[Next][Prev] [Right] [____] [Up] [Index] [Root]
Acknowledgements
Introduction
Creation Functions
Creation of Number Fields
Maximal Orders
Creation of Elements
Creation of Homomorphisms
Structure Operations
General Functions
Related Structures
Representing Fields as Vector Spaces
Invariants
Basis Representation
Ring Predicates
Field Predicates
Element Operations
Parent and Category
Arithmetic
Equality and Membership
Predicates on Elements
Finding Special Elements
Real and Complex Valued Functions
Norm, Trace, and Minimal Polynomial
Other Functions
Class and Unit Groups
Galois Theory
Solving Norm Equations
Places and Divisors
Creation of Structures
Operations on Structures
Creation of Elements
Arithmetic with Places and Divisors
Other Functions for Places and Divisors
Bibliography
DETAILS
Introduction
Example FldNum_Q-as-number-field (H31E1)
Creation Functions
Creation of Number Fields
NumberField(f) : RngUPolElt -> FldNum
NumberField(Q) : FldRat -> FldNum
NumberField(s) : [ RngUPolElt ] -> FldNum
ext< F | s1, ..., sn > : FldNum, RngUPolElt, ..., RngUPolElt -> FldNum
Example FldNum_Creation (H31E2)
RadicalExtension(F, d, a) : Rng, RngIntElt, RngElt -> FldNum
SplittingField(F) : FldNum -> FldNum, SeqEnum
SplittingField(f) : RngUPolElt -> FldNum
SplittingField(L) : [RngUPolElt] -> FldNum, [FldNumElt]
sub< F | e1, ..., en > : FldAlg, FldAlgElt, ..., FldAlgElt -> FldAlg, Map
MergeFields(F, L) : FldNum, FldNum -> SeqEnum
Compositum(K, L) : FldNum, FldNum -> FldNum
quo< FldNum : R | f > : RngUPol, RngUPolElt -> FldNum
Example FldNum_CompositeFields (H31E3)
OptimizedRepresentation(F) : FldNum -> FldNum, map
Example FldNum_opt-rep (H31E4)
Maximal Orders
MaximalOrder(F) : FldNum -> RngOrd
Creation of Elements
F ! a : FldNum, RngElt -> FldNumElt
F ! [a0, a1, ..., a1] : FldNum, [RngElt] -> FldNumElt
Random(F, m) : FldNum, RngIntElt -> FldNumElt
Example FldNum_Elements (H31E5)
Creation of Homomorphisms
hom< F -> R | r > : FldNum, Rng, RngElt -> Map
Example FldNum_Homomorphisms (H31E6)
Structure Operations
General Functions
AssignNames(~K, s) : FldNum, [ MonStgElt ] ->
Name(K, i) : FldNum, RngIntElt -> FldNumElt
Related Structures
GroundField(F) : FldNum -> Fld
AbsoluteField(F) : FldNum -> FldNum
SimpleExtension(F) : FldNum -> FldNum
RelativeField(F, L) : FldNum, FldNum -> FldNum
Example FldNum_Compositum (H31E7)
Embed(F, L, a) : FldNum, FldNum, FldNumElt ->
Embed(F, L, a) : FldNum, FldNum, [FldNumElt] ->
EmbeddingMap(F, L): FldNum, FldNum -> Map
Example FldNum_em (H31E8)
MinkowskiSpace(F) : FldNum -> Lat, Map
Completion(K, P) : FldNum, RngOrdIdl -> FldLoc, Map
Completion(K, P) : FldNum, PlcNumElt -> FldLoc, Map
Representing Fields as Vector Spaces
Algebra(K, J) : FldNum, Fld -> AlgAss, Map
VectorSpace(K, J) : FldNum, Fld -> ModTupFld, Map
Example FldNum_vector_space_eg (H31E9)
Invariants
Degree(F) : FldNum -> RngIntElt
AbsoluteDegree(F) : FldNum -> RngIntElt
Discriminant(F) : FldNum -> RngIntElt
AbsoluteDiscriminant(K) : FldNum -> FldRatElt
Regulator(K) : FldNum -> FldComElt
RegulatorLowerBound(K) : FldNum -> FldComElt
Signature(F) : FldAlg -> RngIntElt, RngIntElt
UnitRank(K) : FldNum -> RngIntElt
DefiningPolynomial(F) : FldNum -> RngUPolElt
Zeroes(F, n) : FldNum, RngIntElt -> [ FldComElt ]
Example FldNum_zero (H31E10)
Basis Representation
Basis(F) : FldNum -> [ FldNumElt ]
IntegralBasis(F) : FldNum -> [ FldNumElt ]
Example FldNum_basis-ring (H31E11)
AbsoluteBasis(K) : FldNum -> [FldNumElt]
Example FldNum_Bases (H31E12)
Ring Predicates
F eq L : FldNum, FldNum -> BoolElt
IsEuclideanDomain(F) : FldNum -> BoolElt
IsSimple(F) : FldNum -> BoolElt
IsPrincipalIdealRing(F) : FldNum -> BoolElt
HasComplexConjugate(K) : FldNum -> BoolElt, Map
ComplexConjugate(x) : FldNumElt -> FldNumElt
Field Predicates
IsIsomorphic(F, L) : FldNum, FldNum -> BoolElt, Map
IsSubfield(F, L) : FldNum, FldNum -> BoolElt, Map
IsNormal(F) : FldNum -> BoolElt
IsAbelian(F) : FldNum -> BoolElt
IsCyclic(F) : FldNum -> BoolElt
IsAbsoluteField(K) : FldNum -> BoolElt
Element Operations
Parent and Category
Arithmetic
Sqrt(a) : FldNumElt -> FldNumElt
Root(a, n) : FldNumElt, RngIntElt -> FldNumElt
IsPower(a, k) : FldNumElt, RngIntElt -> BoolElt, FldNumElt
Denominator(a) : FldNumElt -> RngIntElt
Numerator(a) : FldNumElt -> RngIntElt
Qround(E, M): FldNumElt, RngIntElt -> FldNumElt
Equality and Membership
Predicates on Elements
IsIntegral(a) : FldNumElt -> BoolElt
IsPrimitive(a) : FldNumElt -> BoolElt
IsTotallyPositive(a) : FldNumElt -> BoolElt
Finding Special Elements
K . 1 : FldNum -> FldNumElt
PrimitiveElement(K) : FldNum -> FldNumElt
Generators(K): FldNum -> FldNumElt
GeneratorsOverBaseRing(K) : FldNum -> FldNumElt
GeneratorsSequence(K): FldNum -> [FldNumElt]
GeneratorsSequenceOverBaseRing(K) : FldNum -> [FldNumElt]
Generators(K, k) : FldAlg, FldAlg -> [FldAlgElt]
Real and Complex Valued Functions
AbsoluteValues(a) : FldNumElt -> [FldComElt]
AbsoluteLogarithmicHeight(a) : FldNumElt -> FldComElt
Conjugates(a) : FldNumElt -> [ FldComElt ]
Conjugate(a, k) : FldNumElt, RngIntElt -> FldComElt
Conjugate(a, l) : FldNumElt, [RngIntElt] -> FldComElt
Length(a) : FldNumElt -> FldReElt
Logs(a) : FldNumElt -> [FldReElt]
CoefficientHeight(E) : FldNumElt -> RngIntElt
CoefficientLength(E) : FldNumElt -> RngIntElt
Norm, Trace, and Minimal Polynomial
Norm(a) : FldNumElt -> FldNumElt
AbsoluteNorm(a) : FldNumElt -> FldRatElt
Trace(a) : FldNumElt -> FldNumElt
AbsoluteTrace(a) : FldNumElt -> FldRatElt
CharacteristicPolynomial(a) : FldNumElt -> RngUPolElt
AbsoluteCharacteristicPolynomial(a) : FldNumElt -> RngUPolElt
MinimalPolynomial(a) : FldNumElt -> RngUPolElt
AbsoluteMinimalPolynomial(a) : FldNumElt -> RngUPolElt
RepresentationMatrix(a) : FldNumElt -> NumMatElt
AbsoluteRepresentationMatrix(a) : FldNumElt -> NumMatElt
Example FldNum_NormsEtc (H31E13)
Other Functions
ElementToSequence(a) : FldNumElt -> [ FldNumElt ]
Eltseq(E, k) : FldNumElt, FldNum -> [RngElt]
Flat(e) : FldNumElt -> [ FldRatElt]
a[i] : FldNumElt, RngIntElt -> FldRatElt
ProductRepresentation(a) : FldNumElt -> [ FldNumElt ], [ RngIntElt ]
ProductRepresentation(P, E) : [ FldNumElt ], [ RngIntElt ] -> FldNumElt
Class and Unit Groups
ClassGroup(K: parameters) : FldNum -> GrpAb, Map
ConditionalClassGroup(K) : FldNum -> GrpAb, Map
ClassNumber(K: parameters) : FldNum -> RngIntElt
BachBound(K) : FldNum -> RngIntElt
MinkowskiBound(K) : FldNum -> RngIntElt
UnitGroup(K) : FldNum -> GrpAb, Map
TorsionUnitGroup(K) : FldNum -> GrpAb, Map
UnitRank(K) : FldNum -> RngIntElt
Example FldNum_UnitGroup (H31E14)
Galois Theory
GaloisGroup(K) : FldNum -> GrpPerm, [RngElt], GaloisData
Solving Norm Equations
NormEquation(F, m) : FldNum, RngIntElt -> BoolElt, [ FldNumElt ]
NormEquation(m, N): RngElt, Map -> BoolElt, RngElt
SimNEQ(K, e, f) : FldNum, FldNumElt, FldNumElt -> BoolElt, [FldNumElt]
Example FldNum_norm-equation (H31E15)
Places and Divisors
Creation of Structures
Places(K) : FldNum -> PlcNum
Operations on Structures
NumberField(P) : PlcNum -> FldNum
Creation of Elements
Place(I) : RngOrdIdl -> PlcNumElt
Decomposition(K, p) : FldNum, RngIntElt -> SeqEnum
Decomposition(K, p) : FldNum, PlcNumElt -> SeqEnum
Decomposition(m, p) :Map[FldRat, FldNum], RngIntElt -> SeqEnum[<PlcNumElt, RngIntElt>]
InfinitePlaces(K) : FldNum -> SeqEnum
Divisor(pl) : PlcNumElt -> DivNumElt
Divisor(I) : RngOrdFracIdl -> DivNumElt
Divisor(x) : FldNumElt -> DivNumElt
RealPlaces(K) : FldRat -> [PlcNumElt]
Arithmetic with Places and Divisors
Other Functions for Places and Divisors
Valuation(a, p) : FldNumElt, PlcNumElt -> RngElt
Valuation(I, p) : RngOrdFracIdl , PlcNumElt -> RngElt
Support(D) : DivNumElt -> SeqEnum, SeqEnum
Ideal(D) : DivNumElt -> RngOrdIdl
Evaluate(x, p) : FldNumElt, PlcNumElt -> RngElt
RealEmbeddings(a) : FldNumElt -> []
RealSigns(a) : FldNumElt -> []
IsReal(p) : PlcNumElt -> BoolElt
IsComplex(p) : PlcNumElt -> BoolElt
IsFinite(p) : PlcNumElt -> BoolElt
IsInfinite(p) : PlcNumElt -> BoolElt, RngIntElt
Extends(P, p) : PlcNumElt, PlcNumElt -> BoolElt
InertiaDegree(P) : PlcNumElt -> RngIntElt
Degree(D) : DivNumElt -> RngElt
NumberField(P) : PlcNumElt -> FldNum
ResidueClassField(P) : PlcNumElt -> Fld
UniformizingElement(P) : PlcNumElt -> FldNumElt
LocalDegree(P) : PlcNumElt -> RngIntElt
RamificationIndex(P) : PlcNumElt -> RngIntElt
Bibliography
[Next][Prev] [Right] [____] [Up] [Index] [Root]
|
