Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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.

If the minimal polynomial splits, V is the direct sum of the stabilised generalised eigenspaces

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space over an arbitrary field F; finite-dimensionality is what makes μT available at all, the minimal polynomial being defined only in that case. Suppose its minimal polynomial splits over F as

μT=i<r(xλi)ei,

with distinct λiF and ei1. Then

V=i<rGλi(ei)(T).

For every kei, ker(TλiI)k=Gλi(ei)(T), so these are the stabilised generalised eigenspaces. The zero space corresponds to the empty product and empty direct sum.

Facts & Assumptions

Given: The displayed split factorisation of μT over F.

[L1]

A nonzero polynomial splits over F when it is a product of linear factors in F[x], with repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L2]

For an endomorphism of a finite-dimensional space, the irreducible-power factors of its minimal polynomial give a direct sum of their invariant kernels, and each restriction has exactly the corresponding factor as minimal polynomial (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

[L3]

Coprime polynomials satisfy a Bézout identity (Bézout identity and the Euclidean algorithm for polynomials over a field).

[L4]

The generalised eigenspace of exponent e is Gλ(e)(T)=ker(TλI)e (Primary components kerq(T)e and generalised eigenspaces Gλ(e)(T)=ker(TλI)e).

Proof

technique · direct
1.1

By [L1], the irreducible factors are the distinct linear polynomials xλi. Applying [L2] gives the displayed direct sum, and [L4] identifies its i-th summand with Gλi(ei)(T).

L1L2L4
2.1

Fix i and kei. The kernel of (TλiI)k contains the i-th summand. On every other primary summand, (xλi)k is coprime to (xλj)ej; evaluating a Bézout identity from [L3] shows (TλiI)k is invertible there. Hence its kernel contains no vector from the other summands.

step 1.1L2L3
3.1

Thus the kernel at every kei is exactly Gλi(ei)(T). If the factorisation is empty, [L2] gives V=0.

step 2.1L2

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: 38 results over 8 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.

Sources