The concrete section-five ideal chain and selected component
DefinitionPhilipponMultiplicity_SectionFiveSource input polynomial and contact data, genuine bounded translation atlases, the explicit chain I₀ = I(G), I₁ = (I(G),P) and later operator-generated ideals; selection of a common minimal prime of maximal dimension at a stable index; its actual zero locus and set stabilizer. The stabilizer closedness is setup data. Construction existence and all three Lemma 5.1 conclusions remain theorem obligations.
Compiled, admission-free definition bundle. Theorems asserting its substantive properties remain open targets in the full-paper goal.
import Definitions.Def_PhilipponMultiplicity_Operators
import Definitions.Def_PhilipponMultiplicity_Degree
import Definitions.Def_PhilipponMultiplicity_Differential
/-!
Concrete data selected in section five: a polynomial, bounded polynomial
translation atlases, the resulting ideal chain, and a common component of
maximal dimension. Existence of these selections and closedness of the
stabilizer are separate geometric obligations. None of the three conclusions
of Lemma 5.1 is a field of these structures.
-/
set_option autoImplicit false
open scoped BigOperators Pointwise
noncomputable section
namespace PhilipponMultiplicity
universe u
variable {K : Type u} [NontriviallyNormedField K]
def idealZeroLocusOnGroup (G : EmbeddedGroupProduct K)
(I : Ideal G.CoordinateRing) : Set G.Point :=
{x | ∀ P ∈ I, G.ambient.eval P (G.embedding x) = 0}
/-- Stabilizer of an actual subset under translation. -/
def setStabilizer (G : EmbeddedGroupProduct K) (V : Set G.Point) : AddSubgroup G.Point :=
AddAction.stabilizer G.Point V
/-- The input from Theorem 2.1 together with the actual bounded coordinate
presentations used to construct its ideals. -/
structure SectionFiveInput (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G) where
samplingSet : Finset G.Point
zero_mem : 0 ∈ samplingSet
contactParameter : ℕ
degrees : G.FactorIndex → ℕ
polynomial : G.CoordinateRing
polynomial_ne_zero : polynomial ≠ 0
polynomial_homogeneous : IsMultihomogeneousOfDegree G polynomial degrees
contact : ∀ g ∈ sumset samplingSet G.dimension,
((G.dimension * contactParameter + 1 : ℕ) : WithTop ℕ) ≤
vanishingOrder A polynomial g
coordinateBounds : G.FactorIndex → ℕ
coordinateBounds_pos : ∀ i, 1 ≤ coordinateBounds i
atlas : ∀ g : G.Point, TranslationAtlas A g
atlas_bound : ∀ g : G.Point, (atlas g).IsBoundedBy coordinateBounds
def SectionFiveInput.scaledDegrees {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveInput G A) : G.FactorIndex → ℕ :=
fun i => C.coordinateBounds i * C.degrees i
/-- The source sets I₀ = I(G) and I₁ = (I(G), P) explicitly. For r ≥ 2
use its displayed polynomial-operator generators, without assuming that
raw chart substitutions at order zero equal P as an unretained ideal. -/
def SectionFiveInput.idealChain {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveInput G A) : ℕ → Ideal G.CoordinateRing
| 0 => G.vanishingIdeal Set.univ
| 1 => G.vanishingIdeal Set.univ ⊔ Ideal.span {C.polynomial}
| r + 2 => G.vanishingIdeal Set.univ ⊔ Ideal.span
{Q | ∃ g ∈ sumset C.samplingSet (r + 1),
∃ a : (C.atlas g).Index, ∃ order : ℕ,
order ≤ (r + 1) * C.contactParameter ∧
∃ directions : Fin order → Fin A.parameterDimension,
Q = polynomialOperator ((C.atlas g).chart a) order directions C.polynomial}
/-- The common component selected on p. 380. The dimension equality and
maximal-component selection describe the source's setup, not the counting,
differential-containment, or incomplete-definition conclusions. -/
structure SectionFiveConstruction (G : EmbeddedGroupProduct K) (A : AnalyticSubgroup G)
extends SectionFiveInput G A where
index : ℕ
index_le : index ≤ G.dimension
dimension_stable :
varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain index)) =
varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain (index + 1)))
selectedPrime : PrimeSpectrum G.CoordinateRing
minimal_at_index : selectedPrime.asIdeal ∈ (toSectionFiveInput.idealChain index).minimalPrimes
minimal_at_next : selectedPrime.asIdeal ∈ (toSectionFiveInput.idealChain (index + 1)).minimalPrimes
meets_group : ComponentMeetsGroup G selectedPrime.asIdeal
maximal_dimension :
varietyDimension G (idealZeroLocusOnGroup G selectedPrime.asIdeal) =
varietyDimension G (idealZeroLocusOnGroup G (toSectionFiveInput.idealChain index))
stabilizer_closed : @IsClosed _ G.zariskiTopology
(setStabilizer G (idealZeroLocusOnGroup G selectedPrime.asIdeal) : Set G.Point)
def SectionFiveConstruction.chosenIdeal {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveConstruction G A) : Ideal G.CoordinateRing :=
C.toSectionFiveInput.idealChain C.index
def SectionFiveConstruction.componentPrime {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveConstruction G A) : Ideal G.CoordinateRing :=
C.selectedPrime.asIdeal
def SectionFiveConstruction.component {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveConstruction G A) : Set G.Point :=
idealZeroLocusOnGroup G C.componentPrime
def SectionFiveConstruction.stabilizer {G : EmbeddedGroupProduct K} {A : AnalyticSubgroup G}
(C : SectionFiveConstruction G A) : AlgebraicSubgroup G where
toAddSubgroup := setStabilizer G C.component
isClosed := C.stabilizer_closed
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 . For any ideal in one of these block polynomial rings, let be the dimension over of the image, in , of the vector space of polynomials homogeneous of exact block degree . Define by choosing a polynomial for which there exists such that for every with for all , if any such polynomial exists; if none exists, define . Its total degree is the largest sum of monomial exponents in its support, with total degree of zero defined to be zero. Put . The number used below is, specifically, the sum over of the total degrees of the analogous one-block Hilbert polynomials for the homogeneous vanishing ideals of the individual subsets ; it is a natural number and may be zero. For and , the order is the infimum in of the natural numbers for which the entire multilinear map is nonzero. Thus it is the least such if one exists, and is if all these derivatives are zero; order zero tests . For , a translation chart consists of a Zariski open set , a degree vector , and polynomials . Every coefficient function of each that is nonzero as a function is analytic at . Every supported monomial of has degree in block and degree zero in each other block. Set , evaluating coefficient functions at and polynomial variables at . For all , all , and all in block , the equality holds on some neighborhood of ; the neighborhood may depend on . For every , on some neighborhood of one has and each vector is nonzero and represents . An atlas for is a family of such charts indexed by an arbitrary type, together with the requirement that every belongs to at least one chart domain. Individual chart domains may be empty, and chart degrees may be zero; the coefficient and monomial conditions on a zero coordinate polynomial are vacuous. The atlas index type cannot be empty, because contains zero. A bound means for every chart and factor . For a chart and , substitute its polynomials into , embedding each scalar coefficient of as a constant function on , and write the resulting finite polynomial as . For and an ordered tuple , define . This sum runs over the finite support of the coefficient function polynomial, differentiates the coefficients only, and has no factorial divisor. Directions may repeat. At the result is the substituted polynomial with coefficient functions evaluated at .
idealZeroLocusOnGroup. For and an arbitrary ideal , this is the subset . The universal condition ranges over every polynomial in the ideal, not merely a displayed generating family. No homogeneity or properness condition is imposed on ; the zero ideal gives all of , and the unit ideal gives the empty set.
setStabilizer. For and any subset , this is the additive subgroup . Membership requires equality of the entire translated set. The subset need not be closed, connected, nonempty, or contain zero. If is empty or all of , its stabilizer is all of . Closedness of this subgroup is not part of this definition.
SectionFiveInput. For and as specified, The input consists of a finite subset with , a natural number , a multidegree vector , a polynomial which is nonzero as an element of and is multihomogeneous of degree , a vector with for every , and, for every , a translation atlas bounded coordinatewise by as described above. If denotes the finite set of sums of exactly elements of , with repetitions permitted, then and the input requires for every , with the natural number on the left included in . Thus the threshold is when either or , and infinite order satisfies the inequality. Individual may be zero, and nonzeroness of does not require that be nonzero as a function on . If every , multihomogeneity and make a nonzero constant, whose order is zero; since , that choice cannot satisfy the contact requirement. The fields provide an atlas for every , including points outside all of the specified finite sumsets. The existence and coordinatewise bounds of those atlases are hypotheses carried by the input; the required coordinate bound is the non-strict inequality , whereas its positivity is the separate condition . There is no requirement that be isometrically isomorphic to a complex or a -adic complex field in this structure.
SectionFiveInput.scaledDegrees. For any input carrying the preceding fields and conditions, the returned degree vector is for every projective factor , using multiplication of natural numbers. Since , the result is zero in every coordinate for which ; zero coordinates are retained.
SectionFiveInput.idealChain. For any input with polynomial , sampling set , contact parameter , and its specified atlases, The sequence of ideals is , , and, for every , . These generators use every chart, including any chart with empty domain; there is no condition that a group point belong to that chart domain when the generator is included. The displayed ideals use ordinary ideal generation in . At only order-zero operators occur in the terms with index at least . In particular the term with index uses and orders at most , the term with index is defined as alone, and the term with index is defined directly as . The clauses form ordinary polynomial-generator ideals; they apply neither localization and contraction nor the locally generated differential-ideal operation.
SectionFiveConstruction. For and , this structure contains all the input data and conditions: , , a nonzero multihomogeneous of degree , contact order at least at every , natural bounds , and an atlas bounded by for every group point. With the sequence defined by the displayed generator formulas, A construction additionally selects an index with and requires , where . It selects a proper prime ideal of that is minimal among prime ideals containing and is also minimal among prime ideals containing . There must exist at which every polynomial in evaluates zero. Put ; the construction requires and requires the additive subgroup to be closed in the specified Zariski topology on . Here , and is allowed, including when . The prime is not separately required to be multihomogeneous, and its meeting condition forces to be nonempty. This structure includes every field and condition of the input just described. Minimality means that each of and is contained in and that no strictly smaller prime ideal containing the respective ideal is contained in . The two equalities involving dimension refer to total degrees of the chosen Hilbert polynomials of homogeneous vanishing ideals of the indicated group zero loci, including their explicit zero fallback; they are equalities of natural numbers, not inequalities. The closedness of the full stabilizer is a supplied condition. No existence or uniqueness of a choice of index or prime is asserted by defining this structure.
SectionFiveConstruction.chosenIdeal. For any construction with its inherited input, selected index , common minimal prime, dimension equalities, meeting condition, and closed stabilizer, this ideal is exactly : it is when , when , and, when , it is plus the ideal generated by the chart coefficient-derivative operators of based at and of orders , for all atlas charts and ordered coordinate directions. This projection performs no further operation on that ideal.
SectionFiveConstruction.componentPrime. For any construction carrying all its input and selection conditions, this returns the underlying proper prime ideal selected in the construction. That prime is minimal over both and , has a common zero in , has group zero-locus dimension equal to that of , and has a group zero locus with closed translation stabilizer, as required by the construction. The returned object is the ideal itself.
SectionFiveConstruction.component. For any construction , this is , using the selected prime and the fixed projective representatives. It is a set of group points. Its nonemptiness follows from the construction's explicit meeting condition, and the construction supplies .
SectionFiveConstruction.stabilizer. For any construction , this is an algebraic subgroup in the defined sense: the additive subgroup , with , equipped with the proof that its carrier is closed in the induced Zariski topology which was supplied as a field of . This definition returns the full stabilizer subgroup; it does not take a connected component.