← Group Theory
⬡

What is a Group?

A group is one of the simplest yet most powerful structures in mathematics. Four concise rules — closure, associativity, identity, inverses — determine whether a set with a binary operation qualifies. These rules capture the abstract essence of symmetry, and their consequences fill volumes of mathematics and physics.

Key Concepts

Group
A set GG with a binary operation ⋅\cdot satisfying four axioms: closure, associativity, identity, and inverses. Written (G,⋅)(G, \cdot). The operation need not be commutative.
Order of a Group
The number of elements ∣G∣|G|. Can be finite (e.g. ∣S3∣=6|S_3| = 6) or infinite (e.g. ∣Z∣=∞|\mathbb{Z}| = \infty). Continuous groups like SU(2)SU(2) have uncountably infinite order.
Order of an Element
The smallest positive integer nn such that gn=eg^n = e. If no such nn exists the element has infinite order. In Zn\mathbb{Z}_n: ord(k)=n/gcd⁡(n,k)\text{ord}(k) = n/\gcd(n,k).
Abelian Group
A group where a⋅b=b⋅aa \cdot b = b \cdot a for all a,b∈Ga, b \in G. All cyclic groups are abelian. SnS_n for n≥3n \geq 3 is non-abelian — the non-commutativity of SU(2)SU(2) and SU(3)SU(3) has deep physical consequences.
Cyclic Group Zn\mathbb{Z}_n
The integers {0,1,…,n−1}\{0, 1, \ldots, n{-}1\} under addition mod nn. Generated by the single element 11. Every finite cyclic group of order nn is isomorphic to Zn\mathbb{Z}_n.

Key Equations

The Four Group Axioms
(1) Closure: a,b∈G⇒a⋅b∈G(2) Associativity: (a⋅b)⋅c=a⋅(b⋅c)(3) Identity: ∃ e s.t. e⋅a=a(4) Inverses: ∀a,∃ a−1 s.t. a⋅a−1=e\begin{aligned} &\text{(1) Closure: } a, b \in G \Rightarrow a \cdot b \in G \\ &\text{(2) Associativity: } (a \cdot b) \cdot c = a \cdot (b \cdot c) \\ &\text{(3) Identity: } \exists\, e \text{ s.t. } e \cdot a = a \\ &\text{(4) Inverses: } \forall a, \exists\, a^{-1} \text{ s.t. } a \cdot a^{-1} = e \end{aligned}
Any set with an operation satisfying all four axioms is a group.
Order of an Element (in Zn\mathbb{Z}_n)
ord(k)=ngcd⁡(n, k)\text{ord}(k) = \frac{n}{\gcd(n,\,k)}
The smallest positive mm with m⋅k≡0(modn)m \cdot k \equiv 0 \pmod{n}.
Worked Example

Order of an Element in Z12\mathbb{Z}_{12}

Problem

Find the order of the element 44 in the group Z12\mathbb{Z}_{12} (integers mod 12 under addition).

Solution

We need the smallest positive nn with n⋅4≡0(mod12)n \cdot 4 \equiv 0 \pmod{12}.

Compute: 1⋅4=41\cdot4=4,   2⋅4=8\;2\cdot4=8,   3⋅4=12≡0\;3\cdot4=12\equiv 0. So ord(4)=3\text{ord}(4)=3.

Using the formula: ord(4)=12/gcd⁡(12,4)=12/4=3\text{ord}(4) = 12/\gcd(12,4) = 12/4 = 3. ✓

Answer ord(4)=3\text{ord}(4) = 3 in Z12\mathbb{Z}_{12}.
Practice

Exercises

7 problems
1 of 7

In Z8\mathbb{Z}_8 (integers mod 8 under addition), what is the order of the element 22?

2 of 7

What is ∣S3∣|S_3|, the order of the symmetric group on 3 elements (all permutations of 3 objects)?

3 of 7

In Z15\mathbb{Z}_{15}, what is the order of the element 55?

Unlock Exercise 3

Subscribe to PhysWeb Premium to access all exercises and track your progress.

4 of 7

The dihedral group DnD_n is the symmetry group of a regular nn-gon, with nn rotations and nn reflections. What is ∣D5∣|D_5|?

Unlock Exercise 4

Subscribe to PhysWeb Premium to access all exercises and track your progress.

5 of 7

In Z12\mathbb{Z}_{12}, how many elements have order exactly 44? (Use ord(k)=12/gcd⁡(12,k)\text{ord}(k) = 12/\gcd(12,k).)

Unlock Exercise 5

Subscribe to PhysWeb Premium to access all exercises and track your progress.

6 of 7

In Z2×Z2={(0,0),(1,0),(0,1),(1,1)}\mathbb{Z}_2 \times \mathbb{Z}_2 = \{(0,0),(1,0),(0,1),(1,1)\} under addition mod 2, how many non-identity elements have order 22?

Unlock Exercise 6

Subscribe to PhysWeb Premium to access all exercises and track your progress.

7 of 7

In Z20\mathbb{Z}_{20}, what is the order of the element 44?

Unlock Exercise 7

Subscribe to PhysWeb Premium to access all exercises and track your progress.

Key Takeaways

  • A group is a set with a binary operation satisfying four axioms: closure, associativity, identity, and inverses.
  • The order of k∈Znk \in \mathbb{Z}_n is n/gcd⁡(n,k)n/\gcd(n,k) — one of the most useful formulas in finite group theory.
  • A group is abelian if multiplication commutes. Zn\mathbb{Z}_n and U(1)U(1) are abelian; SnS_n (n≥3n\geq3) and SU(n)SU(n) (n≥2n\geq2) are not.
  • The symmetric group SnS_n (all permutations of nn objects) has order n!n! and is non-abelian for n≥3n\geq3. It is the prototypical non-abelian group.