Cluster k0045
Area formulas with multiplicity, and lattice point counts
Two jobs sit together here. The first is an "area formula". It says that if a smooth map covers some points several times, then the area of the source weighted by how much the map stretches equals the area of the target counted with multiplicity. It is stated for general maps, for weighted sums, and for graphs of complex-differentiable maps. The second job counts points of a lattice (a regular grid) in a box inside the space attached to a number field, giving a lower bound on how many grid points fit. These are tools from measure theory and geometry of numbers. Most files are claims, or proofs that assume other claims. The statements do not show whether 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
Linear algebraCalculusIntegration on a group, Haar measure and fundamental domainsReal analysisMeasuring curved shapes of any dimension (Hausdorff measure)Lattices in n dimensions, covolume and counting points
References
Evans and Gariepy, Measure Theory and Fine Properties of Functions · ch. 3, area and coarea formulasBackground reading suggested by the AI namer · unchecked
Uses
Used by
43 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.ComplexAnalyticSets.