Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

An endomorphism is diagonalisable exactly when V=⨁i<rEλi(T) for some finite list of distinct scalars λi

Statement

An endomorphism T:V→V of a finite-dimensional F-vector space is diagonalisable if and only if there are distinct scalars λ0,…,λr−1∈F such that

V=⨁i<rEλi(T).

For V=0, take the empty list of scalars.

Facts & Assumptions

Given: A finite-dimensional endomorphism T:V→V.

[L3]

V=⨁i<nUi means ∑i<nUi=V together with Uj∩∑i≠jUi={0V} for every j<n (Internal direct sum V=⨁i<nUi: the sum is everything and each summand meets the sum of the others only in 0V).

Proof

technique · direct
1.1L1L2L3algebra

Suppose T is diagonalisable and fix an eigenbasis. Only finitely many eigenvalues occur among its finitely many vectors; group the basis vectors by those distinct eigenvalues. If v∈Eλ(T) is expanded in the eigenbasis, comparing the coefficients in Tv=λv forces every coefficient at a basis vector with eigenvalue different from λ to vanish. Thus the group carrying λ is a basis of Eλ(T). The groups exhaust the eigenbasis, so the eigenspaces sum to V; and a nonzero v∈Eλ(T) lying in the sum of the other eigenspaces would have one eigenbasis expansion supported on the λ-group and another supported off it, contradicting uniqueness of coordinates in a basis. Both conditions of [L3] therefore hold.

1.2L1L2L3L4choose

Conversely, suppose the displayed direct sum holds. Choose a basis of each eigenspace using [L4] and concatenate the finite lists. The first condition of [L3] makes the concatenation spanning. It is independent: in a vanishing combination, group the terms by eigenspace, so each group sums to a vector of its Eλ(T) and one such vector equals minus the sum of the others; the second condition of [L3] forces every group to sum to 0V, and independence inside each chosen basis then kills every coefficient. So it is a basis of eigenvectors and [L1] makes T diagonalisable.

2.1step 1.1step 1.2∎

The two constructions prove both implications. When V=0, the empty basis and empty direct sum satisfy them.

Depends on

Used by

Dependency tree · two levels

31 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