Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Bounded equations — total degree of isolated cosets with multiplicity

Proved
PhilipponMultiplicity.bounded_equations_coset_degree_sum

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

algebraic-geometrycommutative-algebra

Let GGG be an embedded product of commutative algebraic groups over a Philippon base field. Let JJJ be a homogeneous ideal containing I(G)I(G)I(G) and generated modulo I(G)I(G)I(G) by finitely many homogeneous equations of multidegrees at most DDD. Let HHH be a connected algebraic subgroup, and let RRR be a finite set of pairwise disjoint cosets g+Hg+Hg+H. Suppose each coset is incompletely defined by JJJ with canonical multiplicity at least ℓ\ellℓ. Then

ℓ∑g∈RH(g+H;D)≤H(G;D).\ell\sum_{g\in R}\mathcal H(g+H;D)\leq\mathcal H(G;D).ℓg∈R∑​H(g+H;D)≤H(G;D).

This is the bounded-equation component-degree estimate on p. 382, using smoothness of the ambient algebraic group, Proposition 3.3, and the primary-component degree formula. Smoothness, Cohen–Macaulayness, and the degree inequality are not supplied as additional assumptions. The bound includes ℓ=0\ell=0ℓ=0 and zero entries of DDD. This statement is independent of the Section 5 analytic construction and its operator ideals.

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

theorem bounded_equations_coset_degree_sum
    (K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
    (G : EmbeddedGroupProduct K) (J : Ideal G.CoordinateRing)
    (hG : G.vanishingIdeal Set.univ ≤ J)
    (hJ : IsMultihomogeneousIdeal G.ambient J) (D : G.FactorIndex → ℕ)
    (hbounded : Hilbert.HasEquationsOfDegreeAtMost K G.factorCount G.ambient.ambientDimension
      (G.vanishingIdeal Set.univ) J D)
    (H : AlgebraicSubgroup G) (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
      J (translate g H.carrier) ell) :
    (ell : ℝ) * (∑ g ∈ R, hilbertDegreeForm G (translate g H.carrier) D) ≤
      hilbertDegreeForm G Set.univ D := 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 Theorem 2.1 and Lemma 5.1, printed pp. 381–382. https://numdam.org/articles/10.24033/bsmf.2060/

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