Cluster k0002
Prime sums, remainder-term bounds and trivial example checks
A mix of small numerical bounds and wrapper files for a "heights" argument. Sample statements say that the sum of log p over primes p up to x is at most x·log 4 (a Chebyshev-type bound on how many primes there are). Another says the tail of the series of log m divided by m squared is small. There are lower bounds on the size of a polynomial built from one term, and several files only check that the hypotheses of other claims can be met (for instance by simple numbers like 1/2). Larger files assemble upper and lower bounds called "Theorem T" from many named pieces taken as assumptions. The cluster looks like bookkeeping and estimates feeding a bigger theorem.
4 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
Chebyshev functions theta and psiPrimes and divisibilityInfinite seriesSymmetric polynomials and elementary symmetric functions
References
Hindry and Silverman, Diophantine Geometry: An Introduction · Part B (heights)Background reading suggested by the AI namer · unchecked
Uses
Used by
53 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.MultinomialWeights.