1132: For Index Set, Sum by -th Power of Index Set Is Sum by Quotient Set of -th Power Index Set of Sum by Quotient Set of -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 -th power of index set is sum by quotient set of -th power index set of sum by quotient set of -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 -th power of the index set is the sum by the canonical quotient set of the -th power index set of the sum by the canonical quotient set of the -symmetric group for each element of the quotient set of the -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:
:
:
:
:
: , such that
:
: , where , the representatives map, is chosen arbitrarily
: , such that
:
//
Statements:
//
2: Note
What is being done is really just a common sense: is divided into the subsets each of which is the permutations of a combination ('combination' means any element of ).
For example, when and , , , as a choice, and is accomplished by taking each element of , 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.
depends on the choice of (the choice of the representative for each class).
For example, when and , if is a representative, and will be equivalent, but if is a representative, and will not be equivalent (instead, and will be equivalent).
Nevertheless, covers the same set of permutations for the class .
When is linearly-ordered, a natural choice for the representative of is (or ).
The motivation for this proposition is that often, the summand of depends (totally or partially) on the combination , and then, thinking as can become handy: for example, when the summand depends totally on , where denotes the cardinality of .
3: Proof
Whole Strategy: Step 1: see that is indeed an equivalence relation; Step 2: see that is indeed an equivalence relation; Step 3: see that .
Step 1:
Let us see that is indeed an equivalence relation.
For each , , because there is such that .
For each such that , , because while there is a such that , there is such that , which is true because while there is a , , and .
For each such that and , , because while there are a such that and a such that , there is such that , which is true because while , for an and , so, .
Step 2:
Let us see that is indeed an equivalence relation.
For each , , because .
For each such that , , because while , .
For each such that and , , because while and , .
Step 3:
Let us see that .
There is no duplication in , obviously.
There is no duplication in , because while there is no duplication in , there is no duplication in the corresponding , and for each , there is no duplication in because is determined exactly for that effect, and there is no duplication between and because and represent some different combinations and permutating any combination does not change the combination.
Each element of exists in , because the element is of a combination whose representative is in , and the element is a permutation of the combination, which is in the corresponding .
Each element of obviously exists in .
So, .
is just an obvious reformulation: the latter is taking the class, , instead of its representative, , but anyway, because .
References
<The previous article in this series | The table of contents of this series | The next article in this series>