Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1, second assertion — stabilizer coset and degree bound

Proved
PhilipponMultiplicity.section_five_counting_inequality

by tomasz · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycommutative-algebra

Under the original Section 5 construction over either of Philippon's base fields, let HHH be the identity component of the stabilizer of the selected common maximal component, and let s=codim⁡A(A∩H)s=\operatorname{codim}_A(A\cap H)s=codimA​(A∩H). For the sampling set Σ\SigmaΣ, contact parameter TTT, polynomial multidegree DDD, and supplied positive translation bounds ccc,

(T+ss) #((Σ+H)/H) H(H;D)≤H(G;cD).\binom{T+s}{s}\,\#((\Sigma+H)/H)\,\mathcal H(H;D)\leq\mathcal H(G;cD).(sT+s​)#((Σ+H)/H)H(H;D)≤H(G;cD).

The degree forms are obtained from the actual multigraded Hilbert polynomials; the coset count uses the actual subgroup carrier. This is precisely the second assertion of Lemma 5.1, with no additional multiplicity, smoothness, or counting certificate as a hypothesis.

Preamble
import Definitions.Def_PhilipponMultiplicity_SectionFive
set_option autoImplicit false
open scoped BigOperators
Formal statement
namespace PhilipponMultiplicity

theorem section_five_counting_inequality
    (K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
    (C : SectionFiveConstruction G A) :
    let H := C.stabilizer.identityComponent
      let s := analyticCodimension A H
      (Nat.choose (C.contactParameter + s) s : ℝ) *
          (cosetCount C.samplingSet H : ℝ) * hilbertDegreeForm G H C.degrees ≤
        hilbertDegreeForm G Set.univ C.scaledDegrees := by sorry

end PhilipponMultiplicity
Source
P. Philippon, Lemmes de zéros dans les groupes algébriques commutatifs, BSMF 114 (1986), pp. 380–383, Lemma 5.1. https://www.numdam.org/item/BSMF_1986__114__355_0/

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me