Function fields form the Magma category FldFun and function field orders form the Magma category RngFunOrd. The notional power structures exist as parents of function fields and their orders but allow no operations.
More interesting related structures (than above) are listed below.
The prime field of the function field F or the order O (prime ring of the constant field).
The constant field k, where F = k(x, alpha).
The exact constant field of the algebraic function field F/k, i.e. the algebraic closure in F of the constant field k of F, together with the inclusion map.
The rational function field k(x) if the function field F is an extension of k(x) and k if F is an extension of k. If F is an extension of another algebraic function field then this field will be returned.
The polynomial algebra k[x] if O is finite or the degree valuation ring if O is infinite. If O is an extension of another order of an algebraic function field this order will be returned.
For a non equation order O returns the order which O was created as a transformation of. This order is one transformation closer to the equation order.
Given an order O, this function returns the function field F to which O belongs. On a function field this function is trivial.
The function field F represented as an extension of a rational function field. This function gives the representation of function fields F/k as finite extensions.
The order O as an extension of its bottom coefficient ring, (i.e. the order of the RationalExtensionRepresentation of the field of fractions of O corresponding to O).
Return the underlying ring of F over R. This is F expressed as an extension of R. If R is not given then it is taken to be the coefficient field of the coefficient field of F. The field R must appear in the tower of coefficient fields under F.
The set of places of the algebraic function field F/k.
The group of divisors of the algebraic function field F/k.
The space of differentials of the algebraic function field F/k.
> R<x> := FunctionField(GF(5)); > P<y> := PolynomialRing(R); > f := y^3 + (4*x^3 + 4*x^2 + 2*x + 2)*y^2 + (3*x + 3)*y + 2; > F<alpha> := FunctionField(f); > ConstantField(F); Finite field of size 5 > CoefficientField(F); Univariate rational function field over GF(5) Variables: x > CoefficientRing(MaximalOrderFinite(F)); Univariate Polynomial Ring in x over GF(5) > FieldOfFractions(IntegralClosure(ValuationRing(R), F)); Algebraic function field defined over Univariate rational function field over GF(5) Variables: x by y^3 + (4*x^3 + 4*x^2 + 2*x + 2)*y^2 + (3*x + 3)*y + 2 > Order(IntegralClosure(ValuationRing(R), F), > MatrixAlgebra(CoefficientRing(MaximalOrderInfinite(F)), 3)!4, > CoefficientRing(MaximalOrderInfinite(F))!1); Maximal Order of F over Valuation ring of Univariate rational function field over GF(5) with generator 1/x > SubOrder(1); Maximal Order of F over Valuation ring of Univariate rational function field over GF(5) with generator 1/x > 1 eq 2; false > Places(F); Set of places of F > DivisorGroup(F); Divisor group of F2; false > Places(F); Set of places of F > DivisorGroup(F); Divisor group of F
> PF<x> := PolynomialRing(GF(31, 3)); > P<y> := PolynomialRing(PF); > FF1<b> := ext<FieldOfFractions(PF) | y^2 - x^3 + 1>; > P<y> := PolynomialRing(FF1); > FF2<d> := ext<FF1 | y^3 - b*x*y - 1>; > RationalExtensionRepresentation(FF2); Algebraic function field defined over Univariate rational function field over GF(31^3) by y^6 + 29*y^3 + (30*x^5 + x^2)*y^2 + 1 > UnderlyingRing(FF2); Algebraic function field defined over Univariate rational function field over GF(31^3) by y^6 + 29*y^3 + (30*x^5 + x^2)*y^2 + 1 > UnderlyingRing(FF2, FieldOfFractions(PF)); Algebraic function field defined over GF(31^3) by .1^6 + 29 *.1^3 + 30*.1^2 *.2^5 + .1^2 *.2^2 + 1
Reduction: BoolElt Default: true
SetVerbose("WeilRes", n): Maximum: 1
A hyperelliptic function field in the Weil restriction over GF(q) of the elliptic function field E: y^2 + xy + x^3 + ax^2 + b defined over GF(q^n) where q is a power of 2. Also returns a function which can be used to map a place (not a pole or zero of x) of F into a divisor of the result. See [Gau00]. Reduction indicates whether a (possibly quite expensive) reduction step is performed at the end of the computation. It defaults to true.
The curve with function field F if F was created from a curve. See Section Function Fields.
Returns true if F has been created from a curve.
The projective curve with function field F if F was created from a curve. See Section Function Fields.
Given an order O belonging to a function field F, this function returns the order obtained by applying size-reduction to the basis of O.[Next][Prev] [Right] [Left] [Up] [Index] [Root]