Section 5 — finite contact cosets and sampling count
ProvedPhilipponMultiplicity.section_five_contact_cosetsalgebraic-geometrycommutative-algebra
Use the original Section 5 construction, with selected maximal component , chosen ideal , contact order , and sampling set . Put
The identity component is a connected algebraic subgroup. There is a finite set such that
The union is disjoint. Its members are actual cosets in the given algebraic group, and the locus is defined by the actual intrinsic differential ideal. This is the finite family and sampling lower bound used in the proof of Lemma 5.1.
Preamble
import Definitions.Def_PhilipponMultiplicity_SectionFive set_option autoImplicit false open scoped BigOperators
Formal statement
namespace PhilipponMultiplicity
theorem section_five_contact_cosets
(K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
(G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
(C : SectionFiveConstruction G A) :
∃ H : AlgebraicSubgroup G,
H.carrier = C.stabilizer.identityComponent ∧ H.IsConnected ∧
∃ R : Finset G.Point,
(∀ g ∈ R, g ∈ idealZeroLocusOnGroup G (differentialIdeal A 0 C.contactParameter
(⨆ v : C.component, translatedIdeal G v.val C.chosenIdeal))) ∧
idealZeroLocusOnGroup G (differentialIdeal A 0 C.contactParameter
(⨆ v : C.component, translatedIdeal G v.val C.chosenIdeal)) =
⋃ g ∈ R, translate g H.carrier ∧
(R : Set G.Point).Pairwise (fun g h => Disjoint
(translate g H.carrier) (translate h H.carrier)) ∧
cosetCount C.samplingSet H.carrier ≤ R.card := 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/ Finite coset decomposition and the inequality (***) on p. 381, refined to identity-component cosets on p. 382.