Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Toric foliations — lattice, wall data, foliated length, and Pr\mathbb P^rPr-bundle data

Definition
ToricFoliations

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

algebraic-geometryfoliationsmori-theorytoric-varieties

definition_name: ToricFoliations definition_title: Toric foliations — lattice, wall data, foliated length, and Pr\mathbb P^rPr-bundle data

Define the toric combinatorial core used in the proof of Theorem 1.3 of Fujino–Sato.

Fix a dimension n≥1n\ge1n≥1. The lattice is N=ZnN=\mathbb Z^nN=Zn and its complexification is NC=CnN_{\mathbb C}=\mathbb C^nNC​=Cn; a toric foliation is represented, via Pang's correspondence, by a C\mathbb CC-subspace V⊆NCV\subseteq N_{\mathbb C}V⊆NC​ of rank r=dim⁡CVr=\dim_{\mathbb C}Vr=dimC​V.

For a torus-invariant curve C=V(W)C=V(W)C=V(W) of a complete simplicial fan, let v1,…,vn+1v_1,\dots,v_{n+1}v1​,…,vn+1​ be the primitive vectors appearing in Reid's description of the wall WWW and of the two adjacent maximal cones σ,σ′\sigma,\sigma'σ,σ′. The type WallData n packages:

  • the vectors vi∈Nv_i\in Nvi​∈N and the integers ai∈Za_i\in\mathbb Zai​∈Z satisfying the wall relation ∑iaivi=0\sum_i a_i v_i=0∑i​ai​vi​=0 of equation (3.1), with an,an+1>0a_n,a_{n+1}>0an​,an+1​>0, with the ordering a1≤⋯≤an+1a_1\le\cdots\le a_{n+1}a1​≤⋯≤an+1​, and with gcd⁡(a1,…,an+1)=1\gcd(a_1,\dots,a_{n+1})=1gcd(a1​,…,an+1​)=1 (stated as a Bézout identity);
  • the multiplicities mult(W),mult(σ),mult(σ′)\mathrm{mult}(W),\mathrm{mult}(\sigma), \mathrm{mult}(\sigma')mult(W),mult(σ),mult(σ′), assumed positive with mult(W)∣mult(σ)\mathrm{mult}(W)\mid\mathrm{mult}(\sigma)mult(W)∣mult(σ) and mult(W)∣mult(σ′)\mathrm{mult}(W)\mid\mathrm{mult}(\sigma')mult(W)∣mult(σ′).

divisorIntersection implements the intersection numbers from equation (3.1):

