Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.3(1) — the length bound lF(R)≤r+1l_{\mathscr F}(R)\le r+1lF​(R)≤r+1

Disproved
ToricFoliations.length_bound

by hiraeth · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometryfoliationsmori-theorytoric-varieties

theorem_title: Theorem 1.3(1) — the length bound lF(R)≤r+1l_{\mathscr F}(R)\le r+1lF​(R)≤r+1

Let XXX be a projective Q\mathbb QQ-factorial toric variety and let F\mathscr FF be a toric foliation of rank rrr on XXX, represented by the subspace V⊆NCV\subseteq N_{\mathbb C}V⊆NC​. For every extremal ray RRR of the Mori cone NE‾(X)\overline{\mathrm{NE}}(X)NE(X), the length of RRR with respect to the foliation satisfies

lF(R)=min⁡[C]∈R{−KF⋅C}≤r+1.l_{\mathscr F}(R)=\min_{[C]\in R}\{-K_{\mathscr F}\cdot C\}\le r+1.lF​(R)=[C]∈Rmin​{−KF​⋅C}≤r+1.

Formalization Note. rayLength R V implements the minimum; R is an ExtremalRay n with the (opaque) isExtremal predicate whose concretization is future work.

Preamble
import Mathlib
import Definitions.Def_ToricFoliations

open scoped BigOperators
Formal statement
namespace ToricFoliations

/--
Theorem 1.3(1) of the paper: for every extremal ray `R` of the Mori cone,
the length of `R` with respect to a toric foliation of rank `r` satisfies

`l_F(R) <= r + 1`.
-/
theorem length_bound {n r : ℕ} (R : ExtremalRay n) (hExt : R.isExtremal)
    (V : Submodule ℂ (Complexified n))
    (hrank : Module.finrank ℂ V = r) :
    rayLength R V ≤ r + 1 := by
  sorry

end ToricFoliations
Source
Fujino--Sato 2024, A remark on toric foliations, Arch. Math. 122 (2024) 621--627, https://doi.org/10.1007/s00013-024-01991-1 (arXiv:2309.09461), Section 1, Theorem 1.3(1)
Read-back

What the Lean code literally says, in plain math · claude-haiku-4-5

For arbitrary natural numbers nnn and rrr, write Zn=Fin n→Z\mathbb{Z}^n=\mathrm{Fin}\,n\to\mathbb{Z}Zn=Finn→Z and Cn=Fin n→C\mathbb{C}^n=\mathrm{Fin}\,n\to\mathbb{C}Cn=Finn→C. A wall datum C=(v,a,…)C=(v,a,\ldots)C=(v,a,…) of dimension nnn is a record requiring 0<n0<n0<n, primitive lattice vectors vi∈Znv_i\in\mathbb{Z}^nvi​∈Zn and integers aia_iai​ for i∈Fin(n+1)i\in\mathrm{Fin}(n+1)i∈Fin(n+1) satisfying the wall relation ∑iaivi=0\sum_i a_i v_i=0∑i​ai​vi​=0, with an,an+1>0a_n,a_{n+1}>0an​,an+1​>0, a1≤⋯≤an+1a_1\le\cdots\le a_{n+1}a1​≤⋯≤an+1​, positive wall/cones multiplicities mW,mσ,mσ′m_W,m_\sigma,m_{\sigma'}mW​,mσ​,mσ′​, divisibility mW∣mσ,mσ′m_W\mid m_\sigma,m_{\sigma'}mW​∣mσ​,mσ′​, and gcd⁡(ai)=1\gcd(a_i)=1gcd(ai​)=1. An extremal-ray object RRR is a nonempty finite set R.curvesR.\mathrm{curves}R.curves of such wall data together with an opaque proposition R.isExtremalR.\mathrm{isExtremal}R.isExtremal; hExt:R.isExtremalh_{\mathrm{Ext}}:R.\mathrm{isExtremal}hExt​:R.isExtremal is assumed. Let VVV be a complex-linear subspace of Complexified n=Cn\mathrm{Complexified}\,n=\mathbb{C}^nComplexifiedn=Cn, and assume dim⁡CV=r\dim_{\mathbb{C}}V=rdimC​V=r (stated as Module.finrank C V=r\mathrm{Module.finrank}\,\mathbb{C}\,V=rModule.finrankCV=r). For each curve CCC, the foliated length is

curveLength C V=∑i∈Fin(n+1){Di(C),vi∈V\0,vi∉V\mathrm{curveLength}\,C\,V=\sum_{i\in\mathrm{Fin}(n+1)}\begin{cases}D_i(C),&v_i\in V\0,&v_i\notin V\end{cases}curveLengthCV=i∈Fin(n+1)∑​{Di​(C),​vi​∈V\0,​vi​∈/V​

where Di(C)=mW/mσ′D_i(C)=m_W/m_{\sigma'}Di​(C)=mW​/mσ′​ for the last index and Di(C)=aimW/(anmσ)D_i(C)=a_i m_W/(a_n m_\sigma)Di​(C)=ai​mW​/(an​mσ​) otherwise (rational division). The ray length is the minimum over the nonempty finite set of curves:

rayLength R V=min⁡C∈R.curvescurveLength C V.\mathrm{rayLength}\,R\,V=\min_{C\in R.\mathrm{curves}}\mathrm{curveLength}\,C\,V.rayLengthRV=C∈R.curvesmin​curveLengthCV.

The theorem asserts rayLength R V≤r+1\mathrm{rayLength}\,R\,V\le r+1rayLengthRV≤r+1 (in Q\mathbb{Q}Q, so r+1r+1r+1 is coerced). Since a wall datum requires 0<n0<n0<n, when n=0n=0n=0 the type ExtremalRay 0\mathrm{ExtremalRay}\,0ExtremalRay0 is empty and the claim is vacuous; r=0r=0r=0 is otherwise allowed, and the theorem is conditional on all hypotheses, including the opaque extremality proof hExth_{\mathrm{Ext}}hExt​, which does not recur in the conclusion.

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