A complex nilpotent matrix of size six is determined up to matrix similarity by its matrix rank and nilpotency index. Its Nilpotent Jordan block sizes form an integer partition of six. If there are blocks and the largest size is , then its matrix rank is and its minimal polynomial is . The eleven possible size lists areNo two have the same pair , which proves the assertion by Jordan normal form. The dimension restriction matters: in size seven, block lists and both have matrix rank four and minimal polynomial , but give different Jordan normal forms.
Cube root of a matrix 2026-10-25
A cube root of a matrix is a square matrix of the same size over the specified field satisfying . Every complex invertible matrix has one: put it in Jordan normal form, choose a scalar cube root of each nonzero eigenvalue, and apply the truncated binomial cube root of the identity plus a nilpotent matrix on each block. The Nilpotent Jordan block has none, even though its square is nonzero. If , then , making a nilpotent matrix of size three; the Cayley-Hamilton theorem then gives , a contradiction.
For a nilpotent linear map with minimal polynomial , set and , with . ThenFor strictness, choose with . The vector belongs to for . For the second inequality, the rank-nullity theorem givesThe first image is contained in the second because .
If the Nilpotent Jordan block sizes are , thenThus successive increments count the Jordan blocks reaching a given size, and counts blocks of size exactly , with . The nullities determine the entire Jordan normal form. Conversely any positive nonincreasing integer increments summing to are realized by taking the corresponding numbers of each Nilpotent Jordan block.
Kronecker quiver 2026-10-06
The Kronecker quiver has two vertices and two parallel arrows from the first to the second. For a representation with arrows , an endomorphism consists of the same matrix at both vertices and must commute with . If is a single Nilpotent Jordan block, this centralizer is , yielding an indecomposable non-brick when the block size exceeds one.
By Jordan normal form, each complex nilpotent matrix of size six can be put by matrix similarity into a block diagonal matrix whose Nilpotent Jordan blocks have sizesA Nilpotent Jordan block of size has matrix rank and minimal polynomial . Therefore, for the whole matrix,Thus the given matrix rank determines the number of Jordan blocks, and the given minimal polynomial determines the largest size . For size six these two data determine the entire integer partition. Here is the complete list, arranged by the largest size:To see that the list is exhaustive, choose the largest part between one and six and partition the remainder into parts at most . The resulting rows all have distinct pairs . Hence and have the same Jordan normal form .
Explicitly, choose invertible matrices such that and . ThenThis proves matrix similarity and illustrates the classification of six-dimensional nilpotent matrices by rank and nilpotency index.
Take the Nilpotent Jordan blockThenSuppose that a complex matrix of size three satisfied . We would have , so would be a nilpotent matrix. Every eigenvalue of must then be zero: if with , applying gives . Its characteristic polynomial is therefore , and the Cayley-Hamilton theorem gives . This contradicts . HenceThe obstruction is that a nilpotent matrix of size three cannot have nilpotency index greater than three.
We construct a cube root of a matrix on each Jordan block. Since is an invertible matrix over the complex numbers, its Jordan normal form isConsider one block , where is a Nilpotent Jordan block and . Choose a complex cube root of , so .
We need a polynomial with constant term one satisfyingThis can be constructed using only polynomial multiplication. Write . Once have been chosen, the coefficient of in is plus an expression depending only on those earlier coefficients. Choose to make this coefficient one at and zero at . Division by three is possible over the complex numbers, so the recursion always succeeds. Its first coefficients areThis is the truncated binomial cube root of the identity plus a nilpotent matrix; equivalently , where the generalized binomial coefficient is and the empty product is one.
Substitute . The polynomial remainder is a multiple of , hence zero. It follows thatFor , take , so the same construction covers single-entry blocks. Assemble the block diagonal matrix . Taking matrix powers respects these blocks, and conjugating back givesThus every invertible matrix over the complex numbers has at least one cube root of a matrix. The construction uses only finitely many matrix powers.
The increments are positive integers by part (a)(i), are nonincreasing by part (a)(ii), and sum to . Thus they form an integer partition of . The complete list is , , , , and .
To prove all five occur over every field, let be a Nilpotent Jordan block of size . It sends each standard basis vector to its predecessor, with the first sent to zero, soFor a block diagonal matrix, the nullities add. The following explicit nilpotent matrices therefore realize every possible sequence:In each row the largest Jordan block size is exactly the nilpotency index , so the displayed sequence stops at the correct place.
Direct matrix multiplication gives . Denote the columns by ; they satisfyThus the matrix rank is at most two. Over the real numbers or complex numbers, the upper-left two-by-two minor is , so the matrix rank is exactly two. Every Jordan block has size at most two because , and each size-two Nilpotent Jordan block contributes one to the matrix rank. ConsequentlyEquivalently the nullities are and the minimal polynomial is .
There is a field qualification in the source: Question 2 initially allows an arbitrary field, and part (c) does not specify a new one. The preceding answer holds over every field whose characteristic is not three. In characteristic three, the first row vanishes and the other three rows all become , giving matrix rank one while . Under that reading the answer is instead
Past exam of the mathematics course of the University of Cambridge 2001 ib Paper 3 17C Solution Created 2026-09-24 Updated 2026-10-14
Work in the finite-dimensional vector space implicit in the requested matrix representation and . Put , with . These form an increasing sequence ending in , and . Choose a basis of , extend it to a basis of , and continue until a basis of is obtained. Each basis vector introduced at stage maps into the span of vectors chosen at earlier stages. Its matrix column can therefore have nonzero entries only in earlier rows. This proves that the matrix is strictly upper triangular.
For a strictly upper-triangular matrix , a nonzero contribution to requires an index chain . No such chain has links among indices. Consequently . An example with exact index four is the Nilpotent Jordan blockHere has entry one in position and all others zero, while .
In the adapted basis, is upper triangular with diagonal entries one, so all its eigenvalues are one. This does not persist for the product of two such matrices with unrelated adapted bases. TakeBoth square to zero, buthas characteristic polynomial and eigenvalues , neither equal to one. The obstruction is that the two nilpotent matrices need not admit a common triangularizing basis.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 6 1 i Solution Created 2026-10-03 Updated 2026-10-14
First consider finite-dimensional Lie algebra representations. The operators representing an abelian Lie algebra commute. They have a common eigenvector: take an eigenspace for the first operator of a basis of the algebra, observe that every remaining operator preserves it, and repeat inside this nonzero space. The resulting line is an invariant subspace, so an irreducible representation must be one-dimensional. Its action has the form for a linear functional . Conversely, every such functional defines a Lie algebra representation, since both the Lie brackets in the algebra and the commutators of its scalar operators vanish. Distinct functionals give nonisomorphic representations. Thus the irreducibles are precisely the characters .
Even without a finite-dimensional assumption on the module, this conclusion for a finite-dimensional abelian Lie algebra follows from the Weak Hilbert Nullstellensatz: its universal enveloping algebra is the polynomial algebra . A simple module over a commutative algebra is its quotient by a maximal ideal, and every maximal ideal of this polynomial algebra over has residue field .
Indecomposable does not imply irreducible. For the one-dimensional abelian Lie algebra , let act on by the Nilpotent Jordan blockThe line spanned by the first coordinate vector is an invariant subspace, so the module is reducible. If it were a direct sum of two nonzero submodules, both would have dimension one; nilpotence would force to act as zero on both, contrary to . Thus it is an indecomposable representation.
For a finite-dimensional module , put and define its generalized weight spaces intrinsically byTo obtain the decomposition, choose a basis of , split into generalized eigenspaces of , and successively split each piece by . All the pieces are submodules because the acting operators commute. On one resulting piece, has a unique eigenvalue . The commuting operators can be simultaneously upper triangularized by repeating the common-eigenvector argument on quotients. Hence on this piece every is strictly upper triangular. Any linear combination is also strictly upper triangular, and its th power vanishes. Extending linearly therefore identifies the piece with . Different tuples give disjoint pieces; if a component has a different tuple from , at least one is invertible there. Consequentlywith only finitely many nonzero summands. Since the definition uses every rather than a chosen basis, this generalized-weight decomposition for a nilpotent Lie algebra is canonical. Its summands need not be irreducible, as the Jordan block example already shows.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 138 1 a Solution 2026-10-03
An -module is a semisimple module when it is a direct sum of simple modules, equivalently when every submodule has a complementary submodule. The finite-dimensional algebra is a semisimple algebra when its left regular module is semisimple.
Let , put , and suppose . The freshman's dream givesso, with ,The indecomposable modules of a cyclic p-group in characteristic p are preciselyIndeed, a module is a vector space with a nilpotent operator , and its decomposition into Nilpotent Jordan blocks gives these modules. Each is a uniserial module, with unique chainTherefore
Past exam of the mathematics course of the University of Cambridge 2021 ib Paper 1 8E a i Solution Created 2026-09-24 Updated 2026-09-25
The Nilpotent Jordan block shifts each standard basis vector one place toward the first coordinate. ThereforeThus , for the matrix has ones precisely on its th superdiagonal, and
Past exam of the mathematics course of the University of Cambridge 2023 iii Paper 102 1 vi Solution Created 2026-09-28 Updated 2026-10-14
No. Let , let be the one-dimensional subalgebra generated by the standard raising operator, and let be the irreducible defining representation. On restriction to , the element acts by a nonzero Nilpotent Jordan block. A direct sum of irreducible representations of the one-dimensional abelian Lie algebra would make diagonalizable, so this restriction is not completely reducible. The complete reducibility of semisimple Lie algebra representations applies when the restricting algebra is semisimple, which is not.