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.
Every elementary matrix is invertible, with inverse given by the reverse elementary operation
Statement
Every elementary matrix is invertible. Its inverse is the elementary matrix belonging to the inverse row operation.
Facts & Assumptions
Given: An elementary matrix corresponding to a row operation .
The operation has an elementary inverse (Every elementary row operation has an elementary inverse, so row equivalence is an equivalence relation).
Applying an elementary row operation is left multiplication by its elementary matrix (Applying an elementary row operation is left multiplication by its elementary matrix).
A square matrix is invertible when it has a two-sided inverse (Invertible matrices and the general linear group ).
Proof
Let be the elementary matrix of . Applying and then to gives , while applying them in the reverse order gives .
Thus is a two-sided inverse of , so is invertible and .
Depends on
Used by
- A linear endomorphism of ℝⁿ sends bounded Jordan sets to bounded Jordan sets and scales their content by the absolute determinant Theorem
- A linear map T of ℝⁿ sends Lebesgue measurable sets to Lebesgue measurable sets, with λₙ(T[E])=|det T| λₙ(E) when T is invertible and T[E] Lebesgue null when it is not Theorem
- Every invertible finite square real matrix is a finite product of elementary matrices Theorem
Dependency tree · two levels
7 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
- J. Hefferon, Linear Algebra, 4th ed., Ch. Three, §IV.3 (standard reference, not scraped)