Algebraic Function Fields
- Introduction
- Creation of Algebraic Function Fields and their Orders
- Creation of Algebraic Function Fields
ext< K | f >: FldFunRat, RngUPolElt → FldFun
ext< K | f >: FldFun, RngUPolElt → FldFun
FunctionField(f : parameters): RngUPolElt → FldFun
FunctionField(f : parameters): RngMPolElt → FldFun
FunctionField(S): [RngUPolElt] → FldFun
HermitianFunctionField(p, d): RngIntElt, RngIntElt → FldFun
HermitianFunctionField(q): RngIntElt → FldFun
sub<F | S>: FldFun, [] → FldFun
sub<F | s₁, ..., sᵣ >: FldFun, [] → FldFun
AssignNames(~F, s): FldFun, [ MonStgElt ]
AssignNames(~a, s): FldFunElt, [ MonStgElt ]
FunctionField(R): Rng → FldFunG
Example: Creation
Example: Creation Rel
Example: Creation Non Simple
Example: Creation Herm
- Construction of Orders of Algebraic Function Fields
EquationOrderFinite(F): FldFun → RngFunOrd
MaximalOrderFinite(F): FldFun → RngFunOrd
EquationOrderInfinite(F): FldFun → RngFunOrd
MaximalOrderInfinite(F): FldFun → RngFunOrd
IntegralClosure(R, F): Rng, FldFun → RngFunOrd
EquationOrder(O): RngFunOrd → RngFunOrd
MaximalOrder(O): RngFunOrd → RngFunOrd
SetOrderMaximal(O, b): RngFunOrd, BoolElt
ext<O | f>: RngFunOrd, RngUPolElt → RngFunOrd
Example: orders
Example: Int Cl
Order(O, T, d): RngFunOrd, AlgMatElt, RngElt → RngFunOrd
Order(O, M): RngFunOrd, ModDed → RngFunOrd
Order(O, S): RngFunOrd, [FldFunElt] → RngFunOrd
Simplify(O): RngFunOrd → RngFunOrd
O1 + O2: RngFunOrd, RngFunOrd → RngFunOrd
O1 meet O2: RngFunOrd, RngFunOrd → RngFunOrd
AsExtensionOf(O1, O2): RngFunOrd, RngFunOrd → RngFunOrd
Example: Order Create More
- Orders and Ideals
- Related Structures
- Parent and Category
- Other Related Structures
PrimeRing(F): FldFun → Rng
PrimeField(F): FldFun → Rng
PrimeRing(O): RngFunOrd → Rng
ConstantField(F): FldFunG → Rng
DefiningConstantField(F): FldFunG → Rng
ExactConstantField(F): FldFunG → Rng, Map
BaseRing(F): FldFun → Rng
BaseField(F): FldFun → Rng
CoefficientRing(F): FldFun → Rng
CoefficientField(F): FldFun → Rng
ISABaseField(F,G): Fld, Fld → BoolElt
BaseRing(O): RngFunOrd → Rng
CoefficientRing(O): RngFunOrd → Rng
BaseRing(FF): FldFunOrd → Rng
BaseField(FF): FldFunOrd → Rng
CoefficientRing(FF): FldFunOrd → Rng
CoefficientField(FF): FldFunOrd → Rng
SubOrder(O): RngFunOrd → RngFunOrd
FunctionField(O): RngFunOrd → FldFun
FieldOfFractions(O): RngFunOrd → FldFunOrd
FieldOfFractions(FF): FldFunOrd → FldFunOrd
FieldOfFractions(F): FldFun → FldFun
Order(FF): FldFunOrd → RngFunOrd
RationalExtensionRepresentation(F): FldFunG → FldFun
AbsoluteOrder(O): RngFunOrd → RngFunOrd
AbsoluteFunctionField(F): FldFunG → FldFunG
UnderlyingRing(F): FldFunG → FldFunG
UnderlyingField(F): FldFunG → FldFunG
UnderlyingRing(F, R): FldFunG, Rng → FldFunG
UnderlyingField(F, R): FldFunG, Rng → FldFunG
Embed(F, L, a): FldFun, FldFun, FldFunElt
Embed(F, L, s): FldFun, FldFun, [FldFunElt]
HasEmbedding(O1, O2): RngFunOrd, RngFunOrd → Bool
CanComputeEmbedding(O1, O2): RngFunOrd, RngFunOrd → Bool
Places(F): FldFunG → PlcFun
DivisorGroup(F): FldFun → DivFun
DifferentialSpace(F): FldFun → DiffFun
Example: Related Structures
Example: Related Structures Rat Ext
WeilRestriction(E, n): FldFun, RngIntElt → FldFun, UserProgram
ConstantFieldExtension(F, E): FldFun, Rng → FldFun, Map
Example: cfe
MonicModel(F): FldFun → FldFun
Reduce(O): RngFunOrd → RngFunOrd
Localization(O, p): RngFunOrd, RngFunOrdIdl → RngVal, Map
- General Structure Invariants
Characteristic(F): FldFun → RngIntElt
Characteristic(O): RngFunOrd → RngIntElt
IsPerfect(F): Fld → BoolElt
Degree(F): FldFunG → RngIntElt
Degree(F, G): FldFun, FldFun → RngIntElt
Degree(O): RngFunOrd → RngIntElt
AbsoluteDegree(F): FldFunG → RngIntElt
AbsoluteDegree(O): RngFunOrd → RngIntElt
DefiningPolynomial(F): FldFun → RngUPolElt
DefiningPolynomial(O): RngFunOrd → RngUPolElt
DefiningPolynomials(F): FldFun → [RngUPolElt]
DefiningPolynomials(O): RngFunOrd → [RngUPolElt]
Basis(F): FldFunG → SeqEnum[FldFunElt]
Basis(O): RngFunOrd → SeqEnum[FldFunElt]
Basis(O, R): RngFunOrd, Rng → SeqEnum[RngElt]
TransformationMatrix(O1, O2): RngFunOrd, RngFunOrd → AlgMatElt, RngElt
CoefficientIdeals(O): RngFunOrd → [RngFunOrdIdl]
BasisMatrix(O): RngFunOrd → AlgMatElt
PrimitiveElement(O): RngFunOrd → RngFunOrdElt
Discriminant(O): RngFunOrd → .
AbsoluteDiscriminant(O): RngFunOrd → .
DimensionOfExactConstantField(F): FldFunG → RngIntElt
DegreeOfExactConstantField(F): FldFunG → RngIntElt
Genus(F): FldFunG → RngIntElt
Example: invar
Example: Invar Non Simple
GapNumbers(F): FldFunG → SeqEnum[RngIntElt]
GapNumbers(F, P): FldFunG, PlcFunElt → SeqEnum[RngIntElt]
GapNumbers(P): PlcFunElt → SeqEnum[RngIntElt]
SeparatingElement(F): FldFunG → FldFunGElt
RamificationDivisor(F): FldFunG → DivFunElt
WeierstrassPlaces(F): FldFunG → [PlcFunElt]
WronskianOrders(F): FldFunG → [RngIntElt]
Different(O): RngFunOrd → RngFunOrdIdl
Index(O, S): RngFunOrd, RngFunOrd → Any
- Galois Groups
GaloisGroup(f): RngUPolElt → GrpPerm, [ RngElt ], GaloisData
GaloisGroup(F): FldFun → GrpPerm, [RngElt], GaloisData
GaloisGroup(F): FldFun[FldFun[FldFunRat]] → GrpPerm, [RngElt], GaloisData
GaloisGroup(F): FldFun[FldFin] → GrpPerm, [RngElt], GaloisData
GaloisGroup(F): FldFun[FldFunRat] → GrpPerm, [RngElt], GaloisData
GaloisGroup(F): FldFun[FldRat] → GrpPerm, [RngElt], GaloisData
Example: Galois Groups
Example: Galois Groups2
GeometricGaloisGroup(f): RngUPolElt → GrpPerm, RngUPolElt, GaloisData
HilbertIrreducibilityCurves(f): RngUPolElt → SetEnum, SeqEnum
Example: appl
- Splitting Fields
- Subfields
- Automorphism Group
- Automorphisms over the Base Field
Automorphisms(K, k): FldFun, FldFunG → [Map]
AutomorphismGroup(K, k): FldFun, FldFunG → GrpFP, Map
Example: Automorphisms
IsSubfield(K, L): FldFun, FldFun → BoolElt, Map
IsIsomorphicOverQt(K, L): FldFun, FldFun → BoolElt, Map
Example: Is Subfield
- General Automorphisms
Isomorphisms(K, E): FldFunG, FldFunG → [Map]
IsIsomorphic(K, E): FldFunG, FldFunG → BoolElt, Map
Automorphisms(K): FldFunG → [Map]
Isomorphisms(K,E,p1,p2): FldFunG, FldFunG, PlcFunElt, PlcFunElt → [Map]
Automorphisms(K,p1,p2): FldFunG, PlcFunElt, PlcFunElt → [Map]
AutomorphismGroup(K): FldFunG → GrpFP, Map
AutomorphismGroup(K,f): FldFunG, Map → Grp, Map, SeqEnum
- Field Morphisms
- Global Function Fields
- Functions relative to the Exact Constant Field
NumberOfPlacesOfDegreeOverExactConstantField(F, m): FldFun, RngIntElt → RngIntElt
NumberOfPlacesDegECF(F, m): FldFun, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantField(F): FldFunG → RngIntElt
NumberOfPlacesOfDegreeOneECF(F): FldFunG → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantField(F, m): FldFunG, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneECF(F, m): FldFun, RngIntElt → RngIntElt
SerreBound(F): FldFunG → RngIntElt
SerreBound(F, m): FldFunG, RngIntElt → RngIntElt
SerreBound(q, g): RngIntElt, RngIntElt → RngIntElt
IharaBound(F): FldFunG → RngIntElt
IharaBound(F, m): FldFunG, RngIntElt → RngIntElt
IharaBound(q, g): RngIntElt, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneECFBound(F): FldFunG → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantFieldBound(F): FldFunG → RngIntElt
NumberOfPlacesOfDegreeOneECFBound(F, m): FldFun, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantFieldBound(F, m): FldFunG, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneECFBound(q, g): RngIntElt, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantFieldBound(q, g): RngIntElt, RngIntElt → RngIntElt
LPolynomial(F): FldFunG → RngUPolElt
LPolynomial(F, m): FldFunG, RngIntElt → RngUPolElt
ZetaFunction(F): FldFunG → FldFunRatUElt
ZetaFunction(F, m): FldFunG, RngIntElt → FldFunRatUElt
- Functions Relative to the Constant Field
Places(F, m): FldFunG, RngIntElt → SeqEnum[PlcFunElt]
HasPlace(F, m): FldFunG, RngIntElt → BoolElt, PlcFunElt
HasRandomPlace(F, m): FldFunG, RngIntElt → BoolElt, PlcFunElt
RandomPlace(F, m): FldFunG, RngIntElt → PlcFunElt
Example: Global Function Fields
Example: global1
- Functions related to Class Group
- Structure Predicates
- Homomorphisms
hom<F -> R | g>: FldFun, Rng, RngElt → Map
hom<F -> R | cf, g>: FldFun, Rng, Map, RngElt → Map
hom< O -> R | g >: RngFunOrd, Rng, RngElt → Map
hom< O -> R | cf, g >: RngFunOrd, Rng, Map, RngElt → Map
IsRingHomomorphism(m): Map → BoolElt
Example: hom
hom< O -> R | b₁, ..., bₙ >: RngFunOrd, Rng, RngElt, ..., RngElt → Map
hom< O -> R | m, b₁, ..., bₙ >: RngFunOrd, Rng, Map, RngElt, ..., RngElt → Map
- Elements
- Creation of Elements
F . 1: FldFun → FldFunElt
F . 2: FldFun → FldFunElt
Name(F, i): FldFun, RngIntElt → FldFunElt
O . i: RngFunOrd, RngIntElt → FldFunOrdElt
FF . i: FldFunOrd, RngIntElt → FldFunOrdElt
F ! a: FldFun, . → FldFunElt
elt<F | a>: FldFun, . → FldFunElt
O ! a: RngFunOrd, . → RngFunOrdElt
elt<O | a>: RngFunOrd, . → RngFunOrdElt
FF ! a: FldFunOrd, Any → FldFunOrdElt
elt<FF | a>: FldFunOrd, Any → FldFunOrdElt
elt< F | a₀, a₁, ..., aₙ₋₁>: FldFun, RngElt, ..., RngElt → FldFunElt
elt< O | a₁, a₂, ..., aₙ>: RngFunOrd, RngElt, ..., RngElt → RngFunOrdElt
elt< FF | a₁, a₂, ..., aₙ>: FldFunOrd, RngElt, ..., RngElt → FldFunOrdElt
One(F): FldFun → FldFunElt
One(O): RngFunOrd → RngFunOrdElt
Identity(F): FldFun → FldFunElt
Identity(O): RngFunOrd → RngFunOrdElt
Zero(F): FldFun → FldFunElt
Zero(O): RngFunOrd → RngFunOrdElt
Representative(F): FldFun → FldFunElt
Representative(O): RngFunOrd → RngFunOrdElt
Random(F, m): FldFunG, RngIntElt → FldFunElt
Random(O, m): RngFunOrd, RngIntElt → RngFunOrdElt
- Parent and Category
- Sequence Conversions
ElementToSequence(a): FldFunElt → SeqEnum[FldElt]
ElementToSequence(a): RngFunOrdElt → SeqEnum[RngElt]
ElementToSequence(a): FldFunOrdElt → SeqEnum[RngElt]
Eltseq(a): FldFunElt → SeqEnum[FldElt]
Eltseq(a): RngFunOrdElt → SeqEnum[RngElt]
Eltseq(a): FldFunOrdElt → SeqEnum[RngElt]
Eltseq(a, R): FldFunElt, FldFunG → [FldFunGElt]
Flat(a): FldFunElt → [FldFunGElt]
F ! [ a₀, a₁, ..., aₙ₋₁ ]: FldFun, SeqEnum → FldFunElt
O ! [ a₁, a₂, ..., aₙ ]: RngFunOrd, SeqEnum → RngFunOrdElt
Example: Elements
- Arithmetic Operators
+ a: FldFunElt → FldFunElt
+ a: RngFunOrdElt → RngFunOrdElt
+ a: FldFunOrdElt → FldFunOrdElt
- a: FldFunElt → FldFunElt
- a: RngFunOrdElt → RngFunOrdElt
- a: FldFunOrdElt → FldFunOrdElt
a + b: FldFunElt, FldFunElt → FldFunElt
a + b: RngFunOrdElt, RngFunOrdElt → RngFunOrdElt
a + b: FldFunOrdElt, FldFunOrdElt → FldFunOrdElt
a - b: FldFunElt, FldFunElt → FldFunElt
a - b: RngFunOrdElt, RngFunOrdElt → RngFunOrdElt
a - b: FldFunOrdElt, FldFunOrdElt → FldFunOrdElt
a * b: FldFunElt, FldFunElt → FldFunElt
a * b: RngFunOrdElt, RngFunOrdElt → RngFunOrdElt
a * b: FldFunOrdElt, FldFunOrdElt → FldFunOrdElt
a div b: FldFunElt, FldFunElt → FldFunElt
a div b: FldFunElt, RngElt → FldFunElt
a div b: RngFunOrdElt, RngFunOrdElt → RngFunOrdElt
a div b: RngFunOrdElt, RngElt → RngFunOrdElt
a / b: FldFunElt, FldFunElt → FldFunElt
a / b: RngFunOrdElt, RngFunOrdElt → FldFunGElt
a / b: FldFunOrdElt, FldFunOrdElt → FldFunOrdElt
a ^ k: FldFunElt, RngIntElt → FldFunElt
a ^ k: RngFunOrdElt, RngIntElt → RngFunOrdElt
a ^ k: FldFunOrdElt, RngIntElt → FldFunOrdElt
Modexp(a, k, m): RngFunOrdElt, RngIntElt, RngUPolElt → RngFunOrdElt
Modexp(a, k, m): RngFunOrdElt, RngIntElt, RngValElt → RngFunOrdElt
a mod I: RngFunOrdElt, RngFunOrdIdl → RngFunOrdElt
Modinv(a, m): RngFunOrdElt, RngFunOrdIdl → RngFunOrdElt
Modinv(a, m): RngFunOrdElt, RngUPolElt → RngFunOrdElt
Modinv(a, m): RngFunOrdElt, RngValElt → RngFunOrdElt
- Equality and Membership
a eq b: FldFunElt, FldFunElt → BoolElt
a eq b: RngFunOrdElt, RngFunOrdElt → BoolElt
a eq b: FldFunOrdElt, FldFunOrdElt → BoolElt
a ne b: FldFunElt, FldFunElt → BoolElt
a ne b: RngFunOrdElt, RngFunOrdElt → BoolElt
a ne b: FldFunOrdElt, FldFunOrdElt → BoolElt
a in F: RngElt, FldFun → BoolElt
a in O: RngElt, RngFunOrd → BoolElt
a in FF: RngElt, FldFunOrd → BoolElt
a notin F: RngElt, FldFun → BoolElt
a notin O: RngElt, RngFunOrd → BoolElt
a notin FF: RngElt, FldFunOrd → BoolElt
- Predicates on Elements
IsDivisibleBy(a, b): FldFunElt, FldFunElt → BoolElt, FldFunElt
IsDivisibleBy(a, b): RngFunOrdElt, RngFunOrdElt → BoolElt, RngFunOrdElt
IsZero(a): FldFunElt → BoolElt
IsZero(a): RngFunOrdElt → BoolElt
IsZero(a): FldFunOrdElt → BoolElt
IsOne(a): FldFunElt → BoolElt
IsOne(a): RngFunOrdElt → BoolElt
IsOne(a): FldFunOrdElt → BoolElt
IsMinusOne(a): FldFunElt → BoolElt
IsMinusOne(a): RngFunOrdElt → BoolElt
IsMinusOne(a): FldFunOrdElt → BoolElt
IsNilpotent(a): FldFunElt → BoolElt
IsNilpotent(a): RngFunOrdElt → BoolElt
IsIdempotent(a): FldFunElt → BoolElt
IsIdempotent(a): RngFunOrdElt → BoolElt
IsUnit(a): FldFunElt → BoolElt
IsUnit(a): RngFunOrdElt → BoolElt
IsUnit(a): FldFunOrdElt → BoolElt
IsZeroDivisor(a): FldFunElt → BoolElt
IsZeroDivisor(a): RngFunOrdElt → BoolElt
IsRegular(a): FldFunElt → BoolElt
IsRegular(a): RngFunOrdElt → BoolElt
IsIrreducible(a): FldFunElt → BoolElt
IsIrreducible(a): RngFunOrdElt → BoolElt
IsPrime(a): FldFunElt → BoolElt
IsPrime(a): RngFunOrdElt → BoolElt
IsSeparating(a): FldFunGElt → BoolElt
IsConstant(a): FldFunGElt → BoolElt, RngElt
IsConstant(a): RngFunOrdElt → BoolElt, RngElt
IsGlobalUnit(a): FldFunElt → BoolElt
IsGlobalUnitWithPreimage(a): FldFunElt → BoolElt, GrpAbElt
IsUnitWithPreimage(a): RngFunOrdElt → BoolElt, GrpAbElt
- Functions related to Norm and Trace
Trace(a): FldFunGElt → FldFunGElt
Trace(a): RngFunOrdElt → RngElt
Norm(a): FldFunGElt → FldFunGElt
Norm(a): RngFunOrdElt → RngElt
MinimalPolynomial(a): FldFunElt → RngUPolElt
MinimalPolynomial(a): RngFunOrdElt → RngUPolElt
MinimalPolynomial(a): FldFunOrdElt → RngUPolElt
CharacteristicPolynomial(a): FldFunElt → RngUPolElt
CharacteristicPolynomial(a): RngFunOrdElt → RngUPolElt
RepresentationMatrix(a): FldFunGElt → AlgMatElt
RepresentationMatrix(a): RngFunOrdElt → AlgMatElt
Trace(a, R): FldFunElt, Rng → RngElt
Trace(a, R): RngFunOrdElt, Rng → RngElt
Norm(a, R): FldFunElt, Rng → RngElt
Norm(a, R): RngFunOrdElt, Rng → RngElt
CharacteristicPolynomial(a, R): FldFunElt, Rng → RngUPolElt
CharacteristicPolynomial(a, R): RngFunOrdElt, Rng → RngUPolElt
MinimalPolynomial(a, R): FldFunElt, Rng → RngUPolElt
MinimalPolynomial(a, R): RngFunOrdElt, Rng → RngUPolElt
AbsoluteMinimalPolynomial(a): FldFunElt → RngUPolElt
RepresentationMatrix(a, R): FldFunGElt, Rng → AlgMatElt
RepresentationMatrix(a, R): RngFunOrdElt, Rng → AlgMatElt
Example: Elements Norm Trace
- Functions related to Orders and Integrality
IntegralSplit(a, O): FldFunElt, RngFunOrd → RngFunOrdElt, RngElt
IntegralSplit(a, O): RngFunOrdElt, RngFunOrd → RngFunOrdElt, RngElt
IntegralSplit(a, O): FldFunOrdElt, RngFunOrd → RngFunOrdElt, RngElt
Numerator(a, O): FldFunElt, RngFunOrd → RngFunOrdElt
Numerator(a): FldFunOrdElt → RngFunOrdElt
Numerator(a, O): FldFunOrdElt, RngFunOrd → RngElt
Denominator(a, O): FldFunElt, RngFunOrd → RngElt
Denominator(a): FldFunOrdElt → RngElt
Denominator(a, O): FldFunOrdElt, RngFunOrd → RngElt
Min(a, O): FldFunElt, RngFunOrd → RngElt, RngElt
Minimum(a, O): FldFunElt, RngFunOrd → RngElt, RngElt
Minimum(a, O): RngFunOrdElt, RngFunOrd → RngElt, RngElt
Min(a, O): RngFunOrdElt, RngFunOrd → RngElt, RngElt
- Functions related to Places and Divisors
Evaluate(a, P): FldFunElt, PlcFunElt → RngElt
Evaluate(a, P): RngFunOrdElt, PlcFunElt → RngElt
Lift(a, P): RngElt, PlcFunElt → FldFunElt
Valuation(a, P): FldFunElt, PlcFunElt → RngIntElt
Valuation(a, P): RngFunOrdElt, PlcFunElt → RngIntElt
Expand(a, P): FldFunGElt, PlcFunElt → RngSerElt, FldFunGElt
Development(a, P): FldFunGElt, PlcFunElt → RngSerElt
Divisor(a): FldFunGElt → DivFunElt
Divisor(a): RngFunOrdElt → DivFunElt
PrincipalDivisor(a): FldFunGElt → DivFunElt
PrincipalDivisor(a): RngFunOrdElt → DivFunElt
Zeros(a): FldFunGElt → [PlcFunElt]
Zeros(a): RngFunOrdElt → [PlcFunElt]
Zeroes(a): FldFunGElt → [PlcFunElt]
Zeroes(a): RngFunOrdElt → [PlcFunElt]
Zeros(F, a): FldFunG, FldFunGElt → [PlcFunElt]
Zeroes(F, a): FldFunG, FldFunGElt → [PlcFunElt]
Poles(a): FldFunGElt → SeqEnum[PlcFunElt]
Poles(a): RngFunOrdElt → SeqEnum[PlcFunElt]
Poles(F, a): FldFun, FldFunGElt → [PlcFunElt]
Degree(a): FldFunElt → RngIntElt
Degree(a): RngFunOrdElt → RngIntElt
CommonZeros(L): [FldFunGElt] → [PlcFunElt]
CommonZeros(F, L): FldFunG, SeqEnum[ FldFunGElt ] → SeqEnum[ PlcFunElt ]
Example: elements
Module(L, R): SeqEnum[ FldFunGElt ], Rng → Mod, Map, SeqEnum[ ModElt ]
Relations(L, R): SeqEnum[ FldFunElt ], Rng → ModTupRng
Relations(L, R, m): SeqEnum[ FldFunElt ], Rng, RngIntElt → ModTupRng
Roots(f, D): RngUPolElt, DivFunElt → SeqEnum[ FldFunElt ]
Example: module
- Other Operations on Elements
ProductRepresentation(a): FldFunGElt → [FldFunGElt], [RngIntElt]
ProductRepresentation(a): RngFunOrdElt → [RngElt], [RngIntElt]
ProductRepresentation(Q, S): [FldFunGElt], [RngIntElt] → FldFunGElt
PowerProduct(Q, S): [FldFunGElt], [RngIntElt] → FldFunGElt
RationalFunction(a): FldFunGElt → RngElt
RationalFunction(a, R): FldFunGElt, Rng → RngElt
Differentiation(x, a): FldFunGElt, FldFunGElt → FldFunGElt
Differentiation(x, n, a): FldFunGElt, RngIntElt, FldFunGElt → FldFunGElt
DifferentiationSequence(x, n, a): FldFunGElt, RngIntElt, FldFunGElt → SeqEnum
PrimePowerRepresentation(x, k, a): FldFunGElt, RngIntElt, FldFunGElt → SeqEnum
Different(a): RngFunOrdElt → RngFunOrdElt
RationalReconstruction(e, f): FldFunElt, RngUPolElt → BoolElt, FldFunElt
CoefficientHeight(a): RngFunOrdElt → RngIntElt
CoefficientHeight(a): FldFunElt → RngIntElt
CoefficientLength(a): RngFunOrdElt → RngIntElt
CoefficientLength(a): FldFunElt → RngIntElt
Example: Elements Other Ops
- Ideals
- Creation of Ideals
ideal< O | a₁, a₂, ... , aₘ >: RngFunOrd, RngElt, ..., RngElt → RngFunOrdIdl
ideal< O | T, d >: RngFunOrd, AlgMatElt, RngElt → RngFunOrdIdl
ideal< O | T, d >: RngFunOrd, ModDed, RngElt → RngFunOrdIdl
ideal< O | T, S >: RngFunOrd, AlgMatElt, [RngFunOrdIdl] → RngFunOrdIdl
ideal< O | T, I₁, ..., Iₙ >: RngFunOrd, AlgMatElt, RngFunOrdIdl, ..., RngFunOrdIdl → RngFunOrdIdl
x * O: RngElt, RngFunOrd → RngFunOrdIdl
O * x: RngFunOrd, RngElt → RngFunOrdIdl
Ideal(P): PlcFunElt → RngFunOrdIdl
Ideals(D): DivFunElt → RngFunOrdIdl, RngFunOrdIdl
O !! I: RngFunOrd, RngFunOrdIdl → RngFunOrdIdl
- Parent and Category
- Arithmetic Operators
I + J: RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
I * J: RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
I / J: RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
I ^ k: RngFunOrdIdl, RngIntElt → RngFunOrdIdl
c * I: RngElt, RngFunOrdIdl → RngFunOrdIdl
I * c: RngFunOrdIdl, RngElt → RngFunOrdIdl
I / c: RngFunOrdIdl, RngElt → RngFunOrdIdl
c / I: RngElt, RngFunOrdIdl → RngFunOrdIdl
IdealQuotient(I, J): RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
ColonIdeal(I, J): RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
ChineseRemainderTheorem(I1, I2, e1, e2): RngFunOrdIdl, RngFunOrdIdl, RngFunOrdElt, RngFunOrdElt → RngFunOrdElt
CRT(I1, I2, e1, e2): RngFunOrdIdl, RngFunOrdIdl, RngFunOrdElt, RngFunOrdElt → RngOrdElt
- Roots of Ideals
- Equality and Membership
- Predicates on Ideals
IsZero(I): RngFunOrdIdl → BoolElt
IsOne(I): RngFunOrdIdl → BoolElt
IsIntegral(I): RngFunOrdIdl → BoolElt
IsPrime(I): RngFunOrdIdl → BoolElt
IsPrincipal(I): RngFunOrdIdl → BoolElt, FldFunElt
- Predicates on Prime Ideals
IsInert(P): RngFunOrdIdl → BoolElt
IsInert(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsInert(P, O): RngElt, RngFunOrd → BoolElt
IsRamified(P): RngFunOrdIdl → BoolElt
IsRamified(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsRamified(P, O): RngElt, RngFunOrd → BoolElt
IsSplit(P): RngFunOrdIdl → BoolElt
IsSplit(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsSplit(P, O): RngElt, RngFunOrd → BoolElt
IsTamelyRamified(P): RngFunOrdIdl → BoolElt
IsTamelyRamified(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsTamelyRamified(P, O): RngElt, RngFunOrd → BoolElt
IsTotallyRamified(P): RngFunOrdIdl → BoolElt
IsTotallyRamified(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsTotallyRamified(P, O): RngElt, RngFunOrd → BoolElt
IsTotallySplit(P): RngFunOrdIdl → BoolElt
IsTotallySplit(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsTotallySplit(P, O): RngElt, RngFunOrd → BoolElt
IsUnramified(P): RngFunOrdIdl → BoolElt
IsUnramified(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsUnramified(P, O): RngElt, RngFunOrd → BoolElt
IsWildlyRamified(P): RngFunOrdIdl → BoolElt
IsWildlyRamified(P, O): RngFunOrdIdl, RngFunOrd → BoolElt
IsWildlyRamified(P, O): RngElt, RngFunOrd → BoolElt
- Further Ideal Operations
I meet J: RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
Gcd(I, J): RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
Lcm(I, J): RngFunOrdIdl, RngFunOrdIdl → RngFunOrdIdl
Factorization(I): RngFunOrdIdl → [ <RngFunOrdIdl, RngIntElt> ]
Factorisation(I): RngFunOrdIdl → [<RngFunOrdIdl, RngIntElt>]
Decomposition(O, p): RngFunOrd, RngElt → [ RngFunOrdIdl ]
Decomposition(O, p): RngFunOrd, RngFunOrdIdl → [ RngFunOrdIdl ]
Decomposition(O): RngFunOrd → [ RngFunOrdIdl ]
DecompositionType(O, p): RngFunOrd, RngElt → [ <RngIntElt, RngIntElt> ]
DecompositionType(O, p): RngFunOrd, RngFunOrdIdl → [ <RngIntElt, RngIntElt> ]
DecompositionType(O): RngFunOrd → [ <RngIntElt, RngIntElt> ]
MultiplicatorRing(I): RngFunOrdIdl → RngFunOrd
pMaximalOrder(O, p): RngFunOrd, RngFunOrdIdl → RngFunOrd
pRadical(O, p): RngFunOrd, RngFunOrdIdl → RngFunOrdIdl
Valuation(a, P): RngElt, RngFunOrdIdl → RngIntElt
Valuation(I, P): RngFunOrdIdl, RngFunOrdIdl → RngIntElt
Order(I): RngFunOrdIdl → RngFunOrd
Denominator(I): RngFunOrdIdl → RngElt
Minimum(I): RngFunOrdIdl → Any
I meet R: RngFunOrdIdl, Rng → Any
IntegralSplit(I): RngFunOrdIdl → RngFunOrdIdl, RngElt
Norm(I): RngFunOrdIdl → Any
TwoElement(I): RngFunOrdIdl → RngElt, RngElt
Generators(I): RngFunOrdIdl → [ RngFunOrdElt ]
Basis(I): RngFunOrdIdl → [FldFunElt]
Basis(I, R): RngFunOrdIdl, Rng → [ RngElt ]
BasisMatrix(I): RngFunOrdIdl → AlgMatElt
TransformationMatrix(I): RngFunOrdIdl → AlgMatElt, RngElt
CoefficientIdeals(I): RngFunOrdIdl → [RngFunOrdIdl]
Different(I): RngFunOrdIdl → RngFunOrdIdl
Codifferent(I): RngFunOrdIdl → RngFunOrdIdl
Divisor(I): RngFunOrdIdl → DivFunElt
Divisor(I, J): RngFunOrdIdl, RngFunOrdIdl → DivFunElt
CoefficientHeight(I): RngFunOrdIdl → RngIntElt
CoefficientLength(I): RngFunOrdIdl → RngIntElt
Example: ideals
- Functions on Prime Ideals
- Quotient Rings
- Operations on Quotient Rings
quo< O | I >: RngFunOrd, RngFunOrdIdl → RngFunOrdRes
quo< O | M >: RngFunOrd, ModDed → RngFunOrdRes
quo< O | M >: RngFunOrd, AlgMatElt → RngFunOrdRes
quo< O | S >: RngFunOrd, RngElt, ..., RngElt → RngFunOrdRes
quo< O | p >: RngFunOrd, RngUPolElt → RngFunOrdRes
quo< O | p, r >: RngFunOrd, RngUPolElt, RngIntElt → RngFunOrdRes
Modulus(OQ): RngFunOrdRes → RngFunOrdIdl
Example: quotient
- Elements of Quotients
- Places
- Creation of Structures
- Creation of Elements
- General Function Field Places
Decomposition(F, P): FldFunG, PlcFunElt → [ PlcFunElt ]
DecompositionType(F, P): FldFun, PlcFunElt → [ <RngIntElt, RngIntElt> ]
Zeros(a): FldFunElt → [ PlcFunElt ]
Zeros(a): RngFunOrdElt → [ PlcFunElt ]
Poles(a): FldFunElt → [ PlcFunElt ]
Poles(a): RngFunOrdElt → [ PlcFunElt ]
S ! I: PlcFun, RngFunOrdIdl → PlcFunElt
Place(I): RngFunOrdIdl → PlcFunElt
Support(D): DivFunElt → [ PlcFunElt ], [ RngIntElt ]
Support(P): PlcFunElt → [ PlcFunElt ], [ RngIntElt ]
AssignNames(~P, s): PlcFunElt, [ MonStgElt ]
InfinitePlaces(F): FldFun → [PlcFunElt]
- Global Function Field Places
- Related Structures
- Structure Invariants
- General Function Fields
- Global Function Fields
NumberOfPlacesOfDegreeOneOverExactConstantField(F, m): FldFun, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneECF(F, m): FldFunG, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneOverExactConstantFieldBound(F, m): FldFun, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOneECFBound(F, m): FldFunG, RngIntElt → RngIntElt
NumberOfPlacesOfDegreeOverExactConstantField(F, m): FldFunG, RngIntElt → RngIntElt
NumberOfPlacesDegECF(F, m): FldFunG, RngIntElt → RngIntElt
- Structure Predicates
- Element Operations
- Parent and Category
- Arithmetic Operators
- Equality and Membership
- Predicates on Elements
- Other Element Operations
FunctionField(P): PlcFunElt → FldFun
Degree(P): PlcFunElt → RngIntElt
RamificationIndex(P): PlcFunElt → RngIntElt
RamificationDegree(P): PlcFunElt → RngIntElt
InertiaDegree(P): PlcFunElt → RngIntElt
ResidueClassDegree(P): PlcFunElt → RngIntElt
Minimum(P): PlcFunElt → RngElt
ResidueClassField(P): PlcFunElt → Rng, Map
Evaluate(a, P): RngElt, PlcFunElt → RngElt
Lift(a, P): RngElt, PlcFunElt → FldFunElt
Lift(i, P): Infty, PlcFunElt → FldFunElt
TwoGenerators(P): PlcFunElt → FldFunGElt, FldFunGElt
LocalUniformizer(P): PlcFunElt → FldFunGElt
UniformizingElement(P): PlcFunElt → FldFunGElt
Valuation(a, P): FldFunElt, PlcFunElt → RngIntElt
Ideal(P): PlcFunElt → RngFunOrdIdl
Norm(P): PlcFunElt → DivFunElt
Example: places
- Completion at Places
- Divisors
- Creation of Structures
- Creation of Elements
- Related Structures
- Structure Invariants
- Structure Predicates
- Element Operations
- Arithmetic Operators
- D: DivFunElt → DivFunElt
D1 + D2: DivFunElt, DivFunElt → DivFunElt
D1 - D2: DivFunElt, DivFunElt → DivFunElt
k * D: RngIntElt, DivFunElt → DivFunElt
D div k: DivFunElt, RngIntElt → DivFunElt
D mod k: DivFunElt, RngIntElt → DivFunElt
P + D: PlcFunElt, DivFunElt → DivFunElt
D + P: DivFunElt, PlcFunElt → DivFunElt
D - P: DivFunElt, PlcFunElt → DivFunElt
P - D: PlcFunElt, DivFunElt → DivFunElt
Quotrem(D, k): DivFunElt, RngIntElt → DivFunElt, DivFunElt
GCD(D1, D2): DivFunElt, DivFunElt → DivFunElt
Gcd(D1, D2): DivFunElt, DivFunElt → DivFunElt
GreatestCommonDivisor(D1, D2): DivFunElt, DivFunElt → DivFunElt
LCM(D1, D2): DivFunElt, DivFunElt → DivFunElt
Lcm(D1, D2): DivFunElt, DivFunElt → DivFunElt
LeastCommonMultiple(D1, D2): DivFunElt, DivFunElt → DivFunElt
- Equality, Comparison and Membership
- Predicates on Elements
- Other Element Operations
FunctionField(D): DivFunElt → FldFun
Degree(D): DivFunElt → RngIntElt
Support(D): DivFunElt → [ PlcFunElt ]
Numerator(D): DivFunElt → DivFunElt
ZeroDivisor(D): DivFunElt → DivFunElt
Denominator(D): DivFunElt → DivFunElt
PoleDivisor(D): DivFunElt → DivFunElt
Ideals(D): DivFunElt → RngFunOrdIdl, RngFunOrdIdl
Norm(D): DivFunElt → DivFunElt
FiniteSplit(D): DivFunElt → DivFunElt, DivFunElt
FiniteDivisor(D): DivFunElt → DivFunElt
InfiniteDivisor(D): DivFunElt → DivFunElt
Dimension(D): DivFunElt → RngIntElt
IndexOfSpeciality(D): DivFunElt → RngIntElt
ShortBasis(D : parameters): DivFunElt → [RngElt], [RngIntElt]
Basis(D : parameters): DivFunElt → [ FldFunElt ]
RiemannRochSpace(D): DivFunElt → ModFld, Map
RiemannRochSpace(P): PlcFunElt → ModFld, Map
Valuation(D, P): DivFunElt, PlcFunElt → RngIntElt
Reduction(D): DivFunElt → DivFunElt, RngIntElt, DivFunElt, FldFunElt
Reduction(D, A): DivFunElt, DivFunElt → DivFunElt, RngIntElt, DivFunElt, FldFunElt
GapNumbers(D, P): DivFunElt, PlcFunElt → SeqEnum[RngIntElt]
GapNumbers(D): DivFunElt → SeqEnum[RngIntElt]
Example: divisors
Example: Alg Reln1
Example: Alg Reln2
RamificationDivisor(D): DivFunElt → DivFunElt
WeierstrassPlaces(D): DivFunElt → [PlcFunElt]
IsWeierstrassPlace(D, P): DivFunElt, PlcFunElt → BoolElt
WronskianOrders(D): DivFunElt → [RngIntElt]
ComplementaryDivisor(D): DivFunElt → DivFunElt
DifferentialBasis(D): DivFunElt → [DiffFunElt]
DifferentialSpace(D): DivFunElt → ModFld, Map
Parametrization(F, D): FldFun, DivFunElt → FldFunElt, [FldFunRatUElt]
- Functions related to Divisor Class Groups of Global Function Fields
ClassGroupGenerationBound(q, g): RngIntElt, RngIntElt → RngIntElt
ClassGroupGenerationBound(F): FldFunG → RngIntElt
ClassNumberApproximation(F, e): FldFunG, FldReElt → FldReElt
ClassNumberApproximationBound(q, g, e): RngIntElt, RngIntElt, FldReElt → RngIntElt
ClassGroup(F : parameters): FldFun → GrpAb, Map, Map
ClassGroupAbelianInvariants(F : parameters): FldFun → SeqEnum
ClassNumber(F): FldFun → RngIntElt
Example: Divisors Class
GlobalUnitGroup(F): FldFun → GrpAb, Map
IsGlobalUnit(a): FldFunElt → BoolElt
IsGlobalUnitWithPreimage(a): FldFunElt → BoolElt, GrpAbElt
PrincipalDivisorMap(F): FldFunG → Map
ClassGroupExactSequence(F): FldFunG → Map, Map, Map
SUnitGroup(S): SetEnum[PlcFunElt] → GrpAb, Map
IsSUnit(a, S): FldFunElt, SetEnum[PlcFunElt] → BoolElt
IsSUnitWithPreimage(a, S): FldFunElt, SetEnum[PlcFunElt] → BoolElt, GrpAbElt
SRegulator(S): SetEnum[PlcFunElt] → RngIntElt
SPrincipalDivisorMap(S): SetEnum[PlcFunElt] → Map
IsSPrincipal(D, S): DivFunElt, SetEnum[PlcFunElt] → BoolElt, FldFunElt
SClassGroup(S): SetEnum[PlcFunElt] → GrpAb, Map, Map
SClassGroupExactSequence(S): SetEnum[PlcFunElt] → Map, Map, Map
SClassGroupAbelianInvariants(S): SetEnum[PlcFunElt] → SeqEnum
SClassNumber(S): SetEnum[PlcFunElt] → RngIntElt
ClassGroupPRank(F): FldFunG → RngIntElt
HasseWittInvariant(F): FldFunG → RngIntElt
TateLichtenbaumPairing(D1, D2, m): DivFunElt, DivFunElt, RngIntElt → RngElt
Example: tate
- Differentials
- Creation of Structures
- Creation of Elements
- Related Structures
- Subspaces
- Structure Predicates
- Operations on Elements
- Arithmetic Operators
- Equality and Membership
- Predicates on Elements
- Functions on Elements
Valuation(d, P): DiffFunElt, PlcFunElt → RngIntElt
Divisor(d): DiffFunElt → DivFunElt
Residue(d, P): DiffFunElt, PlcFunElt → RngElt
Example: Diff Fun
Module(L, R): SeqEnum[ DiffFunElt ], Rng → Mod, Map, SeqEnum[ ModElt ]
Relations(L, R): SeqEnum[ DiffFunElt ], Rng → ModTupRng
Relations(L, R, m): SeqEnum[ DiffFunElt ], Rng, RngIntElt → ModTupRng
Example: Module Diff
Cartier(b): DiffFunElt → DiffFunElt
Cartier(b, r): DiffFunElt, RngIntElt → DiffFunElt
- Other
- Weil Descent
WeilDescent(E,k): FldFun, FldFin → FldFunG, Map
ArtinSchreierExtension(c,a,b): FldFin, FldFin, FldFin → FldFun
WeilDescentDegree(E,k): FldFun, FldFin → RngIntElt
WeilDescentGenus(E,k): FldFun, FldFin → RngIntElt
MultiplyFrobenius(b,f,F): RngElt, RngUPolElt, Map → RngElt
Example: Ghs Descent
- Function Field Database
- The Montes Algorithm
Montes(f, p): RngUPolElt, RngUPolElt → SeqEnum, SeqEnum, RngIntElt
Example: Montes Eg 1
Montes(K, p): FldArith, RngElt
Example: Montes Eg 2
SFL(P, s): OMIdl, RngIntElt
Example: sfl
SetUseMontes(f): BoolElt
SetUseMontes(t, f): Cat, BoolElt
GetUseMontes(t): Cat → BoolElt
SetVerbose("Montes", v): MonStgElt, RngIntElt
- Ideals in OM Representation
- Ideal Operations
pIntegralBasis(I, p): OMIdl, RngElt → SeqEnum
SIntegralBasis(I, S): OMIdl, SeqEnum → SeqEnum
SIntegralBasis(I, S): RngOrdFracIdl, [RngIntElt] → SeqEnum
SIntegralBasis(I, S): RngFunOrdIdl, [RngUPolElt] → SeqEnum
Basis(I): OMIdl → SeqEnum
Example: Om Ideal Op
TwoElement(I): OMIdl → FldArithElt, FldArithElt
Norm(I): OMIdl → RngElt
Valuation(alpha, P : parameters): FldArithElt, OMIdl → RngIntElt, FldElt
Valuation(alpha, P : parameters): FldRatElt, OMIdl → RngIntElt, FldElt
Valuation(alpha, P : parameters): RngIntElt, OMIdl → RngIntElt, FldElt
Valuation(alpha, P : parameters): RngUPolElt, OMIdl → RngIntElt, FldElt
Valuation(I, P): OMIdl, OMIdl → RngIntElt
a mod P: FldArithElt, OMIdl → FldArithElt
Reduction(a, P): FldArithElt, OMIdl → FldArithElt
Reduction(a, P, m): FldArithElt, OMIdl, RngIntElt → [FldArithElt]
Factorization(I): OMIdl → SeqEnum
Factorisation(I): OMIdl → SeqEnum
Example: Om Ideal Ops
ResidueField(I): OMIdl → Fld
Degree(I): OMIdl → RngIntElt
Example: Om Ideals Deg Res
- Divisors in OM representation