Groups
[49/65%]Which of the following binary operations are closed?
subtraction of positive integers
division of nonzero integers
function composition of polynomials with real coefficients
multiplication of matrices with integer entries
exponentiation of integers
Which of the following binary operations are associative?
subtraction of integers
division of nonzero rationals
function composition of polynomials with real coefficients
multiplication of matrices with integer entries
exponentiation of integers
Which of the following binary operations are commutative?
subtraction of integers
division of nonzero real numbers
function composition of polynomials with real coefficients
multiplication of matrices with real entries
exponentiation of integers
Which of the following sets are closed under the given operation?
addition mod
addition mod
multiplication mod
multiplication mod
In each case, find the inverse of the element under the given operation.
in
in
in
in , the group of nonzero complex numbers under multiplication
In each case, perform the indicated operation.
In ,
In ,
In ,
In ,
Which of the following sets are groups under matrix multiplication?
.
.
.
Does the set of integers under subtraction (i.e., ) have an identity element?
Show that the equation modulo has no integer solution but does.
List the elements of and find the inverse of each one.
For group elements , , and provide a descriptive name for the property .
Give two reasons why the set of odd integers under addition is not a group.
Show that under multiplication modulo is not a group but that under multiplication modulo is a group.
Show that the group of Example 9 is non-Abelian by exhibiting a pair of matrices and in such that .
Let belong to a group and . Express the inverse of each of the elements , and in the form for some positive integer .
Show that the set is a group under multiplication modulo . What is the identity element of this group? Can you see any relationship between this group and ?
Translate each of the following multiplicative expressions into its additive counterpart. Assume that the operation is commutative.
For group elements , , and , express and without parentheses.
Suppose that and belong to a group and and . Write and without using negative exponents.
List the members of and .
Prove that the set of all matrices with entries from and determinant is a group under matrix multiplication.
For any integer , show that there are at least two elements in that satisfy .
An abstract algebra teacher intended to give a typist a list of nine integers that form a group under multiplication modulo . Instead, one of the nine integers was inadvertently left out, so that the list appeared as . Which integer was left out? (This really happened!)
Let be a group with the property that for any in the group, implies . Prove that is Abelian. (``Left-right cancellation'' implies commutativity.)
Let and be elements of an Abelian group and let be any integer. Show that . Is this also true for non-Abelian groups?
Draw an analogy between the statement and the act of putting on and taking off your socks and shoes. Find distinct nonidentity elements and from a non-Abelian group such that . Find an example that shows that in a group, it is possible to have . What would be an appropriate name for the group property ?
Prove that a group is Abelian if and only if for all and in .
Prove that in a group, for all .
For any elements and from a group and any integer , prove that .
If belong to a group, what is the inverse of ?
The integers and are among a collection of integers that form a group under multiplication modulo . List all .
For a positive integer let be the set of all 1-1 functions from to itself. What is the identity under the operation of function composition? Does every element of have an inverse in under this operation? Is closed under this operation? Is a group under this operation? How many elements are in ?
Prove that every group table is a Latin square; that is, each element of the group appears exactly once in each row and each column.
Give an example of a group with exactly elements. Give three examples of groups with elements.
Prove that the set of all matrices with real entries of the form
is a group. (Multiplication is defined by
This group, sometimes called the Heisenberg group after the Nobel Prize--winning physicist Werner Heisenberg, is intimately related to the Heisenberg Uncertainty Principle of quantum physics.)
Prove that in a group, if and only if . Prove that in a group, if and only if .
Let be a finite group and an odd positive integer. Show that the number of elements of such that is odd. Show that the number of elements of such that is even.
Let denote the positive rational numbers. Explain why the correspondence from that takes to is not a binary operation on . (That is, the correspondence is not well-defined.)
Suppose and are distinct reflections in a dihedral group . Prove that .
Suppose and are distinct reflections in a dihedral group such that . Prove that .
Let be any fixed rotation and any fixed reflection in a dihedral group. Prove that .
Let be any fixed rotation and any fixed reflection in a dihedral group. Prove that . Why does this imply that is non-Abelian?
Let be some rotation in and some reflection in . Express in the form . Express in the form .
Let and be rotations in and be a reflection in . What rotation is ? What rotation is ?
Prove that if is a group with the property that the square of every element is the identity, then is Abelian. (This exercise is referred to in Chapter 25.)
In a finite group, show that the number of nonidentity elements that satisfy the equation is a multiple of . If the stipulation that the group be finite is omitted, what can you say about the number of nonidentity elements that satisfy the equation ?
List the six elements of . Show that this group is non-Abelian by finding two elements that do not commute. (This exercise is referred to in Chapter 7.)
Prove the assertion made in Example 20 that the set is a group under multiplication modulo if and only if is prime.
Suppose the table below is a group table. Fill in the blank entries.