A square-field Stepanov bound for arbitrary function fields #
The one-point Stepanov construction is intrinsic to a finite separable extension of a rational function field. This file applies it to the complete type of degree-one places, rather than to the regular affine points of a chosen plane model.
Choose one rational place as the pole. Every rational finite place away from it is a zero-counting place; at most one rational finite place is omitted. The rational places above infinity contribute at most the degree of the function-field extension, by the fundamental ramification-inertia equality. This gives a uniform estimate suitable for the Frobenius fixed-field twists.
The algebra structure from S to L used in the general square field stepanov count
construction.
Equations
- BGS.HasseWeil.generalSquareFieldConstantAlgebra S L = ((algebraMap (RatFunc S) L).comp (algebraMap S (RatFunc S))).toAlgebra
Instances For
The algebra structure from (RatFuncInfinityIntegers S) to L used in the general
square field stepanov count construction.
Equations
Instances For
The number of rational places above infinity is at most the function-field degree.
The intrinsic one-point square-field Stepanov bound for all degree-one places of a finite separable function field, using Riemann's inequality only at rational finite places.
If a rational finite place exists, it is chosen as the pole in the Stepanov construction. If none exists, all rational places lie above infinity and the fundamental ramification--inertia equality gives the required bound directly. Thus no Riemann inequality at an infinity place is needed.
The intrinsic one-point square-field Stepanov bound for all degree-one places of a finite separable function field.
This compatibility wrapper preserves the original API. Its stronger
hypothesis supplies the finite-place Riemann inequalities required by
finiteExtensionRationalPlaceCount_le_squareFieldStepanov_of_finitePlaceRiemann.