Abstract AlgebraSylow TheoremsCauchy's Theorem and p Groups
Groups of Order p Squared and p Cubed
The nontrivial center theorem becomes especially powerful when the order of the group is small. The focus keyword is groups of order p squared and p cubed, because these are the first cases where p-group structure can be described with strong conclusions. Groups of order p2 are always abelian, while groups of order p3 may be abelian or nonabelian but still have a large center. These examples show how counting, centers, and quotient groups cooperate in finite group theory.
:::definition[Elementary Abelian Group]
Let p be a prime number. A finite abelian p-group G is called elementary abelian if every nonidentity element of G has order p. In this case G behaves like a vector space over the field Zp.
:::
:::lemma
Let G be a group. If G/Z(G) is cyclic, then G is abelian.
:::
:::proof
Given that G/Z(G) is cyclic.
To prove that G is abelian.
Since G/Z(G) is cyclic, there exists a∈G such that G/Z(G)=⟨aZ(G)⟩. Let x,y∈G. Then there exist integers m,n and elements z1,z2∈Z(G) such that x=amz1 and y=anz2. Since z1,z2∈Z(G), they commute with all elements of G. Therefore
xy=(amz1)(anz2)=am+nz1z2=an+mz2z1=(anz2)(amz1)=yx.
Therefore every pair of elements of G commutes.
Hence G is abelian.
□
:::
:::theorem
Let G be a group of order p2, where p is prime. Then G is abelian.
:::
:::proof
Given that G is a group of order p2, where p is prime.
To prove that G is abelian.
Since G is a nontrivial finite p-group, the center Z(G) is nontrivial. By Lagrange's theorem, ∣Z(G)∣ divides p2. Hence ∣Z(G)∣∈{p,p2}. If ∣Z(G)∣=p2, then Z(G)=G, and G is abelian. If ∣Z(G)∣=p, then ∣G/Z(G)∣=p. A group of prime order is cyclic. Therefore G/Z(G) is cyclic. By the lemma, G is abelian.
Hence G is abelian.
□
:::
:::corollary
Let G be a group of order p2. Then G is isomorphic either to a cyclic group of order p2 or to an elementary abelian group of order p2.
:::
:::proof
Given that G is a group of order p2.
To prove that G is isomorphic either to a cyclic group of order p2 or to an elementary abelian group of order p2.
By the preceding theorem, G is abelian. If G has an element a of order p2, then G=⟨a⟩, so G is cyclic of order p2. If G has no element of order p2, then every nonidentity element has order p. Choose a=e. Since ∣⟨a⟩∣=p and ∣G∣=p2, choose b∈/⟨a⟩. Then o(b)=p, and ⟨a⟩∩⟨b⟩={e}. Since G is abelian, ⟨a⟩⟨b⟩ is a subgroup of order p2, and hence equals G.
Hence G is isomorphic either to Zp2 or to Zp×Zp.
□
:::
:::theorem
Let G be a nonabelian group of order p3, where p is prime. Then ∣Z(G)∣=p.
:::
:::proof
Given that G is a nonabelian group of order p3.
To prove that ∣Z(G)∣=p.
Since G is a nontrivial finite p-group, Z(G) is nontrivial. By Lagrange's theorem, ∣Z(G)∣∈{p,p2,p3}. If ∣Z(G)∣=p3, then Z(G)=G, so G is abelian, contradicting the hypothesis. If ∣Z(G)∣=p2, then ∣G/Z(G)∣=p, so G/Z(G) is cyclic. By the lemma, G is abelian, contradicting the hypothesis. Therefore the only remaining possibility is ∣Z(G)∣=p.
Hence ∣Z(G)∣=p.
□
:::
:::example
Let G=Zp×Zp. Then ∣G∣=p2, and G is abelian. Every nonzero element has order p, so G is elementary abelian.
:::
:::example
Let G=Zp2. Then ∣G∣=p2, and G is cyclic. The element 1 has additive order p2.
:::
This preview compares the center-size possibilities in orders p2 and p3. Choose the exponent and decide whether the group is abelian. The output explains which center sizes are possible and why cyclic quotients by the center force the whole group to be abelian. Try exponent 2 first, then exponent 3 with the nonabelian option to see why the center must have order p.
:::scientific-preview[Small p-Group Center Explorer]
:::
For order p2, every possible center size leads to commutativity. For a nonabelian group of order p3, the larger center sizes would make G/Z(G) cyclic, which again forces commutativity. That leaves ∣Z(G)∣=p as the only nonabelian possibility.
This calculator turns the center-size argument into a quick diagnostic. Enter a prime p, choose exponent 2 or 3, and select whether the group is abelian. The output states the possible center sizes and the structural conclusion. Use p=3, exponent 2 for groups of order 9, and p=3, exponent 3, nonabelian for groups of order 27.
:::calculator[Small p-Group Classifier Calculator]
Groups of Order p Squared and p Cubed | BMLabs | Sylow Theorems | BMLabs Mathematics | BMLabs Mathematics
Progress is stored only in this browser. Academic content remains complete and printable.
1
Definitions
2
Theorems
1
Lemmas
1
Corollaries
4
Proofs
4
Examples
1
Exercises
2
Visual tools
Local progress
Study status
Lesson profile
LevelUG
Estimated time 25 min
Objectives6
Prerequisites0
1.Understand the central mathematical ideas of Groups of Order p Squared and p Cubed.
2.Use the key definitions and notation accurately.
3.Interpret the principal results and their mathematical conditions.
4.Follow and justify the main proof strategy step by step.
5.Apply the method to representative examples and problems.
6.Practise the concept independently and verify the result.
Theorem and proof navigator Formula and result sheet
definition
1. Elementary Abelian Group
Let p be a prime number. A finite abelian p-group G is called elementary abelian if every nonidentity element of G has order p. In this case G behaves like a vector space over the field Zp.
lemma
2. lemma
Let G be a group. If G/Z(G) is cyclic, then G is abelian.
theorem
3. theorem
Let G be a group of order p2, where p is prime. Then G is abelian.
corollary
4. corollary
Let G be a group of order p2. Then G is isomorphic either to a cyclic group of order p2 or to an elementary abelian group of order p2.
theorem
5. theorem
Let G be a nonabelian group of order p3, where p is prime. Then ∣Z(G)∣=p.
The nontrivial center theorem becomes especially powerful when the order of the group is small. The focus keyword is groups of order p squared and p cubed, because these are the first cases where p-group structure can be described with strong conclusions. Groups of order p2 are always abelian, while groups of order p3 may be abelian or nonabelian but still have a large center. These examples show how counting, centers, and quotient groups cooperate in finite group theory.
Core definition02
Elementary Abelian Group
Let p be a prime number. A finite abelian p-group G is called elementary abelian if every nonidentity element of G has order p. In this case G behaves like a vector space over the field Zp.
Supporting result03
Let G be a group. If G/Z(G) is cyclic, then G is abelian.
Reasoning pathway04
Given that G/Z(G) is cyclic.
To prove that G is abelian.
Since G/Z(G) is cyclic, there exists a∈G such that G/Z(G)=⟨aZ(G)⟩. Let x,y∈G. Then there exist integers m,n and elements z1,z2∈Z(G) such that x=amz1 and y=anz2. Since z1,z2∈Z(G), they commute with all elements of G. Therefore
Therefore every pair of elements of G commutes.
Hence G is abelian.
□
Key result05
Let G be a group of order p2, where p is prime. Then G is abelian.
Reasoning pathway06
Given that G is a group of order p2, where p is prime.
To prove that G is abelian.
Since G is a nontrivial finite p-group, the center Z(G) is nontrivial. By Lagrange's theorem, ∣Z(G)∣ divides p2. Hence ∣Z(G)∣∈{p,p2}. If ∣Z(G)∣=p2, then Z(G)=G, and G is abelian. If ∣Z(G)∣=p, then ∣G/Z(G)∣=p. A group of prime order is cyclic. Therefore G/Z(G) is cyclic. By the lemma, G is abelian.
Hence G is abelian.
□
Consequence07
Let G be a group of order p2. Then G is isomorphic either to a cyclic group of order p2 or to an elementary abelian group of order p2.
Reasoning pathway08
Given that G is a group of order p2.
To prove that G is isomorphic either to a cyclic group of order p2 or to an elementary abelian group of order p2.
By the preceding theorem, G is abelian. If G has an element a of order p2, then G=⟨a⟩, so G is cyclic of order p2. If G has no element of order p2, then every nonidentity element has order p. Choose a=e. Since ∣⟨a⟩∣=p and ∣G∣=p2, choose b∈/⟨a⟩. Then o(b)=p, and ⟨a⟩∩⟨b⟩={e}. Since G is abelian, ⟨a⟩⟨b⟩ is a subgroup of order p2, and hence equals G.
Hence G is isomorphic either to Zp2 or to Zp×Zp.
□
Key result09
Let G be a nonabelian group of order p3, where p is prime. Then ∣Z(G)∣=p.
Reasoning pathway10
Given that G is a nonabelian group of order p3.
To prove that ∣Z(G)∣=p.
Since G is a nontrivial finite p-group, Z(G) is nontrivial. By Lagrange's theorem, ∣Z(G)∣∈{p,p2,p3}. If ∣Z(G)∣=p3, then Z(G)=G, so G is abelian, contradicting the hypothesis. If ∣Z(G)∣=p2, then ∣G/Z(G)∣=p, so G/Z(G) is cyclic. By the lemma, G is abelian, contradicting the hypothesis. Therefore the only remaining possibility is ∣Z(G)∣=p.
Hence ∣Z(G)∣=p.
□
Guided example11
Let G=Zp×Zp. Then ∣G∣=p2, and G is abelian. Every nonzero element has order p, so G is elementary abelian.
Guided example12
Let G=Zp2. Then ∣G∣=p2, and G is cyclic. The element 1 has additive order p2.
This preview compares the center-size possibilities in orders p2 and p3. Choose the exponent and decide whether the group is abelian. The output explains which center sizes are possible and why cyclic quotients by the center force the whole group to be abelian. Try exponent 2 first, then exponent 3 with the nonabelian option to see why the center must have order p.
Visual laboratory
Small p-Group Center Explorer
SMALL P-GROUP CENTER EXPLORER
Dynamic Sandbox
Initializing Workspace
For order p2, every possible center size leads to commutativity. For a nonabelian group of order p3, the larger center sizes would make G/Z(G) cyclic, which again forces commutativity. That leaves ∣Z(G)∣=p as the only nonabelian possibility.
This calculator turns the center-size argument into a quick diagnostic. Enter a prime p, choose exponent 2 or 3, and select whether the group is abelian. The output states the possible center sizes and the structural conclusion. Use p=3, exponent 2 for groups of order 9, and p=3, exponent 3, nonabelian for groups of order 27.
Interactive calculator
Small p-Group Classifier Calculator
SMALL P-GROUP CLASSIFIER CALCULATOR
Initializing Workspace
The calculator summarizes conclusions proved by center and quotient arguments. It does not classify every group of order p3, but it highlights the key restriction: nonabelian groups of order p3 have center exactly of order p.
Worked problem18
Prove that every group of order 9 is abelian.
Complete solution19
Given that ∣G∣=9.
Since 9=32, the group G has order p2 with p=3. By the theorem on groups of order p2, every group of order p2 is abelian. Hence G is abelian.
Worked problem20
Let G be a nonabelian group of order 27. Determine ∣Z(G)∣.
Complete solution21
Given that G is nonabelian and ∣G∣=27=33.
By the theorem on nonabelian groups of order p3, the center has order p. Here p=3. Therefore ∣Z(G)∣=3.
Independent practice22
Prove that every group of order 25 is abelian.
List the two possible isomorphism types of groups of order p2.
Let G be a nonabelian group of order 8. What is ∣Z(G)∣?
Explain why G/Z(G) being cyclic forces G to be abelian.
Answer23
Since 25=52, the theorem on groups of order p2 applies, so the group is abelian.
The two types are Zp2 and Zp×Zp.
Since 8=23 and G is nonabelian, ∣Z(G)∣=2.
If every coset is a power of one coset aZ(G), then every element of G has the form anz with z∈Z(G); such elements commute pairwise.
Questions to consolidate
Frequently Asked Questions
3
1Are all groups of order p3 abelian?
No. Groups of order p3 may be nonabelian.
2Are all groups of order p2 cyclic?
No. They are abelian, but they may be cyclic or isomorphic to Zp×Zp.
3Why does the center matter in these classifications?
Its possible order restricts the quotient G/Z(G), and cyclic quotients by the center force commutativity.
Continue learning
Build Subgroups Inside p-Groups
Use the center to construct subgroups of all possible prime-power orders.