for every torus-invariant divisor along a wall curve
ProvedToricFoliations.divisor_intersection_le_onetheorem_title: for every torus-invariant divisor along a wall curve
Let be a projective -factorial toric variety, and let be a torus-invariant curve corresponding to the wall of the fan. Let be the primitive vectors completing the two maximal cones adjacent to , and let be the integers of the wall relation (3.1), normalized by , ordered with , and with the multiplicity divisibility .
Then for every index , the intersection number of the torus-invariant prime divisor with satisfies
This is the estimate used immediately after equation (3.2) in the proof of Theorem 1.3; together with the pigeonhole step it produces at least vectors of the wall lying in .
Formalization Note. The theorem asserts divisorIntersection C i ≤ 1 for
every i : Fin (n+1), where all hypotheses are fields of WallData n.
import Mathlib import Definitions.Def_ToricFoliations open scoped BigOperators
namespace ToricFoliations
/--
Equation (3.1) plus the sorted relation (3.2) and the multiplicity
divisibility from the fan imply `D . C <= 1` for every torus-invariant prime
divisor `D` on `X`. This is the step right after (3.2) in the proof of
Theorem 1.3.
-/
theorem divisor_intersection_le_one {n : ℕ} (C : WallData n) :
∀ i : Fin (n + 1), divisorIntersection C i ≤ 1 := by
sorry
end ToricFoliationsRead-back
What the Lean code literally says, in plain math · claude-haiku-4-5
The theorem states: for every natural number and every , for every index — i.e. every — the rational number satisfies .
Here is a record carrying a proof ; the primitive lattice vectors (each ); integer coefficients satisfying the wall relation (coordinatewise in ); positivity of the coefficients at the two last indices, namely (Lean index ) and ; monotonicity whenever (the 's are sorted); three positive natural multiplicities with and ; and a Bézout identity for some integers , encoding .
For such , is defined by: if is the last index, , it equals in ; otherwise it equals in .
Because itself contains the hypothesis , the outer universal over is vacuous for ; for the data force the multiplicities and the two selected 's to be positive, though the divisibility is what the theorem asserts. The file proves the claim by sorry (an admitted placeholder), so no proof is supplied.