Professional Documents
Culture Documents
of
degree 1). No linear polynomial with rational coefficients has 2 as a root, since 2 is
irrational. Thus X 2 2 has no non-trivial factorization in Q[X]. Also X 2 + 2 has no real
roots, so it can have no linear factor with coefficients in Q.
as an element of R[X]?
Solution f1 = (X 2)(X + 2) is reducible in R[X]. However X 2 + 2 has no real
root, and so cannot have a linear factor with coefficients in R.
(c) Is either f1 or f2 irreducible, viewed as an element
of C[X]?
1 1
0 1
G. Then JK = K yields
a a+b
0
c
=
1 1
0 1
.
Therefore a = c = 1 and b = 0.
(b) Show that if A, B G, then AB
G.
0 0
a b
a b
Solution Suppose that A =
and B =
. Then
0 c
0 c
AB =
.
(b) Let G be the set of n n matrices with real entries such that AAT = AT A = In , where
In is the relevant identity matrix. Prove that G is a group under matrix multiplication.
Solution Notice that In G. Also (AT )T AT = AT (AT )T = AAT = AT A = In so AT
is in G, and moveover AT is the inverse of A. The only issue remaining is multiplicative
closure. Suppose that A, B G, then (AB)(AB)T = (AB)(B T AT ) by the previous
part. Therefore (AB)(AB)T = (A(BB T ))AT by associativity of matrix multiplication.
Now BB T = In so (AB)(AB)T = AAT = In . Similarly (AB)T (AB) = (B T (AT A))B =
B T B = In . Therefore AB G, and so G is a group.
(c) Find infinitely many 2 2 matrices with real entries such that AAT = AT A = I2 .
Solution Consider the matrices of the form
cos sin
.
=
sin cos
These are distinct if 0 < 2 (and correspond to rotation about the origin through
). Notice that 0 = I2 , 1 2 = 1 +2 and the inverse matrix of is both and
T .
10. (Tutor pacifier) Find all f R[X] such that q Q if, and only if, f (q) Q.
Solution Not yet! Here is a solution to Problem 10 of Sheet 6. The statements was this.
Suppose that In = {1, 2, . . . , n}, and Sn denotes the symmetric group consisting of all bijections f : In In . We suppose that n > 1. A transposition is any t Sn such that t is not
the identity, but t fixes n 2 elements of the domain. Suppose that g Sn . Prove that g is
the composition of at most n transpositions.
Solution If n = 2, then let (12) denote the transposition swapping 1 and 2. Then (12)(12) =
id, and (12) = (12), so every element of S2 is the product of at most 2 transpositions. Now
suppose that Sn . Suppose that (n) = r 6= n. In that case, (rn) fixes n. In this case by
induction on n, this permutation being viewed as an element of Sn1 , then (rn) is (by induction) the product of at most n 1 transpositions (each of which fixes n). Now premultiply
(multiply on the left) by (rn) to express as the product of at most n transpositions in Sn .
On the other hand, it is possible that (n) = n. In that case is expressible as a product of
at most n 1 transpositions (in Sn1 , by induction).