Skip to content
Tutorials Center
My learning

Topics

Lesson 7 of 37 · Groups and Subgroups

Basic Properties of Groups

Prove that identities and inverses are unique, that groups allow cancellation, that (ab)⁻¹ = b⁻¹a⁻¹, and learn the order of an element with runnable checks.

From just four axioms we can deduce a surprising number of facts. This lesson proves the first consequences, which are used in every later proof, and tests them numerically. Throughout, G is a group and we often write ab for a * b.

Uniqueness of the identity

Claim. A group has exactly one identity.

Proof. Suppose e and e' are both identities. Then e = e * e' (since e' is an identity) and e * e' = e' (since e is an identity). So e = e'. ∎

Uniqueness of inverses

Claim. Each element a has exactly one inverse.

Proof. Let b and c both be inverses of a. Then b = b e = b (a c) = (b a) c = e c = c. ∎

We write the inverse as a⁻¹. Note that (a⁻¹)⁻¹ = a, because a satisfies the equation that defines the inverse of a⁻¹.

Cancellation

Claim. If ab = ac then b = c; if ba = ca then b = c.

Proof. Multiply ab = ac on the left by a⁻¹: a⁻¹(ab) = a⁻¹(ac), so (a⁻¹a)b = (a⁻¹a)c, so b = c. The other case is symmetric. ∎

Cancellation is the algebraic reason for the Latin square property. In particular the equations ax = b and xa = b each have a unique solution (x = a⁻¹b and x = ba⁻¹).

You must cancel from the same side. From ab = ca you cannot conclude b = c unless the group is abelian.

The inverse of a product

Claim. (ab)⁻¹ = b⁻¹a⁻¹. The order reverses, like taking off socks and shoes: you put on socks then shoes, and undo by removing shoes first.

Proof. (ab)(b⁻¹a⁻¹) = a(bb⁻¹)a⁻¹ = aea⁻¹ = aa⁻¹ = e. By uniqueness of inverses, b⁻¹a⁻¹ is the inverse of ab. ∎

Python Check the properties in the group U(20)

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Powers and the order of an element

For a ∈ G and an integer k we define a⁰ = e, aᵏ = a·a·…·a (k factors) for k > 0, and a⁻ᵏ = (a⁻¹)ᵏ. The usual rules hold: aᵐaⁿ = aᵐ⁺ⁿ and (aᵐ)ⁿ = aᵐⁿ. In additive notation the powers become multiples: ka.

The order of a, written |a| or ord(a), is the smallest positive k with aᵏ = e. If no such k exists, a has infinite order. In a finite group every element has finite order, because the powers a, a², a³, ... cannot all be different, so two coincide, aᵐ = aⁿ with m < n, and cancellation gives aⁿ⁻ᵐ = e.

Python Orders of all elements

Press Run (or Ctrl + Enter) to see the result here.

Program input · what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

You can see that every order divides the size of the group (8 elements in U(20), 12 in ℤ₁₂): 1, 2, 4 divide 8 and 1, 2, 3, 4, 6, 12 divide 12. That is a theorem in chapter 4, Lagrange.

Abelian groups and squares

A neat consequence: if a² = e for every a ∈ G, then G is abelian. Indeed every element is its own inverse, so ab = (ab)⁻¹ = b⁻¹a⁻¹ = ba. This is why the Klein four-group, where everything has order 2, is commutative.

flowchart LR
    A["Axioms"] --> B["unique identity"]
    A --> C["unique inverses"]
    C --> D["cancellation"]
    C --> E["(ab)⁻¹ = b⁻¹a⁻¹"]
    D --> F["Latin squares"]

Each fact is derived from the earlier ones.

Check your understanding

Quick check · 4 questions

of 4 answered You scored / 4 · perfect!

  1. 1. What is (ab)⁻¹ in a group?

    (ab)(b⁻¹a⁻¹) = e, so b⁻¹a⁻¹ is the inverse; the order reverses.
  2. 2. Which step proves that the inverse of a is unique?

    b = b(ac) = (ba)c = c using associativity and the identity.
  3. 3. If ab = ac in a group, what follows?

    Multiply on the left by a⁻¹ to cancel a.
  4. 4. If every element of a group satisfies a² = e, the group is:

    Every element is its own inverse, so ab = (ab)⁻¹ = b⁻¹a⁻¹ = ba.

Summary

  • The identity and each inverse are unique; (a⁻¹)⁻¹ = a.
  • Cancellation holds in groups, and ax = b has the unique solution x = a⁻¹b.
  • (ab)⁻¹ = b⁻¹a⁻¹: inverses reverse the order.
  • The order of an element is the smallest positive power giving the identity; in finite groups it always exists.

Next: Subgroups and the Subgroup Test