Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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 a finite-dimensional space, λ is an eigenvalue of T if and only if TλI is not invertible

Statement

Let T:VV be an endomorphism of a finite-dimensional vector space over F, and let λF. Then λ is an eigenvalue of T if and only if TλIV is not invertible.

Facts & Assumptions

Given: A finite-dimensional F-vector space V, an endomorphism T of V, and λF.

[L1]

The scalar λ is an eigenvalue of T exactly when ker(TλIV){0V} (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker(TλI), and the spectrum σF(T) of an endomorphism).

[L3]

For a linear map S:VV with V finite-dimensional, dimV=dimkerS+dimimS (Rank-nullity: dimFV=nullityT+rankT). A subspace of V has dimension dimV if and only if it is all of V (If dimFV=n and U is a linear subspace of V, then U is finite-dimensional, dimFUn, and dimFU=n if and only if U=V, clause 2).

[L4]

An invertible linear map has a two-sided linear inverse, and hence is bijective (Invertible linear maps, linear isomorphisms, and inverse linear maps).

Proof

technique · direct
1.1

If λ is an eigenvalue, [L1] and [L2] show that TλIV is not injective; it therefore cannot be invertible by [L4].

L1L2L4given
1.2

Conversely, suppose λ is not an eigenvalue. Then [L1] and [L2] make S=TλIV injective, so kerS={0}. By [L3], dimimS=dimV, hence imS=V and S is bijective. Its inverse function is linear: applying S to S1(au+bv) and to aS1(u)+bS1(v) gives au+bv in both cases, and injectivity makes the two inputs equal. Thus S is invertible; contraposition gives that noninvertibility forces λ to be an eigenvalue.

L1L2L3L4givenalgebra
2.1

The two implications establish the equivalence. If V={0V}, [L1] makes the left side false and the unique endomorphism is the identity, so the same argument includes that case.

step 1.1step 1.2L1L4

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 80 results over 24 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