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.
Fibrewise exact finite flat complexes lift over a Noetherian target
Statement
Assume the Axiom of Choice. Let be a local homomorphism of Noetherian local rings, with maximal ideal . Let be a complex with , each a finite -module flat over . If its reduction modulo is exact at every term except possibly , then the original complex is exact at every term except possibly , and is flat over .
Facts & Assumptions
Given: The local Noetherian map, finite flat complex, and its exact reduced complex.
An injective reduced map from a finite -module into an -flat -module lifts to an injection with -flat cokernel (Fibrewise injectivity lifts and leaves a flat cokernel over a Noetherian target).
Tensor with is right exact, so the reduction of the cokernel of a map is the cokernel of its reduction (Tensoring is right exact).
Proof
[base] If , the reduced map is injective by hypothesis. Apply [F1] with source and target . It makes injective and its cokernel flat over , proving the assertion.
[IH] Suppose and the assertion holds for complexes with arrows. The reduced top arrow is injective. By [F1] its lift is injective and is a finite -module flat over . The map factors through , giving a shorter complex .
[induction] By [F2], the reduction is the cokernel of the reduced top arrow. Exactness of the original reduced complex therefore makes the shorter reduced complex exact at every term except possibly its last. The induction hypothesis applies, making the shorter complex exact and its final cokernel -flat. Combining this with the injection from step 1.2 restores exactness of the original complex; its final cokernel is the same one.
[discharge-induction: step 2.1] The base and induction steps prove the result for all . The Axiom of Choice is inherited through [F1]; all other selections are finite.
Depends on
Used by
Dependency tree · two levels
15 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
- The Stacks Project, Algebra, Lemma 10.99.5 (tag 00MI), exact complexes and flat cokernels (standard reference, not scraped)