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 , trivial nullspace and unique solvability are equivalent
Statement
For , the following are equivalent:
- is invertible;
- is a linear isomorphism;
- ;
- ;
- has a pivot in every row and every column;
- the RREF of is ;
- for every , the equation has exactly one solution.
Facts & Assumptions
Given: A square matrix .
RREF detects consistency and parametrises solutions by its nonpivot variables (Reduced row echelon form detects consistency and parametrises every solution by the nonpivot variables).
Rank–nullity for matrices gives (For an matrix , ).
Matrix rank equals the rank of (The rank of a matrix equals the rank of the linear map ).
Matrix rank equals the number of pivots in any echelon form (Row rank equals column rank, and both equal the number of pivots).
Matrix invertibility means existence of a two-sided matrix inverse (Invertible matrices and the general linear group ).
A square matrix is invertible exactly when its multiplication map is a linear isomorphism (A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms).
A linear map is injective exactly when its kernel is trivial (The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial).
A linear isomorphism is a linear map with a two-sided linear inverse (Invertible linear maps, linear isomorphisms, and inverse linear maps).
Proof
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 .
By [L2], trivial nullspace is equivalent to rank , and [L4] makes this equivalent to having pivots. A square matrix has pivots exactly when every row and column contains one.
An RREF with a pivot in every row and column is . By [L1], RREF is equivalent to the assertion that every right-hand side produces a consistent system with no free variable, hence exactly one solution.
Under condition 7, define to be the unique solution of . Then , and uniqueness for the right-hand side gives . Moreover, linearity of from [L3] gives ; applying the inverse function proves that is linear. Thus 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 , the unique empty matrix is , its map on the zero space is bijective, and every condition holds.
Depends on
- Reduced row echelon form detects consistency and parametrises every solution by the nonpivot variables
- For an $m\times n$ matrix $A$, $\operatorname{rank}(A)+\dim N(A)=n$
- The rank of a matrix equals the rank of the linear map $x\mapsto Ax$
- Row rank equals column rank, and both equal the number of pivots
- Invertible matrices and the general linear group $\operatorname{GL}_n(F)$
- A square matrix is invertible exactly when its multiplication map is a linear isomorphism; matrices preserve inverses of linear isomorphisms
- The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial
- Invertible linear maps, linear isomorphisms, and inverse linear maps
Used by
- Over a field, for each right-hand side b, Ax=b has a unique solution exactly when det(A) is nonzero, and then Cramer's quotient formula holds Corollary
- Row reducing [A∣ I] yields [I∣ A⁻¹] exactly when A is invertible Corollary
- A matrix has rank at least r exactly when it has a nonzero r-rowed minor Lemma
- Determinant criterion: if the matrix (⟨ vᵢ,wⱼ⟩)_i,j is invertible then both v₁,…,vₘ and w₁,…,wₘ are linearly independent Lemma
- The quaternion double cover generates the third homotopy group of SO(3) Lemma
- A finite square real matrix is invertible if and only if its determinant is nonzero Theorem
- A linear endomorphism of ℝⁿ sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant Theorem
- Every invertible finite square real matrix is a finite product of elementary matrices Theorem
- The reciprocal spectral condition number is the relative distance to singularity Theorem
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
- D. Margalit and J. Rabinoff, Interactive Linear Algebra, §3.6 (standard reference, not scraped)