The parameterized numerical bound in Corvaja--Zannier Theorem 4 #
This file isolates the real and natural-number optimization in the proof of Corvaja--Zannier, JEMS 15 (2013), Theorem 4. The curve-theoretic content of their Proposition 2 is an ordinary proposition-valued hypothesis below. No function-field or valuation statement is assumed through a typeclass.
The source chooses
h = floor (t * (b^2 / (a * chi))^(1/3)) - 1 and
k = floor (t * (a^2 / (b * chi))^(1/3)) - 1.
The proof below retains that choice and checks the small-k, degree-
alternative, parameter-admissibility, and numerical-bound cases separately.
The natural parameters to which the numerical form of Corvaja--Zannier
Proposition 2 applies. Positivity of h * k + h + k records that the
denominator in Proposition 2 is meaningful.
Equations
Instances For
The two alternatives supplied by the numerical part of Corvaja--Zannier Proposition 2.
Here a = deg(v), b = deg(u), chi is the Euler characteristic, and G
is the gcd sum. This is deliberately an ordinary Prop, not a structure,
class, or axiom.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The floor-parameter optimization in Corvaja--Zannier Theorem 4.
The hypothesis hPropositionTwo is exactly the numerical alternative of
Proposition 2, supplied for every admissible pair of natural parameters.
All remaining hypotheses are elementary: positive natural degrees and Euler
characteristic, positive characteristic and real parameter, a nonnegative gcd
quantity, and its trivial upper bound by the smaller degree.