Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 5 — global degree bound for isolated cosets

Proved
PhilipponMultiplicity.section_five_finite_coset_degree_bound

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

algebraic-geometrycommutative-algebra

Under the original Section 5 construction, let H=Stab⁡G(V)0H=\operatorname{Stab}_G(V)^0H=StabG​(V)0 be its connected identity subgroup and let

J=∑v∈Vτv(Ir).J=\sum_{v\in V}\tau_v(I_r).J=v∈V∑​τv​(Ir​).

Let RRR be any finite set whose cosets g+Hg+Hg+H are pairwise disjoint. Suppose JJJ incompletely defines each of those cosets with multiplicity at least the natural number ℓ\ellℓ. Then

ℓ ∣R∣ H(H;D)≤H(G;cD).\ell\,|R|\,\mathcal H(H;D)\leq \mathcal H(G;cD).ℓ∣R∣H(H;D)≤H(G;cD).

Here DDD is the original polynomial multidegree and ccc is the supplied bound on the translation chart degrees. The forms are the actual multigraded Hilbert degree forms, and all local lengths are canonical. This isolates the global degree estimate in the last part of the proof of Lemma 5.1, allowing any common multiplicity lower bound. Zero values of ℓ\ellℓ and entries of DDD are included; no positivity assumption on DDD is added.

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

theorem section_five_finite_coset_degree_bound
    (K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
    (C : SectionFiveConstruction G A)
    (H : AlgebraicSubgroup G) (hH : H.carrier = C.stabilizer.identityComponent)
    (hconn : H.IsConnected) (R : Finset G.Point) (ell : ℕ)
    (hdisjoint : (R : Set G.Point).Pairwise (fun g h => Disjoint
      (translate g H.carrier) (translate h H.carrier)))
    (hmultiplicity : ∀ g ∈ R, IncompletelyDefinesWithMultiplicityAtLeast G
      (⨆ v : C.component, translatedIdeal G v.val C.chosenIdeal) (translate g H.carrier) ell) :
    (ell : ℝ) * (R.card : ℝ) * hilbertDegreeForm G H.carrier C.degrees ≤
      hilbertDegreeForm G Set.univ C.scaledDegrees := by sorry

end PhilipponMultiplicity
Source
Patrice Philippon, Lemmes de zéros dans les groupes algébriques commutatifs, Bull. Soc. Math. France 114 (1986), proof of Lemma 5.1, printed pp. 381–382. https://numdam.org/articles/10.24033/bsmf.2060/ The final three displayed degree estimates on p. 382, after replacing J by its bounded polynomial-operator ideal J′, applying Proposition 3.3 and Lemma 4.5. The common multiplicity lower bound is denoted ell here; the source uses binomial(T+s,s).

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