2025-02-09

998: For Finite Cyclic Group and Its Prime Factor of Order, Cyclic Subgroup of Factor Order Can Be Extracted in Certain Way

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

description/proof of that for finite cyclic group and its prime factor of order, cyclic subgroup of factor order can be extracted in certain way

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 finite cyclic group and any prime factor of the order of the group, a cyclic subgroup of the factor order can be extracted in a certain way.

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:
p: { the prime numbers }
G: { the cyclic groups } with order pn, ={g,...,gpn=1}
//

Statements:
Gp:={gn,g2n,...,gpn}{ the p -ordered cyclic groups }
//


2: Note


By Cauchy's theorem, a p-ordered subgroup (inevitably cyclic, by the proposition that any prime-number-ordered group is cyclic and each element except 1 generates the group) can be extracted without G required to be cyclic; the point of this proposition is that a p-ordered subgroup can be extracted in the specific way, not "a p-ordered subgroup is hidden somewhere unknown".

This proposition does not claim that Gp is the only p-ordered subgroup, but it is indeed the only p-ordered subgroup, by the proposition that for any cyclic group and its any prime factor of the order of the group, there is at most 1 subgroup of the factor order.


3: Proof


Whole Strategy: Step 1: see that Gp is indeed a p-ordered subgroup.

Step 1:

Let us see that Gp is a subgroup.

For any gjn,gknGp, gjngkn=g(j+k)n. j+k=mp+l for an m,lN such that 0l<p. g(j+k)n=g(mp+l)n=gmpn+ln=gmpngln=(gpn)mgln=1mgln=1gln=gln. When 0<l<p, glnGp. When l=0, gln=g0=1=gpnGp. So, gjngknGp anyway.

gpn=1Gp.

For each gjnGp, g(pj)nGp, and gjng(pj)n=gjn+(pj)n=gpn=1; g(pj)ngjn=gjn+(pj)n=gpn=1.

Gp is p-ordered, because {gn,g2n,...,gpn} is distinct, because {g,...,gpn=1} is distinct.


References


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