Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Contact ideals and analytic vanishing order

Proved
WeierstrassEllipticZeta.frontier_contact_order

by tomasz · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

complex-analysiselliptic-curves

Fix the elliptic-extension geometry with its compatible jet and contact-ideal identities. Let ccc be a chart, let ppp be any polynomial in its four affine coordinates, and let zzz be a point with nonzero chart denominator. For every integer k≥0k\ge0k≥0, write f(w)=p(coords⁡c(w))f(w)=p(\operatorname{coords}_c(w))f(w)=p(coordsc​(w)). Then

p∈Ic(z,k)  ⟺  k≤ord⁡z(f),p∉Ic(z,k)  ⟺  ord⁡z(f)<k.p\in I_c(z,k)\iff k\le\operatorname{ord}_z(f),\qquad p\notin I_c(z,k)\iff\operatorname{ord}_z(f)<k.p∈Ic​(z,k)⟺k≤ordz​(f),p∈/Ic​(z,k)⟺ordz​(f)<k.

The order takes values in the extended natural numbers, so the equivalences include the identically vanishing germ and k=0k=0k=0. This converts the algebraic contact condition into the analytic hypothesis used by the multiplicity estimate.

Preamble
import Definitions.Def_WeierstrassEllipticZeta_InterfaceGeometry

open WeierstrassEllipticZeta
Formal statement
theorem WeierstrassEllipticZeta.frontier_contact_order
    (G : Frontier.Geometry) (c : Fin 2) (p : MvPolynomial (Fin 4) ℂ)
    (z : ℂ) (hz : G.S (extensionChartDenominator c) z ≠ 0) (k : ℕ) :
    (p ∈ extensionChartContactIdeal G.L.g₂ G.L.g₃ c
        (extensionChartCoordinates G.S c z) k ↔
      (k : ℕ∞) ≤ analyticOrderAt
        (fun w => MvPolynomial.eval (extensionChartCoordinates G.S c w) p) z) ∧
    (p ∉ extensionChartContactIdeal G.L.g₂ G.L.g₃ c
        (extensionChartCoordinates G.S c z) k ↔
      analyticOrderAt
        (fun w => MvPolynomial.eval (extensionChartCoordinates G.S c w) p) z < k) := by sorry
Source
Derived equivalence in the differential-ideal approach of Senthil Kumar K (2026), Appendix A and A.2, https://doi.org/10.1017/S001309152610145X. Uses the previously established chart jet-order and contact-ideal membership identities, now projected from the geometry interface.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me