Groups vs Fields

Check the rules of reversible moves in a table. Compare with a world where all four operations work.

A group rests on three promises. Grouping must not change results. A do-nothing element must exist. Every move needs an undoing move. A field adds division on top of that.

For example, pedaling a bicycle forward can be undone by pedaling back. Staying still counts as a move too. Chaining moves gives another move. A set of moves obeying these rules is a group.

(a+b)+c=a+(b+c),  ∃ 0,  ∀a ∃(−a)(a+b)+c = a+(b+c),\ \ \exists\,0,\ \ \forall a\,\exists(-a)
a(b+c)=ab+ac,2Z≤Z,  Q≤Ra(b+c) = ab+ac,\qquad 2\mathbb{Z} \le \mathbb{Z},\ \ \mathbb{Q} \le \mathbb{R}

Examples & Exercises

Check that (Z,+)(\mathbb{Z}, +) is a group from the three axioms.

0∈Z,a+(−a)=00 \in \mathbb{Z},\qquad a + (-a) = 0
The (Z5,×)(\mathbb{Z}_5, \times) table — the additive group (Z,+)(\mathbb{Z},+) satisfies the same three axioms.
Show proof
  1. Closure: the sum of two integers is an integer. Associativity is inherited from integer addition.

  2. The identity is 0∈Z0 \in \mathbb{Z} with a+0=aa + 0 = a.

    The inverse of aa is −a∈Z-a \in \mathbb{Z}, satisfying a+(−a)=0a + (-a) = 0.

    Only the right identity and right inverse are checked here; since addition on Z\mathbb{Z} is commutative, the left versions 0+a=a0 + a = a and (−a)+a=0(-a) + a = 0 follow automatically.

Prove (Z,×)(\mathbb{Z}, \times) is not a group.

2x=1⇒x=12∉Z2x = 1 \Rightarrow x = \frac{1}{2} \notin \mathbb{Z}
The (Z6,×)(\mathbb{Z}_6, \times) table — 2 has no inverse.
Show proof
  1. The multiplicative identity would have to be 11, since 1⋅a=a1 \cdot a = a.

  2. An inverse of 22 would need x∈Zx \in \mathbb{Z} with 2x=12x = 1.

    This is impossible by an argument inside Z\mathbb{Z}: for every integer xx, 2x2x is even, whereas 11 is odd, so the equation 2x=12x = 1 has no solution in Z\mathbb{Z} (consistently, solving in Q\mathbb{Q} gives x=12∉Zx = \frac{1}{2} \notin \mathbb{Z}).

    So the inverse axiom fails, and (Z,×)(\mathbb{Z}, \times) is not a group.

Prove a⋅0=0a \cdot 0 = 0 in any field, from the axioms.

a⋅0=a⋅(0+0)=a⋅0+a⋅0a \cdot 0 = a \cdot (0 + 0) = a \cdot 0 + a \cdot 0
Cancellation in the additive group is the key.
Show proof
  1. By distributivity, a⋅0=a⋅(0+0)=a⋅0+a⋅0a \cdot 0 = a \cdot (0 + 0) = a \cdot 0 + a \cdot 0.

  2. Put b=a⋅0b = a \cdot 0, so the identity above reads b=b+bb = b + b.

    Add −b-b to both sides (additive inverses exist): the left side becomes −b+b=0-b + b = 0.

    The right side needs associativity to rebracket: −b+(b+b)=(−b+b)+b=0+b=b-b + (b + b) = (-b + b) + b = 0 + b = b.

    Hence 0=b0 = b, i.e. 0=a⋅00 = a \cdot 0.

2. Number Systems