Skip to content
Topos Uranos

Summary

This lesson, the last of the unit on matrices and algebraic structures, gathers into a few definitions what numbers, matrices, symmetries and the remainders of division have in common. It defines binary operations and their properties, and with them groups: the integers under addition, the nonzero complex numbers, the roots of unity, the rotations of the plane, the invertible matrices, the six symmetries of the equilateral triangle and the remainders of division by nn. It proves, without using commutativity, the uniqueness of the identity element and of the inverse, cancellation and the rule for the inverse of a product; it studies subgroups and the order of an element, and proves Lagrange’s theorem by means of cosets. It then defines rings and fields, proves that the remainders of division by nn form a field exactly when nn is prime, and presents isomorphisms as the precise way of saying that two structures are the same. It ends with a map of the two Algebra and Geometry courses and of what comes after them.

Learning objectives

  1. Recognize binary operations and their properties, decide whether a set with an operation is a group, and build the table of a finite group.
  2. Prove the elementary properties of groups, the uniqueness of the identity element and of inverses, cancellation and the inverse of a product, without using commutativity.
  3. Compute the order of an element, find subgroups and apply Lagrange’s theorem to finite groups.
  4. Distinguish rings and fields, operate with the remainders of division by nn, solve equations in them and decide whether two structures are isomorphic.

Binary operations

Throughout this course and the course Algebra and Geometry I, natural numbers, integers, rational, real and complex numbers have been added and multiplied; functions have been composed, matrices have been multiplied and rotations of the plane have been performed one after another. Each of these operations takes two objects of a set and returns a third object of the same set, and in all of them similar properties have been proved again and again. This lesson isolates those properties and studies what follows from them, whatever the nature of the objects.

A binary operation on a set AA is a rule that assigns to each ordered pair of elements aa and bb of AA a unique element of AA, written a⋅ba \cdot b, or simply abab. That the result belongs to AA is expressed by saying that AA is closed under the operation.

The dot does not necessarily denote a product of numbers here: it is the generic name of the operation, which in each case will be addition, multiplication, composition or any other. When the operation is an addition, the sign ++ is used by custom. Four properties are of interest. The operation is associative if (ab)c=a(bc)(ab)c = a(bc) for all aa, bb and cc in AA, and commutative if ab=baab = ba for all aa and bb. An element ee of AA is an identity element if ea=ae=aea = ae = a for every aa; and, if there is an identity element, an element bb is an inverse of aa when ab=ba=eab = ba = e.

(ab)c=a(bc),ab=ba,ea=ae=a,ab=ba=e(ab)c = a(bc), \qquad ab = ba, \qquad ea = ae = a, \qquad ab = ba = e

None of the four properties is automatic. Subtraction is a binary operation on Z\mathbb{Z}, but it is neither associative nor commutative, and it has no identity element: 00 satisfies a−0=aa - 0 = a, but not 0−a=a0 - a = a. Division is not a binary operation on Q\mathbb{Q}, because it assigns nothing to the pair formed by 11 and 00. Addition on N\mathbb{N} is associative and commutative, but it has no identity element, because in Course I the natural numbers begin at 11. Composition of functions is associative and not commutative, as was proved in the Course I lesson on function operations, and the same happens with the product of square matrices of the same order, studied in the lesson on matrices and matrix operations, whose identity element is the identity matrix II.

(5−3)−2=0≠4=5−(3−2)(5 - 3) - 2 = 0 \neq 4 = 5 - (3 - 2)