Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

For split characteristic polynomial, elementary divisors and Jordan strings give the same Jordan blocks

Statement

For an endomorphism with split characteristic polynomial, the elementary divisors (xλ)e in the module construction and the Jordan strings in the rank-of-powers construction determine exactly the same block sizes and multiplicities, including the empty data on the zero space.

Facts & Assumptions

Given: The module-derived Jordan form of Jordan canonical form from the elementary divisors of VT.

[L1]

The ranks of all shifted powers determine the Jordan form uniquely up to permutation of its blocks (Ranks of shifted powers determine Jordan form up to block order).

[L2]

For a nilpotent operator, successive kernel dimensions or rank differences give the number of blocks of each size (Power ranks determine every nilpotent Jordan-block multiplicity).

Proof

technique · direct
1.1

On the cyclic summand F[x]/((xλ)e), multiplication by (xλ)k has kernel dimension min(k,e) for k0: it kills exactly the final min(k,e) translated-power basis vectors.

algebra
2.1

Kernel dimensions add over direct sums, so for each λ the module elementary divisors give dimker(TλI)k=emin(k,e), counted with multiplicity.

step 1.1algebra
3.1

By [L2], successive differences of the sequence in step 2.1 recover the number of blocks of size at least k and exactly k. These are the same shifted-power invariants used in [L1], so the module and Jordan-string constructions have identical block multisets. For k=0 the kernel is zero; after the largest exponent the sequence stabilizes, and on the zero space every sequence and list is empty.

step 2.1L1L2

Depends on

Used by

Dependency tree · two levels

15 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources