2024-08-25

748: Finite Composition of Motions Is Motion

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that finite composition of motions is motion

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that any finite composition of motions is a motion.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
{F1,...,Fn}: Fj{R,C}, with the canonical field structure
{F1,...,Fn}: Fj{R,C}, with the canonical field structure, such that j{1,...,n1}(Fj=Fj+1)
{V1,...,Vn}: Vj{ the normed Fj vectors spaces }, with the norm, j
{V1,...,Vn}: Vj{ the normed Fj vectors spaces } such that j{1,...,n1}(VjVj+1), with the norm, j+1
{f1,...,fn}: fj:VjVj, { the motions }
//

Statements:
fn...f1:V1Vn{ the motions }
//


2: Natural Language Description


For any {F1,...,Fn} where Fj{R,C} with the canonical field structure, any {F1,...,Fn} where Fj{R,C} with the canonical field structure, such that for each j{1,...,n1}, Fj=Fj+1, any {V1,...,Vn} where Vj{ the normed Fj vectors spaces } with the norm, j, any {V1,...,Vn} where Vj{ the normed Fj vectors spaces } such that for each j{1,...,n1}, VjVj+1, with the norm, j+1, and any {f1,...,fn} where fj:VjVj is any motion, fn...f1:V1Vn is a motion.


3: Proof


Whole Strategy: prove it inductively with respect to n; Step 1: prove it for the n=1 case; Step 2: prove it for the n=2 case; Step 3: suppose it for the n=1,...,n1 cases, and prove it for the n=n case.

Step 1:

Let us suppose that n=1.

f1 is a motion.

Step 2:

Let us suppose that n=2.

For each v,vV1, vv1=f1(v)f1(v)2=f2f1(v)f2f1(v)3. So, f2f1 is a motion.

Step 3:

Let us suppose that the proposition holds for the n=1,...,n1 cases.

Let us suppose that n=n.

fn...f1=fn(fn1...f1). fn1...f1 is a motion, by the induction hypothesis for the n=n1 case. fn(fn1...f1) is a motion, by the induction hypothesis for the n=2 case.


References


<The previous article in this series | The table of contents of this series | The next article in this series>