<The previous article in this series | The table of contents of 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 previous article in this series | The table of contents of this series | The next article in this series>
definition of map-related vectors fields pair for map between manifolds with boundary
Topics
About:
manifold
The table of contents of this article
Starting Context
Target Context
-
The reader will have a definition of map-related vectors fields pair for map between manifolds with boundary.
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:
:
:
: ,
:
//
Conditions:
//
2: Note
This definition does not claim that there is such a for each .
Whether there is a for a depends on .
For example, when , will do.
When is any diffeomorphism, is (although we do not prove that fact here), so, is -related.
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
definition of wedge product of multicovectors
Topics
About:
vectors space
The table of contents of this article
Starting Context
Target Context
-
The reader will have a definition of wedge product of multicovectors.
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:
:
:
:
//
Conditions:
//
is usually denoted as .
2: Note
Another definition defines that .
The difference in the coefficients results in the differences in the coefficients for some properties of wedge product.
Indeed, , because , , and .
Let us see some properties of wedge product.
Let us see that wedge product is associative.
, by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.
, by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.
So, .
So, while , it can be associated in any way.
: to prove it inductively, it holds when ; supposing that it holds for , , by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.
, because , by the property of tensor product of tensors, , by the proposition that any antisymmetrization-of-tensor map is linear, .
When is any combination of elements of and is any, for each , , by the proposition that for any vectors space and its any covectors combination, the antisymmetrization of the tensor product of any permutation of the covectors combination operated on the same permutation of any vectors combination is the antisymmetrization of the tensor product of the covectors combination operated on the vectors combination, because and .
When is any combination of elements of and is any, , because , by the above result, , because is antisymmetric, but .
When furthermore has any duplication, , because supposing , taking as the permutation that switches and (), .
When , a -covector, and , a -covector, , because by the proposition that the -covectors space of any vectors space has the basis that consists of the wedge products of the increasing elements of the dual basis of the vectors space, and , and , but as each is an element of , 1st, can be moved to in front of by the transpositions each of which gives the factor with the total factor, then, can be move to in front of with the factor, ..., after all, can be changed to with the factor, and .
When furthermore and , when is odd, , because ; when is even, is not necessarily : does not imply that : for example, and , then, ; if , , so, sometimes for a .
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
description/proof of 2 possible meanings of permutation of sequence
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 2 possible meanings of permutation of sequence.
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:
:
:
:
: ,
:
:
//
Statements:
is the permutation of by by a definition of permutation of sequence, but some people may understand by "permutation of by "
//
2: Proof
Whole Strategy: Step 1: see what means; Step 2: see what means.
Step 1:
Let us see what means.
For each , , which means that where is the -th element of , which means that the sequence is .
Note that when we regard the permutation as moving an item to a position, the permutation is moving the item to the -th position.
For example, when , , and , , which is moving the item to the -st position, the item to the -nd position, and the item to the -rd position.
Step 2:
The reason why we have described this proposition is that Step 1 may not be what some people understand as "permutation of by ".
They may understand it as moving the -th item to the position.
Let us see that that is not .
Let us denote the permutation that moves the -th item to the position as .
.
Taking , , so, .
So, not .
For example, when , , and , which is the same with the above example, and , which is moving the -st item to the -rd position, the -nd item to the -st position, and the -rd item to the -nd position.
3: Note
This is not about which of the 2 is correct, but about the necessity of clarifying what is meant by 'permutation of by ' and being consistent.
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
description/proof of that for vectors space and covectors combination, antisymmetrization of tensor product of permutated covectors combination operated on same-permutated vectors combination is antisymmetrization of tensor product of covectors combination operated on vectors combination
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 for any vectors space and its any covectors combination, the antisymmetrization of the tensor product of any permutation of the covectors combination operated on the same permutation of any vectors combination is the antisymmetrization of the tensor product of the covectors combination operated on the vectors combination.
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:
:
:
:
:
//
Statements:
//
2: Proof
Whole Strategy: Step 1: expand and see that it equals .
Step 1:
, by the definition of antisymmetrization of tensor with respect to some arguments.
Note that each of and is a bijection, , and is nothing but .
.
can be permutated to while the argument of is , because means that and the argument of is .
So, , by the definition of antisymmetrization of tensor with respect to some arguments.
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
description/proof of that associativity for 3 items allows any association
Topics
About:
structure
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 structure, the associativity for any 3 items allows any association.
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:
:
:
//
Statements:
can be associated in any way
//
2: Note
Associativity is generally defined with respect to 3 items, which is being understood to allow any associativity. Let us confirm that that is indeed the case.
3: Proof
Whole Strategy: Step 1: for each , associate and 1st; Step 2: conclude the proposition.
Step 1:
.
Letting , it is .
Applying the associativity for 3 items to , .
So, any and can be associated.
Step 2:
Letting , it is .
By Step 1, its any neighboring 2 items can be associated.
That is what it means by "can be associated in any way".
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
description/proof of that for map, cardinality of range is equal to or smaller than cardinality of domain
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 map, the cardinality of the range is equal to or smaller than the cardinality of the domain.
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:
:
:
:
//
Statements:
//
2: Proof
Whole Strategy: Step 1: think of the relation, ; Step 2: apply the axiom of choice to have a function, , such that .
Step 1:
Let us think of the relation, .
The domain of is .
is not necessarily any function, because for an , there may be some multiple s.
Step 2:
But by the axiom of choice, there is a function, , such that .
is a map from into .
is injective, because for any such that , , because if , , a contradiction.
So, .
References
<The previous article in this series | The table of contents of this series | The next article in this series>
<The previous article in this series | The table of contents of this series | The next article in this series>
description/proof of that for manifold with boundary, interior point has --open-balls charts pair and boundary point has --open-half-balls charts pair
Topics
About:
manifold
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 manifold with boundary, each interior point has an --open-balls charts pair and each boundary point has an --open-half-balls charts pair for any positive and .
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
//
Statements:
(
)
(
)
//
2: Proof
Whole Strategy: Step 1: suppose that is any interior point, and take any -open-ball chart around , ; Step 2: take and define ; Step 3: see that is an -open-ball chart around ; Step 4: suppose that is any boundary point, and take any -open-half-ball chart around , ; Step 5: take and define ; Step 6: see that is an -open-half-ball chart around .
Step 1:
Let us suppose that is any interior point.
Let us take any -open-ball chart around , , which is possible, by the proposition that for any manifold with boundary, each interior point has an -open-ball chart and each boundary point has an -open-half-ball chart for any positive .
Step 2:
Let us take .
Let us define .
is an open neighborhood of on and on .
Step 3:
is a chart, because is a homeomorphism and is compatible with larger .
So, is an -open-ball chart around .
So, is an --open-balls charts pair around .
Step 4:
Let us suppose that is any boundary point.
Let us take any -open-half-ball chart around , , which is possible, by the proposition that for any manifold with boundary, each interior point has an -open-ball chart and each boundary point has an -open-half-ball chart for any positive .
Step 5:
Let us take .
Let us define .
is an open neighborhood of on and on .
Step 6:
is a chart, because is a homeomorphism and is compatible with larger .
So, is an -open-half-ball chart around .
So, is an --open-half-balls charts pair around .
References
<The previous article in this series | The table of contents of this series | The next article in this series>