2025-05-25

1132: For Index Set, Sum by n-th Power of Index Set Is Sum by Quotient Set of n-th Power Index Set of Sum by Quotient Set of n-Symmetric Group

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

description/proof of that for index set, sum by n-th power of index set is sum by quotient set of n-th power index set of sum by quotient set of n-symmetric group

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 any index set, the sum by the n-th power of the index set is the sum by the canonical quotient set of the n-th power index set of the sum by the canonical quotient set of the n-symmetric group for each element of the quotient set of the n-th power index 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:
J: { the index sets }
n: N{0}
Jn: = the product set 
Sn: = the n -symmetric group 
: { the equivalence relations on Jn}, such that j=(j1,...,jn),j=(j1,...,jn)Jn(jjσSn((jσ1,...,jσn)=(j1,...,jn)))
Jn/: = the quotient set 
Jn/f: = the representatives set of Jn/, where f:Jn/Jn, the representatives map, is chosen arbitrarily
{j|jJn/f}: j{ the equivalent relations of Sn}, such that σ,σSn(σjσ(jσ1,...,jσn)=(jσ1,...,jσn))
{Sn/j|jJn/f}}: Sn/j{ the quotient sets }
//

Statements:
jJn=jJn/fσSn/j=[j]Jn/σSn/f([j])
//


2: Note


What is being done is really just a common sense: Jn is divided into the subsets each of which is the permutations of a combination ('combination' means any element of Jn/).

For example, when j={1,2} and n=3, Jn={(1,1,1),(1,1,2),(1,2,1),(1,2,2),(2,1,1),(2,1,2),(2,2,1),(2,2,2)}, Jn/∼={{(1,1,1)},{(1,1,2),(1,2,1),(2,1,1)},{(1,2,2),(2,1,2),(2,2,1)},{(2,2,2)}}, Jn/f={(1,1,1),(1,1,2),(1,2,2),(2,2,2)} as a choice, and jJn is accomplished by taking each element of Jn/f, summing by all the distinct permutations of the element, and summing up the sums.

The point of this proposition is offering an exact notation of the intuitively natural procedure.

j depends on the choice of f (the choice of the representative for each class).

For example, when j={1,2} and n=3, if (1,1,2) is a representative, (1,2,3)(1,2,3)Sn and (1,2,3)(2,1,3)Sn will be equivalent, but if (1,2,1) is a representative, (1,2,3)(1,2,3)Sn and (1,2,3)(2,1,3)Sn will not be equivalent (instead, (1,2,3)(1,2,3)Sn and (1,2,3)(3,2,1)Sn will be equivalent).

Nevertheless, σSn/j covers the same set of permutations for the class [j].

When J is linearly-ordered, a natural choice for the representative of [(j1,...,jn)] is j1...jn (or jn...j1).

The motivation for this proposition is that often, the summand of jJn depends (totally or partially) on the combination [j], and then, thinking jJn as jJn/fσSn/j can become handy: for example, when the summand depends totally on [j], jJn/fσSn/j=jJn/f|Sn/j| where |Sn/j| denotes the cardinality of Sn/j.


3: Proof


Whole Strategy: Step 1: see that is indeed an equivalence relation; Step 2: see that j is indeed an equivalence relation; Step 3: see that jJn=jJn/fσSn/j=[j]Jn/σSn/f([j]).

Step 1:

Let us see that is indeed an equivalence relation.

For each j=(j1,...,jn)Jn, jj, because there is σ=idSn such that (jσ1,...,jσn)=(j1,...,jn).

For each j=(j1,...,jn),j=(j1,...,jn)Jn such that jj, jj, because while there is a σSn such that (jσ1,...,jσn)=(j1,...,jn), there is σ1Sn such that (jσ11,...,jσ1n)=(j1,...,jn), which is true because while there is a σl=σ(l)=1, l=σ1(1), and j1=jσl=jl=jσ1(1).

For each j=(j1,...,jn),j=(j1,...,jn),j=(j1,...,jn)Jn such that jj and jj, jj, because while there are a σSn such that (jσ1,...,jσn)=(j1,...,jn) and a σSn such that (jσ1,...,jσn)=(j1,...,jn), there is σσSn such that (j(σσ)1,...,j(σσ)n)=(j1,...,jn), which is true because while j1=jσ1, σ1=l for an l and jσ1=jl=jσl=jσ(l)=jσ(σ1)=jσ(σ(1))=jσσ(1)=jσσ1, so, j1=jσσ1.

Step 2:

Let us see that j is indeed an equivalence relation.

For each σSn, σjσ, because (jσ1,...,jσn)=(jσ1,...,jσn).

For each σ,σSn such that σjσ, σjσ, because while (jσ1,...,jσn)=(jσ1,...,jσn), (jσ1,...,jσn)=(jσ1,...,jσn).

For each σ,σ,σSn such that σjσ and σjσ, σjσ, because while (jσ1,...,jσn)=(jσ1,...,jσn) and (jσ1,...,jσn)=(jσ1,...,jσn), (jσ1,...,jσn)=(jσ1,...,jσn)=(jσ1,...,jσn).

Step 3:

Let us see that jJn=jJn/fσSn/j.

There is no duplication in jJn, obviously.

There is no duplication in jJn/fσSn/j, because while there is no duplication in jJn/f, there is no duplication in the corresponding {[j]}, and for each [j], there is no duplication in σSn/j because σSn/j is determined exactly for that effect, and there is no duplication between [j] and [j] because [j] and [j] represent some different combinations and permutating any combination does not change the combination.

Each element of jJn exists in jJn/fσSn/j, because the element is of a combination whose representative is in jJn/f, and the element is a permutation of the combination, which is in the corresponding σSn/j.

Each element of jJn/fσSn/j obviously exists in jJn.

So, jJn=jJn/fσSn/j.

jJn/fσSn/j=[j]Jn/σSn/f([j]) is just an obvious reformulation: the latter is taking the class, [j], instead of its representative, j, but anyway, σSn/j=σSn/f([j]) because j=f([j]).


References


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