Dvi⋅C={0vi∉{v1,…,vn+1},ai mult(W)an mult(σ)1≤i≤n,mult(W)mult(σ′)i=n+1.D_{v_i}\cdot C= \begin{cases} 0 & v_i\notin\{v_1,\dots,v_{n+1}\},\\ \dfrac{a_i\,\mathrm{mult}(W)}{a_n\,\mathrm{mult}(\sigma)} & 1\le i\le n,\\[6pt] \dfrac{\mathrm{mult}(W)}{\mathrm{mult}(\sigma')} & i=n+1. \end{cases}Dvi​​⋅C=⎩⎨⎧​0an​mult(σ)ai​mult(W)​mult(σ′)mult(W)​​vi​∈/{v1​,…,vn+1​},1≤i≤n,i=n+1.​

curveLength is the foliated length −KF⋅C=∑vi∈VDvi⋅C-K_{\mathscr F}\cdot C=\sum_{v_i\in V}D_{v_i}\cdot C−KF​⋅C=∑vi​∈V​Dvi​​⋅C; ExtremalRay and rayLength package an abstract extremal ray and the minimum lF(R)=min⁡[C]∈R{−KF⋅C}l_{\mathscr F}(R)=\min_{[C]\in R}\{-K_{\mathscr F}\cdot C\}lF​(R)=min[C]∈R​{−KF​⋅C}; IsProjectiveSpaceBundle encodes the conclusion of Theorem 1.3(2): the tail vectors sum to zero, span a saturated rank-rrr sublattice, and give a lattice splitting N≅Zr×Zn−rN\cong\mathbb Z^r\times\mathbb Z^{n-r}N≅Zr×Zn−r — the toric data of a Pr\mathbb P^rPr-bundle.

Formalization Note. Lattice n := Fin n → ℤ, Complexified n := Fin n → ℂ, V is a Submodule ℂ (Complexified n), and the rank is Module.finrank ℂ V. Division by zero is total in ℚ, so no side conditions are needed inside divisorIntersection.

Definition code
import Mathlib

open scoped BigOperators

/-!
# Toric foliations: combinatorial core of Fujino--Sato, "A remark on toric foliations"

This file formalizes the *combinatorial core* of Theorem 1.3 of

  Osamu Fujino and Hiroshi Sato,
  *A remark on toric foliations*,
  Arch. Math. 122 (2024), 621--627.
  https://doi.org/10.1007/s00013-024-01991-1

The full statement of Theorem 1.3 lives in toric Mori theory (projective
`Q`-factorial toric varieties, saturated torus-equivariant subsheaves of the
tangent sheaf, the Mori cone, extremal contraction morphisms).  Mathlib does
not yet contain that machinery, so this mission fixes the combinatorial data
the proof of Section 3 actually uses:

* a lattice `N = Z^n` together with its complexification `N_C = C^n`;
* a wall `W` of a complete simplicial fan, i.e. a relation
  `sum_i a_i v_i = 0` among the `n+1` primitive vectors `v_1,...,v_{n+1}`
  appearing in Reid's description of toric extremal contractions;
* a toric foliation, represented (via Pang's correspondence) by a complex
  subspace `V <= N_C`;
* the intersection numbers `D_{v_i} . C` computed by equation (3.1) of the
  paper, which build the foliated length `-K_F . C`.

The geometric wrapper (sheaves, Mori cone, contraction morphisms, relative
tangent sheaf) is deliberately left as future work; the goal theorem is the
faithful lattice/fan content of Theorem 1.3.
-/

namespace ToricFoliations

/-- The lattice `N = Z^n` of a toric variety of dimension `n`. -/
abbrev Lattice (n : ℕ) := Fin n → ℤ

/-- The complexification `N_C = C^n`. -/
abbrev Complexified (n : ℕ) := Fin n → ℂ

/-- The natural inclusion `N -> N_C`. -/
def toComplex {n : ℕ} (x : Lattice n) : Complexified n :=
  fun i => (x i : ℂ)

/-- The index of `v_{n+1}` among the `n+1` vectors `v_1,...,v_{n+1}`.
(We use 0-based `Fin (n+1)` indices, so `lastIndex n = n`.) -/
def lastIndex (n : ℕ) : Fin (n + 1) :=
  ⟨n, Nat.lt_succ_self n⟩

/-- The index of `v_n` among the `n+1` vectors (0-based index `n-1`). -/
def wallIndex (n : ℕ) (hn : 0 < n) : Fin (n + 1) :=
  ⟨n - 1, by omega⟩

/--
The wall data of a torus-invariant curve `C = V(W)` in a complete simplicial
fan, following equations (3.1)--(3.3) and Proposition 14-1-5 of Matsuki's
book as used in the proof of Theorem 1.3.

`v : Fin (n+1) -> N` lists the primitive vectors; `a : Fin (n+1) -> Z` are the
integers in the wall relation `sum_i a_i v_i = 0`; `mWall`, `mSigma`,
`mSigma'` are the multiplicities of the wall `W` and of the two maximal cones
`sigma`, `sigma'` adjacent to `W`.
-/
structure WallData (n : ℕ) where
  hn : 0 < n
  v : Fin (n + 1) → Lattice n
  a : Fin (n + 1) → ℤ
  /-- The wall relation (3.1): `sum_i a_i v_i = 0`. -/
  relation : (∑ i : Fin (n + 1), a i • v i) = 0
  /-- `a_n > 0` (paper index `n`, Lean index `n-1`). -/
  an_pos : 0 < a (wallIndex n hn)
  /-- `a_{n+1} > 0`. -/
  aLast_pos : 0 < a (lastIndex n)
  /-- After reordering, (3.2): `a_1 <= ... <= a_{n+1}`. -/
  sorted : ∀ i j : Fin (n + 1), i.val ≤ j.val → a i ≤ a j
  /-- Multiplicity of the wall `W`. -/
  mWall : ℕ
  /-- Multiplicity of the maximal cone `sigma`. -/
  mSigma : ℕ
  /-- Multiplicity of the maximal cone `sigma'`. -/
  mSigma' : ℕ
  mWall_pos : 0 < mWall
  mSigma_pos : 0 < mSigma
  mSigma'_pos : 0 < mSigma'
  /-- `mult(W) | mult(sigma)`, used for `D . C <= 1`. -/
  wall_dvd_sigma : mWall ∣ mSigma
  /-- `mult(W) | mult(sigma')`, used for `D . C <= 1`. -/
  wall_dvd_sigma' : mWall ∣ mSigma'
  /-- `gcd(a_1,...,a_{n+1}) = 1` via a Bézout identity. -/
  gcd_one : ∃ b : Fin (n + 1) → ℤ, (∑ i : Fin (n + 1), b i * a i) = 1

/--
The intersection number `D_{v_i} . C` from equation (3.1) of the paper:
for `i = n+1` it is `mult(W)/mult(sigma')`, and for every other index it is
`a_i * mult(W) / (a_n * mult(sigma))`.  Division by zero is total in `Q`,
so no side conditions are needed in the definition.
-/
noncomputable def divisorIntersection {n : ℕ} (C : WallData n) (i : Fin (n + 1)) : ℚ :=
  if i = lastIndex n then
    (C.mWall : ℚ) / (C.mSigma' : ℚ)
  else
    (C.a i : ℚ) * (C.mWall : ℚ) / ((C.a (wallIndex n C.hn) : ℚ) * (C.mSigma : ℚ))

/--
The foliated length `-K_F . C = sum_{v_i in V} D_{v_i} . C` of a
torus-invariant curve `C`, for the toric foliation represented by the complex
subspace `V` (see equation (1.1)--(1.2) and the proof of Theorem 1.3).
-/
noncomputable def curveLength {n : ℕ} (C : WallData n)
    (V : Submodule ℂ (Complexified n)) : ℚ := by
  classical
  exact ∑ i : Fin (n + 1), if toComplex (C.v i) ∈ V then divisorIntersection C i else 0

/--
An abstract extremal ray of the Mori cone: a set of torus-invariant curves
plus an (intentionally opaque) extremality predicate.  Making `isExtremal`
concrete is part of the mission's future work of connecting this combinatorial
core to toric Mori theory.
-/
structure ExtremalRay (n : ℕ) where
  /-- The torus-invariant curves whose classes span the ray. -/
  curves : Finset (WallData n)
  nonempty : curves.Nonempty
  isExtremal : Prop

/--
The length `l_F(R) = min_{[C] in R} (-K_F . C)` of an extremal ray with
respect to the toric foliation represented by `V`.
-/
noncomputable def rayLength {n : ℕ} (R : ExtremalRay n)
    (V : Submodule ℂ (Complexified n)) : ℚ := by
  classical
  exact R.curves.inf' R.nonempty (fun C : WallData n => curveLength C V)

/--
The index of the paper's `v_{n-r+j}` (1-based) inside `Fin (n+1)`: for
`0 <= j <= r` this is `n-r+j`.  These are the tail indices that appear in
equations (3.5)--(3.6) once the long-ray case has been analyzed.
-/
def tailIndex {n r : ℕ} (hr : r ≤ n) (j : Fin (r + 1)) : Fin (n + 1) :=
  ⟨n - r + j.val, by
    have hj : j.val ≤ r := Nat.le_of_lt_succ j.isLt
    omega⟩

/--
Combinatorial encoding of the conclusion of Theorem 1.3(2): the extremal
contraction is a `P^r`-bundle.  In toric geometry this is equivalent to the
lattice splitting `N = N1 (+) N2` with `rank N1 = r`, where the tail vectors
`v_{n-r+1},...,v_{n+1}` span the saturated sublattice `N1` and satisfy
`v_{n-r+1} + ... + v_{n+1} = 0` (equations (3.10)--(3.11) and Fulton's
exercise quoted in the paper).
-/
structure IsProjectiveSpaceBundle {n r : ℕ} (hr : r ≤ n) (C : WallData n) : Prop where
  /-- `v_{n-r+1} + ... + v_{n+1} = 0` (equation (3.10)). -/
  tail_sum_zero : (∑ j : Fin (r + 1), C.v (tailIndex hr j)) = 0
  /-- The tail vectors span a rank-`r` saturated sublattice (3.11). -/
  tail_span :
    Nonempty
      ((Submodule.span ℤ (Set.range fun j : Fin (r + 1) => C.v (tailIndex hr j)) :
          Submodule ℤ (Lattice n)) ≃ₗ[ℤ] (Fin r → ℤ))
  /-- The splitting `N = N1 (+) N2` giving the `P^r`-bundle structure. -/
  lattice_split : Nonempty (Lattice n ≃ₗ[ℤ] ((Fin r → ℤ) × (Fin (n - r) → ℤ)))

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), Sections 1 and 3
Read-back

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

Fix n∈Nn\in\mathbb{N}n∈N. The module defines the toric lattice N=ZnN=\mathbb{Z}^nN=Zn as functions Fin n→Z\mathrm{Fin}\,n\to\mathbb{Z}Finn→Z, its complexification NC=CnN_{\mathbb{C}}=\mathbb{C}^nNC​=Cn, and the coordinatewise inclusion N↪NCN\hookrightarrow N_{\mathbb{C}}N↪NC​. The index nnn inside Fin(n+1)\mathrm{Fin}(n+1)Fin(n+1) is called the last index (the (n+1)(n+1)(n+1)-st vector, vn+1v_{n+1}vn+1​); under the hypothesis 0<n0<n0<n, n−1n-1n−1 is the "wall index" (the paper's nnn-th vector). A structure WallData n\mathrm{WallData}\,nWallDatan consists of a proof 0<n0<n0<n, vectors v0,…,vn∈Znv_0,\dots,v_n\in\mathbb{Z}^nv0​,…,vn​∈Zn, integers a0,…,ana_0,\dots,a_na0​,…,an​, the wall relation ∑i=0naivi=0\sum_{i=0}^{n} a_i v_i=0∑i=0n​ai​vi​=0 in Zn\mathbb{Z}^nZn, an−1>0a_{n-1}>0an−1​>0 and an>0a_n>0an​>0, monotonicity ai≤aja_i\le a_jai​≤aj​ whenever i≤ji\le ji≤j (so a0≤⋯≤ana_0\le\cdots\le a_na0​≤⋯≤an​), natural multiplicities mWall,mσ,mσ′m_{\mathrm{Wall}},m_\sigma,m_{\sigma'}mWall​,mσ​,mσ′​, all >0>0>0, divisibilities mWall∣mσm_{\mathrm{Wall}}\mid m_\sigmamWall​∣mσ​ and mWall∣mσ′m_{\mathrm{Wall}}\mid m_{\sigma'}mWall​∣mσ′​, and integers bib_ibi​ with ∑ibiai=1\sum_i b_i a_i=1∑i​bi​ai​=1. Because 0<n0<n0<n is a field, WallData 0\mathrm{WallData}\,0WallData0 is empty. For such CCC and index iii, the intersection number is Di=mWall/mσ′D_i=m_{\mathrm{Wall}}/m_{\sigma'}Di​=mWall​/mσ′​ if i=ni=ni=n, and otherwise Di=ai mWall/(an−1 mσ)D_i=a_i\,m_{\mathrm{Wall}}/(a_{n-1}\,m_\sigma)Di​=ai​mWall​/(an−1​mσ​) in Q\mathbb{Q}Q; the stated hypotheses make the latter denominator nonzero. For a complex subspace V⊆CnV\subseteq\mathbb{C}^nV⊆Cn, the foliated curve length is ∑iDi\sum_i D_i∑i​Di​ over indices with the complexification of viv_ivi​ lying in VVV, and 000 for the rest. An ExtremalRay n\mathrm{ExtremalRay}\,nExtremalRayn is a nonempty finite set of such wall data together with an opaque proposition isExtremal\mathrm{isExtremal}isExtremal; its ray length is the minimum of the curve lengths over that finite set. With r≤nr\le nr≤n and 0≤j≤r0\le j\le r0≤j≤r, the tail index is n−r+jn-r+jn−r+j inside Fin(n+1)\mathrm{Fin}(n+1)Fin(n+1); note r=0r=0r=0 yields only index nnn, and r=nr=nr=n yields 0,…,n0,\dots,n0,…,n. Finally, IsProjectiveSpaceBundle (r≤n) C\mathrm{IsProjectiveSpaceBundle}\,(r\le n)\,CIsProjectiveSpaceBundle(r≤n)C asserts: (i) the tail sum ∑j=0rvn−r+j=0\sum_{j=0}^{r} v_{n-r+j}=0∑j=0r​vn−r+j​=0 in Zn\mathbb{Z}^nZn; (ii) the Z\mathbb{Z}Z-span of those tail vectors is Z\mathbb{Z}Z-linearly equivalent to Zr\mathbb{Z}^rZr; (iii) there is a Z\mathbb{Z}Z-linear equivalence Zn≅Zr×Zn−r\mathbb{Z}^n\cong\mathbb{Z}^r\times\mathbb{Z}^{n-r}Zn≅Zr×Zn−r.

Human review
  • Flagged by Shuze Chen · Oct 19, 2026

    WallData leaves mWall, mSigma, mSigma' as free naturals unrelated to the vectors viv_ivi​, does not require the v_i to be primitive or nonzero, and ExtremalRay.isExtremal is an arbitrary Prop. The paper's argument (cones sigmaksigma_ksigmak​, curves V(muk,n+1),mult(muk,n+1)=mult(sigmak)V(mu_{k,n+1}), mult(mu_{k,n+1}) = mult(sigma_k)V(muk,n+1​),mult(muk,n+1​)=mult(sigmak​), primitivity of vn−r+1)v_{n-r+1})vn−r+1​) cannot be expressed over this data. The dependent statements below are false in this abstraction.

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