Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree-bounded incidence relation for a generically finite rational parametrization

Proved
APSCounting893.Main.rational_incidence_relation_bounded

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryapschow-formfunction-fields

Let KKK be a field of characteristic zero and let v1,…,vm∈K(x1,…,xr)v_1,\ldots,v_m\in K(x_1,\ldots,x_r)v1​,…,vm​∈K(x1​,…,xr​) be rational functions with a common nonzero denominator QQQ. Write vi=Pi/Qv_i=P_i/Qvi​=Pi​/Q and assume that QQQ and every PiP_iPi​ have degree at most ddd, where d≥1d\ge1d≥1. Suppose that some rrr of the viv_ivi​ are algebraically independent over KKK.

There is a nonzero polynomial qqq in (r+1)(m+1)(r+1)(m+1)(r+1)(m+1) matrix coefficients such that

deg⁡q≤(r+1)dr\deg q\le(r+1)d^rdegq≤(r+1)dr

and qqq vanishes identically on the generic matrices whose free entries are BijB_{ij}Bij​ and whose pivot entries satisfy

Ai0=−∑j=1mBijvj,Aij=Bij(j>0).A_{i0}=-\sum_{j=1}^m B_{ij}v_j,\qquad A_{ij}=B_{ij}\quad(j>0).Ai0​=−j=1∑m​Bij​vj​,Aij​=Bij​(j>0).

This is a degree-bounded equation for the incidence locus of the projective closure of the rationally parametrized image. It supplies the quantitative output-projection certificate used in Proposition 3.14 of the APS argument.

Formalization Note The identity is evaluated in the fraction field of the polynomial ring in the independent free coefficients. Thus it is a polynomial identity, not an assumption about sampled coefficients.

Preamble
import Mathlib
set_option autoImplicit false
open MvPolynomial
Formal statement
theorem APSCounting893.Main.rational_incidence_relation_bounded {K : Type} [Field K] [CharZero K] {r m : ℕ}
    (Q : MvPolynomial (Fin r) K) (hQ : Q ≠ 0)
    (P : Fin m → MvPolynomial (Fin r) K)
    (v : Fin m → FractionRing (MvPolynomial (Fin r) K))
    (hP : ∀ i, algebraMap _ (FractionRing (MvPolynomial (Fin r) K)) (P i) =
      algebraMap _ (FractionRing (MvPolynomial (Fin r) K)) Q * v i)
    (g : Fin r → Fin m) (hg : AlgebraicIndependent K (v ∘ g))
    (d : ℕ) (hd : 0 < d) (hdQ : Q.totalDegree ≤ d) (hdP : ∀ i, (P i).totalDegree ≤ d) :
    ∃ q : MvPolynomial (Fin (r+1) × Fin (m+1)) K,
      q ≠ 0 ∧ q.totalDegree ≤ (r+1)*d^r ∧ (let E := FractionRing (MvPolynomial (Fin r) K)
       let S := MvPolynomial (Fin (r+1) × Fin m) E
       MvPolynomial.aeval (R := K) (S₁ := FractionRing S) (fun a : Fin (r+1) × Fin (m+1) =>
         Fin.cases (-algebraMap S (FractionRing S) (∑ j : Fin m, MvPolynomial.X (a.1,j)*MvPolynomial.C (v j)))
           (fun j => algebraMap S (FractionRing S) (MvPolynomial.X (a.1,j))) a.2) q = 0) := by sorry
Source
Jeronimo, Krick, Sabia and Sombra, The computational complexity of the Chow form, arXiv:math/0210009, Section 1.1, pp.6–7 (incidence equation and multidegree); applied to the projective image of [Q:P_1:...:P_m]. Agarwal, Hari, Pandey and Shukla, STOC 2027 submission #893, Proposition 3.14, pp.14–15. https://arxiv.org/pdf/math/0210009#page=6 ; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/893.pdf

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