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.
Buchsbaum-Eisenbud rank and grade criterion for exact free complexes
Statement
Assume the Axiom of Choice. Let be a Noetherian local ring and a finite free complex. Define . When , let be the ideal of -minors of , with the -minor ideal equal to . Then the complex is exact at every positive-degree term if and only if, for all , the integers are nonnegative, all -minors vanish, and either or contains an -regular sequence of length . Under these equivalent conditions, has rank exactly .
Facts & Assumptions
Given: The local Noetherian ring, finite free complex, expected ranks, and determinantal ideals.
Positive-degree exactness forces expected rank, vanishing larger minors, and the regular-sequence alternative, including over nonreduced rings (Exact free complexes have the expected ranks and determinantal regular sequences).
Those rank and regular-sequence conditions force positive-degree exactness (Expected ranks and determinantal regular sequences force a free complex to be exact).
Proof
If the complex is positively exact, [F1] gives nonnegative , vanishing -minors, the determinantal regular-sequence alternative, and exact rank for every .
Conversely, assume the conditions in the Statement. By [F2] the complex is exact in every positive degree, and [F2] also gives exact rank . AC is inherited by the two proved directions.
Depends on
Used by
Dependency tree · two levels
14 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, Proposition 10.102.9 (tag 00N1), exactness criterion (standard reference, not scraped)