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 |

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 |

1131: Top-Covector for Vectors Space Is Determined by Result for Ordered Basis for Vectors Space

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

description/proof of that top-covector for vectors space is determined by result for ordered basis for vectors space

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 any top-covector for any vectors space is determined by the result for any ordered basis for the vectors space.

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:
F: { the fields }
V: { the d -dimensional F vectors spaces }
Λd(V:F): = the top-covectors space 
t: Λd(V:F)
t: Λd(V:F)
(b1,...,bd): { the bases for V}
//

Statements:
t(b1,...,bd)=t(b1,...,bd)

t=t
//


2: Proof


Whole Strategy: Step 1: let (v1,...,vd) be any set of vectors of V and see that t(v1,...,vd)=t(v1,...,vd).

Step 1:

Let (v1,...,vd) be any set of vectors of V.

If t(v1,...,vd)=t(v1,...,vd), t=t.

So, let us see that t(v1,...,vd)=t(v1,...,vd).

vj=vjljblj.

t(v1,...,vd)=t(v1l1bl1,...,vdldbld)=v1l1...vdldt(bl1,...,bld).

When (bl1,...,bld) is from (b1,...,bd) by a permutation, σ, t(bl1,...,bld)=sgnσt(b1,...,bd)=sgnσt(b1,...,bd)=t(bl1,...,bld).

Otherwise, {bl1,...,bld} is not distinct, so, t(bl1,...,bld)=0=t(bl1,...,bld).

So, t(v1,...,vd)=v1l1...vdldt(bl1,...,bld)=v1l1...vdldt(bl1,...,bld)=t(v1l1bl1,...,vdldbld)=t(v1,...,vd).

So, t=t.


References


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

1130: Top-Covectors Space of Finite-Dimensional Vectors Space

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

definition of top-covectors space of finite-dimensional vectors space

Topics


About: vectors space

The table of contents of this article


Starting Context



Target Context


  • The reader will have a definition of top-covectors space of finite-dimensional vectors space.

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:
F: { the fields }
V: { the d -dimensional F vectors spaces }
Λd(V:F):
//

Conditions:
//


2: Note


Λd(V:F) is 1-dimensional, by the proposition that the antisymmetric tensors space with respect to any field and any k same finite-dimensional vectors spaces over the field and the field has the basis that consists of the wedge products of the increasing elements of the dual basis of the same vectors space.

Each element of Λd(V:F) is called "top-covector".


References


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

1129: Map-Related Vectors Fields Pair for C Map Between C Manifolds with Boundary

<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 C map between C manifolds with boundary

Topics


About: C 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 C map between C 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:
M1: { the C manifolds with boundary }
M2: { the C manifolds with boundary }
f: :M1M2, { the C maps }
(V1,V2): Vj{ the C vectors fields over Mj}
//

Conditions:
m1M1(dfm1V1(m1)=V2(f(m1)))
//


2: Note


This definition does not claim that there is such a V2 for each V1.

Whether there is a V2 for a V1 depends on V1.

For example, when V1=0, V2=0 will do.

When f is any diffeomorphism, V2:m2dff1(m2)V1(f1(m2)) is C (although we do not prove that fact here), so, (V1,V2) is f-related.


References


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

1128: q-Covectors Space at Point on C Manifold with Boundary

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

definition of q-covectors space at point on C manifold with boundary

Topics


About: C manifold

The table of contents of this article


Starting Context



Target Context


  • The reader will have a definition of q-covectors space at point on C manifold 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:
M: { the C manifolds with boundary }
m: M
TmM: = the tangent vectors space at m
q: N
Λq(TmM:R): = the q -covectors space 
f: :Tq0(TmM)L(TmM,...,TmM:R), = the canonical 'vectors spaces - linear morphisms' isomorphism 
Λq(TmM): =f1(Λq(TmM:R)) when q0; =R when q=0, { the R vectors spaces }
//

