Weighted boundary support for a plane curve #
This file proves the sharp coordinate-boundary estimate needed in the
Corvaja--Zannier middle game. The exhaustive places are defined using the
first-coordinate RatFunc model. To bound the positive divisor of the
second coordinate, each positive place is transported to the finite chart
of the second-coordinate model. The transport preserves both the normalized
valuation and the residue degree; injectivity then compares the two weighted
positive-divisor sums.
The final theorem is stated directly for the zero/pole boundary
propositionTwoExceptionalPlaces of positive coordinate powers.
The algebra structure from K[X] to L used in the plane curve boundary support
construction.
Equations
- BGS.CorvajaZannier.probePolynomialAlgebra K L = ((algebraMap (RatFunc K) L).comp (algebraMap (Polynomial K) (RatFunc K))).toAlgebra
Instances For
The algebra structure from K to (RatFuncFiniteIntegralClosure K L) used in the plane
curve boundary support construction.
Equations
Instances For
The algebra structure from K to (RatFuncInfinityIntegers K) used in the plane curve
boundary support construction.
Equations
Instances For
The algebra structure from K to (RatFuncInfinityIntegralClosure K L) used in the
plane curve boundary support construction.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The zero/pole boundary of positive powers of the two plane-curve coordinates has degree at most twice the sum of the two coordinate degrees.