Cluster k0050
Minimal primes, lengths and fundamental cycles
These files do commutative algebra about the pieces ("minimal primes") of a shape cut out by polynomial equations. Statements say the "length" of a quotient (the number of steps in a simple composition series) adds up over those pieces. They also say a "fundamental cycle", which records each piece with its multiplicity, behaves well when the coefficient field is enlarged. A cut by one extra equation has a total multiplicity that is the sum over the pieces. Many files are claims only, or proofs that assume other claims. The cluster seems a technical part of intersection-counting (Bezout-style) machinery. The statements do not show the proofs are complete.
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
Prime ideals, localization and quotient ringsLocal rings and residue fields: one big ideal of small elementsPolynomialsNoetherian spaces and irreducible componentsPrime ideals, coordinate rings and dimension of a solution set
References
Matsumura, Commutative Ring Theory · ch. 6, length and multiplicityBackground reading suggested by the AI namer · unchecked
Uses
Used by
8 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.ArithmeticBezout.