Canonical form for nilpotent matrices
ProvedHefferonLinAlg.nilpotent_canonical_formLet be a nilpotent matrix over an arbitrary field (algebraic closure is not needed for this one). Then is similar, after a reindexing of coordinates, to a block-diagonal matrix every block of which is a Jordan block with eigenvalue zero. This is the technical heart of Hefferon's last chapter: he decomposes a nilpotent map into strings and reads off the basis in which it is block diagonal. Jordan form is this theorem applied to on each generalized eigenspace.
import Mathlib import Definitions.Def_HefferonLinAlg_jordan open Matrix
namespace HefferonLinAlg
theorem nilpotent_canonical_form
{K : Type*} [Field K] {n : ℕ} (A : Matrix (Fin n) (Fin n) K) (hA : IsNilpotent A) :
∃ (k : ℕ) (sz : Fin k → ℕ), IsJordanFormOf A sz (fun _ => (0 : K)) := by
sorry
end HefferonLinAlgRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: HefferonLinAlg.nilpotent_canonical_form
What the declaration literally asserts. Let be an arbitrary field — the only assumption on is that it is a field; it is not assumed algebraically closed, infinite, of any particular characteristic, or otherwise constrained — and let be an arbitrary natural number, including . Let be an matrix with entries in , indexed by rows and columns drawn from . The single hypothesis is that is nilpotent in the sense that some natural-number power of is the zero matrix: there exists with . (This is the bare existential form; no bound is placed on , in particular it is not required that or that . Note that is formally permitted, in which case the hypothesis reads , which holds only when ; for the hypothesis therefore forces some with .) The conclusion asserts the existence of a natural number and a function assigning a size to each index , such that the pair with the constant-zero eigenvalue function for every is a Jordan form of in the following unfolded sense. First, every block is nonempty: for all . Second, writing
for the disjoint union of the block index sets, there exists a bijection from onto (which in particular forces , and hence ), and there exists an matrix over whose determinant is a unit of (equivalently, over a field, , so that is a genuine two-sided inverse rather than the conventional zero-value fallback) satisfying the exact equation
where is the block-diagonal matrix indexed by built from Jordan blocks with all eigenvalues equal to , given entrywise by
That is, each diagonal block is the matrix with zeros on the main diagonal and ones on the subdiagonal (the 's sit one row below the diagonal, at positions where the row index exceeds the column index by exactly one), all off-diagonal blocks are zero, and is this matrix with its rows and columns relabelled through the bijection . A block of size is thus the zero matrix.
Quantifier scope and degenerate cases made explicit. , , and are all merely asserted to exist; nothing is claimed about their uniqueness, about the multiset of block sizes being an invariant of , about the blocks being listed in any particular (e.g. weakly decreasing) order, or about any relationship between the block sizes and the nilpotency index . The statement is an implication, not a biconditional: it says nothing about matrices that are not nilpotent, and asserts no converse. The case is included: there the matrix algebra is the trivial ring, the hypothesis is automatically satisfiable, and with the empty size function meets the conclusion (the index set is then empty and is the empty bijection). The case is permitted by the conclusion in general, but the bijection requirement makes it usable only when . The relabelling equivalence is existentially quantified and otherwise unconstrained, so it need not respect any ordering of indices. Finally, the similarity is stated in the direction (equivalently ), with ranging over matrices of unit determinant.
Form of the artifact. The declaration is stated as a theorem whose proof is left unfilled; only the statement above is asserted.
Confirmed by the mission captain (proposal self-audit).