Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 II, trivial nullspace and unique solvability are equivalent

Statement

For AMn(F)A\in M_n(F), the following are equivalent:

  1. AA is invertible;
  2. xAxx\mapsto Ax is a linear isomorphism;
  3. N(A)={0}N(A)=\{0\};
  4. rank(A)=n\operatorname{rank}(A)=n;
  5. AA has a pivot in every row and every column;
  6. the RREF of AA is InI_n;
  7. for every bFnb\in F^n, the equation Ax=bAx=b has exactly one solution.

Facts & Assumptions

Given: A square matrix AMn(F)A\in M_n(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 rankA+dimN(A)=n\operatorname{rank}A+\dim N(A)=n (For an m×nm\times n matrix AA, rank(A)+dimN(A)=n\operatorname{rank}(A)+\dim N(A)=n).

[L3]

Matrix rank equals the rank of xAxx\mapsto Ax (The rank of a matrix equals the rank of the linear map xAxx\mapsto 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 GLn(F)\operatorname{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}N(A)=\{0\}.

L5L6L7L8
2.1

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

step 1.1L2L3L4
3.1

An n×nn\times n RREF with a pivot in every row and column is InI_n. By [L1], RREF InI_n 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)S(b) to be the unique solution of Ax=bAx=b. Then LA(S(b))=bL_A(S(b))=b, and uniqueness for the right-hand side AxAx gives S(LA(x))=xS(L_A(x))=x. Moreover, linearity of LAL_A from [L3] gives LA(S(λy+z))=λy+z=LA(λS(y)+S(z))L_A(S(\lambda y+z))=\lambda y+z=L_A(\lambda S(y)+S(z)); applying the inverse function SS proves that SS is linear. Thus LAL_A 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=0n=0, the unique empty matrix is I0I_0, 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 · next 3 levels

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