Conditions:
//


2: Note


Another definition defines "Λq(TmM):=Λq(TmM:R)", but that would make Λq(TmM) non-subspace of Tq0(TmM), because we have defined Tq0(TmM):=TmM...TmM, not =L(TmM,...,TmM:R).

TmM is an R vectors space as is shown in Note for the definition of tangent vectors space at point on C manifold with boundary and Λq(TmM:R) is indeed a vectors subspace of L(TmM,...,TmM:R) as is shown in Note for the definition of antisymmetric tensors space with respect to field and k same vectors spaces and vectors space over field. So, f1(Λq(TmM:R)) is a vectors subspace of Tq0(TmM).

Λq(TmM) is canonically 'vectors spaces - linear morphisms' isomorphic to Λq(TmM:R), and quite often, the 2 spaces are implicitly identified by the isomorphism, which is the reason why Λq(TmM) is called "q-covectors space".

Λ0(TmM)=T00(TmM).

Λ1(TmM)=T10(TmM), because each element of T10(TmM) is antisymmetric.


References


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

1127: q-Covectors Space Has Basis That Consists of Wedge Products of Increasing Elements of Dual Basis

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

description/proof of that q-covectors space has basis that consists of wedge products of increasing elements of dual basis

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 the q-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.

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:
F: { the fields }
V: { the finite-dimensional F vectors spaces }
Λq(V:F): = the q -covectors space 
B: { the bases for V}={bl|1ldimV}
B: = the dual basis for B={bl|1ldimV}
B~: ={bj1...bjq|l{1,...,q}(1jldimV)j1<...<jq}
//

Statements:
B~{ the bases for Λq(V:F)}
//

Let us call B~ "the standard basis with respect to B": it is not determined unless B is specified.


3: Proof


Whole Strategy: Step 1: see that B~ spans Λq(V:F); Step 2: see that B~ is linearly independent.

Step 1:

Let us see that B~ spans Λq(V:F).

Let tΛq(V:F) be any.

As Λq(V:F)L(V,...,V:F), tL(V,...,V:F).

By the proposition that for any field and any k finite-dimensional vectors spaces over the field, the tensors space with respect to the field and the vectors spaces and the field has the basis that consists of the tensor products of the elements of the dual bases of any bases of the vectors spaces, L(V,...,V:F) has the standard basis with respect to B, {bj1...bjk|l{1,...,k}(1jldimV)}.

So, t=tj1,...,jkbj1...bjk.

As t is antisymmetric, t=Asym(t)=Asym(tj1,...,jkbj1...bjk)=tj1,...,jkAsym(bj1...bjk)=tj1,...,jk1/k!bj1...bjk, by a property of wedge product of multicovectors.

For each term such that {j1,...,jk} is not distinct, the term is 0, by a property of wedge product of multicovectors.

For each term such that (j1,...,jk) is not increasing, there is a permutation, σSk, such that (jσ1,...,jσk) is increasing, and bj1...bjk=cbσ1...bσk where c is 1 or 1, by a property of wedge product of multicovectors.

So, t is a linear combination of B~.

Step 2:

Let us see that B~ is linearly independent.

Let cj1,...,jkbj1...bjk=0 where j1<...<jk.

For each fixed (j1,...,jk), let cj1,...,jkbj1...bjk operate on (bj1,...,bjk).

cj1,...,jkbj1...bjk((bj1,...,bjk))=0((bj1,...,bjk))=0.

But the only possibly nonzero term of the left hand side is cj1,...,jkbj1...bjk((bj1,...,bjk)), because any other term has a bjl such that jl{j1,...,jk} and bj1...bjk((bj1,...,bjk))=0, because bjl(bjm)=0 for each m.

bj1...bjk((bj1,...,bjk))=det(bjl(bjm))=detI=1, by a property of wedge product of multicovectors.

So, cj1,...,jk=0.

