Cluster k0340
Combinatorics behind the Kleiman ampleness argument
These files are about combinatorial bookkeeping for cohomology of multi-graded rings. A complex of cochains, built from finite index sets with a linear order, has a boundary operator, and the claims say a cochain that the boundary kills is a boundary of something simple. Another claim says only finitely many integer exponent patterns have all-or-nothing negative sets. A further claim embeds this combinatorial complex into the real Čech complex of a quotient ring. The role is technical support for Kleiman-style ampleness criteria. Mainly stated claims.
5 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Chain complexes, homology and exact sequencesFinite sets and countingPolynomialsPrime ideals, localization and quotient ringsLinear algebra
References
Hartshorne, Algebraic Geometry · ch. III sec. 4 (Cech cohomology) and ch. III sec. 5Background reading suggested by the AI namer · unchecked
Uses
Used by
15 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.KleimanAmpleness.