Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Computing commuting diagonal and nilpotent parts of a split Jordan matrix

Example

Over any field, put T=J2(0)J2(1). Then D=0I2I2=3T22T3,N=TD=J2(0)J2(0). Thus T=D+N, the operator D is diagonal, N2=0, and DN=ND.

Facts & Assumptions

Given: The displayed block diagonal operator T.

[L1]

For a split minimal polynomial, the primary projections are polynomials in the endomorphism (Each projection in the primary decomposition is a polynomial in the endomorphism).

[L2]

On each generalised eigenspace, the operator is the eigenvalue scalar plus a nilpotent operator (Split characteristic polynomials decompose into generalised eigenspaces of the algebraic multiplicities).

Verification

technique · computation
1.1

For h(x)=3x22x3, one has h(0)=h(0)=0 and h(1)=1, h(1)=0; evaluating on the two size-two blocks therefore gives h(J2(0))=0 and h(J2(1))=I2. These identities remain valid in characteristics 2 and 3 by direct reduction.

L1algebra
2.1

Hence D=h(T) is the scalar part on the two generalised eigenspaces, while N=TD is the direct sum of their nilpotent parts as in [L2].

step 1.1L2
3.1

The displayed blocks give N2=0 and DN=ND; commutation also follows because both D and N=Th(T) are polynomials in T.

step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 36 results over 9 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.