Cluster k0006
Remainder-term assembly via power-sum decompositions
Files that break a polynomial into pieces by "power-sum decomposition" and then control a "rest term". Sample statements say such a decomposition can be cut down by degree, that moving variables between blocks is compatible with it, and that an integral over a "flag" kills any multiple of a power sum. A final assembly file puts together five named claims into one claim about the rest term, and one bound has the shape "at most a constant times a power over a factorial". One file checks a value of -1 in the smallest case. The group looks like glue that combines the earlier algebra clusters into a single estimate, resting on its stated assumptions. Names such as flag integral are project terms.
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
PolynomialsSymmetric polynomials and elementary symmetric functionsFinite sets and counting
Uses
Used by
25 Lean files, main folder GroundTheory.HeightsAndTheta.Heights.HeightKernels.