Inclusion, equality and strict inclusion of finite contact ideals
ProvedWeierstrassEllipticZeta.finite_contact_ideal_orderby tomasz · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)
commutative-algebraelliptic-functionstranscendencezero-estimates
Let A=C[t,x1,x2,x3], choose complex parameters g2,g3,
and choose either elliptic-extension chart with its polynomial derivation
Dc. For v∈C4 and a≥0, let
Cv(a)={p∈A:(Dcjp)(v)=0 for every 0≤j<a}.
Let V⊂C4 be finite, and let m,n:V→N be
arbitrary. Set
Im=v∈V⋂Cv(mv),In=v∈V⋂Cv(nv).
Then inclusion is characterized by the reverse pointwise order:
Im⊆In⟺nv≤mv for every v∈V.
Equality determines the entire multiplicity function:
Im=In⟺m=n.
Finally,
Im⊊In⟺(∀v∈V, nv≤mv) and (∃v∈V, nv<mv).
Thus a finite contact ideal determines its orders uniquely on the fixed
finite set, and ideal comparisons are exactly numerical comparisons of
those orders.
Formalization Note The formal contact ideals are defined as spans;
the proved structure theorem identifies membership with the displayed
jet conditions. The two multiplicity functions have no positivity,
comparability or upper-bound assumption. The finite set may be empty,
orders may be zero, and distinct full affine points may have the same
time coordinate. The result concerns the stated family of contact
ideals on a fixed V.
Preamble
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveContactIdeal
import Mathlib.LinearAlgebra.FiniteDimensional.Defs
import Mathlib.RingTheory.Ideal.Colon
open WeierstrassEllipticZeta
open scoped Classical
Formal statement
theorem WeierstrassEllipticZeta.finite_contact_ideal_order (g₂ g₃ : ℂ) (c : Fin 2)
(V : Finset (Fin 4 → ℂ)) (m n : V → ℕ) :
let I : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (m v)
let J : Ideal (MvPolynomial (Fin 4) ℂ) :=
⨅ v : V, extensionChartContactIdeal g₂ g₃ c v.val (n v)
(I ≤ J ↔ ∀ v : V, n v ≤ m v) ∧
(I = J ↔ m = n) ∧
(I < J ↔ (∀ v : V, n v ≤ m v) ∧ ∃ v : V, n v < m v) := by sorry
Source
Derived contact-ideal order calculation for the differential polynomial-ring method associated with Senthil Kumar K (2026), Appendix A introductory paragraphs and Theorem A.2, https://doi.org/10.1017/S001309152610145X. This exact order characterization is proved here, not quoted from the article. Reuses the Proved finite_contact_ideal_sum and elliptic_extension_contact_quotient_dimension. Inclusion makes the ideal sum equal its larger member; comparing the minimum-order dimension formula with the dimension of that member forces every multiplicity inequality. Reverse inclusion follows from the span definition. Antisymmetry gives uniqueness, and strict inclusion is inclusion without reverse inclusion. Primary formal references: Ideal.span_mono, Submodule.mem_iInf, sup_eq_right, Finset.sum_lt_sum and lt_iff_le_not_ge.
View graph