So, B~ is linearly independent.


References


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

1126: Wedge Product of Multicovectors

<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:
F: { the fields }
V: { the F vectors spaces }
: :Λk1(V:F)×Λk2(V:F)Λk1+k2(V:F),(t1,t2)(k1+k2)!/(k1!k2!)Asym(t1t2)
//

Conditions:
//

(t1,t2) is usually denoted as t1t2.


2: Note


Another definition defines that t1t2=Asym(t1t2).

The difference in the coefficients results in the differences in the coefficients for some properties of wedge product.

Indeed, t1t2Λk1+k2(V:F), because t1t2L(V,...,V:F), Asym(t1t2)Λk1+k2(V:F), and (k1+k2)!/(k1!k2!)Asym(t1t2)Λk1+k2(V:F).

Let us see some properties of wedge product.

Let us see that wedge product is associative.

(t1t2)t3=(k1+k2)!/(k1!k2!)Asym(t1t2)t3=(k1+k2+k3)!/((k1+k2)!k3!)Asym((k1+k2)!/(k1!k2!)Asym(t1t2)t3)=(k1+k2+k3)!/((k1+k2)!k3!)(k1+k2)!/(k1!k2!)Asym(Asym(t1t2)t3)=(k1+k2+k3)!/(k1!k2!k3!)Asym(t1t2t3), by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.

t1(t2t3)=t1(k2+k3)!/(k2!k3!)Asym(t2t3)=(k1+k2+k3)!/(k1!(k2+k3)!)Asym(t1(k2+k3)!/(k2!k3!)Asym(t2t3))=(k1+k2+k3)!/(k1!(k2+k3)!)(k2+k3)!/(k2!k3!)Asym(t1Asym(t2t3))=(k1+k2+k3)!/(k1!k2!k3!)Asym(t1t2t3), by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.

So, (t1t2)t3=t1(t2t3).

So, while t1...tn:=(...((t1t2)t3)...tn1)tn, it can be associated in any way.

t1...tn=(k1+...+kn)!/(k1!...kn!)Asym(t1...tn): to prove it inductively, it holds when n=2; supposing that it holds for n=2,...,n1, t1...tn=(t1...tn1)tn=(k1+...+kn1)!/(k1!...kn1!)Asym(t1...tn1)tn=(k1+...+kn)!/((k1+...+kn1)!kn!)Asym((k1+...+kn1)!/(k1!...kn1!)Asym(t1...tn1)tn)=(k1+...+kn)!/((k1+...+kn1)!kn!)(k1+...+kn1)!/(k1!...kn1!)Asym(Asym(t1...tn1)tn)=(k1+...+kn)!/(k1!...kn!)Asym(t1...tn), by the proposition that the antisymmetrization of the tensor product of any tensors is the antisymmetrizations applied sequentially.

t1...(rtj+rtj)...tn=rt1...tj...tn+rt1...tj...tn, because t1...(rtj+rtj)...tn=(k1+...+kn)!/(k1!...kn!)Asym(t1...(rtj+rtj)...tn)=(k1+...+kn)!/(k1!...kn!)Asym(rt1...tj...tn+rt1...tj...tn), by the property of tensor product of tensors, =(k1+...+kn)!/(k1!...kn!)(rAsym(t1...tj...tn)+rAsym(t1...tj...tn)), by the proposition that any antisymmetrization-of-tensor map is linear, =r(k1+...+kn)!/(k1!...kn!)Asym(t1...tj...tn)+r(k1+...+kn)!/(k1!...kn!)Asym(t1...tj...tn)=rt1...tj...tn)+rt1...tj...tn.

When (t1,...,tk) is any combination of elements of V and σSk is any, for each v1,...,vkV, tσ1...tσk(vσ1,...,vσ1)=t1...tk(v1,...,vk), 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 tσ1...tσk=k!Asym(tσ1...tσk) and t1...tk=k!Asym(t1...tk).

