Section 5 — bounded equations preserving translated-chain multiplicities
ProvedPhilipponMultiplicity.section_five_bounded_translated_chainLet be a complete nontrivially normed field. Take the original Section 5 input, including the homogeneous polynomial of multidegree and polynomial translation atlases bounded by . For every chain stage and every nonempty subset of the group, put . There is a homogeneous ideal containing and generated modulo by finitely many homogeneous equations of multidegrees at most such that and have equal retained ideals and equal localizations at every genuine homogeneous representative of a group point.
For every subset and every natural number , incompletely defines with multiplicity at least if and only if does. Multiplicity is the actual localized quotient length. This is the bounded replacement on pp. 381–382, generalized from the selected component to any nonempty translating set. The chain stage zero, contact order zero, and zero entries in are included.
import Definitions.Def_PhilipponMultiplicity_SectionFive import Definitions.Def_PhilipponMultiplicity_SectionFour set_option autoImplicit false open scoped BigOperators
namespace PhilipponMultiplicity
theorem section_five_bounded_translated_chain
(K : Type*) [NontriviallyNormedField K] [CompleteSpace K]
(G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
(C : SectionFiveInput G A) (n : ℕ) (V : Set G.Point) (hV : V.Nonempty) :
∃ J' : Ideal G.CoordinateRing,
G.vanishingIdeal Set.univ ≤ J' ∧ IsMultihomogeneousIdeal G.ambient J' ∧
Hilbert.HasEquationsOfDegreeAtMost K G.factorCount G.ambient.ambientDimension
(G.vanishingIdeal Set.univ) J' C.scaledDegrees ∧
retainOnGroup G J' = retainOnGroup G (⨆ v : V, translatedIdeal G v.val (C.idealChain n)) ∧
(∀ x : GroupHomogeneousRepresentative G,
J'.map (algebraMap G.CoordinateRing
(Localization.AtPrime (representativeMaximalIdeal G x).asIdeal)) =
(⨆ v : V, translatedIdeal G v.val (C.idealChain n)).map
(algebraMap G.CoordinateRing
(Localization.AtPrime (representativeMaximalIdeal G x).asIdeal))) ∧
(∀ W : Set G.Point, ∀ ell : ℕ,
IncompletelyDefinesWithMultiplicityAtLeast G J' W ell ↔
IncompletelyDefinesWithMultiplicityAtLeast G
(⨆ v : V, translatedIdeal G v.val (C.idealChain n)) W ell) := by sorry
end PhilipponMultiplicity