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.

Reduction of an exact free complex by a nonzerodivisor stays exact above degree one

Statement

Let (R,m) be a local ring, let x∈m be a nonzerodivisor, and let F∙:0→Fe→Fe−1→⋯→F0 be a finite complex of finite free R-modules. If Hj(F∙)=0 for every j≥1, then Hj(F∙/xF∙)=0 for every j≥2. Equivalently, the reduced complex is exact at all its terms of degree at least two. The degree-one homology can appear from x-torsion in the original cokernel.

Facts & Assumptions

Given: The local ring, nonzerodivisor, finite free complex, and exactness in positive degrees.

[F1]

A short exact sequence of complexes gives a long exact sequence in homology (The long exact sequence in homology).

Proof

technique · use the homology sequence of multiplication by the nonzerodivisor
1.1F1

Because each Fj is free and x is a nonzerodivisor on R, multiplication by x is injective on every Fj. Thus 0→F∙→xF∙→F∙/xF∙→0 is a short exact sequence of complexes.

2.1F1step 1.1∎

By [F1], for j≥2 the segment Hj(F∙)→xHj(F∙)→Hj(F∙/xF∙)→Hj−1(F∙) is exact. Both outer groups vanish by hypothesis, so Hj(F∙/xF∙)=0. At j=1 the last group is H0(F∙), which need not be x-torsion-free; no degree-one conclusion is claimed.

Depends on

Used by

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