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.
Over a field, for each right-hand side , has a unique solution exactly when is nonzero, and then Cramer's quotient formula holds
Statement
Let be a field, , , and fix . The system has a unique solution if and only if . In that case
Facts & Assumptions
Given: as in the statement.
A field is a commutative ring, and every nonzero field element is a unit (Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring).
Over a commutative ring, a unit determinant gives the unique Cramer solution (Cramer's rule over a commutative ring: every solution satisfies , and a unit determinant gives the unique quotient formula).
A square matrix over a field is invertible exactly when its kernel is zero (Invertible matrix theorem: invertibility, full pivot rank, RREF , trivial nullspace and unique solvability are equivalent).
A positive-sized square matrix over a commutative ring is invertible exactly when its determinant is a unit (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).
Matrix multiplication distributes over column addition (Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products).
Proof
If , it is a unit by [F1], so [L1] gives the unique solution and the displayed quotient formula.
Conversely, suppose has the unique solution . If , then by distributivity, so uniqueness gives . Thus the kernel of is zero.
By [L2], step 1.2 makes invertible. By [L3] and [F1], is a unit and hence is nonzero.
Steps 1.1 and 2.1 prove both directions.
Depends on
- Cramer's rule over a commutative ring: every solution satisfies $\det(A)x_j=\det(A_j(b))$, and a unit determinant gives the unique quotient formula
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
- Invertible matrix theorem: invertibility, full pivot rank, RREF $I$, trivial nullspace and unique solvability are equivalent
- Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products
- Every field is a commutative ring with $1 \ne 0$; it is an integral domain, and it is a commutative division ring
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 76 results over 20 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
- Interactive Linear Algebra (standard reference, not scraped)