The Jordan block multiset is an invariant of the matrix
ProvedHefferonLinAlg.jordanBlocks_uniqueAny two Jordan forms of the same square complex matrix have the same multiset of pairs. In other words the Jordan block data is an invariant of the matrix: the blocks may be listed in any order, but which blocks occur, and with what multiplicity, is determined by alone. This is the uniqueness half of the canonical form, and it is where the difficulty of the goal theorem lives — given it, the goal follows by packaging it with existence.
import Mathlib import Definitions.Def_HefferonLinAlg_jordan open Matrix
namespace HefferonLinAlg
theorem jordanBlocks_unique
{n : ℕ} {A : Matrix (Fin n) (Fin n) ℂ} {k₁ k₂ : ℕ}
{sz₁ : Fin k₁ → ℕ} {lam₁ : Fin k₁ → ℂ}
{sz₂ : Fin k₂ → ℕ} {lam₂ : Fin k₂ → ℂ}
(h₁ : IsJordanFormOf A sz₁ lam₁) (h₂ : IsJordanFormOf A sz₂ lam₂) :
jordanBlocks sz₁ lam₁ = jordanBlocks sz₂ lam₂ := by
sorry
end HefferonLinAlgRead-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back: HefferonLinAlg.jordanBlocks_unique
What the statement asserts
For every natural number , every matrix with complex entries, every pair of natural numbers , and every choice of four functions
if the block data is a Jordan form of and the block data is a Jordan form of — both in the precise sense unfolded below — then the two multisets of size–eigenvalue pairs coincide:
as multisets of elements of . All of , , , , , , , are implicit arguments universally quantified over; the two Jordan-form hypotheses are the only hypotheses. There is no hypothesis of invertibility, nonzero size, distinctness of eigenvalues, ordering of block sizes, or anything else about .
The named constructions, unfolded
Jordan block. For and a scalar , is the matrix whose entry is
with read as integers in . The 's therefore sit on the subdiagonal (directly below the diagonal), not above it. For this is the empty matrix.
Index type of a Jordan matrix. Given and , the index set is the disjoint union
whose elements are pairs with . Its cardinality is .
Jordan matrix. is the matrix indexed by that is block diagonal with the -th diagonal block equal to :
Similarity. For square matrices over a commutative ring, indexed by the same finite index set, " is similar to " means: there exists a matrix of the same shape such that is a unit (over : ) and
where is the total matrix-inverse operation, which — because is assumed to be a unit — is the genuine two-sided inverse of . Note the direction: it is that is conjugated into .
" is a Jordan form of ." For indexed by , this is the conjunction of two conditions:
- Every block is nonempty: for all .
- There exists a bijection such that is similar (in the sense just given, as matrices indexed by ) to the matrix obtained from by relabelling its rows and columns along — i.e. to the matrix with . Explicitly: there exist and a matrix over indexed by with and .
The bijection and the conjugator are existentially quantified separately inside each hypothesis; nothing links the ones supplied by the first hypothesis to the ones supplied by the second.
The multiset of blocks. is the multiset obtained by running over all of and collecting the pairs , keeping repetitions. It has exactly elements counted with multiplicity; the pair appears once for each index producing it.
What the conclusion does and does not say
- Multiset equality means: the two collections contain the same size–eigenvalue pairs with the same multiplicities. Size and eigenvalue are matched jointly, not separately — the pair on one side must be answered by a pair on the other, not merely by "some block of size " and "some block with eigenvalue ".
- Because a multiset's cardinality is preserved, the conclusion in particular forces ; equivalently, it is logically the same as the existence of a bijection from to with and for all .
- It says nothing about the ordering of the blocks, and nothing about the bijections or the conjugating matrices appearing in the two hypotheses; no relation between them is claimed.
- It does not assert that a Jordan form exists for any given , nor that the 's are eigenvalues of , nor that eigenvalues appearing in different blocks are distinct, nor that block sizes are listed in any order. It is a conditional statement: if two such block descriptions are given, they agree as multisets.
Degenerate and boundary cases covered by the quantifiers
- : is the empty matrix. A bijection requires ; combined with condition 1 ( for every ), forces and hence both multisets are empty.
- : allowed for either hypothesis; condition 1 is then vacuously true, is empty, and the resulting multiset is empty. As above, this is compatible with the hypotheses only when .
- Size-zero blocks are excluded by condition 1, so a block description may not be padded with empty blocks carrying arbitrary eigenvalues.
- Dimension constraint: more generally, each hypothesis silently forces , via the existence of the bijection .
- Repeated pairs: the multiset construction keeps duplicates, so two distinct indices with the same size and the same eigenvalue contribute two copies.
- The hypotheses are simultaneous assumptions about a single fixed ; if for a particular no such data exists, the statement holds vacuously for that .
Note on the artifact
The declaration is stated with its proof omitted (the proof body is a placeholder), so the file contains the statement above and no argument for it.
Confirmed by the mission captain (proposal self-audit).