Polynomial translation operators and local component retention
DefinitionPhilipponMultiplicity_OperatorsActual polynomial translation charts with analytic coefficients, substitution and coefficient-wise iterated differentiation, generated ideals, and intersections of contractions from localization at all homogeneous representatives of group points. The comparison with source primary-component retention and atlas independence remain separate theorem obligations.
Compiled, admission-free definition bundle. Theorems asserting its substantive properties remain open targets in the full-paper goal.
import Definitions.Def_PhilipponMultiplicity_Geometry
import Definitions.Def_PhilipponMultiplicity_Analytic
/-!
# Philippon's polynomial translation/differentiation operators
The chart coordinates are actual finite polynomials in the projective
coordinates, with actual analytic functions as coefficients. The operators
substitute those polynomials, differentiate their coefficients, and reassemble
the resulting polynomial. No ideal or degree estimate is supplied as data.
The group-retention operation is a literal intersection of contractions of
localized ideals at all homogeneous representatives of group points. Its
comparison with the primary-component presentation in Definition 4.2 is a
separate theorem. It preserves local ideal membership, not just zero loci.
-/
set_option autoImplicit false
open scoped BigOperators Topology
open Filter
noncomputable section
namespace PhilipponMultiplicity
universe u
variable {K : Type u} [NontriviallyNormedField K]
/-- The coefficient ring consists of functions of the analytic parameters. -/
abbrev AnalyticCoefficientRing {G : EmbeddedGroupProduct K} (A : AnalyticSubgroup G) :=
A.ParameterSpace → K
/-- Evaluate a polynomial with parameter-function coefficients at an actual
group point and a parameter value. -/
def evaluateCoefficientPolynomial {G : EmbeddedGroupProduct K} (A : AnalyticSubgroup G)
(P : MvPolynomial G.ambient.Variable (AnalyticCoefficientRing A))
(x : G.Point) (z : A.ParameterSpace) : K :=
MvPolynomial.eval₂Hom (Pi.evalRingHom (fun _ : A.ParameterSpace => K) z)
(G.ambient.coordinate (G.embedding x)) P
/-- One Zariski chart for translating by `g` and the local analytic subgroup.
The parameter neighborhood in the representation may depend on `x`.
This is the germwise representation needed to define the source operators;
any stronger uniform product-neighborhood presentation supplies this data. -/
structure TranslationChart {G : EmbeddedGroupProduct K} (A : AnalyticSubgroup G)
(g : G.Point) where
domain : Set G.Point
domain_isOpen : @IsOpen _ G.zariskiTopology domain
degree : G.FactorIndex → ℕ
coordinates : G.ambient.Variable →
MvPolynomial G.ambient.Variable (AnalyticCoefficientRing A)
coefficient_analytic : ∀ v, ∀ e ∈ (coordinates v).support,
AnalyticAt K ((coordinates v).coeff e) 0
coordinate_homogeneous : ∀ v, ∀ e ∈ (coordinates v).support,
(∑ j : Fin (G.ambient.ambientDimension v.1 + 1), e ⟨v.1, j⟩) = degree v.1 ∧
∀ i : G.FactorIndex, i ≠ v.1 →
(∑ j : Fin (G.ambient.ambientDimension i + 1), e ⟨i, j⟩) = 0
/- Rational translation formulas remain projectively compatible wherever
they are evaluated, although their entire tuple may vanish off the chart.
This excludes arbitrary off-chart polynomials (including on other
connected components) from the global operator ideal. -/
coordinate_compatible : ∀ x : G.Point, ∀ i : G.FactorIndex,
∀ j k : Fin (G.ambient.ambientDimension i + 1),
∀ᶠ z in 𝓝 (0 : A.ParameterSpace),
evaluateCoefficientPolynomial A (coordinates ⟨i, j⟩) x z *
A.lift (g + x) z ⟨i, k⟩ =
evaluateCoefficientPolynomial A (coordinates ⟨i, k⟩) x z *
A.lift (g + x) z ⟨i, j⟩
represents : ∀ x ∈ domain,
∀ᶠ z in 𝓝 (0 : A.ParameterSpace),
∃ hz : z ∈ A.domain, ∀ i : G.FactorIndex,
∃ h : (fun j => evaluateCoefficientPolynomial A (coordinates ⟨i, j⟩) x z) ≠ 0,
Projectivization.mk K
(fun j => evaluateCoefficientPolynomial A (coordinates ⟨i, j⟩) x z) h =
G.embedding (x + g + A.map ⟨z, hz⟩) i
/-- An actual Zariski cover by polynomial translation charts. -/
structure TranslationAtlas {G : EmbeddedGroupProduct K} (A : AnalyticSubgroup G)
(g : G.Point) where
Index : Type u
chart : Index → TranslationChart A g
covers : ∀ x : G.Point, ∃ a : Index, x ∈ (chart a).domain
/-- A coordinatewise bound on the actual chart degrees. The existence of
embedding-dependent bounds for such atlases is a separate geometric theorem. -/
def TranslationAtlas.IsBoundedBy {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
{g : G.Point} (atlas : TranslationAtlas A g) (c : G.FactorIndex → ℕ) : Prop :=
∀ a : atlas.Index, ∀ i : G.FactorIndex, (atlas.chart a).degree i ≤ c i
/-- Substitute the chart coordinate polynomials into `P`, with constant
coefficients embedded as constant parameter functions. -/
def substitutedPolynomial {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
{g : G.Point} (chart : TranslationChart A g) (P : G.CoordinateRing) :
MvPolynomial G.ambient.Variable (AnalyticCoefficientRing A) :=
MvPolynomial.eval₂Hom
(MvPolynomial.C.comp (Pi.constRingHom A.ParameterSpace K)) chart.coordinates P
/-- Source Definition 4.1. An ordered tuple of coordinate directions describes
a mixed partial derivative; repeated directions are allowed. -/
def polynomialOperator {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
{g : G.Point} (chart : TranslationChart A g) (order : ℕ)
(directions : Fin order → Fin A.parameterDimension) (P : G.CoordinateRing) :
G.CoordinateRing :=
(AddMonoidAlgebra.coeff (substitutedPolynomial chart P)).sum fun e coefficient =>
MvPolynomial.monomial e
(iteratedFDeriv K order coefficient 0
(fun i => Pi.single (directions i) 1))
/-- A genuine nonzero homogeneous representative of a group point in every
projective factor. Retention ranges over all such representatives. -/
structure GroupHomogeneousRepresentative (G : EmbeddedGroupProduct K) where
point : G.Point
coordinates : G.ambient.Variable → K
nonzero : ∀ i : G.FactorIndex, (fun j => coordinates ⟨i, j⟩) ≠ 0
represents : ∀ i : G.FactorIndex,
Projectivization.mk K (fun j => coordinates ⟨i, j⟩) (nonzero i) = G.embedding point i
/-- Every group point has a homogeneous representative; the retention
intersection consequently ranges over a genuine nonempty family. -/
def representativeOfPoint (G : EmbeddedGroupProduct K) (x : G.Point) :
GroupHomogeneousRepresentative G where
point := x
coordinates := G.ambient.coordinate (G.embedding x)
nonzero i := (G.embedding x i).rep_nonzero
represents i := (G.embedding x i).mk_rep
def representativeEvaluation (G : EmbeddedGroupProduct K)
(x : GroupHomogeneousRepresentative G) : G.CoordinateRing →+* K :=
MvPolynomial.eval x.coordinates
theorem representativeEvaluation_surjective (G : EmbeddedGroupProduct K)
(x : GroupHomogeneousRepresentative G) :
Function.Surjective (representativeEvaluation G x) := by
intro a
exact ⟨MvPolynomial.C a, MvPolynomial.eval_C (f := x.coordinates) a⟩
/-- The actual maximal ideal of a chosen homogeneous representative. -/
def representativeMaximalIdeal (G : EmbeddedGroupProduct K)
(x : GroupHomogeneousRepresentative G) : MaximalSpectrum G.CoordinateRing where
asIdeal := RingHom.ker (representativeEvaluation G x)
isMaximal := RingHom.ker_isMaximal_of_surjective _ (representativeEvaluation_surjective G x)
/-- Localization at one genuine representative, followed by contraction. -/
def retainAtRepresentative (G : EmbeddedGroupProduct K) (J : Ideal G.CoordinateRing)
(x : GroupHomogeneousRepresentative G) : Ideal G.CoordinateRing :=
(J.map (algebraMap G.CoordinateRing
(Localization.AtPrime (representativeMaximalIdeal G x).asIdeal))).under G.CoordinateRing
/-- Retain precisely the local ideal data on the homogeneous cone above `G`.
For a homogeneous ideal in this Noetherian coordinate ring, comparison with
the intersection of primary components whose projective supports meet `G`
is required separately. Ranging over all representatives avoids relying on
unproved independence from a selected projective representative. -/
def retainOnGroup (G : EmbeddedGroupProduct K) (J : Ideal G.CoordinateRing) :
Ideal G.CoordinateRing :=
⨅ x : GroupHomogeneousRepresentative G, retainAtRepresentative G J x
theorem le_retainOnGroup (G : EmbeddedGroupProduct K) (J : Ideal G.CoordinateRing) :
J ≤ retainOnGroup G J := by
apply le_iInf
intro x
exact Ideal.le_comap_map
/-- The literal polynomial-generator ideal before the retention operation
in source Definition 4.2. -/
def polynomialOperatorIdeal {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
{g : G.Point} (atlas : TranslationAtlas A g) (T : ℕ) (I : Ideal G.CoordinateRing) :
Ideal G.CoordinateRing :=
G.vanishingIdeal Set.univ ⊔ Ideal.span
{Q | ∃ P ∈ I, (∃ D, G.ambient.IsHomogeneous P D) ∧
∃ a : atlas.Index, ∃ order : ℕ, order ≤ T ∧
∃ directions : Fin order → Fin A.parameterDimension,
Q = polynomialOperator (atlas.chart a) order directions P}
/-- Source Definition 4.2 with a supplied actual chart atlas. Independence
from that atlas, composition, and comparison with the sheaf presentation
are separate theorems, not fields or assumptions here. -/
def retainedPolynomialOperatorIdeal {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
{g : G.Point} (atlas : TranslationAtlas A g) (T : ℕ) (I : Ideal G.CoordinateRing) :
Ideal G.CoordinateRing :=
retainOnGroup G (polynomialOperatorIdeal atlas T I)
end PhilipponMultiplicity
Read-back
What the Lean code literally says, in plain math · gpt-6
For all declarations in this bundle, The common data are a field with a nontrivial norm and a product with . Each is a subset of , where may be zero, equipped with an additive commutative group law; this subset is locally closed in the projective Zariski topology, and addition and negation have local polynomial presentations. More explicitly, at every input and for each output projective factor there is a Zariski open neighborhood in the input projective space and a tuple of input multihomogeneous polynomials of one common multidegree whose evaluated vector is nonzero and represents that output at every input in the neighborhood. Put , and let be the coordinate of the fixed nonzero representative chosen for the projective point ; evaluation at a group point means . A polynomial is multihomogeneous of multidegree when every monomial in its support has sum of exponents in block ; the zero polynomial satisfies this condition for every . The Zariski topology on the ambient product is generated by the sets where one such polynomial evaluates nonzero, and has the topology induced by its inclusion. For , write for the ideal of generated by all multihomogeneous polynomials, of any multidegree, whose evaluations vanish for every , and write . In particular, this is an ideal span of homogeneous vanishing polynomials. The analytic datum consists of an integer , a real radius , the open ball about zero (with its specified openness and membership ), and a map with and whenever . It also contains total coordinate functions for every and . Every such coordinate function is analytic at . For each coordinate, has a formal multilinear power series representing it on the ball of radius ; for every , each vector is nonzero and represents . For every , on some neighborhood of all parameters belong to , each vector is nonzero, and its projective point is . These latter neighborhoods may depend on . Injectivity of and positivity of its derivative rank are not hypotheses. The parameter space is the full normed vector space , including points outside . Here denotes the th iterated Fréchet derivative over as a continuous -linear map. Its value for is , with an empty tuple of arguments. At each positive recursive step the Fréchet derivative is defined to be zero if the differentiated function is not differentiable there; these expressions are total. Write for the vector with coordinate equal to and every other coordinate equal to .
AnalyticCoefficientRing. For an analytic datum with parameter space , this is the ring of all functions , with pointwise operations. Membership in this ring imposes no analyticity or continuity condition and no restriction to the ball .
evaluateCoefficientPolynomial. For , a polynomial , a group point , and any parameter , this value is : each coefficient function is evaluated at , and each polynomial variable is replaced by the fixed representative coordinate . The polynomial, the point, and the parameter are arbitrary; in particular need not lie in .
TranslationChart. Given and , this structure consists of a set and a proof that it is open in the specified Zariski topology, a vector , and a polynomial over the ring of all parameter functions for each projective coordinate. Every nonzero coefficient function of every is analytic at . For every supported exponent vector of , its exponents sum to in block and to in each other block. With , for every and every the relation holds for all in some neighborhood of . This compatibility quantifies over all group points, including points outside , and its neighborhood may depend on ; by itself it permits all in a block to be zero. For every , for all in some neighborhood of there is a membership such that, for every , the vector is nonzero and its projective class equals . This representation neighborhood may depend on . The domain may be empty, in which case this last condition is vacuous; is allowed, and a zero coordinate polynomial has no support conditions to check. These conditions impose analyticity at the parameter origin, not a condition on every parameter value.
TranslationAtlas. For and , an atlas is an index type, of the same universe level as the field, a translation chart for each index, and the condition that for every there exists an index with . The index set need not be finite, and individual chart domains may be empty. Since contains its group identity, the covering condition precludes an empty index type.
TranslationAtlas.IsBoundedBy. For , , an atlas at , and any natural vector , this predicate is precisely for every atlas index and every block . The bound is non-strict, applies even to empty charts, and has no positivity assumption on .
substitutedPolynomial. For , , one translation chart at , and any , this is the polynomial over the ring obtained by replacing by the chart polynomial and replacing every scalar coefficient of by the corresponding constant function on the parameter space. The input polynomial need not be homogeneous, and the construction does not evaluate at a group point or restrict to the chart domain.
polynomialOperator. For , , a chart at , any order , an ordered list of coordinate directions , and any , write its substituted polynomial as . The returned element of is , summed over the finite coefficient support. Directions may repeat, there is no factorial normalization, and derivatives apply to coefficient functions rather than to the polynomial variables. At , the unique empty list of directions gives ; for a zero substituted polynomial the sum is empty and equals zero. There is no homogeneity assumption on and no upper bound on in this definition.
GroupHomogeneousRepresentative. For , such a representative is a group point together with a scalar coordinate function such that for each block the vector is nonzero and has projective class . All choices of nonzero representative in every block are allowed. Neither the fixed representative nor a normalization of one coordinate is required.
representativeOfPoint. For and every , this constructs the preceding kind of representative with point and coordinate function exactly , using the chosen nonzero representative of each projective factor. In particular such representatives exist for every group point, including zero.
representativeEvaluation. For and a representative as above, this is the ring homomorphism sending a polynomial to and fixing each scalar coefficient. It uses the supplied coordinate vectors , not a new choice of projective representatives.
representativeEvaluation_surjective. For every and every representative , the evaluation homomorphism is surjective: for each there exists with , with the constant polynomial providing a preimage.
representativeMaximalIdeal. For and a representative , this is the maximal ideal , equipped with maximality obtained from surjectivity of evaluation into the field . It is an ideal of the ordinary polynomial ring at the specified vector of coordinates.
retainAtRepresentative. For , any ideal , and a representative , this is the contraction to of the extension of to the localization ; explicitly it is . Equivalently, belongs when there is a polynomial with and . No homogeneity or properness assumption is imposed on . If contains a polynomial nonzero at , its localized extension and this contracted ideal are both the unit ideal.
retainOnGroup. For and any ideal , this is , with the intersection over every group point and every nonzero homogeneous coordinate representative of that point in all projective factors. Thus for each representative separately, membership requires a multiplier nonzero at that representative with ; a single common multiplier is not required. The family is nonempty, since zero is a group point and has a representative. The input ideal may be zero or the unit ideal and is not required to be homogeneous.
le_retainOnGroup. For every and every ideal , one has the inclusion . The statement asserts this direction of inclusion for arbitrary ideals, including zero and the unit ideal.
polynomialOperatorIdeal. For , , a translation atlas at , any , and any ideal , this is . Here is the coefficient-derivative polynomial just defined, and is generated by the homogeneous polynomials vanishing on all group points. The input ideal need not itself be homogeneous; only its homogeneous elements furnish operators. The zero polynomial is eligible, chart indices are unrestricted by their domains, and all orders from zero through are included with repeated directions allowed. If , only coefficient evaluation at the parameter origin occurs; if is the zero ideal, this ideal is .
retainedPolynomialOperatorIdeal. For , , an atlas at , , and an arbitrary ideal , first form , and then return . The intersection is over all group homogeneous representatives, and the atlas is a supplied argument to this definition. The zero-order case, empty individual chart domains, homogeneous zero generators, and arbitrary nonhomogeneous input ideals are included as in the preceding definitions.