2024-03-17

509: For Set of Sequences for Fixed Domain and Codomain, Permutation Bijectively Maps Set onto Set

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

description/proof of that for set of sequences for fixed domain and codomain, permutation bijectively maps set onto set

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 for the set of all the sequences for any fixed domain and any fixed codomain, any permutation bijectively maps the set onto the set.

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:
S: N, ={l1,...,lk}
S: { the sets }
S: ={f|f:SS{ the sequences over S}}
σ: { the permutations of an f0S}, :SS
fσ: SS,ffσ
//

Statements:
fσ{ the bijections }.
//


2: Natural Language Description


For any subset, SN={l1,...,lk}, any set, S, the set of all the sequences, S={f|f:SS}, and any permutation, σ:SS of any f0S, fσ:SS,ffσ is a bijection.


3: Proof


fσ is well-defined, because fσ:SSSS.

Let us prove that fσ is injective. For any ffS, fσfσ, because if fσ=fσ, f=fσσ1=fσσ1=f, a contradiction.

Let us prove that fσ is surjective. For any fS, fσ1S and fσ1σ=f.


4: Note


Typically, S={1,...,k} and S={1,...,d} and we think of (j1,...,jk)SNj1,...,jkMj1,...,jk, which is nothing but Nj1,...,jkMj1,...,jk with the Einstein convention. What this proposition implies is that (j1,...,jk)SNσ((j1,...,jk))1,...,σ((j1,...,jk))kMσ((j1,...,jk))1,...,σ((j1,...,jk))k=Nj1,...,jkMj1,...,jk. That fact is usually immediately accepted as obvious, but we have bothered to prove it rigorously.


References


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