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.
A residue-field basis lifts to a basis of a finite flat module over a local ring
Example
Assume the Axiom of Choice (The Axiom of Choice). Let be a Noetherian local ring and let be a finite flat -module. If is a basis of the residue vector space , then any lifts form an -basis of .
Facts & Assumptions
Given: The Axiom of Choice, a Noetherian local ring , a finite flat -module , a basis of , and lifts .
Under the assumed Axiom of Choice, a finite flat module over a Noetherian local ring is free (A finite flat module over a local ring is free).
Under the same assumption, every element outside the unique maximal ideal of a local ring is a unit (Assuming the Axiom of Choice, a nonzero commutative ring is local exactly when its nonunits form an ideal, exactly when one of and is a unit for every ).
Verification
By [L1], the module is free of rank , because reducing a free basis modulo gives a basis of . Fix a free basis of .
Let be the coordinate matrix whose columns are the in the basis . Reducing modulo gives an invertible matrix because the form a residue basis, so . By [L2], is a unit. The adjugate identity therefore makes invertible over . Thus its columns are a basis. For , both bases are empty and the conclusion is immediate.
So residue-field bases lift to actual bases in the finite flat local case under the stated Choice assumption.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Stacks Project, Section 10.78: Finite projective modules (standard reference, not scraped)