Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Expected ranks and determinantal regular sequences force a free complex to be exact

Statement

Assume the Axiom of Choice. Let (R,m) be a Noetherian local ring and let F∙:0→Rne→de⋯→d1Rn0 be a finite free complex. For 1≤i≤e put ri=ni−ni+1+⋯+(−1)e−ine, and let Ii be the ideal of ri-minors of di, with the 0-minor ideal equal to R. Assume every ri is nonnegative, all (ri+1)-minors of di vanish, and for every i, either Ii=R or Ii contains an R-regular sequence of length i. Then F∙ is exact in every positive degree. The assumptions imply each di has rank exactly ri.

Facts & Assumptions

Given: The local Noetherian ring, finite free complex, expected-rank bounds, and determinantal regular sequences.

[F1]

A unit differential entry splits a contractible two-term pair. The resulting complement has ranks reduced by one in those two degrees (A unit differential entry splits a contractible two-term summand).

[F2]

A finite complex with depth⁡Fj≥j cannot have nonzero finite-length highest positive homology (The highest positive homology of a depth-bounded finite complex has positive depth).

[F3]

A regular sequence localizes to a regular sequence when its terminal quotient stays nonzero. Depth is at most local dimension, and the maximal ideal of a Noetherian local ring has finite height (Localisation And Faithfully Flat Base Change Of Regular Sequences, A finite local module has depth at most its dimension, Krull's height theorem).

[F4]

The support of a finite module is the vanishing set of its annihilator. If such a module over a Noetherian local ring is supported only at the maximal ideal, a power of the maximal ideal kills it (For a finite module, support is the set of primes containing the annihilator).

Proof

technique · split unit entries, localize the minimal complex and induct on local dimension, then use the depth acyclicity lemma to kill closed-point homology
1.1F3

First verify that Ii≠0 for every i. If Ii=R this is clear, including the ri=0 convention where the 0-minor is 1. Otherwise it contains a regular sequence of positive length, whose first member is a nonzerodivisor on the nonzero ring R. Thus an ri-minor is nonzero. Since all larger minors vanish, di has rank exactly ri.

1.2F1step 1.1

If a matrix entry of some dk is a unit, [F1] splits an identity pair in degrees k,k−1. In the complement the expected rank at k is rk−1 and all other expected ranks remain ri. The determinant identity for a block 1⊕D gives Irk(1⊕D)=Irk−1(D) and Irk+1(1⊕D)=Irk(D); minors at other differentials are unchanged because the removed rows or columns there are zero. Therefore the complement satisfies the same hypotheses. Repeat finitely many times, since each split reduces the sum of all ranks. It suffices to prove exactness for a complex whose differential entries all lie in m; call this the minimal complex.

2.1F3step 1.2

If the minimal complex has no positive-degree term, it is exact there. Otherwise let t>0 be its highest nonzero degree. Its expected rank is rt=nt>0, and It⊆m because all entries of dt lie in m. By hypothesis It contains a regular sequence of length t, so depth⁡R≥t. Every nonzero free term of the minimal complex has this same depth; therefore depth⁡Fj≥j for every j. By [F3], dim⁡R≥t. In particular if dim⁡R=0, there is no positive term and the complex is exact.

3.1F3step 1.1step 2.1

Induct on the finite integer d=dim⁡R; finiteness follows from the Noetherian maximal ideal and the height theorem [F3]. Assume d>0 and exactness for complexes with the stated hypotheses over all Noetherian local rings of dimension less than d. Let p⊊m. The localized complex over Rp retains vanishing of all larger minors. If (Ii)p is unit, its alternative holds. Otherwise every element of a chosen regular sequence in Ii belongs to p, and [F3] preserves its regularity after localization, including a nonzero terminal quotient. Thus each localized determinantal ideal satisfies the alternative. The ideal is nonzero by the localized regular sequence or unit condition, so the expected-rank equality persists. Because p⊊m, dim⁡Rp<d; the induction hypothesis makes the localized complex exact in positive degrees.

4.1F2F4step 1.2step 2.1step 3.1

Each positive homology module Hi of the minimal complex is finite over R and vanishes after localization at every nonmaximal prime by step 3.1. Thus its support is contained in {m}. By [F4], Ann⁡Hi=m when Hi≠0. If m=(x1,…,xs), powers of all xa kill Hi; a sufficiently large power mN therefore kills it. The finite filtration by mjHi has quotients finite-dimensional over R/m, so Hi has finite length. If any positive Hi were nonzero, choose the largest such i. Step 2.1 supplies the depth bounds for the complex, while [F2] says this highest homology has depth at least one. A nonzero finite-length module has depth zero, contradiction. Hence the minimal complex is positively exact, and reattaching the contractible pairs from step 1.2 proves the original complex exact.

5.1F1F2F3F4step 2.1step 3.1step 4.1∎

The dimension-zero base and positive-dimension induction complete the proof. AC is inherited by the regular-sequence, depth, and support suppliers; the unit-pair splitting itself is finite and choice-free.

Depends on

Used by

Dependency tree · two levels

20 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