2024-06-03

600: For Group as Direct Sum of Finite Number of Normal Subgroups, Element Is Uniquely Decomposed and Decomposition Is Commutative

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

description/proof of that for group as direct sum of finite number of normal subgroups, element is uniquely decomposed and decomposition is commutative

Topics


About: group

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 group as the direct sum of any finite number of normal subgroups, each element is uniquely decomposed and the decomposition is commutative.

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:
G: { the groups }
{G1,...,Gn}: { the normal subgroups of G}
//

Statements:
G= the direct sum of {G1,...,Gn}

p1...pn=p1...pnG such that pj,pjGj(pj=pjσ{ the permutations of {1,...,n}}(p1...pn=pσ1...pσn)).
//


2: Natural Language Description


For any group, G, and any normal subgroups, G1,...,Gn, of G, such that G is the direct sum of {G1,...,Gn}, for each p1...pnG such that pjGj, p1...pn is the unique decomposition of the element, and for each permutation of {1,...,n}, σ, p1...pn=pσ1...pσn.


3: Proof


Let us prove it inductively with respect to n.

Let n=2.

As p1p2=p1p2, p11p1p2p21=p11p1p2p21, so, p2p21=p11p1, but the left hand side is in G2 and the right hand side is in G1, so, the both side is in G1G2={1}, so, p2p21=p11p1=1, which implies that p1=p1 and p2=p2.

For each p2p1G, p2p1=p1p2 for a p1G1 and a p2G2, because G=G1G2. p21p2p1=p21p1p2, so, p1=p21p1p2=p21p1p2p21p2=p1p21p2 for a p1G1, because G1 is a normal subgroup, but as the decomposition is unique, p11=p1p21p2 implies that p21p2=1, so, p2=p2. Likewise, p2p1p11=p1p2p11, so, p2=p1p2p11=p1p11p1p2p11=p1p11p2 for a p2G2, but as the decomposition is unique, 1p2=p1p11p2 implies that p1p11=1, so, p1=p1. So, p2p1=p1p2.

Let us suppose that the proposition holds through n=n.

Let us suppose that G is the direct sum of {G1,...,Gn+1}.

G is the direct sum of {G1,G2...Gn+1}, by the proposition that any group as direct sum of finite number of normal subgroups is the group as direct sum of any reordered and combined normal subgroups.

For each p=p1...pn+1=p1...pn+1, p=p1(p2...pn+1)=p1(p2...pn+1), where p2...pn+1,p2...pn+1G2...Gn+1, so, p1=p1 and p2...pn+1=p2...pn+1, by applying this proposition for n=2.

G2...Gn+1 is the direct sum of {G2,...,Gn+1}, by the proposition that for any group as direct sum of finite number of normal subgroups, the product of any subset of the normal subgroups is the group as direct sum of the subset. So, applying this proposition for n=n, pj=pj for each 2jn+1.

So, pj=pj for each 1jn+1.

For each σ, when σ1=1, p1...pn+1=pσ1...pσn+1 by applying this proposition for n=n; when σ11, σ1=k for a 2kn+1, and p1...pn+1=p1(p2...pn+1)=(p2...pn+1)p1=p2(p3...pn+1p1)=(p3...pn+1p1)p2=...=pkpk+1...pn+1p1...pk1=pσ1pk+1...pn+1p1...pk1=pσ1...pσn+1, where the 'until (not including)'-the-last equals are by applying this proposition for n=2 and the last equal is by applying this proposition for n=n.

So, this proposition holds for each 2n.


References


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