Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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 R→S be a local homomorphism of Noetherian local rings, with maximal ideal m⊂R. Let 0⟶Fe⟶Fe−1⟶⋯⟶F0 be a complex with e≥1, each Fi a finite S-module flat over R. If its reduction modulo m is exact at every term except possibly F0/mF0, then the original complex is exact at every term except possibly F0, and coker⁡(F1→F0) is flat over R.

Facts & Assumptions

Given: The local Noetherian map, finite flat complex, and its exact reduced complex.

[F1]

An injective reduced map from a finite S-module into an R-flat S-module lifts to an injection with R-flat cokernel (Fibrewise injectivity lifts and leaves a flat cokernel over a Noetherian target).

[F2]

Tensor with R/m is right exact, so the reduction of the cokernel of a map is the cokernel of its reduction (Tensoring is right exact).

Proof

technique · induct on the number of arrows, replacing the top injective pair by its flat cokernel
1.1F1

[base] If e=1, the reduced map F1/mF1→F0/mF0 is injective by hypothesis. Apply [F1] with source F1 and target F0. It makes F1→F0 injective and its cokernel flat over R, proving the assertion.

1.2F1

[IH] Suppose e>1 and the assertion holds for complexes with e−1 arrows. The reduced top arrow Fe/mFe→Fe−1/mFe−1 is injective. By [F1] its lift is injective and C=coker⁡(Fe→Fe−1) is a finite S-module flat over R. The map Fe−1→Fe−2 factors through C, giving a shorter complex 0→C→Fe−2→⋯→F0.

2.1F2step 1.2

[induction] By [F2], the reduction C/mC 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 R-flat. Combining this with the injection Fe→Fe−1 from step 1.2 restores exactness of the original complex; its final cokernel is the same one.

3.1F1step 1.1step 2.1∎

[discharge-induction: step 2.1] The base and induction steps prove the result for all e≥1. 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