A lattice degree function polynomial on integer affine lines
OpenPhilipponMultiplicity.closure_action_has_line_polynomial_degree_modelLet be a commutative algebraic group over a Philippon base field, let be its multiprojective closure, and suppose regular automorphisms satisfy and .
There exist an integer , a representation , and vectors indexed by the projective factors with the following property. Every closed subset admits a function . Set equal to the total degree of the actual multigraded quotient Hilbert polynomial of the ambient vanishing ideal of . For every , there is a univariate polynomial such that
The degree function also satisfies
where evaluates the factorial-normalized top homogeneous part of the actual quotient Hilbert polynomial. The lattice, representation, and factor vectors are common to all closed subsets; only the function and its line polynomials depend on .
This isolates a numerical intersection function on a lattice and the univariate degree calculation on every integral affine line. Empty and reducible closed subsets, zero-dimensional lattices, and negative lattice coordinates are included. The zero polynomial has natural degree zero. No multivariate polynomial is part of the conclusion.
Formalization Note. This is an auxiliary synthesis of the Theorem of the Base and numerical intersection theory, not a verbatim numbered source theorem. Constructing the scheme associated with the embedded point model, descending numerical degree to a finite divisor-class lattice, constructing its action, and identifying its numerical function with the concrete factorial-normalized Hilbert degree remain Open. Neither connectedness nor joint regularity of the action is assumed.
Current reduction. A checked arithmetic argument reduces this theorem to a degree function with vanishing directional finite differences. Bernoulli polynomials give discrete antiderivatives, and induction on the order of the difference constructs a univariate polynomial of the required degree on all integers. Restriction to an affine lattice line commutes with iterated differences. The common geometric lattice, action, factor vectors, numerical function, directional vanishing, and actual Hilbert-degree identity remain Open. The formal statement is unchanged.
import Mathlib.RingTheory.MvPolynomial.Homogeneous import Mathlib.LinearAlgebra.Multilinear.Basic import Mathlib.RingTheory.Finiteness.Cardinality import Definitions.Def_PhilipponMultiplicity_Support import Definitions.Def_PhilipponMultiplicity_SectionThree set_option autoImplicit false open scoped BigOperators Topology
namespace PhilipponMultiplicity
theorem closure_action_has_line_polynomial_degree_model
(K : Type*) [NontriviallyNormedField K] (hK : IsPhilipponBaseField K)
(G : EmbeddedGroupProduct K)
(τ : G.Point → (groupProjectiveClosure G ≃ groupProjectiveClosure G))
(hzero : τ 0 = Equiv.refl _)
(hadd : ∀ g h, τ (g+h) = (τ h).trans (τ g))
(hregular : ∀ g, G.ambient.IsRegularAlong G.ambient
(fun x : groupProjectiveClosure G => x.val) (fun x => (τ g x).val)) :
∃ (m : ℕ)
(α : Multiplicative G.Point →* ((Fin m → ℤ) ≃ₗ[ℤ] (Fin m → ℤ)))
(c : G.FactorIndex → (Fin m → ℤ)),
∀ (V : Set (groupProjectiveClosure G)),
@IsClosed _ (TopologicalSpace.induced Subtype.val G.ambient.zariskiTopology) V →
∃ f : (Fin m → ℤ) → ℚ,
(∀ x y : Fin m → ℤ, ∃ q : Polynomial ℚ,
q.natDegree ≤ SectionThree.locusDimension G.ambient (Subtype.val '' V) ∧
∀ t : ℤ, f (fun j => x j + t * y j) = q.eval (t : ℚ)) ∧
∀ (g : G.Point) (D : G.FactorIndex → ℕ), (∀ i, 1 ≤ D i) →
SectionThree.locusDegreeValue G.ambient (Subtype.val '' (τ g '' V)) D =
f (α (Multiplicative.ofAdd (-g)) (∑ i, (D i : ℤ) • c i)) := by sorry
end PhilipponMultiplicity