Derivative ideals and persistent minimal-prime chart data
DefinitionWeierstrassEllipticZeta_ChartProlongationDataThis definition package supplies the derivative ideal
for an arbitrary derivation on a commutative algebra, and the associated data for a persistent minimal prime in a Weierstrass chart. The complete theorem separately proves , composition of these operations, and the contact interpretation of prime persistence.
Fix as in the chart-prime frontier. ChartProlongationMultiplicityData L S Q T e supplies:
- A chart index and a point at which its denominator is nonzero.
- A base ideal in and a natural stage ; the derivative ideals use the fixed chart derivation .
- A prime which is minimal over both and .
- Membership for the normalized chart polynomial, and vanishing for every .
- A localized length bound .
Differential contact on is a consequence of persistence, not a field of this structure. The datum includes no claim that an appropriate base ideal or persistent prime exists.
Formalization Note. A checked local converse recovers these data from any previous ChartPrimeMultiplicityData by taking its ideal as the base and stage zero. Thus the two data conditions are equivalent at fixed , without changing the point, prime or local length. The remaining child must select suitable data and prove the uniform total degree bound.
import Definitions.Def_WeierstrassEllipticZeta_ChartPrimeMultiplicityData
noncomputable section
namespace TranscendenceTheory
/-- Adjoin all derivatives through order `n` of all elements of an ideal. -/
def differentialProlongation {K R : Type*} [CommRing K] [CommRing R] [Algebra K R]
(D : Derivation K R R) (I : Ideal R) (n : ℕ) : Ideal R :=
Ideal.span {r | ∃ f ∈ I, ∃ k ≤ n, (D^[k]) f = r}
end TranscendenceTheory
namespace WeierstrassEllipticZeta
open TranscendenceTheory
/-- A chart component that persists between two stages of derivative ideals.
Contact through `T` on the first stage follows from the two minimal-prime fields. -/
structure ChartProlongationMultiplicityData (L : PeriodPair) (S : Fin 5 → ℂ → ℂ)
(Q : MvPolynomial (Fin 7) ℂ) (T e : ℕ) where
chart : Fin 2
z : ℂ
chart_ne : S (extensionChartDenominator chart) z ≠ 0
base : Ideal (MvPolynomial (Fin 4) ℂ)
stage : ℕ
p : Ideal (MvPolynomial (Fin 4) ℂ)
[prime : p.IsPrime]
minimal_start : p ∈ (differentialProlongation
(extensionChartDerivation L.g₂ L.g₃ chart) base stage).minimalPrimes
minimal_end : p ∈ (differentialProlongation
(extensionChartDerivation L.g₂ L.g₃ chart) base (stage + T)).minimalPrimes
normalized_mem : extensionChartNormalize chart Q ∈ p
point_on_prime : ∀ r ∈ p, MvPolynomial.eval (extensionChartCoordinates S chart z) r = 0
length_le : Module.length (Localization.AtPrime p)
((Localization.AtPrime p) ⧸ (differentialProlongation
(extensionChartDerivation L.g₂ L.g₃ chart) base stage).map
(algebraMap (MvPolynomial (Fin 4) ℂ) (Localization.AtPrime p))) ≤ (e : ℕ∞)
attribute [instance] ChartProlongationMultiplicityData.prime
end WeierstrassEllipticZeta