2024-09-08

763: Composition of Product Maps Is Product of Compositions of Component Maps

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

description/proof of that composition of product maps is product of compositions of component maps

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that the composition of any product maps is the product of the compositions of the component maps.

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 1


Here is the rules of Structured Description.

Entities:
A: { the possibly uncountable index sets }
{Sα|αA}: Sα{ the sets }
{Sα|αA}: Sα{ the sets }
{Sα|αA}: Sα{ the sets }
{fα|αA}: fα:SαSα
{fα|αA}: fα:SαSα
×αAfα: :×αASα×αASα,(αf(α))(αfα(f(α)))
×αAfα: :×αASα×αASα,(αf(α))(αfα(f(α)))
//

Statements:
×αAfα×αAfα:×αASα×αASα=×αAfαfα:×αASα×αASα
//


2: Natural Language Description 1


For any possibly uncountable index set, A, any set of sets, {Sα|αA}, any set of sets, {Sα|αA}, any set of sets, {Sα|αA}, any set of maps, {fα|αA}, such that fα:SαSα, any set of maps, {fα|αA}, such that fα:SαSα, ×αAfα:×αASα×αASα,(αf(α))(αfα(f(α))), and ×αAfα:×αASα×αASα,(αf(α))(αfα(f(α))), ×αAfα×αAfα:×αASα×αASα=×αAfαfα:×αASα×αASα.


3: Proof 1


Whole Strategy: Step 1: see that ×αAfαfα:×αASα×αASα indeed makes sense; Step 2: see what ×αAfα×αAfα maps p=(αf(α)) to; Step 3: see what ×αAfαfα maps p=(αf(α)) to; Step 4: conclude the proposition.

Step 1:

Let us see that ×αAfαfα:×αASα×αASα indeed makes sense.

fαfα:SαSα.

So, ×αAfαfα:×αASα×αASα makes sense, according to the definition of project map. It is :(αf(α))(αfαfα(f(α))).

Step 2:

Let p=(αf(α))×αASα be any.

Let us see what ×αAfα×αAfα maps p to.

p(αfα(f(α)))(αfαfα(f(α))).

Step 3:

Let p=(αf(α))×αASα be any.

Let us see what ×αAfαfα maps p to.

p(αfαfα(f(α))).

Step 4:

Step 2 and Step 3 have shown that the 2 maps map p to the same point, so, the 2 maps are the same.


4: Structured Description 2


Here is the rules of Structured Description.

Entities:
J: ={1,...,n}
{Sj|jJ}: Sj{ the sets }
{Sj|jJ}: Sj{ the sets }
{Sj|jJ}: Sj{ the sets }
{fj|jJ}: fj:SjSj
{fj|jJ}: fj:SjSj
f1×...×fn: :S1×...×SnS1×...×Sn,(p1,...,pn)(f1(p1),,...,fn(pn))
f1×...×fn: :S1×...×SnS1×...×Sn,(p1,...,pn)(f1(p1),,...,fn(pn))
//

Statements:
f1×...×fnf1×...×fn:S1×...×SnS1×...×Sn=f1f1×...×fnfn:S1×...×SnS1×...×Sn
//


5: Natural Language Description 2


For the finite index set, J={1,...,n}, any set of sets, {Sj|jJ}, any set of sets, {Sj|jJ}, any set of sets, {Sj|jJ}, any set of maps, {fj|jJ}, such that fj:SjSj, any set of maps, {fj|jJ}, such that fj:SjSj, f1×...×fn:S1×...×SnS1×...×Sn,(p1,...,pn)(f1(p1),,...,fn(pn)), and f1×...×fn:S1×...×SnS1×...×Sn,(p1,...,pn)(f1(p1),,...,fn(pn)), f1×...×fnf1×...×fn:S1×...×SnS1×...×Sn=f1f1×...×fnfn:S1×...×SnS1×...×Sn.


6: Proof 2


Whole Strategy: Step 1: see that f1f1×...×fnfn:S1×...×SnS1×...×Sn indeed makes sense; Step 2: see what f1×...×fnf1×...×fn maps p=(p1,...,pn) to; Step 3: see what f1f1×...×fnfn maps p=(p1,...,pn) to; Step 4: conclude the proposition.

Step 1:

Let us see that f1f1×...×fnfn:S1×...×SnS1×...×Sn indeed makes sense.

fjfj:SjSj.

So, f1f1×...×fnfn:S1×...×SnS1×...×Sn makes sense, according to the definition of project map. It is :(p1,...,pn)(f1f1(p1),...,fnfn(pn)).

Step 2:

Let p=(p1,...,pn)S1×...×Sn be any.

Let us see what f1×...×fnf1×...×fn maps p to.

p(f1(p1),,...,fn(pn))(f1f1(p1),,...,fnfn(pn)).

Step 3:

Let p=(p1,...,pn)S1×...×Sn be any.

Let us see what f1f1×...×fnfn maps p to.

p(f1f1(p1),...,fnfn(pn)).

Step 4:

Step 2 and Step 3 have shown that the 2 maps map p to the same point, so, the 2 maps are the same.


References


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