2025-02-02

990: 2 Different Prime-Number-Ordered Subgroups Share Only 1

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

description/proof of that 2 different prime-number-ordered subgroups share only 1

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 any 2 different prime-number-ordered subgroups share only 1.

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}
Gq: { the q -ordered subgroups of G}
//

Statements:
GpGq

GpGq={1}
//

p=q is not excluded.


2: Proof


Whole Strategy: Step 1: suppose that there was a g(GpGq){1}; Step 2: see that Gp=g=Gq, a contradiction.

Step 1:

Let us suppose that there was a g(GpGq){1}.

Step 2:

g=Gp, by the proposition that any prime-number-ordered group is cyclic and each element except 1 generates the group.

g=Gq, likewise.

So, Gp=g=Gq, a contradiction.

So, the supposition that there was a g(GpGq){1} is wrong, and (GpGq){1}=, which means that GpGq={1}.


References


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