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)=ab+ac,2Z≤Z,Q≤R
Examples & Exercises
Check that (Z,+) is a group from the three axioms.
0∈Z,a+(−a)=0
The (Z5,×) table — the additive group (Z,+) satisfies the same three axioms.Show proof
Closure: the sum of two integers is an integer. Associativity is inherited from integer addition.
The identity is 0∈Z with a+0=a.
The inverse of a is −a∈Z, satisfying a+(−a)=0.
Only the right identity and right inverse are checked here; since addition on Z is commutative, the left versions 0+a=a and (−a)+a=0 follow automatically.
Prove (Z,×) is not a group.
2x=1⇒x=21∈/Z
The (Z6,×) table — 2 has no inverse.Show proof
The multiplicative identity would have to be 1, since 1⋅a=a.
An inverse of 2 would need x∈Z with 2x=1.
This is impossible by an argument inside Z: for every integer x, 2x is even, whereas 1 is odd, so the equation 2x=1 has no solution in Z (consistently, solving in Q gives x=21∈/Z).
So the inverse axiom fails, and (Z,×) is not a group.
Prove a⋅0=0 in any field, from the axioms.
a⋅0=a⋅(0+0)=a⋅0+a⋅0
Cancellation in the additive group is the key.Show proof
By distributivity, a⋅0=a⋅(0+0)=a⋅0+a⋅0.
Put b=a⋅0, so the identity above reads b=b+b.
Add −b to both sides (additive inverses exist): the left side becomes −b+b=0.
The right side needs associativity to rebracket: −b+(b+b)=(−b+b)+b=0+b=b.