2.4: Examples of Groups/Nongroups, Part I
( \newcommand{\kernel}{\mathrm{null}\,}\)
Let's look at some examples of groups/nongroups.
Example 2.4.1
We claim that Z is a group under addition. Indeed, ⟨Z,+⟩ is a binary structure and that addition is associative on the integers. The integer 0 acts as an identity element of Z under addition (since a+0=0+a=a for each a∈Z), and each element a in G has inverse −a since a+(−a)=−a+a=0.
Example 2.4.2
For each following binary structure ⟨G,∗⟩, determine whether or not G is a group. For those that are not groups, determine the first group axiom that fails, and provide a proof that it fails.
- ⟨Q,+⟩
- ⟨Z,−⟩
- ⟨R,⋅⟩
- ⟨C∗,⋅⟩
- ⟨R,+⟩
- ⟨Z+,+⟩
- ⟨Z∗,⋅⟩
- ⟨Mn(R),+⟩
- ⟨C,+⟩
- ⟨Z,⋅⟩
- ⟨R∗,⋅⟩
- ⟨Mn(R),⋅⟩
If you have taken linear algebra, you have also probably seen a collection of matrices that is a group under matrix multiplication.
Definition: General and Special Linear Groups
Recall that given a square matrix A, the notation detA denotes the determinant of A. Let
GL(n,R)={M∈Mn(R):detM≠0}
(that is, let GL(n,R) be the set of all invertible n×n matrices over R) , and let
SL(n,R)={M∈Mn(R):detM=1}.
These subsets of Mn(R) are called, respectively, the general and special linear groups of degree n over R.
Note that these definitions imply that these subsets of Mn(R) are groups (under some operation). Sure enough, they are!
Theorem 2.4.1
GL(n,R) is a group under matrix multiplication.
- Proof
-
Let A,B∈GL(n,R). Then det(AB)=(detA)(detB)≠0 (since detA,detB≠0), so AB∈GL(n,R). Thus, ⟨GL(n,R),⋅⟩ ⟨GL(n,R),⋅⟩ is a binary structure.
We know that matrix multiplication is always associative, so G2 holds. Next,
[100⋯0010⋯0001⋯0⋮⋮⋮⋱⋮000⋯1]
the is in GL(n,R) since detIn=1≠0, and it acts as an identity element for ⟨GL(n,R),⋅⟩ ⟨GL(n,R),⋅⟩ since
AIn=InA=A
for all A∈GL(n,R).
Finally, let A∈GL(n,R). Since detA≠0, A has (matrix multiplicative) inverse A−1 in M2(R). But we need to verify that A−1 is in G. This is in fact the case, however, since A−1 is invertible (it has inverse A), hence detA−1≠0. Thus, A−1 is also in GL(n,R).
So GL(n,R) is a group under multiplication.
Theorem 2.4.2
SL(n,R), is a group under matrix multiplication.
- Proof
-
Let A,B∈SL(n,R). Then det(AB)=(detA)(detB)=1(1)=1, so AB∈SL(n,R). Thus, ⟨SL(n,R),⋅⟩ ⟨SL(n,R),⋅⟩ is a binary structure.
The rest of the proof is left as an exercise for the reader.
Remark
Throughout this course, if we are discussing a set GL(n,R) or SL(n,R), you should assume n∈Z+, unless otherwise noted.
We end this section with a final example.
Example 2.4.3
Define ∗ on Q∗ by a∗b=(ab)/2 for all a,b∈Q∗. Prove that ⟨Q∗,∗⟩ is a group.
Solution
First, ⟨Q∗⟩, is a binary structure, since (ab)/2 is rational and nonzero whenever a,b are rational and nonzero.
Next, we check that Q∗ under ∗ satisfies the group axioms. Since multiplication is commutative on Q,∗ is clearly commutative on Q∗, and so our work to show G2 and G3 is marginally reduced.
First, associativity of ∗ on Q∗ is inherited from associativity of multiplication on Q∗.
Notice that the perhaps “obvious” choice, 1, is not an identity element for Q∗ under ∗: for instance, 1∗3=3/2≠3. Rather, e is such an identity element if and only if for all a∈Q we have a=e∗a=(ea)/2. We clearly have a=(2a)/2 for all a∈Q∗; so 2 acts as an identity element for Q∗ under ∗.
Finally, let a∈Q∗. Since a≠0, it makes sense to divide by a; then 4/a∈Q∗, with a∗(4/a)=(a(4/a))/2=2.
Thus, ⟨Q∗,∗⟩ is a group.