When (t1,...,tk) is any combination of elements of V and σSk is any, tσ1...tσk=sgnσt1...tk, because tσ1...tσk(v1,...,vk)=tσ1...tσk(v(σσ1)1,...,v(σσ1)k)=t1...tk(vσ11,...,vσk1), by the above result, =sgnσ1t1...tk(v1,...,vk), because t1...tk is antisymmetric, but sgnσ1=sgnσ.

When furthermore (t1,...,tk) has any duplication, t1...tk=0, because supposing tm=tn, taking σ as the permutation that switches m and n (sgnσ=1), t1...tm...tn...tk=t1...tn...tm...tk=t1...tm...tn...tk.

When t1Λk1(V:F), a k1-covector, and t2Λk2(V:F), a k2-covector, t2t1=(1)k1k2t1t2, because by the proposition that the q-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, t1=t1j1,...,jk1bj1...bjk1 and t2=t2l1,...,lk2bl1...blk2, and t2t1=(t2l1,...,lk2bl1...blk2)(t1j1,...,jk1bj1...bjk1)=t1j1,...,jk1t2l1,...,lk2bl1...blk2bj1...bjk1, but as each bm is an element of V, 1st, bj1 can be moved to in front of bl1 by the k2 transpositions each of which gives the 1 factor with the total (1)k2 factor, then, bj2 can be move to in front of bl1 with the (1)k2 factor, ..., after all, bl1...blk2bj1...bjk1 can be changed to bj1...bjk1bl1...blk2 with the 1k2k1=1k1k2 factor, and =1k1k2t1j1,...,jk1t2l1,...,lk2bj1...bjk1bl1...blk2=1k1k2t1t2.

When furthermore k1=k2=k and t1=t2=t, when k is odd, tt=0, because tt=(1)k2tt=tt; when k is even, tt is not necessarily 0: tt=(1)k2tt=tt does not imply that tt=0: for example, k=2 and t=t1,2b1b2+t3,4b3b4, then, tt=(t1,2b1b2+t3,4b3b4)(t1,2b1b2+t3,4b3b4)=t1,2t3,4b1b2b3b4+t1,2t3,4b3b4b1b2=t1,2t3,4b1b2b3b4+t1,2t3,4b1b2b3b4=2t1,2t3,4b1b2b3b40; if t=t1,2b1b2, tt=0, so, sometimes tt=0 for a t0.


References


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

1125: 2 Possible Meanings of Permutation of Sequence

<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:
N:
S: N
f: { the sequences from S}
σ: :SS, { the bijections }
σ(f): =fσ
g: =fσ1
//

Statements:
σ(f) is the permutation of f by σ by a definition of permutation of sequence, but some people may understand g by "permutation of f by σ"
//


2: Proof


Whole Strategy: Step 1: see what σ(f) means; Step 2: see what g means.

Step 1:

Let us see what σ(f):=fσ means.

For each sS, σ(f)(s)=f(σ(s)), which means that σ(f)j=f(σ(sj))=f(σj) where sjS is the j-th element of S, which means that the sequence is f(σ1),f(σ2),....

Note that when we regard the permutation as moving an item to a position, the permutation is moving the σj item to the j-th position.

For example, when S={1,2,3}, f=4,5,6, and σ:(1,2,3)(3,1,2), σ(f)=f(σ(1)),f(σ(2)),f(σ(3))=6,4,5, which is moving the σ(1)=3 item to the 1-st position, the σ(2)=1 item to the 2-nd position, and the σ(3)=2 item to the 3-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 f by σ".

They may understand it as moving the j-th item to the σj position.

Let us see that that is g not σ(f).

Let us denote the permutation that moves the j-th item to the σj position as h.

f(sj)=h(σj)=h(σ(sj)).

Taking t:=σ(sj), sj=σ1(t), so, h(t)=f(sj)=f(σ1(t))=fσ1(t).

