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

Invertible matrix theorem: invertibility, full pivot rank, RREF I, trivial nullspace and unique solvability are equivalent

Statement

For A∈Mn(F), the following are equivalent:

  1. A is invertible;
  2. x↦Ax is a linear isomorphism;
  3. N(A)={0};
  4. rank⁡(A)=n;
  5. A has a pivot in every row and every column;
  6. the RREF of A is In;
  7. for every b∈Fn, the equation Ax=b has exactly one solution.

Facts & Assumptions

Given: A square matrix A∈Mn(F).

[L1]

RREF detects consistency and parametrises solutions by its nonpivot variables (Reduced row echelon form detects consistency and parametrises every solution by the nonpivot variables).

[L2]

Rank–nullity for matrices gives rank⁡A+dim⁡N(A)=n (For an m×n matrix A, rank⁡(A)+dim⁡N(A)=n).

[L3]

Matrix rank equals the rank of x↦Ax (The rank of a matrix equals the rank of the linear map x↦Ax).

[L4]

Matrix rank equals the number of pivots in any echelon form (Row rank equals column rank, and both equal the number of pivots).

[L5]

Matrix invertibility means existence of a two-sided matrix inverse (Invertible matrices and the general linear group GL⁡n(F)).

[L6]
[L8]

A linear isomorphism is a linear map with a two-sided linear inverse (Invertible linear maps, linear isomorphisms, and inverse linear maps).

Proof

technique · direct
1.1

By [L6], matrix invertibility is equivalent to the multiplication map being an isomorphism. An isomorphism has a two-sided inverse by [L8], hence is injective, and [L7] then gives N(A)={0}.

L5L6L7L8
2.1

By [L2], trivial nullspace is equivalent to rank n, and [L4] makes this equivalent to having n pivots. A square matrix has n pivots exactly when every row and column contains one.

step 1.1L2L3L4
3.1

An n×n RREF with a pivot in every row and column is In. By [L1], RREF In is equivalent to the assertion that every right-hand side produces a consistent system with no free variable, hence exactly one solution.

step 2.1L1
4.1

Under condition 7, define S(b) to be the unique solution of Ax=b. Then LA(S(b))=b, and uniqueness for the right-hand side Ax gives S(LA(x))=x. Moreover, linearity of LA from [L3] gives LA(S(λy+z))=λy+z=LA(λS(y)+S(z)); applying the inverse function S proves that S is linear. Thus LA has a two-sided linear inverse and is a linear isomorphism by [L8], so [L6] returns condition 1. Together with steps 1.1–3.1, this closes the implication cycle and proves all seven conditions equivalent. For n=0, the unique empty matrix is I0, its map on the zero space is bijective, and every condition holds.

step 1.1step 2.1step 3.1L3L6L8algebra∎

Depends on

Used by

Dependency tree · two levels

29 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