Theorem11.2.1A Monoid Theorem
If \(a\), \(b\) are elements of \(M\) and \(a * b = b * a\), then \((a * b) * (a * b) = (a * a) * (b * b)\).
An algebraic system is a mathematical system consisting of a set called the domain and one or more operations on the domain. If \(V\) is the domain and \(*_1, *_2, \ldots , *_n\) are the operations, \(\left[V;*_1, *_2, \ldots , *_n\right]\) denotes the mathematical system. If the context is clear, this notation is abbreviated to \(V\).
Consider the following two examples of algebraic systems.
Let \(B^*\) be the set of all finite strings of 0's and 1's including the null (or empty) string, \(\lambda\). An algebraic system is obtained by adding the operation of concatenation. The concatenation of two strings is simply the linking of the two strings together in the order indicated. The concatenation of strings \(a\) with \(b\) is denoted \(a+b\). For example, \(01101+101 =01101101\) and \(\lambda +100 = 100\). Note that concatenation is an associative operation and that \(\lambda\) is the identity for concatenation.
A note on notation: There isn't a standard symbol for concatenation. We have chosen \(+\) to be consistant with the notation used in Python and Sage for the concatenation.
Let \(M\) be any nonempty set and let * be any operation on \(M\) that is associative and has an identity in \(M\).
Our second example might seem strange, but we include it to illustrate a point. The algebraic system \(\left[B^*;+\right]\) is a special case of \([M;*]\). Most of us are much more comfortable with \(B^*\) than with \(M\). No doubt, the reason is that the elements in \(B^*\) are more concrete. We know what they look like and exactly how they are combined. The description of \(M\) is so vague that we don't even know what the elements are, much less how they are combined. Why would anyone want to study \(M\)? The reason is related to this question: What theorems are of interest in an algebraic system? Answering this question is one of our main objectives in this chapter. Certain properties of algebraic systems are called algebraic properties, and any theorem that says something about the algebraic properties of a system would be of interest. The ability to identify what is algebraic and what isn't is one of the skills that you should learn from this chapter.
Now, back to the question of why we study \(M\). Our answer is to illustrate the usefulness of \(M\) with a theorem about \(M\).
If \(a\), \(b\) are elements of \(M\) and \(a * b = b * a\), then \((a * b) * (a * b) = (a * a) * (b * b)\).
The power of this theorem is that it can be applied to any algebraic system that \(M\) describes. Since \(B^*\) is one such system, we can apply Theorem 11.2.1 to any two strings that commute. For example, 01 and 0101. Although a special case of this theorem could have been proven for \(B^*\), it would not have been any easier to prove, and it would not have given us any insight into other special cases of \(M\).
Consider the set of \(2\times 2\) real matrices, \(M_{2\times 2}(\mathbb{R})\), with the operation of matrix multiplication. In this context, Theorem 11.2.1 can be interpreted as saying that if \(A B = B A\), then \((A B)^2= A^2B^2\). One pair of matrices that this theorem applies to is \(\left( \begin{array}{cc} 2 & 1 \\ 1 & 2 \\ \end{array} \right)\) and \(\left( \begin{array}{cc} 3 & -4 \\ -4 & 3 \\ \end{array} \right)\).
One of the fundamental tools in mathematics is abstraction. There are three levels of abstraction that we will identify for algebraic systems: concrete, axiomatic, and universal.
Almost all of the mathematics that you have done in the past was at the concrete level. As a rule, if you can give examples of a few typical elements of the domain and describe how the operations act on them, you are describing a concrete algebraic system. Two examples of concrete systems are \(B^*\) and \(M_{2\times 2}(\mathbb{R})\). A few others are:
The integers with addition. Of course, addition isn't the only standard operation that we could include. Technically, if we were to add multiplication, we would have a different system.
The subsets of the natural numbers, with union, intersection, and complementation.
The complex numbers with addition and multiplication.
The next level of abstraction is the axiomatic level. At this level, the elements of the domain are not specified, but certain axioms are stated about the number of operations and their properties. The system that we called \(M\) is an axiomatic system. Some combinations of axioms are so common that a name is given to any algebraic system to which they apply. Any system with the properties of \(M\) is called a monoid. . The study of \(M\) would be called monoid theory. The assumptions that we made about \(M\), associativity and the existence of an identity, are called the monoid axioms. One of your few brushes with the axiomatic level may have been in your elementary algebra course. Many algebra texts identify the properties of the real numbers with addition and multiplication as the field axioms. As we will see in Chapter 16, “Rings and Fields,” the real numbers share these axioms with other concrete systems, all of which are called fields.
The final level of abstraction is the universal level. There are certain concepts, called universal algebra concepts, that can be applied to the study of all algebraic systems. Although a purely universal approach to algebra would be much too abstract for our purposes, defining concepts at this level should make it easier to organize the various algebraic theories in your own mind. In this chapter, we will consider the concepts of isomorphism, subsystem, and direct product.
To illustrate the axiomatic level and the universal concepts, we will consider yet another kind of axiomatic system, the group. In Chapter 5 we noted that the simplest equation in matrix algebra that we are often called upon to solve is \(A X = B\), where \(A\) and \(B\) are known square matrices and \(X\) is an unknown matrix. To solve this equation, we need the associative, identity, and inverse laws. We call the systems that have these properties groups.
A group consists of a nonempty set G and a binary operation \(*\) on \(G\) satisfying the properties
\(*\) is associative on \(G\): \((a*b)*c=a*(b*c)\) for all \(a, b, c \in G\).
There exists an identity element, \(e \in G\) such that \(a*e=e*a=a\) for all \(a \in G\).
For all \(a \in G\), there exists an inverse, there exist \(b\in G\) such that \(a *b = b*a=e\).
A group is usually denoted by its set's name, \(G\), or occasionally by \([G; * ]\) to emphasize the operation. At the concrete level, most sets have a standard operation associated with them that will form a group. As we will see below, the integers with addition is a group. Therefore, in group theory \(\mathbb{Z}\) always stands for \([\mathbb{Z}; +]\).
At the axiomatic and universal levels, there are often symbols that have a special meaning attached to them. In group theory, the letter \(e\) is used to denote the identity element of whatever group is being discussed. A little later, we will prove that the inverse of a group element, \(a\), is unique and its inverse is usually denoted \(a^{-1}\) and is read “\(a\) inverse.” When a concrete group is discussed, these symbols are dropped in favor of concrete symbols. These concrete symbols may or may not be similar to the generic symbols. For example, the identity element of the group of integers is 0, and the inverse of \(n\) is denoted by \(-n\), the additive inverse of \(n\).
The asterisk could also be considered a generic symbol since it is used to denote operations on the axiomatic level.
The integers with addition is a group. We know that addition is associative. Zero is the identity for addition: \(0 + n = n + 0 = n\) for all integers \(n\). The additive inverse of any integer is obtained by negating it. Thus the inverse of \(n\) is \(-n\).
The integers with multiplication is not a group. Although multiplication is associative and 1 is the identity for multiplication, not all integers have a multiplicative inverse in \(\mathbb{Z}\). For example, the multiplicative inverse of 10 is \(\frac{1}{10}\), but \(\frac{1}{10}\) is not an integer.
The power set of any set \(U\) with the operation of symmetric difference, \(\oplus\), is a group. If \(A\) and \(B\) are sets, then \(A\oplus B=(A\cup B)-(A\cap B)\). We will leave it to the reader to prove that \(\oplus\) is associative over \(\mathcal{P}(U)\). The identity of the group is the empty set: \(A\oplus \emptyset = A\). Every set is its own inverse since \(A \oplus A = \emptyset\). Note that \(\mathcal{P}(U)\) is not a group with union or intersection.
A group is abelian if its operation is commutative.
Most of the groups that we will discuss in this book will be abelian. The term abelian is used to honor the Norwegian mathematician N. Abel (1802-29), who helped develop group theory.
Discuss the analogy between the terms generic and concrete for algebraic systems and the terms generic and trade for prescription drugs.
AnswerDiscuss the connection between groups and monoids. Is every monoid a group? Is every group a monoid?
Which of the following are groups?
\(B^*\) with concatenation (see Subsection 11.2.1).
\(M_{2\times 3}(\mathbb{R})\) with matrix addition.
\(M_{2\times 3}(\mathbb{R})\) with matrix multiplication.
The positive real numbers, \(\mathbb{R}^+,\)with multiplication.
The nonzero real numbers, \(\mathbb{R}^*\), with multiplication.
\(\{1, -1\}\) with multiplication.
The positive integers with the operation \(M\) defined by \(a M b = \textrm{ the larger of } a \textrm{ and } b\).
Prove that, \(\oplus\), defined by \(A \oplus B = (A \cup B) - (A \cap B)\) is an associative operation on \(\mathcal{P}(U)\).
The following problem supplies an example of a non-abelian group. A rook matrix is a matrix that has only 0's and 1's as entries such that each row has exactly one 1 and each column has exactly one 1. The term rook matrix is derived from the fact that each rook matrix represents the placement of \(n\) rooks on an \(n\times n\) chessboard such that none of the rooks can attack one another. A rook in chess can move only vertically or horizontally, but not diagonally. Let \(R_n\) be the set of \(n\times n\) rook matrices. There are six \(3\times 3\) rook matrices: \(\begin{array}{ccc} I=\left( \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \\ \end{array} \right) & R_1=\left( \begin{array}{ccc} 0 & 1 & 0 \\ 0 & 0 & 1 \\ 1 & 0 & 0 \\ \end{array} \right) & R_2=\left( \begin{array}{ccc} 0 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{array} \right) \\ F_1=\left( \begin{array}{ccc} 1 & 0 & 0 \\ 0 & 0 & 1 \\ 0 & 1 & 0 \\ \end{array} \right) & F_2=\left( \begin{array}{ccc} 0 & 0 & 1 \\ 0 & 1 & 0 \\ 1 & 0 & 0 \\ \end{array} \right) & F_3=\left( \begin{array}{ccc} 0 & 1 & 0 \\ 1 & 0 & 0 \\ 0 & 0 & 1 \\ \end{array} \right) \\ \end{array}\)
List the \(2\times 2\) rook matrices. They form a group, \(R_2,\) under matrix multiplication. Write out the multiplication table. Is the group abelian?
Write out the multiplication table for \(R_3\) . This is another group. Is it abelian?
How many \(4\times 4\) rook matrices are there? How many \(n\times n\) rook matrices are there?
For each of the following sets, identify the standard operation that results in a group. What is the identity of each group?
The set of all \(2\times 2\) matrices with real entries and nonzero determinants.
The set of \(2 \times 3\) matrices with rational entries.
Let \(V = \{e,a,b, c\}\). Let \(*\) be defined (partially) by \(x * x = e\) for all \(x \in V\). Write a complete table for \(*\) so that \([V; * ]\) is a group.
Answer