A long ray forces at least wall vectors in
ProvedToricFoliations.exists_r_add_one_vectors_in_subspacetheorem_title: A long ray forces at least wall vectors in
Let be a toric foliation of rank on a projective -factorial toric variety, represented by the subspace . Let be a torus-invariant curve with wall data as in equation (3.1) normalized by the ordering (3.2). If the foliated length satisfies
then at least of the vectors belong to :
This is equation (3.3) of the paper; it follows from for all and from .
Formalization Note. The conclusion is an injective map
ι : Fin (r+1) → Fin (n+1) with toComplex (C.v (ι j)) ∈ V for all j.
import Mathlib import Definitions.Def_ToricFoliations open scoped BigOperators
namespace ToricFoliations
/--
If `-K_F . C > r` and `rank F = r`, then at least `r+1` of the vectors
`v_1,...,v_{n+1}` lie in `V`. This is the pigeonhole
step (3.3) of the proof of Theorem 1.3, using `D . C <= 1`.
-/
theorem exists_r_add_one_vectors_in_subspace {n r : ℕ} (C : WallData n)
(V : Submodule ℂ (Complexified n))
(hrank : Module.finrank ℂ V = r)
(hlong : r < curveLength C V) :
∃ ι : Fin (r + 1) → Fin (n + 1),
Function.Injective ι ∧
∀ j : Fin (r + 1), toComplex (C.v (ι j)) ∈ V := by
sorry
end ToricFoliationsRead-back
What the Lean code literally says, in plain math · claude-haiku-4-5
For arbitrary natural numbers and , let be wall data of dimension and a -linear subspace of (here , and is a submodule over ). Wall data entails: ; an integer lattice map listing vectors; integers with wall relation ; , , the nondecreasing in index; positive multiplicities with ; and a Bezout identity . Assume (1) , i.e. ; (2) , where the rational foliated length is
with the inclusion (each coordinate cast to ), and if (the last index), else . The theorem then asserts: there is an injective function such that for every , the complexified lattice vector . Thus among the vectors, at least distinct ones (complexified) lie in . Since wall data forces , gives no ; no hypothesis states , yet an injection requires , so makes the conclusion impossible unless the hypotheses are inconsistent.