So, h=fσ1=g not =fσ:=σ(f).

For example, when S={1,2,3}, f=4,5,6, and σ:(1,2,3)(3,1,2), which is the same with the above example, σ1:(1,2,3)(2,3,1) and g=f(σ1(1)),f(σ1(2)),f(σ1(3))=5,6,4, which is moving the 1-st item to the 3-rd position, the 2-nd item to the 1-st position, and the 3-rd item to the 2-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 f by σ' and being consistent.


References


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

1124: 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

<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:
F: { the fields }
V: { the F vectors spaces }
(t1,...,tk): { the combinations of elements of V}
σ: Sk
//

Statements:
v1,...,vkV(Asym(tσ1...tσk)(vσ1,...,vσ1)=Asym(t1...tk)(v1,...,vk))
//


2: Proof


Whole Strategy: Step 1: expand Asym(tσ1...tσk)(vσ1,...,vσk) and see that it equals Asym(t1...tk)(v1,...,vk).

Step 1:

Asym(tσ1...tσk)(vσ1,...,vσk)=1/k!σsgnσtσ1...tσk(vσ(σ1),...,vσ(σk)), by the definition of antisymmetrization of tensor with respect to some arguments.

Note that each of σ and σ is a bijection, :{1,...,k}{1,...,k}, and σj is nothing but σ(j).

=1/k!σsgnσtσ1(vσ(σ1))...tσk(vσ(σk)).

(tσ1,...,tσk) can be permutated to (t1,...,tk) while the argument of tj is vσj, because tσl=tj means that j=σl and the argument of tσl is vσ(σl)=vσ(j)=vσj.

So, =1/k!σsgnσt1(vσ1)...tk(vσk)=1/k!σsgnσt1...tk(vσ1,...,vσk)=Asym(t1...tk)(v1,...,vk), 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>

2025-05-18

1123: Associativity for 3 Items Allows Any Association

<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:
S: { the structures }
: { the operations of S}
//

Statements:
s1,s2,s3S((s1s2)s3=s1(s2s3))

s1...sn:=(...((s1s2)s3)...sn1)sn 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 1jn1, associate sj and sj+1 1st; Step 2: conclude the proposition.

Step 1:

s1...sn:=(...(((...((s1s2)s3)...sj1)sj)sj+1)...sn1)sn.

Letting a:=(...((s1s2)s3)...sj1), it is (...((asj)sj+1)...sn1)sn.

Applying the associativity for 3 items to (asj)sj+1, =(...(a(sjsj+1))...sn1)sn=(...((...((s1s2)s3)...sj1)(sjsj+1))...sn1)sn.

So, any sj and sj+1 can be associated.

Step 2:

Letting b:=sjsj+1, it is (...((...((s1s2)s3)...sj1)b)...sn1)sn.

By Step 1, its any neighboring 2 items can be associated.

That is what it means by s1...sn "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>

1122: For Map, Cardinality of Range Is Equal to or Smaller Than Cardinality of Domain

<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:
S1: { the sets }
S2: { the sets }
f: :S1S2
//

Statements:
Card(f(S1))Card(S1)
//


2: Proof


Whole Strategy: Step 1: think of the relation, R:={(s2,s1)S2×S1|s2=f(s1)}; Step 2: apply the axiom of choice to have a function, FR, such that Dom(F)=Dom(R).

Step 1:

Let us think of the relation, R:={(s2,s1)S2×S1|s2=f(s1)}.

The domain of R is Dom(R)=f(S1).

R is not necessarily any function, because for an s2, there may be some multiple s1 s.

Step 2:

But by the axiom of choice, there is a function, FR, such that Dom(F)=Dom(R).

F is a map from Dom(F) into S1.

F is injective, because for any s2,s2Dom(F) such that s2s2, F(s2)F(s2), because if F(s2)=F(s2), s2=f(F(s2))=f(F(s2))=s2, a contradiction.

