2025-02-02

991: For 2 Subgroups with Different Prime Number Orders, if Generators of Subgroups Are Commutative, Product-of-Prime-Numbers-Ordered Cyclic Subgroup Can Be Constructed

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

description/proof of that for 2 subgroups with different prime number orders, if generators of subgroups are commutative, product-of-prime-numbers-ordered cyclic subgroup can be constructed

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 and its any 2 subgroups with any different prime number orders, if any generators of the subgroups are commutative, a the-product-of-the-prime-numbers-ordered cyclic subgroup can be constructed.

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 }
p: { the prime numbers }
q: { the prime numbers }
Gp: { the p -ordered subgroups of G}, ={gp,...,gpp=1}
Gq: { the q -ordered subgroups of G}, ={gq,...,gqq=1}
Gpq: ={gpgq,...,(gpgq)pq}
//

Statements:
(
pq

gpgq=gqgp
)

(
Gpq{ the (pq) -orderd cyclic subgroups of G}

j,kN such that 1j<p and 1k<q({gpjgqk,...,(gpjgqk)pq}=Gpq)
)
//


2: Note


Gp inevitably takes the shape of {gp,...,gpp=1}, by the proposition that any prime-number-ordered group is cyclic and each element except 1 generates the group. It is likewise for Gq.

By the proposition that any prime-number-ordered group is cyclic and each element except 1 generates the group, Gp or Gq can be regarded to be generated by any gpj or gqk where 1j<p and 1k<q, but gpjgqk=gqkgqj holds anyway, because gpjgqk=gpj1gpgqgqk1=gpj1gqgpgqk1=gpj2gpgqgpgqk1=gpj2gqgpgpgqk1=gpj2gqgp2gqk1=...=gqgpjgqk1=gq2gpjgqk2=...=gqkgpj.

The 2nd half of Statements is saying that we cannot have any different (pq)-ordered cyclic subgroup by just choosing a different generator: this proposition says that gpjgqk generates a (pq)-ordered cyclic subgroup, but in fact, the subgroup is no different from Gpq.


3: Proof


Whole Strategy: Step 1: see that Gpq is a (pq)-ordered cyclic subgroup; Step 2: see that {gpjgqk,...,(gpjgqk)pq}=Gpq.

Step 1:

Let us see that Gpq is a (pq)-ordered cyclic subgroup.

1Gpq: (gpgq)pq=gppqgqpq=(gpp)q(gqq)p=1q1p=1.

For each (gpgq)j,(gpgq)kGpq, (gpgq)j(gpgq)k=(gpgq)j+k. j+k=mpq+l where m,lN and 0l<pq. (gpgq)j+k=(gpgq)mpq+l=(gpgq)mpq(gpgq)l=((gpgq)pq)m(gpgq)l=(gppqgqpq)m(gpgq)l=((gpp)q(gqq)p)m(gpgq)l=(1q1p)m(gpgq)l=1m(gpgq)l=(gpgq)l. When 1l<pq, (gpgq)lGpq and when l=0, (gpgq)0=1=(gpgq)pqGpq. So, (gpgq)j(gpgq)kGpq anyway.

For each (gpgq)jGpq, (gpgq)pqjGpq, and (gpgq)j(gpgq)pqj=(gpgq)pq=1 and (gpgq)pqj(gpgq)j=(gpgq)pq=1.

The associativity holds because it holds in the ambient G.

So, Gpq is a subgroup of G.

Let us see that {gpgq,...,(gpgq)pq} is distinct.

Let us suppose that (gpgq)j=(gpgq)k where 1jkpq without loss of generality. 1=(gpgq)kj, gpkj=gqjk, because gpgq=gqgp, =1 by the proposition that any 2 different prime-number-ordered subgroups share only 1, so, kj=mp=nq, which means that kj=0: kj is a multiple of pq but kj<pq. So, j=k.

So, Gpq is a (pq)-ordered cyclic subgroup.

Step 2:

Let us see that {gpjgqk,...,(gpjgqk)pq}=Gpq.

{gpjgqk,...,(gpjgqk)pq} is a (pq)-ordered cyclic subgroup by Step 1, because also gpj generates Gp and also gqk generates Gq, by the proposition that any prime-number-ordered group is cyclic and each element except 1 generates the group, and Step 1 applies for {gpjgqk,...,(gpjgqk)pq} with just gp and gq replaced with gpj and gqk respectively.

Let us see that for each r,sN such that 1rp and 1sq, gprgqsGpq, because then, as each element of {gpjgqk,...,(gpjgqk)pq} is of that form, it will be that {gpjgqk,...,(gpjgqk)pq}Gpq.

There are some n,mZ such that rs=np+mq by the proposition that any principal integral domain is a greatest common divisors domain, and for each 2 elements on the principal integral domain, each of the greatest common divisors of the 2 elements is a one by which the sum of the principal ideals by the 2 elements is the principal ideal, because Z is a principal integral domain, gcd(p,q)={1}, and 1Z=pZ+qZ.

Let l:=rnp=s+mq. Then, (gpgq)l=gplgql=gprnpgqs+mq=gprgpnpgqsgqmq=gpr(gpp)ngqs(gqq)m=gpr1ngqs1m=gprgqs.

So, gprgqsGpq.

So, {gpjgqk,...,(gpjgqk)pq}Gpq.

As |{gpjgqk,...,(gpjgqk)pq}|=|Gpq| as finite sets, {gpjgqk,...,(gpjgqk)pq}=Gpq.


References


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