Neither nor is divisible by a prime number, so both lie outside . On the other hand, . If an integer has , part (a)(i) supplies a prime number dividing the positive integer ; the same divides , so . These cases exhaust , proving
The set is nonempty because . By the well-ordering principle for the natural numbers, it has a least element . In particular and divides .
If were not a prime number, it would have a positive integer divisor with . Since divides and divides , divisibility is transitive and divides . This would put in , contradicting the minimality of . Hence .
Yes: use the non-abelian group from part (a). Every element is for a strictly upper triangular matrix with . In the finite field , the binomial theorem for commuting matrices givesThus . This constant identity-valued map is a group homomorphism, since . Part (a)(iv) already proves that is not an abelian group. Here is neither injective nor surjective, consistently with the preceding part.
If is an injective group homomorphism, then for all ,because lie in the abelian group . Injectivity gives . Hence .
Assume is a group homomorphism. For any , expanding and cancelling the initial and final gives the useful identityWe also need a consequence of compatibility with conjugation. Calculate the cube of in two ways:Cancelling shows . Thus the square of every element of commutes with every element of the image of a group homomorphism .
Now take any . In particular . Applying (1) to and then using this commutation givesThis proves the abelian image of a cubing homomorphism property. Since the image of a group homomorphism is a subgroup, .
Use the symmetric group , composing permutations from right to left. Set and . Each is a transposition, so and , whereas has order of a group element three. ConsequentlyThus the cubing map on is not a group homomorphism.
The identity is the identity matrixLeft or right matrix multiplication by it preserves every entry, as is also immediate from the product formula above.
Parametrize the matrices byDirect matrix multiplication givesThis proves closure. The identity matrix is , and the formulagives both a left and a right inverse, as substitution in the product formula verifies. Thus each element is an invertible matrix, and the subgroup test shows that is a subgroup of . It is the unitriangular group and has elements.
In the finite field , perform ordinary addition and multiplication and then take the remainder modulo . The tables areThe nonzero elements have multiplicative inverses and .
Yes. Consider the following matrices:Each has only row nonzero and has th diagonal entry , so part (c)(ii) proves that it is a diagonalisable matrix. The collection is a spanning set, because it contains every andThus it spans the matrix unit basis. A spanning set of vectors in an -dimensional vector space is a basis. Alternatively, in a vanishing linear combination of , each off-diagonal entry first forces its own coefficient to be zero, and then each diagonal entry forces the remaining coefficient to be zero.
Since , the vector is an eigenvector with nonzero eigenvalue . The assumption also makes , so the kernel has dimension . Choose its basis .
The vector is outside this kernel. Hence is a basis of consisting of eigenvectors, with corresponding eigenvalues . In that basis, is the diagonal matrixThis proves that is a diagonalisable matrix, including the case .
Write . The linear map represented by has the formThe image of a linear map here is contained in the one-dimensional linear span of , so its matrix rank is at most one. The rank-nullity theorem yieldsThus the solution space of , namely the zero eigenspace when zero is an eigenvalue, contains at least linearly independent vectors. If its dimension is ; otherwise it is . When the asserted lower bound is zero, even if zero is not an eigenvalue.
Let be the vector subspace of symmetric matrices. A basis consists of for and for , soThe dimension formula for a sum of subspaces now givesChoose . It belongs to and is a symmetric matrix, so part (a)(i) makes it a diagonalisable matrix. The preceding example shows that the strict threshold is sharp.
Take the vector subspace of skew-symmetric matrices,It is closed under vector addition and scalar multiplication, and a basis isIndeed, its diagonal entries vanish, and its entries below the diagonal are forced by those above it. Hence . Part (a)(ii) proves that the only diagonalisable matrix in is .
The matrix units , , form a basis of : each matrix has the unique expression . There are of them, so
Let be a skew-symmetric matrix. For every real vector , the real scalar equals its own transpose, butHence . If is a real eigenvector equation with , it follows thatso . If is a diagonalisable matrix over , it has a real basis of eigenvectors, all with eigenvalue zero. Thus vanishes on a basis and .
The field matters: a nonzero real skew-symmetric matrix can be a diagonalisable matrix over the complex numbers, for example with eigenvalues .
The real spectral theorem states that a symmetric matrix has an orthonormal basis of real eigenvectors, and hence is a diagonalisable matrix. Here is a proof in this setting.
For , the quadratic form attains a maximum on the unit sphere, by compactness and the extreme value theorem. Choose a unit maximizer and put . For any , the Rayleigh quotient along has a maximum at , soThe last equality uses and . Thus is orthogonal to every , so .
The orthogonal complement is an invariant subspace, because for ,The restriction of to is again symmetric with respect to the induced inner product. By mathematical induction on dimension, it has an orthonormal basis of eigenvectors; adjoining gives one for . If has those basis vectors as columns, then is a real diagonal matrix and .
The same matrix similarity preserves being a diagonalisable matrix. If is a diagonal matrix, thenTherefore is a diagonalisable matrix whenever is, and the converse follows by interchanging . Thus they are either both diagonalisable matrices or neither is. In fact the previous part shows that one invertible factor suffices.
There are unlisted articles, also show them or only show them.