The weighted-trace torsion-intersection bound #
This module records the exact numerical statement consumed by the Markoff middle game. The statement is intentionally independent of how the estimate is proved, so low-level escape lemmas do not import the full general Corvaja--Zannier development.
The bound is uniform in the two weights and the two torsion orders. Its hypotheses expose the
actual curve admissibility, positivity, and prime-to-characteristic requirements. The completed
producer corvajaZannierWeightedTraceBound supplies this statement from the in-repository general
Corvaja--Zannier theorem.
The conclusion is the safe coefficient-48 envelope used by the downstream middle game. This
permits the genuine degree-only Euler bound χ ≤ 8 for a general bidegree-(2,2) torus curve; no
unsupported genus-one identification is built into the interface.
The numerical weighted-trace torsion-intersection statement used by the middle game.
This is a lightweight internal proof boundary, not an external assumption. The selected BGS path
constructs it with corvajaZannierWeightedTraceBound.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Multiplicative subgroup orders satisfy every arithmetic side condition in the weighted-trace torsion-intersection bound.
Apply the weighted-trace torsion-intersection bound after Lean has proved the concrete curve is admissible and both subgroup orders satisfy the source's arithmetic hypotheses.