So, Card(f(S1))=Card(Dom(R))=Card(Dom(F))Card(S1).


References


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

1121: For C Manifold with Boundary, Interior Point Has r-r-Open-Balls Charts Pair and Boundary Point Has r-r-Open-Half-Balls Charts Pair

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

description/proof of that for C manifold with boundary, interior point has r-r-open-balls charts pair and boundary point has r-r-open-half-balls charts pair

Topics


About: C 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 C manifold with boundary, each interior point has an r-r-open-balls charts pair and each boundary point has an r-r-open-half-balls charts pair for any positive r and r.

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:
M: { the d -dimensional C manifolds with boundary }
m: M
r: {rR|0<r}
r: {rR|0<r} such that r<r
//

Statements:
(
m{ the interior points of M}

((Bm,rM,ϕm),(Bm,rM,ϕm|Bm,r)){ the r - r -open-balls charts pairs around m on M}
)

(
m{ the boundary points of M}

((Hm,rM,ϕm),(Hm,rM,ϕm|Hm,r)){ the r - r -open-half-balls charts pairs around m on M}
)
//


2: Proof


Whole Strategy: Step 1: suppose that m is any interior point, and take any r-open-ball chart around m, (Bm,rM,ϕm); Step 2: take Bϕm(m),rBϕm(m),r and define Bm,r:=ϕm1(Bϕm(m),r); Step 3: see that (Bm,rM,ϕm|Bm,r) is an r-open-ball chart around m; Step 4: suppose that m is any boundary point, and take any r-open-half-ball chart around m, (Hm,rM,ϕm); Step 5: take Hϕm(m),rHϕm(m),r and define Hm,r:=ϕm1(Hϕm(m),r); Step 6: see that (Hm,rM,ϕm|Hm,r) is an r-open-half-ball chart around m.

Step 1:

Let us suppose that m is any interior point.

Let us take any r-open-ball chart around m, (Bm,rM,ϕm), which is possible, by the proposition that for any C manifold with boundary, each interior point has an r-open-ball chart and each boundary point has an r-open-half-ball chart for any positive r.

Step 2:

Let us take Bϕm(m),rBϕm(m),r.

Let us define Bm,r:=ϕm1(Bϕm(m),r)Bm,r.

Bm,r is an open neighborhood of m on Bm,r and on M.

Step 3:

(Bm,rM,ϕm|Bm,r) is a chart, because ϕm|Bm,r:Bm,rBϕm(m),r is a homeomorphism and (Bm,rM,ϕm|Bm,r) is C compatible with larger (Bm,rM,ϕm).

So, (Bm,rM,ϕm|Bm,r) is an r-open-ball chart around m.

So, ((Bm,rM,ϕm),(Bm,rM,ϕm|Bm,r)) is an r-r-open-balls charts pair around m.

Step 4:

Let us suppose that m is any boundary point.

Let us take any r-open-half-ball chart around m, (Hm,rM,ϕm), which is possible, by the proposition that for any C manifold with boundary, each interior point has an r-open-ball chart and each boundary point has an r-open-half-ball chart for any positive r.

Step 5:

Let us take Hϕm(m),rHϕm(m),r.

Let us define Hm,r:=ϕm1(Hϕm(m),r)Hm,r.

Hm,r is an open neighborhood of m on Hm,r and on M.

Step 6:

(Hm,rM,ϕm|Hm,r) is a chart, because ϕm|Hm,r:Hm,rHϕm(m),r is a homeomorphism and (Hm,rM,ϕm|Hm,r) is C compatible with larger (Hm,rM,ϕm).

So, (Hm,rM,ϕm|Hm,r) is an r-open-half-ball chart around m.

So, ((Hm,rM,ϕm),(Hm,rM,ϕm|Hm,r)) is an r-r-open-half-balls charts pair around m.


References


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