Section 5 — global degree bound for isolated cosets
ProvedPhilipponMultiplicity.section_five_finite_coset_degree_boundalgebraic-geometrycommutative-algebra
Under the original Section 5 construction, let be its connected identity subgroup and let
Let be any finite set whose cosets are pairwise disjoint. Suppose incompletely defines each of those cosets with multiplicity at least the natural number . Then
Here is the original polynomial multidegree and 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 and entries of are included; no positivity assumption on 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 PhilipponMultiplicitySource
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).