Theorem 1.3(1) — the length bound
DisprovedToricFoliations.length_boundtheorem_title: Theorem 1.3(1) — the length bound
Let be a projective -factorial toric variety and let be a toric foliation of rank on , represented by the subspace . For every extremal ray of the Mori cone , the length of with respect to the foliation satisfies
Formalization Note. rayLength R V implements the minimum; R is an
ExtremalRay n with the (opaque) isExtremal predicate whose concretization
is future work.
import Mathlib import Definitions.Def_ToricFoliations open scoped BigOperators
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 ToricFoliationsRead-back
What the Lean code literally says, in plain math · claude-haiku-4-5
For arbitrary natural numbers and , write and . A wall datum of dimension is a record requiring , primitive lattice vectors and integers for satisfying the wall relation , with , , positive wall/cones multiplicities , divisibility , and . An extremal-ray object is a nonempty finite set of such wall data together with an opaque proposition ; is assumed. Let be a complex-linear subspace of , and assume (stated as ). For each curve , the foliated length is
where for the last index and otherwise (rational division). The ray length is the minimum over the nonempty finite set of curves:
The theorem asserts (in , so is coerced). Since a wall datum requires , when the type is empty and the claim is vacuous; is otherwise allowed, and the theorem is conditional on all hypotheses, including the opaque extremality proof , which does not recur in the conclusion.