Cluster k0369
Constant shifts, monomial perturbations and counting small sections
These files state how intersection numbers change when a metric is scaled by a constant (the change is a dimension-based multiple of a degree), how a monomially bounded semipositive metric can be perturbed to give a "small generated datum", and an upper bound saying the number of small sections of degree n is at most the intersection number times n to the power D+1 over a factorial, plus error. A weight statement about group elements appears as a stray. Mostly 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
Lattices in n dimensions, covolume and counting pointsAmple and nef line bundles, and intersection numbersPolynomialsReal analysis
References
Moriwaki, Arakelov Geometry · chapters on arithmetic volumeBackground reading suggested by the AI namer · unchecked
Uses
Used by
22 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.HilbertSamuel.