Multiplicity obstruction with polynomial normal forms for spectral commutants
OpenWeierstrassEllipticZeta.spectral_factor_commutant_normal_form_multiplicity_obstructionLet be a complex period pair with lattice , invariants , normalized entire sigma differential data , and entire functions without a common zero, satisfying
Let be a -linear map equal to the canonical quasiperiods. Put
Let be the locus
Let
Suppose a bijection has nonzero homogeneous coordinate vectors
for all . Assume also that is equipped with a projective additive-fiber model : the projection has exactly the Weierstrass cubic as image, the action is
it obeys the additive action laws, and if and only if there is a unique with . Suppose respects the additive inclusion :
Write for a chosen nonzero representative of the underlying projective point .
Assume in addition the following polynomial differential equations for the normalized coordinate functions.
On the open set where , put
Then these functions have complex derivatives
On the open set where , put
Their complex derivatives are
Each assertion holds at every point where its specified denominator is nonzero, without excluding lattice points.
Assume also the following algebraic description of the chart jets.
For complex parameters , consider the two polynomial derivations on four-variable polynomial rings over :
in variables , and
in variables . Their respective cubic polynomials are
Given five functions , the coordinate maps are
used on and , respectively. These are the affine coordinates for the zero and second homogeneous-coordinate charts of the elliptic-extension model.
For , the derivation annihilates its cubic:
For every polynomial in the four coordinates and every integer ,
At each , the exact derivative identity is
and the vanishing-order criterion is
The analytic order is allowed to be infinite. These statements include and the zero polynomial, using degree zero for the zero polynomial.
Fix also a nondecreasing function with positive values such that, for every degree bound , chart , polynomial of degree at most , and point , vanishing of for all is equivalent to vanishing for all . This one cutoff function is fixed before the polynomial and finite-set parameters below.
For either chart, a point and an integer , define the contact ideal
Angle brackets mean the ideal generated by the displayed set. The definition uses the ambient four-variable polynomial ring and an arbitrary affine evaluation point. Neither the cubic equation nor a nonzero chart denominator is required.
Assume the following proved contact-ideal structure.
Write for the maximal ideal of the affine point . For the fixed invariants of , both charts, all affine points and all nonnegative integers , the following hold:
- A polynomial belongs to if and only if its jets of orders vanish at . Thus taking the ideal span in the definition adds no further polynomials.
- , and .
- If , then and is a primary ideal. Here primary means that the ideal is proper and that in the ideal and outside it imply that a power of lies in the ideal.
- If , then is the entire polynomial ring, including when either order is zero.
- .
- For every finite set , orders and assigned polynomials , there is one polynomial satisfying for every . Equivalently, simultaneously matches the jets of the assigned polynomials through order at each point.
The last assertion is interpolation of polynomial residue classes; no degree bound on the interpolating polynomial is asserted. The statement includes empty finite sets and zero orders. These properties give the local algebra of the contact conditions; the additional dimension hypotheses below describe their combined quotient.
There is a real constant uniform in integers , finite sets containing zero, and complex bihomogeneous polynomials of bidegree in two additive and five projective coordinates. Assume that for every chart and point ,
The normalized polynomial is defined as follows.
Write a polynomial in seven variables as . Define two algebra homomorphisms into four-variable polynomial rings over by
These substitutions set the additive homogenizing coordinate to one and eliminate a projective coordinate using . The subscripts denote the nonzero homogeneous coordinate, so the Lean indices 0 and 1 select and , respectively.
Suppose for every and ,
For each chart , define the finite sets
and the ideal
Assume for each chart that , the quotient is finite-dimensional over , and
For each chart put and define the time polynomial
Assume that is monic of degree and that there are polynomials , all of degree below , with
Assume also the exact membership criterion, for every ,
Degree here assigns minus infinity to zero. An empty chart set has , and , so the assertion includes it. These generator and divisibility hypotheses replace the previous existence-and-uniqueness normal-form clause.
For the same coordinate polynomials, write . Assume the following exact calculation after imposing any additional polynomial equation. For every , set and . There exists a complex algebra isomorphism
The quotient is finite-dimensional and satisfies
with the further bound whenever . This includes an identically zero added equation and empty chart sets.
Assume also that each of the above intersection lengths decomposes into local contact multiplicities. For every chart and every added equation , there exist natural numbers for , with , such that for ,
and
The are the local vanishing orders truncated at the prescribed contact order . All previously assumed quotient isomorphisms, finite dimensionality, gcd-degree formulas, degree bounds, triangular generators and membership criteria continue to hold for the same coordinate polynomials. This added identity is supplied by the proved local-multiplicity lemma; it places no additional restriction on the point set or the added equation.
Assume in addition that the derivatives below the existing cutoff have a finite Bézout certificate in each contact quotient. Put and . For every chart there are coefficient polynomials with
and
This certificate follows from the existing nonzero-jet hypothesis, the containment of powers of point-evaluation kernels in contact ideals, and their finite Chinese remainder property. All previous finite lengths, triangular presentations, quotient isomorphisms, degree bounds and sums of local multiplicities remain in force.
Assume that the finite derivative certificate can be chosen with bounded coefficients in the time coordinate. For each chart put and . There are univariate polynomials , , such that
where and natural subtraction is truncated at zero. For , the residual polynomial
belongs to and satisfies
This is supplied by reducing the earlier coefficient polynomials modulo the same monic in the same time presentation. Every earlier certificate, unit-ideal equality, finite length, triangular presentation, intersection isomorphism and local multiplicity sum remains in force. The coefficient bound depends on the contact length ; an estimate independent of the contact data is not asserted.
Assume also the exact intersection-length formula for every initial segment of derivatives of . For each chart and each natural number , put
where . Then is finite-dimensional. There exist integers such that, for ,
and
These formulas use the same contact ideals and the same normalized polynomial. Every previous certificate, degree bound, time presentation, one-equation quotient isomorphism and local multiplicity formula is retained. No bound on the number of strict stages is assumed.
Assume moreover an explicit description using the first nonzero jet orders. In each chart there are integers with
For every positive , the same ideals defined above are finite-dimensional quotients with
Also
and in particular whenever . The same work for all positive . The earlier common-jet formulations for all remain in force. These conclusions use the existing cutoff and do not give a degree bound for that cutoff.
Strengthen the common-jet description of each derivative-prefix intersection to equality of ideals. For every chart and every , the same residual common-jet orders in that description also satisfy
Thus the equations generate exactly the residual contact intersection, in addition to having the stated quotient length. All previous common-jet equivalences, explicit first-order profiles, stopping criteria and length formulas remain in force. The factors of positive order have the primary support already given by the contact-ideal structure hypotheses; order-zero factors are the whole ring.
For each derivative-prefix stage, also identify the radical and every prime ideal containing its residual intersection:
and for every prime ideal ,
Here and the same residual orders and ideals from the contact decomposition are used. These conclusions include empty support. All earlier contact decompositions, common-jet equivalences, explicit profiles, stopping criteria and length formulas remain in force.
For every derivative-prefix stage, also identify the complex algebra of its residual intersection:
Use the same residual orders and ideal as in the contact decomposition and prime-support formulas. The assertion is existence of an algebra isomorphism, so multiplication and complex scalars are preserved. It holds also at stage zero and with empty or zero-order factors. All previous common-jet equivalences, decompositions, radicals, prime classifications, profiles, stopping criteria and length formulas remain in force.
At every derivative-prefix stage, also compute the saturation of its residual ideal by every polynomial . Put
Require
and require that is finite dimensional with
Use the same residual orders as in the contact decomposition; their existing bound supplies the stated exponent. These requirements include stage zero, empty support and the zero polynomial. All previous algebra models, common-jet equivalences, decompositions, radicals, prime classifications, profiles, stopping criteria and lengths remain in force.
For each chart's finite contact ideal and every additional hypersurface polynomial , also compute the residual ideal using the same time presentation. With , put
Require the exact membership test
an isomorphism of complex algebras
and finite dimensionality with
These residual requirements use the same , , and hypersurface quotient as the existing intersection formulas. They include and empty contact sets. All earlier residual-stage saturation results, algebra models, common-jet equivalences, decompositions, radicals, prime classifications, profiles, stopping criteria and lengths remain in force.
For every additional hypersurface polynomial , require the same truncated jet orders used in its intersection-length formula to describe the residual ideal as well. Writing , this adds
These orders are the existing witnesses satisfying and the full truncated-jet equivalence for ; they are not new independent witnesses. The previous residual quotient algebra, its finite dimensionality and its length balance remain part of the premise. The decomposition also includes and empty contact sets. All preceding data and the final global conclusion are retained.
For each additional hypersurface , its intersection ideal and residual ideal must also be mutual residuals inside the same contact scheme:
Here the colon by an ideal means . These are ideal equalities using the same as the existing algebra, length and complementary-contact formulas. All earlier data and the final global conclusion remain in force.
Write for the normalized chart polynomial. At every derivative-prefix stage , the intersection ideal
also has a canonical time generator: require a monic divisor of the same such that
Require uniqueness among all monic polynomials giving that exact membership test. At the derivative family is empty. This generator is compatible with all the existing finite-dimensionality, contact-order, algebra-product, support, saturation and length data; every earlier clause and the global conclusion remain unchanged.
At every derivative-prefix stage , take the residual by the whole intersection ideal,
Require , , and finite dimensionality of , with
For every ideal containing , also require
Here is the normalized chart polynomial and the derivative family is empty when . All canonical generator, contact-order, algebra, support, saturation and length clauses continue to hold with the same data. Every earlier premise and the global conclusion remain unchanged.
At every derivative-prefix stage, use the same contact-order witnesses already specifying
Require an exact contact decomposition and length for the residual by the whole intersection ideal:
The residual is the same one already appearing in the involution, inclusion and complementary-length clauses. These additional equalities use the existing contact-order witnesses at each , including the empty derivative prefix. All earlier hypotheses and the final zero-estimate conclusion remain unchanged.
For every derivative-prefix intersection and its residual , use the same contact orders and to require
Require finite dimensionality of its quotient, with
and the exact comaximality criterion
These statements measure the overlap of each intersection with its residual, using the already specified contact decompositions. They hold also for the empty derivative prefix. Every earlier hypothesis and the final zero-estimate conclusion remain unchanged.
At each derivative-prefix stage, when every existing contact order is an endpoint,
require that the ideal and its residual split the original contact ideal and its quotient:
as complex algebras. Also require a polynomial with
This is conditional on the endpoint criterion already equivalent to ; no endpoint assumption is imposed on other stages. All earlier hypotheses, witnesses and the final zero-estimate conclusion remain unchanged.
At every derivative-prefix stage put and , using the same contact orders and . Require
The quotient is finite dimensional, with
Also require if and only if . These statements apply to every prefix, including those with overlapping residual support. The previous conditional product splitting and all earlier hypotheses, witnesses and the final zero-estimate conclusion are retained.
At every derivative-prefix stage, retain the existing contact presentation
For every nonnegative order function , put and require
These comparisons use the same witnesses already describing the prefix ideal, and prove their uniqueness among all contact presentations on . The test function is arbitrary; it is not restricted by the full contact order. All earlier hypotheses, witnesses and the final zero-estimate conclusion are retained.
At every derivative-prefix stage, whenever the existing ideal is proper, require a polynomial whose derivative leaves that ideal:
This uses the finite-dimensional quotient already supplied at that stage and the chart identity . The witness is an arbitrary polynomial in ; no new degree bound or form for it is assumed. All previous hypotheses, witnesses and the final zero-estimate conclusion are retained.
At every derivative-prefix stage with proper ideal , additionally assume a monic time polynomial satisfying and
Its evaluation belongs to , while and . Here is the chart's time coordinate. This supplies a specified form and a degree bound for an escaping element at every proper stage. The assertion is conditional on properness, and the earlier unrestricted escape assertion is retained. Every other hypothesis, witness, formula and the final multiplicity estimate remain unchanged.
At every derivative-prefix stage, let be its existing contact decomposition. For every , additionally assume that the ideal equals , has finite quotient dimension , and is the whole ring exactly when all . Also require that is equivalent to the existence of with .
These assertions apply to all stages and derivative orders. They use the already chosen exponents and adjoin derivatives of elements ranging over the whole prefix ideal. Every earlier assumption, witness, bound, escape assertion and the final multiplicity estimate is retained.
For every finite generating family of each derivative-prefix ideal , and every , additionally assume that
Its quotient is finite dimensional of dimension ; membership is equivalent to having a single -th primitive modulo lying in ; and it is the whole ring exactly when all .
This clause uses the already chosen contact exponents. It applies to any family satisfying the stated generating equality. All previous contact-differentiation formulas, assumptions, witnesses, escape assertions and the final multiplicity estimate are retained.
For the already specified ideals obtained from any finite generating family of each derivative-prefix ideal , additionally assume the following progress and stopping formulas:
These clauses use the same generators and contact exponents as the existing finite-generator clause. All its previous identities and all other assumptions, witnesses, escape assertions and the complete final multiplicity estimate are retained.
For the canonical monic divisor of already associated with each derivative-prefix ideal , define the four polynomials
Additionally require that
and that for every ,
Here is monic, so its degree is a nonnegative integer; multivariate degrees are total degrees, with zero assigned total degree zero. This uses the same and coordinate polynomials as the existing presentation. All earlier witnesses, generator-jet formulas, progress criteria, escape assertions and the complete multiplicity estimate remain.
For the canonical monic polynomial already associated with each derivative-prefix ideal , additionally require the following for every contact presentation :
and, for every ,
This uses the same canonical polynomial as the existing ideal presentation, four-generator list and quotient-dimension formula. Every earlier witness, degree bound, generator-jet identity, progress criterion, escape assertion and the complete multiplicity estimate is retained.
For each derivative-prefix ideal J and its existing canonical monic time polynomial g, put d=deg(g)=dim_C(A/J), t=X_0, p=g(t), and let δ be the chart derivation. Require also the explicit identities δ^k(p)=g^(k)(t) for every k, δ^d(p)=d!, and (d!)^(-1)δ^d(p)=1. All derivatives above d vanish, and for each k≥dim_C(A/J), the ideal generated by p,δp,...,δ^k(p) is the unit ideal. This uses derivatives of the single canonical time polynomial. These assertions are added to its existing membership, dimension, factorization and uniqueness data.
For each derivative-prefix ideal and its existing canonical monic time polynomial , require the following update rule for every . Write for the existing triangular coordinate substitution, and . Then is monic, divides , and is the unique monic polynomial with membership criterion . The quotient is finite dimensional, with dimension . Also precisely when ; both the polynomial degree and the quotient dimension strictly decrease precisely when . This applies in particular when the adjoined equation is the next derivative of the normalized polynomial.
For each chart, write for the existing triangular substitution and for the normalized polynomial. The canonical polynomial of the derivative-prefix ideal of length is required to equal , where
Thus the canonical polynomials already occurring in the hypotheses are the values of this explicit recurrence. All their previous properties and the final multiplicity estimate are retained.
For each chart and each derivative prefix , write , , and . The contact data also satisfy
In particular the derivatives that changed the ideal when first adjoined suffice to generate the prefix modulo , and their number is bounded by the loss of quotient dimension. All canonical polynomial, recurrence, update, certificate, factorization and contact conditions stated above remain in force.
For each chart and derivative prefix with , the retained indices also support a bounded Bézout certificate. There are polynomials , indexed by , with and , such that
The same coefficients satisfy
for every natural number bounding the total degrees of all retained derivatives. Subtraction by is truncated in the natural-number bounds. The earlier sparse-generator inequality already bounds by . This applies in particular at the existing uniform unit-ideal cutoff. All previous conditions remain in force.
For every chart and every positive derivative prefix with , there is an integer with such that
is nonzero at each contact point in and satisfies
The coefficients in this combination are constants, and also when . This applies in particular at the existing positive uniform unit-ideal cutoff. All earlier contact, canonical polynomial, sparse certificate and multiplicity conditions remain in force.
For the same bounded integer parameter and generic combination at every positive unit derivative prefix, additionally require a polynomial with degree below such that . Its time lift has total degree at most , and the residual has total degree at most . This is unique among polynomials of degree below satisfying the congruence. Multiplication by is cancellable modulo : if and only if for every polynomial . Also . Here substitutes the time coordinate for the univariate variable and is truncated natural subtraction. These conditions supplement the same parameter bound, nonvanishing and total-degree bound already required of .
For the same generic combination and its bounded inverse at each positive unit derivative prefix, additionally require a complex-linear map given by . Here is the existing time substitution and lifts a univariate polynomial to the time coordinate. Writing , every has degree below , its lift has total degree at most , and has total degree at most . Each is the unique polynomial of degree below satisfying that congruence. Also if and only if , and is the unique complex-linear map whose outputs have degree below and satisfy the congruence for all inputs. Natural subtraction is truncated. All earlier properties of the same parameter, combination and inverse remain required.
For the same generic combination and bounded division operator at each positive unit derivative prefix, additionally require a basis of indexed by , with . The displayed representatives have total degree at most . The coordinate of at is the coefficient , so , and . Natural subtraction is truncated. All earlier properties of the same parameter, combination, inverse and division operator remain required.
For the same weighted basis and division operator at each positive unit derivative prefix, additionally require a complex-algebra homomorphism , where , representing multiplication by residue classes in that basis. Its entry at is , and if and only if . With , require for every and characteristic polynomial . Here is the same existing time substitution. All earlier data, witnesses and bounds remain required.
The same quotient multiplication representation also satisfies, for every chart polynomial ,
In addition, is invertible if and only if at every contact point of positive multiplicity. Here every multiplicity is . This determinant formula and criterion hold at each positive derivative prefix whose generated ideal is the whole ring, using the same generic combination, division operator, weighted basis and representation as above.
For this same multiplication representation, every chart polynomial has
The spectrum consists exactly of the contact-point values . The matrix is nilpotent exactly when all those values vanish, and in that case
These statements hold at each positive derivative prefix whose generated ideal is the whole ring, using the same generic combination, division operator, weighted basis, representation and determinant formula as above.
The same representation also identifies the image of multiplication by every chart polynomial with its residual quotient:
In particular,
and the rank plus the intersection quotient dimension is . Here . These conclusions hold at each positive unit derivative prefix, using the same weighted basis and multiplication representation. Together with the previously stated length formulas, they compute matrix ranks and nullities from the polynomial gcd and the local contact orders.
At every positive derivative prefix whose associated intermediate ideal is the unit ideal, the same multiplication representation also has an explicit Fitting decomposition. With and , the subspaces and are complementary, and the contact quotient is complex-linearly isomorphic to their product. For every ,
These conclusions hold for every affine-chart polynomial , with the earlier basis, rank and spectral data retained.
At every positive derivative prefix with unit intermediate ideal, the same contact quotient also has the following algebraic splitting. Set . For every affine-chart polynomial , let
Then is the unit ideal and . There is a complex-algebra isomorphism
The class of has th power zero in the first factor and is a unit in the second. There exists with and such that
All earlier basis, spectral, rank and Fitting data are retained.
At every positive derivative prefix with unit intermediate ideal, each polynomial class in the same contact quotient has a unique generalized inverse with index at most . Precisely, for every affine-chart polynomial , write . There exists a unique satisfying
All earlier algebraic splitting, Fitting, rank, spectral and basis data are retained.
At each positive derivative prefix whose generated ideal is the unit ideal, strengthen the existing unique generalized inverse witness b for every polynomial class a in the contact quotient by the following properties. With d=M.natDegree and f(x)=ax, multiplication by ab is idempotent, has kernel ker(f^d) and range range(f^d), and equals the canonical projection onto range(f^d) along ker(f^d). The element ab itself is idempotent. The same b still satisfies ab*b=b and a^(d+1)*b=a^d, and remains unique with this enriched property. All prior hypotheses, witnesses and conclusions are retained.
At each positive derivative prefix generating the unit ideal, the individual generalized inverses also assemble into a unique map G from the polynomial ring to the contact quotient which preserves zero, one and multiplication. For every polynomial p, with a its quotient class and d=M.natDegree, this map satisfies a*G(p)*G(p)=G(p) and a^(d+1)*G(p)=a^d. All previous pointwise inverse and projector properties remain present.
At each positive derivative prefix generating the unit ideal, strengthen the same unique multiplicative generalized-inverse map G by the following pointwise criteria: G(p)=0 if and only if p belongs to the radical of the contact ideal I, and the quotient class a of p is a unit if and only if a*G(p)=1. The map still preserves zero, one and multiplication and satisfies both original inverse equations. All earlier witnesses, pointwise projectors and conclusions are retained.
At each positive derivative prefix generating the unit ideal, strengthen the same unique multiplicative generalized-inverse map G as follows. For every polynomial p, every representative r with class r=G(p) in the contact quotient, and every contact point v,
Here 0^(-1)=0. The formula quantifies over all representatives. All earlier inverse equations, radical and unit criteria, projector data, witnesses and conclusions are retained.
The canonical generalized inverse also determines the dimensions of its multiplication projector. For every polynomial and every representative of in the contact quotient, set . In addition to the reciprocal and zero-or-one residue values already supplied, one has
These equalities hold for every representative of the same canonical inverse. The second subtraction is in the natural numbers.
The multiplication matrix of every polynomial now has an explicit dimension formula for all sufficiently high powers. Write and . For every polynomial and every natural ,
The subtraction is in the natural numbers. These conclusions depend only on and ; the existing canonical inverse and projector data are also retained.
The multiplication matrices also have explicit generalized-eigenspace dimensions at every value. For a polynomial and , let . The maximal generalized eigenspace of at has dimension
For every , the order- generalized eigenspace has this same dimension. Coincident values of contribute the sum of the contact multiplicities of all points in the fibre. The preceding rank, inverse and contact data are also supplied.
For every polynomial , let be the finite set of its distinct values on the contact points:
Write for the maximal generalized eigenspace of the multiplication matrix at . The strengthened data include an internal direct-sum decomposition and a linear equivalence given by summation:
Distinct contact points with equal polynomial values contribute to the same generalized eigenspace. This decomposition gives a unique spectral-component representation of every vector. All earlier assumptions and the final estimate below are retained.
For each polynomial , the spectral summation equivalence additionally comes with endomorphisms indexed by its distinct values on the contact points. They recover its components and resolve the identity:
Each range is the maximal generalized eigenspace of at the indexed value. Every projector commutes with every polynomial multiplication endomorphism:
The coordinate equality includes the natural inclusion of into the ambient vector space. All the earlier data and the final multiplicity estimate below are retained.
For each polynomial , the spectral projectors are further realized by elements of the contact quotient algebra. If is the coordinate equivalence from its supplied basis, the strengthened data require
Here is the regular multiplication operator in those coordinates. These quotient elements satisfy
The preceding spectral decomposition, coordinate projectors and all earlier chart data are retained, together with the final multiplicity estimate below.
Write for the contact quotient algebra and retain the spectral idempotents . For every polynomial , define ideals within by
The strengthened data identify each such ideal as a multiplication annihilator and give a canonical algebra equivalence
Its coordinates are the quotient maps, and the idempotents become the standard coordinate elements:
The previously supplied idempotents, projector resolutions, spectral equivalences and all earlier chart data remain part of the hypotheses. The final multiplicity estimate below is retained unchanged.
Each spectral algebra factor is also identified explicitly with its maximal generalized eigenspace. Write , , and let denote the supplied basis of the contact quotient. For every and every , there is a complex-linear isomorphism
such that, in the ambient coordinate space,
Its dimension is
Here is the finite set of chart-coordinate points, so the cardinality counts coordinate points with the specified polynomial value. The canonical product equivalence, its quotient-map coordinates and idempotent images, and all earlier chart data are retained. The final multiplicity estimate and its subgroup restrictions are unchanged.
The action of in every spectral algebra factor is a scalar plus a nilpotent element with an explicit vanishing exponent. Write , , and . For every and , the class satisfies
The factor equivalence with its maximal generalized eigenspace, its representative formula and exact dimension, and the canonical algebra product decomposition all remain present. The exponent is the supplied dimension of the ambient contact-coordinate space. All earlier chart data and the final multiplicity estimate are retained.
The vanishing exponent in each spectral factor can be bounded by that factor's own dimension. For a polynomial and a spectral value , put
Then for every integer ,
The previous vanishing relation at the ambient dimension is retained, as are the factor equivalences, representative formulas, exact dimensions, algebra product maps and all earlier chart data. The final multiplicity estimate and subgroup restrictions are unchanged.
Each spectral algebra factor additionally carries an explicit inverse away from its indexed spectral value. Write , let be the composite quotient map, and put
For every with , set
Here constants inside mean constant polynomials. Then
The sum is truncated at the factor's own dimension. The existing nilpotence relations, factor equivalences, dimensions, product maps and all earlier chart data remain present. The final multiplicity estimate and its subgroup restrictions are unchanged.
Polynomial evaluation in every spectral factor additionally has an exact unit and nilpotence criterion. For a polynomial in the chart coordinates and a spectral value , write , let be the composite quotient map, and put
For every univariate polynomial , evaluate its coefficients through the scalar map . Then
and
The spectral value has a nonempty evaluation fiber, so the factor has positive dimension. All previous resolvent formulas, nilpotence bounds, factor equivalences, dimensions, product maps and chart data remain present. The final multiplicity estimate and subgroup restrictions are unchanged.
Exact root orders in the spectral factors. For a chart polynomial and a spectral value , let be its factor algebra, let be the composite quotient map from chart polynomials, and put
For each nonzero univariate polynomial , put and evaluate at with the scalar homomorphism . Require a unit satisfying
For every , require
and in particular whenever . The nonzero hypothesis on is explicit. These identities concern a univariate polynomial applied to . All previous spectral-factor data and the final estimate are retained.
Polynomial kernels and quotient embeddings. For each chart polynomial and spectral value , let be the corresponding factor algebra and the composite quotient map from chart polynomials. Put
Let evaluate at through the scalar homomorphism . Require and
for every polynomial , including . Require also
and an injective unital ring map
with for every . These data describe the polynomial expressions in within each factor. All preceding chart and spectral data and the final multiplicity estimate are retained.
Canonical polynomial representatives. In each factor indexed by a chart polynomial and spectral value , keep the composite quotient map and put
For , let be its remainder modulo , and let denote evaluation at with scalar map . Require
and that any of degree below with equals . Require also
for every pair . These are normal forms for polynomial expressions in . The exact kernels, quotient embeddings, all earlier chart data and the final multiplicity estimate remain as stated.
Finite Taylor calculus. In each spectral factor for a chart polynomial and spectral value , retain the quotient map and put
Write for evaluation at through the coefficient map , and let denote the Hasse derivative. Require
for every . Require also that precisely when for every , and that precisely when for every . These conditions describe the evaluation of univariate polynomial expressions in . Retain the preceding canonical normal forms, exact kernels, quotient embeddings and all other chart data, together with the stated final multiplicity estimate.
Ordinary derivative calculus. In each spectral factor for a chart polynomial and spectral value , retain the quotient map and set
Let be evaluation at with coefficient map , and let denote the th ordinary derivative, including . Require
for every . Require also that exactly when for all , and that exactly when for all . Division by takes place in . These are statements about univariate polynomial expressions in . Retain the preceding Hasse Taylor calculus, normal forms, exact kernels, quotient embeddings and all other chart data, together with the stated final multiplicity estimate.
Exact nilpotency indices. In each spectral factor for a chart polynomial and spectral value , retain the quotient map and write
For every nonzero , put and let denote evaluation at with coefficient map . Require
When , require to be nilpotent with exact nilpotency class
Retain all preceding ordinary and Hasse Taylor formulas, zero and equality criteria, canonical normal forms, exact kernels, quotient embeddings and other chart data, together with the stated final subgroup multiplicity estimate.
For each spectral value and chart polynomial , write for the spectral factor and for the composite quotient map into . Set . The hypotheses additionally include
The generated subalgebra has a power basis whose generator is and whose dimension is . It is finite-dimensional, its complex dimension is exactly , and is linearly independent in . The statement concerns this generated subalgebra; generation of the whole spectral factor is not assumed or concluded.
For each spectral value and chart polynomial , let be the spectral factor, let be the composite quotient map, and put . The hypotheses additionally include a unique complex-algebra isomorphism
compatible with evaluation: for every , the image of in is . Uniqueness is subject to this compatibility formula. Thus the generated subalgebra has an explicit polynomial-quotient model, with mapping to . This does not assert that generates all of .
For a chart polynomial and spectral value , let denote the spectral factor and let be the composite quotient map. Put and let
be the already specified complex dimension of the factor. The hypotheses additionally give the equivalences
They also give
These are criteria for generation by the chosen element, and do not assume that every spectral factor is generated by it.
For every spectral factor and every , further require the following characterization of cyclic vectors for the polynomial action. Write , let be the shifted nilpotency index already specified, and let be the stated dimension of . Then
Here is called cyclic precisely when every element of has the form . Thus cyclic vectors are exactly the units when the chosen element generates the factor, and there are no cyclic vectors when it does not. All evaluation maps use the previously specified coefficient map and quotient construction.
Each spectral factor also has the following commutant description when its polynomial action is cyclic. Fix and , and retain the factor , the quotient map , the shifted nilpotency index , and its dimension . Write and . If , then every complex-linear map satisfies
This describes all linear operators commuting with multiplication by the generator in a cyclic spectral factor.
The invertible operators in each cyclic spectral commutant also admit a unique unit parameter. Fix and , retain the spectral factor , the quotient map , its shifted nilpotency index and dimension , and put . If , then each complex-linear endomorphism satisfies
where . This identifies all linear automorphisms commuting with multiplication by the chosen generator.
The commutant of each cyclic spectral factor also has unique polynomial coordinates. Fix and , let and be the inherited factor and quotient map, put , and retain the shifted nilpotency index and factor dimension . If , then every complex-linear endomorphism satisfies
where and . This describes commuting operators by a unique polynomial of bounded degree.
The factor counts the actual complex points in that chart: the first coordinate of is , so is injective. Empty chart sets are allowed. Under these hypotheses,
there are an additive subgroup and nonnegative integers with , such that either and , or and , and
Here , , and is the additive quotient map. The triple-sumset vanishing is expressed as membership in an intersection of contact ideals, together with its exact complex quotient dimension. The map takes values in the part of the explicit projective algebraic locus covered by the two standard affine charts with coordinate indices zero and two. The explicit additive action and its fibers are supplied, and the parametrization is bijective and equivariant, and its derivatives are supplied in both projective charts. Identification with an algebraic-group embedding, the geometric multiplicity bound and subgroup projection profiles remain open obligations. The supplied bijection is between the underlying sets; topological and algebraic compatibility remain to be proved. No finiteness of subgroup intersections is assumed.
import Mathlib.LinearAlgebra.FiniteDimensional.Basic import Mathlib.RingTheory.Ideal.Quotient.Operations import Mathlib.RingTheory.Adjoin.Polynomial.Basic import Mathlib.RingTheory.Adjoin.PowerBasis import Mathlib.Algebra.Polynomial.Taylor import Mathlib.Algebra.DirectSum.Module import Mathlib.LinearAlgebra.Eigenspace.Basic import Mathlib.Algebra.Algebra.Bilinear import Mathlib.LinearAlgebra.Projection import Mathlib.LinearAlgebra.Matrix.Rank import Mathlib.LinearAlgebra.Matrix.Charpoly.Eigs import Mathlib.LinearAlgebra.Matrix.ToLin import Mathlib.LinearAlgebra.Matrix.Charpoly.Coeff import Mathlib.RingTheory.Ideal.Colon import Mathlib.Algebra.Algebra.Pi import Mathlib.RingTheory.AdjoinRoot import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.LinearAlgebra.FiniteDimensional.Defs import Mathlib.RingTheory.Ideal.Quotient.Basic import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal import Mathlib.RingTheory.Ideal.IsPrimary import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartNormalization import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionFiberModel import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionChartLocus import Definitions.Def_WeierstrassEllipticZeta_ProjectiveExtensionLocus import Mathlib.LinearAlgebra.Projectivization.Basic import Definitions.Def_TranscendenceTheory_GraphQuotientExtension import Mathlib.Analysis.Analytic.Order import Definitions.Def_WeierstrassEllipticZeta_SigmaDifferential import Mathlib.Algebra.MvPolynomial.Eval import Mathlib.Analysis.Calculus.IteratedDeriv.Defs import Mathlib.Algebra.Group.Pointwise.Finset.Basic import Mathlib.LinearAlgebra.Quotient.Basic import Mathlib.Data.Set.Card open WeierstrassEllipticZeta open scoped Pointwise open TranscendenceTheory open scoped Classical set_option maxHeartbeats 800000
theorem WeierstrassEllipticZeta.spectral_factor_commutant_normal_form_multiplicity_obstruction
(L : PeriodPair) (D : EllipticSigmaDifferentialData L)
(S : Fin 5 → ℂ → ℂ)
(hS : ∀ j, AnalyticOnNhd ℂ (S j) Set.univ)
(hS_value : ∀ z : ℂ, z ∉ L.lattice → ∀ j : Fin 5,
S j z = D.sigma z ^ 3 * ![1, L.weierstrassP z, L.derivWeierstrassP z,
weierstrassZeta L z,
L.derivWeierstrassP z * weierstrassZeta L z + 2 * L.weierstrassP z ^ 2] j)
(hS_ne : ∀ z : ℂ, ∃ j : Fin 5, S j z ≠ 0)
(η : L.lattice →ₗ[ℤ] ℂ)
(hη : ∀ ω : L.lattice, η ω = zetaQuasiPeriod L ω)
(P : GraphQuotientExtension L.lattice η ≃ ProjectiveExtensionChartLocus L.g₂ L.g₃)
(hP : ∀ z u : ℂ, ∃ hv :
![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] ≠ 0,
(P ((extensionPeriodGraph L.lattice η).mkQ (z, u))).val.val = Projectivization.mk ℂ
![S 0 z, S 1 z, S 2 z, S 3 z + u * S 0 z, S 4 z + u * S 2 z] hv)
(F : ProjectiveExtensionFiberModel L.g₂ L.g₃)
(hP_action : ∀ (u : ℂ) (e : GraphQuotientExtension L.lattice η),
P (e + extensionInclusion L.lattice η u) = F.action u (P e))
(hflow :
(∀ z : ℂ, S 0 z ≠ 0 →
HasDerivAt (fun w => S 1 w / S 0 w) (S 2 z / S 0 z) z ∧
HasDerivAt (fun w => S 2 w / S 0 w) (6 * (S 1 z / S 0 z) ^ 2 - L.g₂ / 2) z ∧
HasDerivAt (fun w => S 3 w / S 0 w) (-S 1 z / S 0 z) z) ∧
(∀ z : ℂ, S 2 z ≠ 0 →
HasDerivAt (fun w => S 0 w / S 2 w)
(-6 * (S 1 z / S 2 z) ^ 2 + L.g₂ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
HasDerivAt (fun w => S 1 w / S 2 w)
(-(1 / 2 : ℂ) - L.g₂ * (S 0 z / S 2 z) * (S 1 z / S 2 z) -
3 * L.g₃ / 2 * (S 0 z / S 2 z) ^ 2) z ∧
HasDerivAt (fun w => S 4 w / S 2 w)
(-2 * L.g₂ * (S 1 z / S 2 z) ^ 2 -
3 * L.g₃ * (S 0 z / S 2 z) * (S 1 z / S 2 z)) z))
(hjets :
(∀ c : Fin 2, extensionChartDerivation L.g₂ L.g₃ c (extensionChartCubic L.g₂ L.g₃ c) = 0) ∧
∀ (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ) (n : ℕ),
((extensionChartDerivation L.g₂ L.g₃ c)^[n] p).totalDegree ≤ p.totalDegree + n ∧
∀ z : ℂ, S (extensionChartDenominator c) z ≠ 0 →
iteratedDeriv n (fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z =
MvPolynomial.eval (extensionChartCoordinates S c z)
((extensionChartDerivation L.g₂ L.g₃ c)^[n] p) ∧
((n : ℕ∞) ≤ analyticOrderAt
(fun w => MvPolynomial.eval (extensionChartCoordinates S c w) p) z ↔
∀ k < n, MvPolynomial.eval (extensionChartCoordinates S c z)
((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0))
(B : ℕ → ℕ)
(hB : Monotone B ∧ (∀ d : ℕ, 0 < B d) ∧
∀ (d : ℕ) (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ), p.totalDegree ≤ d →
∀ v : Fin 4 → ℂ,
((∀ k < B d, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0) ↔
∀ k : ℕ, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0))
(hcontact :
(∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v n ↔
∀ k < n, MvPolynomial.eval v ((extensionChartDerivation L.g₂ L.g₃ c)^[k] p) = 0) ∧
(∀ (c : Fin 2) (v : Fin 4 → ℂ) (m n : ℕ),
extensionChartContactIdeal L.g₂ L.g₃ c v m * extensionChartContactIdeal L.g₂ L.g₃ c v n ≤
extensionChartContactIdeal L.g₂ L.g₃ c v (m + n)) ∧
(∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ),
RingHom.ker (MvPolynomial.eval v) ^ n ≤ extensionChartContactIdeal L.g₂ L.g₃ c v n) ∧
(∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ), 0 < n →
(extensionChartContactIdeal L.g₂ L.g₃ c v n).radical = RingHom.ker (MvPolynomial.eval v) ∧
(extensionChartContactIdeal L.g₂ L.g₃ c v n).IsPrimary) ∧
(∀ (c : Fin 2) (v w : Fin 4 → ℂ), v ≠ w → ∀ m n : ℕ,
extensionChartContactIdeal L.g₂ L.g₃ c v m ⊔ extensionChartContactIdeal L.g₂ L.g₃ c w n = ⊤) ∧
(∀ (c : Fin 2) (v : Fin 4 → ℂ) (n : ℕ) (p : MvPolynomial (Fin 4) ℂ),
p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v (n + 1) →
extensionChartDerivation L.g₂ L.g₃ c p ∈ extensionChartContactIdeal L.g₂ L.g₃ c v n) ∧
(∀ (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ)
(p : V → MvPolynomial (Fin 4) ℂ),
∃ q : MvPolynomial (Fin 4) ℂ, ∀ v : V,
q - p v ∈ extensionChartContactIdeal L.g₂ L.g₃ c v.val (n v))) :
∃ C : ℝ, 0 < C ∧ ∀ m n U : ℕ,
1 ≤ m → 1 ≤ n → 1 ≤ U → ∀ X : Finset ℂ,
0 ∈ X → ∀ Q : MvPolynomial (Fin 7) ℂ,
(∀ d ∈ Q.support, d 0 + d 1 = m ∧
d 2 + d 3 + d 4 + d 5 + d 6 = n) →
(∀ (c : Fin 2) (z : ℂ), S (extensionChartDenominator c) z ≠ 0 →
extensionChartNormalize c Q ∉ extensionChartContactIdeal L.g₂ L.g₃ c
(extensionChartCoordinates S c z) (B (m + 2 * n))) →
(∀ (c : Fin 2) (k : ℕ),
((extensionChartDerivation L.g₂ L.g₃ c)^[k] (extensionChartNormalize c Q)).totalDegree ≤
m + 2 * n + k) →
(∀ c : Fin 2,
let Z := (X + X + X).filter (fun z => S (extensionChartDenominator c) z ≠ 0)
let V := Z.image (extensionChartCoordinates S c)
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (3 * U + 1)
extensionChartNormalize c Q ∈ I ∧
(∃ a : Fin (B (m + 2 * n)) → MvPolynomial (Fin 4) ℂ,
1 - ∑ k : Fin (B (m + 2 * n)), a k *
((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q)) ∈ I ∧
I ⊔ Ideal.span (Set.range (fun k : Fin (B (m + 2 * n)) =>
(extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))) = ⊤) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) = (3 * U + 1) * Z.card ∧
let M : Polynomial ℂ :=
∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ (3 * U + 1)
M.Monic ∧ M.degree = ((3 * U + 1) * Z.card : ℕ) ∧
∃ r : Fin 3 → Polynomial ℂ,
(∀ i, (r i).degree < ((3 * U + 1) * Z.card : ℕ)) ∧
I = Ideal.span (insert (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) M)
(Set.range (fun i : Fin 3 => MvPolynomial.X i.succ -
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i)))) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ I ↔ M ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) p) ∧
(∃ t : V → ℕ,
(∀ v : V, 3 * U + 1 ≤ t v ∧ t v < B (m + 2 * n) ∧
MvPolynomial.eval v.val
((extensionChartDerivation L.g₂ L.g₃ c)^[t v] (extensionChartNormalize c Q)) ≠ 0 ∧
∀ j < t v, MvPolynomial.eval v.val
((extensionChartDerivation L.g₂ L.g₃ c)^[j] (extensionChartNormalize c Q)) = 0) ∧
∀ s : ℕ, 0 < s →
let J := I ⊔ Ideal.span (Set.range (fun i : Fin s =>
(extensionChartDerivation L.g₂ L.g₃ c)^[i.val] (extensionChartNormalize c Q)))
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) =
∑ v : V, min (3 * U + 1) (t v + 1 - s) ∧
(J = ⊤ ↔ ∀ v : V, t v < s) ∧
(B (m + 2 * n) ≤ s → J = ⊤)) ∧
(∀ s : ℕ,
let J := I ⊔ Ideal.span (Set.range (fun i : Fin s =>
(extensionChartDerivation L.g₂ L.g₃ c)^[i.val] (extensionChartNormalize c Q)))
(0 < s → J = ⊤ → ∃ a : ℕ, a ≤ V.card * (s - 1) ∧
let q := ∑ j : Fin s, MvPolynomial.C ((a : ℂ) ^ j.val) *
((extensionChartDerivation L.g₂ L.g₃ c)^[j.val] (extensionChartNormalize c Q))
(∀ v : V, MvPolynomial.eval v.val q ≠ 0) ∧
q.totalDegree ≤ m + 2 * n + (s - 1) ∧
∃ b : Polynomial ℂ,
b.degree < (M.natDegree : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) b).totalDegree ≤
M.natDegree - 1 ∧
1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q ∈ I ∧
(1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b * q).totalDegree ≤
M.natDegree - 1 + q.totalDegree ∧
(∀ b' : Polynomial ℂ, b'.degree < (M.natDegree : ℕ) →
1 - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b' * q ∈ I → b' = b) ∧
(∀ f : MvPolynomial (Fin 4) ℂ, f * q ∈ I ↔ f ∈ I) ∧
I ⊔ Ideal.span {q} = ⊤ ∧
∃ T : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ,
T p = (MvPolynomial.aeval (Fin.cons Polynomial.X r)
(p * Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b)) %ₘ M ∧
(T p).degree < (M.natDegree : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (T p)).totalDegree ≤
M.natDegree - 1 ∧
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q ∈ I ∧
(p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T p) * q).totalDegree ≤
max p.totalDegree (M.natDegree - 1 + q.totalDegree) ∧
(∀ b' : Polynomial ℂ, b'.degree < (M.natDegree : ℕ) →
(p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) b' * q ∈ I ↔ b' = T p))) ∧
(∀ p : MvPolynomial (Fin 4) ℂ, T p = 0 ↔ p ∈ I) ∧
(∀ T' : MvPolynomial (Fin 4) ℂ →ₗ[ℂ] Polynomial ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ, (T' p).degree < (M.natDegree : ℕ) ∧
p - Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (T' p) * q ∈ I) → T' = T) ∧
∃ β : Module.Basis (Fin M.natDegree) ℂ (MvPolynomial (Fin 4) ℂ ⧸ I),
(∀ i : Fin M.natDegree,
β i = Ideal.Quotient.mk I ((MvPolynomial.X (0 : Fin 4)) ^ i.val * q) ∧
((MvPolynomial.X (0 : Fin 4)) ^ i.val * q).totalDegree ≤
M.natDegree - 1 + q.totalDegree) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (i : Fin M.natDegree),
β.repr (Ideal.Quotient.mk I p) i = (T p).coeff i.val) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
Ideal.Quotient.mk I p = ∑ i : Fin M.natDegree,
(T p).coeff i.val • Ideal.Quotient.mk I
((MvPolynomial.X (0 : Fin 4)) ^ i.val * q)) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) = M.natDegree ∧
∃ ρ : MvPolynomial (Fin 4) ℂ →ₐ[ℂ]
Matrix (Fin M.natDegree) (Fin M.natDegree) ℂ,
(∀ p : MvPolynomial (Fin 4) ℂ,
ρ p = Algebra.leftMulMatrix β (Ideal.Quotient.mk I p)) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (i j : Fin M.natDegree),
ρ p i j = ((MvPolynomial.aeval (Fin.cons Polynomial.X r) p *
Polynomial.X ^ j.val) %ₘ M).coeff i.val) ∧
(∀ p : MvPolynomial (Fin 4) ℂ, ρ p = 0 ↔ p ∈ I) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
ρ p = Polynomial.aeval (ρ (MvPolynomial.X (0 : Fin 4)))
(MvPolynomial.aeval (Fin.cons Polynomial.X r) p)) ∧
(ρ (MvPolynomial.X (0 : Fin 4))).charpoly = M ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).det = ∏ v : V,
(MvPolynomial.eval v.val p) ^ (3 * U + 1)) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
IsUnit (ρ p) ↔ ∀ v : V, 0 < 3 * U + 1 →
MvPolynomial.eval v.val p ≠ 0) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).charpoly = ∏ v : V,
(Polynomial.X - Polynomial.C (MvPolynomial.eval v.val p)) ^
(3 * U + 1)) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(ρ p).trace = ∑ v : V,
((3 * U + 1 : ℕ) : ℂ) * MvPolynomial.eval v.val p) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (z : ℂ),
z ∈ spectrum ℂ (ρ p) ↔ ∃ v : V,
0 < 3 * U + 1 ∧ z = MvPolynomial.eval v.val p) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
IsNilpotent (ρ p) ↔ ∀ v : V, 0 < 3 * U + 1 →
MvPolynomial.eval v.val p = 0) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
(∀ v : V, 0 < 3 * U + 1 → MvPolynomial.eval v.val p = 0) →
(ρ p) ^ M.natDegree = 0) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ I.colon {p}) ≃ₗ[ℂ]
LinearMap.range (ρ p).mulVecLin) ∧
(ρ p).rank = Module.finrank ℂ
(MvPolynomial (Fin 4) ℂ ⧸ I.colon {p}) ∧
Module.finrank ℂ (LinearMap.ker (ρ p).mulVecLin) =
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸
(I ⊔ Ideal.span {p})) ∧
(ρ p).rank + Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸
(I ⊔ Ideal.span {p})) = M.natDegree) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
IsCompl (LinearMap.ker ((ρ p) ^ M.natDegree).mulVecLin)
(LinearMap.range ((ρ p) ^ M.natDegree).mulVecLin) ∧
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ I) ≃ₗ[ℂ]
(LinearMap.ker ((ρ p) ^ M.natDegree).mulVecLin) ×
(LinearMap.range ((ρ p) ^ M.natDegree).mulVecLin)) ∧
∀ N : ℕ, M.natDegree ≤ N →
LinearMap.ker ((ρ p) ^ N).mulVecLin =
LinearMap.ker ((ρ p) ^ M.natDegree).mulVecLin ∧
LinearMap.range ((ρ p) ^ N).mulVecLin =
LinearMap.range ((ρ p) ^ M.natDegree).mulVecLin ∧
I.colon {p ^ N} = I.colon {p ^ M.natDegree}) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
let K := I ⊔ Ideal.span {p ^ M.natDegree}
let R := I.colon {p ^ M.natDegree}
K ⊔ R = ⊤ ∧ K ⊓ R = I ∧ K * R = I ∧
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ I) ≃ₐ[ℂ]
(MvPolynomial (Fin 4) ℂ ⧸ K) ×
(MvPolynomial (Fin 4) ℂ ⧸ R)) ∧
(Ideal.Quotient.mk K p) ^ M.natDegree = 0 ∧
IsUnit (Ideal.Quotient.mk R p) ∧
∃ e : MvPolynomial (Fin 4) ℂ,
e ∈ K ∧ 1 - e ∈ R ∧ e * e - e ∈ I ∧
K = I ⊔ Ideal.span {e} ∧ R = I ⊔ Ideal.span {1 - e}) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
∃! b : MvPolynomial (Fin 4) ℂ ⧸ I,
Ideal.Quotient.mk I p * b * b = b ∧
(Ideal.Quotient.mk I p) ^ (M.natDegree + 1) * b =
(Ideal.Quotient.mk I p) ^ M.natDegree ∧
(let a := Ideal.Quotient.mk I p
let f := Algebra.lmul ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) a
let E := Algebra.lmul ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) (a * b)
IsIdempotentElem (a * b) ∧ IsIdempotentElem E ∧
LinearMap.ker E = LinearMap.ker (f ^ M.natDegree) ∧
LinearMap.range E = LinearMap.range (f ^ M.natDegree) ∧
∃ h : IsCompl (LinearMap.range (f ^ M.natDegree))
(LinearMap.ker (f ^ M.natDegree)),
E = (LinearMap.range (f ^ M.natDegree)).projection
(LinearMap.ker (f ^ M.natDegree)) h)) ∧
(∃! G : MvPolynomial (Fin 4) ℂ →*₀
(MvPolynomial (Fin 4) ℂ ⧸ I),
∀ p : MvPolynomial (Fin 4) ℂ,
Ideal.Quotient.mk I p * G p * G p = G p ∧
(Ideal.Quotient.mk I p) ^ (M.natDegree + 1) * G p =
(Ideal.Quotient.mk I p) ^ M.natDegree ∧
(G p = 0 ↔ p ∈ I.radical) ∧
(IsUnit (Ideal.Quotient.mk I p) ↔
Ideal.Quotient.mk I p * G p = 1) ∧
∀ r : MvPolynomial (Fin 4) ℂ,
Ideal.Quotient.mk I r = G p →
(∀ v : V,
MvPolynomial.eval v.val r = (MvPolynomial.eval v.val p)⁻¹ ∧
MvPolynomial.eval v.val (p * r) =
if MvPolynomial.eval v.val p = 0 then 0 else 1) ∧
(ρ (p * r)).rank = (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p ≠ 0)).card ∧
Module.finrank ℂ (LinearMap.ker (ρ (p * r)).mulVecLin) =
M.natDegree - (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p ≠ 0)).card) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (N : ℕ), M.natDegree ≤ N →
((ρ p) ^ N).rank = (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p ≠ 0)).card ∧
Module.finrank ℂ (LinearMap.ker ((ρ p) ^ N).mulVecLin) =
M.natDegree - (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p ≠ 0)).card) ∧
(∀ (p : MvPolynomial (Fin 4) ℂ) (z : ℂ),
Module.finrank ℂ
(Module.End.maxGenEigenspace (ρ p).mulVecLin z) =
(3 * U + 1) * (Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z)).card ∧
∀ N : ℕ, M.natDegree ≤ N →
Module.finrank ℂ
(Module.End.genEigenspace (ρ p).mulVecLin z N) =
(3 * U + 1) * (Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z)).card) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
let W := Finset.univ.image (fun v : V => MvPolynomial.eval v.val p)
DirectSum.IsInternal (fun z : W =>
Module.End.maxGenEigenspace (ρ p).mulVecLin z.val) ∧
∃ e : (∀ z : W,
Module.End.maxGenEigenspace (ρ p).mulVecLin z.val) ≃ₗ[ℂ]
(Fin M.natDegree → ℂ),
(∀ x, e x = ∑ z : W, (x z : Fin M.natDegree → ℂ)) ∧
∃ Pr : W → Module.End ℂ (Fin M.natDegree → ℂ),
(∀ z x, Pr z x = (e.symm x z : Fin M.natDegree → ℂ)) ∧
(∀ z, IsIdempotentElem (Pr z)) ∧
(∀ z w, z ≠ w → Pr z * Pr w = 0) ∧
(∑ z, Pr z) = 1 ∧
(∀ z, LinearMap.range (Pr z) =
Module.End.maxGenEigenspace (ρ p).mulVecLin z.val) ∧
(∀ (q : MvPolynomial (Fin 4) ℂ) (z : W),
Commute (Pr z) (ρ q).mulVecLin) ∧
∃ ε : W → MvPolynomial (Fin 4) ℂ ⧸ I,
(∀ z, (Algebra.leftMulMatrix β (ε z)).mulVecLin = Pr z) ∧
(∀ z, ε z = β.equivFun.symm (Pr z (β.equivFun 1))) ∧
(∀ z, IsIdempotentElem (ε z)) ∧
(∀ z w, z ≠ w → ε z * ε w = 0) ∧
(∑ z, ε z) = 1 ∧
(∀ z (a : MvPolynomial (Fin 4) ℂ ⧸ I),
a ∈ Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)) ↔ ε z * a = 0) ∧
∃ Φ : (MvPolynomial (Fin 4) ℂ ⧸ I) ≃ₐ[ℂ]
(∀ z : W, (MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
(∀ a z, Φ a z =
Ideal.Quotient.mk (Ideal.span {1 - ε z}) a) ∧
(∀ z w, Φ (ε w) z = if z = w then 1 else 0) ∧
∀ z : W, ∃ ψ : ((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))) ≃ₗ[ℂ]
Module.End.maxGenEigenspace (ρ p).mulVecLin z.val,
(∀ a : MvPolynomial (Fin 4) ℂ ⧸ I,
(ψ (Ideal.Quotient.mk (Ideal.span {1 - ε z}) a) : Fin M.natDegree → ℂ) =
β.equivFun (ε z * a)) ∧
Module.finrank ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))) =
(3 * U + 1) * (Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z.val)).card ∧
(Ideal.Quotient.mk
(Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))
(Ideal.Quotient.mk I (p - MvPolynomial.C z.val))) ^
M.natDegree = 0 ∧
(∀ N : ℕ, (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z.val)).card ≤ N →
(Ideal.Quotient.mk
(Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))
(Ideal.Quotient.mk I (p - MvPolynomial.C z.val))) ^ N = 0) ∧
(∀ w : ℂ, w ≠ z.val →
let π := (Ideal.Quotient.mk
(Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))).comp
(Ideal.Quotient.mk I)
let d := (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z.val)).card
let b := π (MvPolynomial.C ((z.val - w)⁻¹)) *
∑ k ∈ Finset.range d,
(-(π (MvPolynomial.C ((z.val - w)⁻¹)) *
π (p - MvPolynomial.C z.val))) ^ k
π (p - MvPolynomial.C w) * b = 1 ∧
b * π (p - MvPolynomial.C w) = 1 ∧
IsUnit (π (p - MvPolynomial.C w))) ∧
(∀ q : Polynomial ℂ,
let π := (Ideal.Quotient.mk
(Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))).comp
(Ideal.Quotient.mk I)
let d := (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z.val)).card
(q.eval₂ (π.comp MvPolynomial.C) (π p) -
π (MvPolynomial.C (q.eval z.val))) ^ d = 0 ∧
(IsUnit (q.eval₂ (π.comp MvPolynomial.C) (π p)) ↔
q.eval z.val ≠ 0) ∧
(IsNilpotent (q.eval₂ (π.comp MvPolynomial.C) (π p)) ↔
q.eval z.val = 0) ∧
(q ≠ 0 →
∃ u : ((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))ˣ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
(π p - π (MvPolynomial.C z.val)) ^ q.rootMultiplicity z.val * ↑u ∧
(∀ k : ℕ,
(q.eval₂ (π.comp MvPolynomial.C) (π p)) ^ k = 0 ↔
(π p - π (MvPolynomial.C z.val)) ^
(q.rootMultiplicity z.val * k) = 0) ∧
∀ k : ℕ, d ≤ q.rootMultiplicity z.val * k →
(q.eval₂ (π.comp MvPolynomial.C) (π p)) ^ k = 0)) ∧
let π := (Ideal.Quotient.mk
(Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))).comp
(Ideal.Quotient.mk I)
let d := (3 * U + 1) *
(Finset.univ.filter (fun v : V =>
MvPolynomial.eval v.val p = z.val)).card
let n := nilpotencyClass (π p - π (MvPolynomial.C z.val))
n ≤ d ∧
(∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) = 0 ↔
(Polynomial.X - Polynomial.C z.val) ^ n ∣ q) ∧
RingHom.ker (Polynomial.eval₂RingHom (π.comp MvPolynomial.C) (π p)) =
Ideal.span ({(Polynomial.X - Polynomial.C z.val) ^ n} : Set (Polynomial ℂ)) ∧
(∀ q : Polynomial ℂ,
let r := q %ₘ ((Polynomial.X - Polynomial.C z.val) ^ n)
r.degree < (n : WithBot ℕ) ∧
r.eval₂ (π.comp MvPolynomial.C) (π p) =
q.eval₂ (π.comp MvPolynomial.C) (π p) ∧
∀ s : Polynomial ℂ, s.degree < (n : WithBot ℕ) →
s.eval₂ (π.comp MvPolynomial.C) (π p) =
q.eval₂ (π.comp MvPolynomial.C) (π p) → s = r) ∧
(∀ q r : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
r.eval₂ (π.comp MvPolynomial.C) (π p) ↔
q %ₘ ((Polynomial.X - Polynomial.C z.val) ^ n) =
r %ₘ ((Polynomial.X - Polynomial.C z.val) ^ n)) ∧
(∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
∑ i ∈ Finset.range n,
π (MvPolynomial.C ((Polynomial.hasseDeriv i q).eval z.val)) *
(π p - π (MvPolynomial.C z.val)) ^ i) ∧
(∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) = 0 ↔
∀ i < n, (Polynomial.hasseDeriv i q).eval z.val = 0) ∧
(∀ q r : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
r.eval₂ (π.comp MvPolynomial.C) (π p) ↔
∀ i < n, (Polynomial.hasseDeriv i q).eval z.val =
(Polynomial.hasseDeriv i r).eval z.val) ∧
(∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
∑ i ∈ Finset.range n,
π (MvPolynomial.C (((Polynomial.derivative^[i]) q).eval z.val /
(i.factorial : ℂ))) *
(π p - π (MvPolynomial.C z.val)) ^ i) ∧
(∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) = 0 ↔
∀ i < n, ((Polynomial.derivative^[i]) q).eval z.val = 0) ∧
(∀ q r : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) =
r.eval₂ (π.comp MvPolynomial.C) (π p) ↔
∀ i < n, ((Polynomial.derivative^[i]) q).eval z.val =
((Polynomial.derivative^[i]) r).eval z.val) ∧
(∀ q : Polynomial ℂ, q ≠ 0 →
(∀ k : ℕ,
(q.eval₂ (π.comp MvPolynomial.C) (π p)) ^ k = 0 ↔
n ≤ q.rootMultiplicity z.val * k) ∧
(0 < q.rootMultiplicity z.val →
IsNilpotent (q.eval₂ (π.comp MvPolynomial.C) (π p)) ∧
nilpotencyClass (q.eval₂ (π.comp MvPolynomial.C) (π p)) =
(n + q.rootMultiplicity z.val - 1) /
q.rootMultiplicity z.val)) ∧
(minpoly ℂ (π p) = (Polynomial.X - Polynomial.C z.val) ^ n ∧
(∃ b : PowerBasis ℂ (Algebra.adjoin ℂ ({π p} : Set _)),
(b.gen : ((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))) = π p ∧
b.dim = n) ∧
FiniteDimensional ℂ (Algebra.adjoin ℂ ({π p} : Set _)) ∧
Module.finrank ℂ (Algebra.adjoin ℂ ({π p} : Set _)) = n ∧
LinearIndependent ℂ (fun i : Fin n => (π p) ^ (i : ℕ))) ∧
(∃! e : (Polynomial ℂ ⧸
Ideal.span {(Polynomial.X - Polynomial.C z.val) ^ n}) ≃ₐ[ℂ]
Algebra.adjoin ℂ ({π p} : Set _),
∀ q : Polynomial ℂ,
(e (Ideal.Quotient.mk
(Ideal.span {(Polynomial.X - Polynomial.C z.val) ^ n}) q) :
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))) =
q.eval₂ (π.comp MvPolynomial.C) (π p)) ∧
((n = d ↔ Algebra.adjoin ℂ ({π p} : Set _) = ⊤) ∧
(n = d ↔ Function.Surjective
(fun q : Polynomial ℂ => q.eval₂ (π.comp MvPolynomial.C) (π p))) ∧
(n < d ↔ ∃ y : ((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
∀ q : Polynomial ℂ,
q.eval₂ (π.comp MvPolynomial.C) (π p) ≠ y)) ∧
(∀ y : ((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
Function.Surjective (fun q : Polynomial ℂ =>
q.eval₂ (π.comp MvPolynomial.C) (π p) * y) ↔
n = d ∧ IsUnit y) ∧
(n = d → ∀ T : Module.End ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
(∀ a, T (π p * a) = π p * T a) ↔
∃! b, T = Algebra.lmul ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))) b) ∧
(n = d → ∀ T : Module.End ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
((∀ a, T (π p * a) = π p * T a) ∧ Function.Bijective T) ↔
∃! u : (((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))ˣ),
T = Algebra.lmul ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))) ↑u) ∧
(n = d → ∀ T : Module.End ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
(∀ a, T (π p * a) = π p * T a) ↔
∃! q : Polynomial ℂ, q.degree < (n : WithBot ℕ) ∧
T = Algebra.lmul ℂ
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I)))
(q.eval₂ (π.comp MvPolynomial.C) (π p))) ∧
∃ f : (Polynomial ℂ ⧸
Ideal.span {(Polynomial.X - Polynomial.C z.val) ^ n}) →+*
((MvPolynomial (Fin 4) ℂ ⧸ I) ⧸
Ideal.span ({1 - ε z} : Set (MvPolynomial (Fin 4) ℂ ⧸ I))),
Function.Injective f ∧ ∀ q : Polynomial ℂ,
f (Ideal.Quotient.mk
(Ideal.span {(Polynomial.X - Polynomial.C z.val) ^ n}) q) =
q.eval₂ (π.comp MvPolynomial.C) (π p))) ∧
(let R := I.colon (J : Set (MvPolynomial (Fin 4) ℂ))
I ≤ R ∧
I.colon (R : Set (MvPolynomial (Fin 4) ℂ)) = J ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) +
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = M.natDegree ∧
(∀ K : Ideal (MvPolynomial (Fin 4) ℂ), I ≤ K →
(J ≤ K ↔ I.colon (K : Set (MvPolynomial (Fin 4) ℂ)) ≤ R))) ∧
(let p : ℕ → MvPolynomial (Fin 4) ℂ := fun j =>
(extensionChartDerivation L.g₂ L.g₃ c)^[j] (extensionChartNormalize c Q)
let T := (Finset.range s).filter (fun j =>
p j ∉ (I ⊔ Ideal.span (Set.range (fun i : Fin j => p i.val))))
J = I ⊔ Ideal.span (p '' (T : Set ℕ)) ∧
T.card + Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ M.natDegree ∧
(J = ⊤ → ∃ b : T → Polynomial ℂ,
(∀ j : T, (b j).degree < (M.natDegree : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (b j)).totalDegree ≤
M.natDegree - 1) ∧
1 - ∑ j : T,
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * p j.val ∈ I ∧
∀ D : ℕ, (∀ j : T, (p j.val).totalDegree ≤ D) →
(1 - ∑ j : T,
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b j) * p j.val).totalDegree ≤
M.natDegree - 1 + D)) ∧
(∃ g : Polynomial ℂ,
g.Monic ∧ g ∣ M ∧ g.natDegree ≤ M.natDegree ∧
g = Nat.rec M (fun j h => gcd h
(MvPolynomial.aeval (Fin.cons Polynomial.X r)
((extensionChartDerivation L.g₂ L.g₃ c)^[j]
(extensionChartNormalize c Q)))) s ∧
J = I ⊔ Ideal.span {Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g} ∧
(let f : Fin 4 → MvPolynomial (Fin 4) ℂ :=
Fin.cons (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g)
(fun i : Fin 3 => MvPolynomial.X i.succ -
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (r i))
J = Ideal.span (Set.range f) ∧
(∀ i : Fin 4, (f i).totalDegree ≤ max 1 M.natDegree) ∧
(∀ (k : ℕ) (i : Fin (k + 1) × Fin 4),
((extensionChartDerivation L.g₂ L.g₃ c)^[i.1.val] (f i.2)).totalDegree ≤
max 1 M.natDegree + k)) ∧
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ J ↔ g ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = g.natDegree ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
let h := gcd g (MvPolynomial.aeval (Fin.cons Polynomial.X r) p)
let K := J ⊔ Ideal.span {p}
h.Monic ∧ h ∣ g ∧
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ K ↔ h ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) = h.natDegree ∧
h.natDegree ≤ g.natDegree ∧
(h = g ↔ p ∈ J) ∧
(h.natDegree < g.natDegree ↔ p ∉ J) ∧
(Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) <
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ↔ p ∉ J) ∧
(∀ q : Polynomial ℂ, q.Monic →
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ K ↔ q ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) → q = h)) ∧
(let δ := extensionChartDerivation L.g₂ L.g₃ c
let p := Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g
(∀ k : ℕ, δ^[k] p = Polynomial.aeval (MvPolynomial.X (0 : Fin 4))
(Polynomial.derivative^[k] g)) ∧
δ^[g.natDegree] p = algebraMap ℂ (MvPolynomial (Fin 4) ℂ)
(g.natDegree.factorial : ℂ) ∧
(g.natDegree.factorial : ℂ)⁻¹ • δ^[g.natDegree] p = 1 ∧
(∀ k : ℕ, g.natDegree < k → δ^[k] p = 0) ∧
(∀ k : ℕ, Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ k →
Ideal.span (Set.range (fun i : Fin (k + 1) => δ^[i.val] p)) = ⊤)) ∧
(∀ e : V → ℕ,
J = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (e v)) →
g = (∏ v : V, (Polynomial.X - Polynomial.C (v.val 0)) ^ e v) ∧
∀ z : ℂ, g.eval z = 0 ↔ ∃ v : V, 0 < e v ∧ z = v.val 0) ∧
(∀ h : Polynomial ℂ, h.Monic →
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ J ↔ h ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) → h = g)) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
(J ≠ ⊤ → ∃ p : MvPolynomial (Fin 4) ℂ,
p ∈ J ∧ extensionChartDerivation L.g₂ L.g₃ c p ∉ J) ∧
(J ≠ ⊤ → ∃ g : Polynomial ℂ,
g.Monic ∧ 0 < g.natDegree ∧
g.natDegree ≤ Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
(∀ q : Polynomial ℂ, Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) q ∈ J ↔ g ∣ q) ∧
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g ∈ J ∧
extensionChartDerivation L.g₂ L.g₃ c (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g) =
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g.derivative ∧
g.derivative.natDegree < g.natDegree ∧
extensionChartDerivation L.g₂ L.g₃ c (Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) g) ∉ J) ∧
∃ e : V → ℕ,
(∀ v : V, e v ≤ 3 * U + 1 ∧ ∀ k ≤ 3 * U + 1,
k ≤ e v ↔ ∀ i : Fin s, ∀ j < k,
MvPolynomial.eval v.val
((extensionChartDerivation L.g₂ L.g₃ c)^[j + i.val]
(extensionChartNormalize c Q)) = 0) ∧
J = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (e v)) ∧
(∀ (r₀ : ℕ) (f : Fin r₀ → MvPolynomial (Fin 4) ℂ),
J = Ideal.span (Set.range f) → ∀ k : ℕ,
let K := Ideal.span (Set.range (fun i : Fin (k + 1) × Fin r₀ =>
(extensionChartDerivation L.g₂ L.g₃ c)^[i.1.val] (f i.2)))
K = J ⊔ Ideal.span ((extensionChartDerivation L.g₂ L.g₃ c)^[k] ''
(J : Set (MvPolynomial (Fin 4) ℂ))) ∧
K = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (e v - k)) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) = ∑ v : V, (e v - k) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ K ↔ ∃ q : MvPolynomial (Fin 4) ℂ, q ∈ J ∧
p - (extensionChartDerivation L.g₂ L.g₃ c)^[k] q ∈ J) ∧
(K = ⊤ ↔ ∀ v : V, e v ≤ k) ∧
(let K' := Ideal.span (Set.range
(fun i : Fin (k + 1 + 1) × Fin r₀ =>
(extensionChartDerivation L.g₂ L.g₃ c)^[i.1.val] (f i.2)))
K ≤ K' ∧
(K = K' ↔ K = ⊤) ∧
(K < K' ↔ ∃ v : V, k < e v) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) =
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K') +
(Finset.univ.filter (fun v : V => k < e v)).card)) ∧
(∀ k : ℕ,
let K := J ⊔ Ideal.span ((extensionChartDerivation L.g₂ L.g₃ c)^[k] ''
(J : Set (MvPolynomial (Fin 4) ℂ)))
K = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (e v - k)) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) = ∑ v : V, (e v - k) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
p ∈ K ↔ ∃ q : MvPolynomial (Fin 4) ℂ, q ∈ J ∧
p - (extensionChartDerivation L.g₂ L.g₃ c)^[k] q ∈ J) ∧
(K = ⊤ ↔ ∀ v : V, e v ≤ k)) ∧
(∀ f : V → ℕ,
let K : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (f v)
(J ≤ K ↔ ∀ v : V, f v ≤ e v) ∧
(J = K ↔ e = f) ∧
(J < K ↔ (∀ v : V, f v ≤ e v) ∧ ∃ v : V, f v < e v)) ∧
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ J) ≃ₐ[ℂ]
((v : V) → Polynomial ℂ ⧸
Ideal.span {(Polynomial.X - Polynomial.C (v.val 0)) ^ e v})) ∧
J.radical = (⨅ v : V, if e v = 0 then ⊤ else RingHom.ker (MvPolynomial.eval v.val)) ∧
(∀ P' : Ideal (MvPolynomial (Fin 4) ℂ), P'.IsPrime →
(J ≤ P' ↔ ∃! v : V, 0 < e v ∧ P' = RingHom.ker (MvPolynomial.eval v.val))) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e v ∧
I.colon (J : Set (MvPolynomial (Fin 4) ℂ)) =
(⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (3 * U + 1 - e v)) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸
I.colon (J : Set (MvPolynomial (Fin 4) ℂ))) =
∑ v : V, (3 * U + 1 - e v) ∧
(let R := I.colon (J : Set (MvPolynomial (Fin 4) ℂ))
J ⊔ R = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val
(min (e v) (3 * U + 1 - e v))) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J ⊔ R) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J ⊔ R) =
∑ v : V, min (e v) (3 * U + 1 - e v) ∧
(J ⊔ R = ⊤ ↔ ∀ v : V, e v = 0 ∨ e v = 3 * U + 1) ∧
((∀ v : V, e v = 0 ∨ e v = 3 * U + 1) →
J ⊓ R = I ∧ J * R = I ∧
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ I) ≃ₐ[ℂ]
(MvPolynomial (Fin 4) ℂ ⧸ J) × (MvPolynomial (Fin 4) ℂ ⧸ R)) ∧
∃ p : MvPolynomial (Fin 4) ℂ,
p ∈ J ∧ 1 - p ∈ R ∧ p * p - p ∈ I ∧
J = I ⊔ Ideal.span {p} ∧ R = I ⊔ Ideal.span {1 - p}) ∧
(let K := J ⊓ R
I ≤ K ∧ K ^ 2 ≤ I ∧
K = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val
(max (e v) (3 * U + 1 - e v))) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) =
∑ v : V, max (e v) (3 * U + 1 - e v) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) +
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J ⊔ R) =
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I) ∧
(K = I ↔ J ⊔ R = ⊤))) ∧
(∀ p : MvPolynomial (Fin 4) ℂ,
let K := J.colon {p ^ (3 * U + 1)}
let e' : V → ℕ := fun v => if MvPolynomial.eval v.val p = 0 then 0 else e v
K = (⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (e' v)) ∧
(∀ q : MvPolynomial (Fin 4) ℂ, (∃ r : ℕ, q * p ^ r ∈ J) ↔ q ∈ K) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ K) = ∑ v : V, e' v)) ∧
(∃ b : Fin (B (m + 2 * n)) → Polynomial ℂ,
(∀ k : Fin (B (m + 2 * n)),
(b k).degree < ((3 * U + 1) * Z.card : ℕ) ∧
(Polynomial.aeval (MvPolynomial.X (R := ℂ) (0 : Fin 4)) (b k)).totalDegree ≤
(3 * U + 1) * Z.card - 1) ∧
(1 - ∑ k : Fin (B (m + 2 * n)),
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b k) *
((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))) ∈ I ∧
(1 - ∑ k : Fin (B (m + 2 * n)),
Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) (b k) *
((extensionChartDerivation L.g₂ L.g₃ c)^[k.val] (extensionChartNormalize c Q))).totalDegree ≤
((3 * U + 1) * Z.card - 1) + (m + 2 * n + (B (m + 2 * n) - 1))) ∧
∀ p : MvPolynomial (Fin 4) ℂ,
let q := MvPolynomial.aeval (Fin.cons Polynomial.X r) p
let J := I ⊔ Ideal.span {p}
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ J) ≃ₐ[ℂ]
(Polynomial ℂ ⧸ Ideal.span {gcd M q})) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = (gcd M q).natDegree ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ M.natDegree ∧
(q ≠ 0 → Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) ≤ q.natDegree) ∧
(let R := I.colon {p}
let G := M / gcd M q
(∀ f : MvPolynomial (Fin 4) ℂ,
f ∈ R ↔ G ∣ MvPolynomial.aeval (Fin.cons Polynomial.X r) f) ∧
Nonempty ((MvPolynomial (Fin 4) ℂ ⧸ R) ≃ₐ[ℂ]
(Polynomial ℂ ⧸ Ideal.span {G})) ∧
FiniteDimensional ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) = G.natDegree ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ R) +
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = M.natDegree ∧
I.colon (R : Set (MvPolynomial (Fin 4) ℂ)) = J ∧
I.colon (J : Set (MvPolynomial (Fin 4) ℂ)) = R) ∧
∃ e : V → ℕ,
(∀ v : V, e v ≤ 3 * U + 1 ∧ ∀ k ≤ 3 * U + 1,
k ≤ e v ↔ ∀ j < k,
MvPolynomial.eval v.val
((extensionChartDerivation L.g₂ L.g₃ c)^[j] p) = 0) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ J) = ∑ v : V, e v ∧
I.colon {p} =
(⨅ v : V, extensionChartContactIdeal L.g₂ L.g₃ c v.val (3 * U + 1 - e v)) ∧
Module.finrank ℂ (MvPolynomial (Fin 4) ℂ ⧸ I.colon {p}) =
∑ v : V, (3 * U + 1 - e v)) →
∃ H : Submodule ℤ (GraphExtensionGroup L.lattice η), ∃ a b : ℕ,
((a = 1 ∧ H ≤ LinearMap.ker (extensionAdditiveProjection L.lattice η)) ∨
(a = 0 ∧ H ≤ LinearMap.ker (extensionEllipticProjection L.lattice η))) ∧
b ≤ 2 ∧
((U + 1 : ℕ) : ℝ) *
(H.mkQ '' (extensionCurve L.lattice η '' (X : Set ℂ))).ncard ≤
C * (m : ℝ) ^ a * (n : ℝ) ^ b := by sorry