Cluster k0039
Marked blowup sequence data: append, continuation and max order reduction
Files about marked blowup sequences viewed as data: how to append one sequence to another, the lengths and boundaries of the result, and the empty sequence. Sample statements include a boundary-length formula for appended sequences, local monomial behaviour near a point, a comparison that continuing with a lower-dimensional reduction gives a pullback blowup sequence, and that the canonical algorithm rules perform a maximal order reduction. These are assembly facts that glue the order-reduction pieces into one procedure. Several statements assume other claims.
6 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
Schemes: spaces glued from rings (Spec, Zariski topology)Pullbacks (fibre products) and maps that "factor through"Noetherian spaces and irreducible components
References
Kollár, Lectures on Resolution of Singularities · ch. 3Background reading suggested by the AI namer · unchecked
Uses
Used by
34 Lean files, main folder Development.ResolutionOfSingularities.EmbeddedResolution.IdealPrincipalization.MarkedOrderReduction.