1987 addendum — corrected common-shift vanishing
ProvedPhilipponMultiplicity.addendum_strengthened_vanishing_common_shiftCorrected common-shift variant; proved on 10 October 2026. This replaces the sampled-containment conclusion in the printed strengthening rather than claiming to transcribe it exactly.
Let be the complex field or the completed algebraic closure of a prime-adic field, with its specified norm. There is a function assigning a positive integer to every embedded commutative algebraic group factor over . This function is chosen before the ambient product, analytic subgroup, sampling set, polynomial, degrees, and contact parameter.
Let be connected of dimension , let be an analytic subgroup, let be finite with , and let . Let be multihomogeneous of multidegree . Suppose its order along is at least at every point of the -fold sumset .
Then there is a connected algebraic subgroup that is incompletely defined by equations of multidegrees at most , and there is one point , shared by every , such that
The same subgroup satisfies, with the analytic codimension of in ,
Here is the existing Hilbert degree form. The full coset count is retained. The common shift is arbitrary in ; it need not be a sample point. These are uniform embedding-dependent constants, and no quadratic addition bound is imposed on this forward statement.
import Definitions.Def_PhilipponMultiplicity_ErratumCorrections set_option autoImplicit false open scoped BigOperators
namespace PhilipponMultiplicity
theorem addendum_strengthened_vanishing_common_shift
(K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K) :
∃ c : EmbeddedCommutativeGroup K → ℕ,
(∀ E, 1 ≤ c E) ∧
∀ (G : EmbeddedGroupProduct K), G.IsConnected → 0 < G.dimension →
∀ (A : AnalyticSubgroup G)
(sample : Finset G.Point), 0 ∈ sample →
∀ (T : ℕ) (D : G.FactorIndex → ℕ) (P : G.CoordinateRing),
P ≠ 0 → IsMultihomogeneousOfDegree G P D →
(∀ g ∈ sumset sample G.dimension,
((G.dimension * T + 1 : ℕ) : WithTop ℕ) ≤ vanishingOrder A P g) →
∃ H : AlgebraicSubgroup G,
H.IsConnected ∧
HasIncompleteDefinition G H.carrier (fun i => c (G.factor i) * D i) ∧
(∃ v : G.Point,
∀ g ∈ sample,
translate (g + v) H.carrier ⊆ zeroLocusOnGroup G P) ∧
((Nat.choose (T + analyticCodimension A H.carrier) (analyticCodimension A H.carrier) : ℝ) *
(cosetCount sample H.carrier : ℝ) * hilbertDegreeForm G H.carrier D ≤
hilbertDegreeForm G Set.univ (fun i => c (G.factor i) * D i)) := by sorry
end PhilipponMultiplicity