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

The inverse of an invertible finite-dimensional endomorphism is a polynomial in that endomorphism

Statement

If T is an invertible endomorphism of a finite-dimensional vector space, then there is a polynomial q∈F[x] such that T−1=q(T).

Facts & Assumptions

Given: An invertible endomorphism T of a finite-dimensional F-vector space V.

[L2]

The characteristic polynomial of an endomorphism is that of any representing matrix A=[T], and the determinant of an endomorphism is det⁡(A) for any such matrix (The basis-independent characteristic polynomial χT of an endomorphism of a finite-dimensional space, including χT=1 in dimension zero, The determinant of an endomorphism of a finite-dimensional vector space: its matrix determinant in an ordered basis in positive dimension, and 1 on the zero space). For A∈Mn(F) with n≥1, χA(x)=xn+cn−1xn−1+⋯+c0 with constant coefficient c0=(−1)ndet⁡(A) (χA(x) is monic of degree n; for n≥1 its xn−1 coefficient is −tr⁡(A) and its constant coefficient is (−1)ndet⁡(A), while χ0×0=1). Hence in positive dimension c0=(−1)ndet⁡(T).

[L3]

An invertible finite-dimensional endomorphism has nonzero determinant (A finite-dimensional linear operator over a field is invertible if and only if its determinant is nonzero).

Proof

technique · direct
1.1

If V={0}, the unique endomorphism is at once T−1 and the zero endomorphism, so the zero polynomial evaluates to T−1.

givenalgebra
1.2

Suppose n=dim⁡V≥1 and use the coefficients in [L2]. By [L3], c0≠0. Cayley-Hamilton gives Tn+cn−1Tn−1+⋯+c1T+c0I=0.

L1L2L3
2.1

Multiply step 1.2 by T−1 and solve for the inverse: T−1=−c0−1(Tn−1+cn−1Tn−2+⋯+c2T+c1I).

step 1.2givenalgebra
3.1

The right side of step 2.1 is a polynomial in T, and step 1.1 handles the zero space.

step 1.1step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

23 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