FieldOfPrimeCharacteristic

ffcat.spad line 1 [edit on github]

FieldOfPrimeCharacteristic is the category of fields of prime characteristic, e.g. finite fields, algebraic closures of fields of prime characteristic, transcendental extensions of of fields of prime characteristic.

* : (%, %) -> %

from Magma

* : (%, Fraction(Integer)) -> %

from RightModule(Fraction(Integer))

* : (Fraction(Integer), %) -> %

from LeftModule(Fraction(Integer))

* : (Integer, %) -> %

from AbelianGroup

* : (NonNegativeInteger, %) -> %

from AbelianMonoid

* : (PositiveInteger, %) -> %

from AbelianSemiGroup

+ : (%, %) -> %

from AbelianSemiGroup

- : % -> %

from AbelianGroup

- : (%, %) -> %

from AbelianGroup

/ : (%, %) -> %

from Field

0 : () -> %

from AbelianMonoid

1 : () -> %

from MagmaWithUnit

= : (%, %) -> Boolean

from BasicType

^ : (%, Integer) -> %

from DivisionRing

^ : (%, NonNegativeInteger) -> %

from MagmaWithUnit

^ : (%, PositiveInteger) -> %

from Magma

annihilate? : (%, %) -> Boolean

from Rng

antiCommutator : (%, %) -> %

from NonAssociativeSemiRng

associates? : (%, %) -> Boolean

from EntireRing

associator : (%, %, %) -> %

from NonAssociativeRng

characteristic : () -> NonNegativeInteger

from NonAssociativeRing

charthRoot : % -> Union(%, "failed")

from CharacteristicNonZero

coerce : % -> %

from Algebra(%)

coerce : Fraction(Integer) -> %

from Algebra(Fraction(Integer))

coerce : Integer -> %

from NonAssociativeRing

coerce : % -> OutputForm

from CoercibleTo(OutputForm)

commutator : (%, %) -> %

from NonAssociativeRng

discreteLog : (%, %) -> Union(NonNegativeInteger, "failed")

discreteLog(b, a) computes s with b^s = a if such an s exists.

divide : (%, %) -> Record(quotient : %, remainder : %)

from EuclideanDomain

euclideanSize : % -> NonNegativeInteger

from EuclideanDomain

expressIdealMember : (List(%), %) -> Union(List(%), "failed")

from PrincipalIdealDomain

exquo : (%, %) -> Union(%, "failed")

from EntireRing

extendedEuclidean : (%, %) -> Record(coef1 : %, coef2 : %, generator : %)

from EuclideanDomain

extendedEuclidean : (%, %, %) -> Union(Record(coef1 : %, coef2 : %), "failed")

from EuclideanDomain

factor : % -> Factored(%)

from UniqueFactorizationDomain

gcd : (%, %) -> %

from GcdDomain

gcd : List(%) -> %

from GcdDomain

gcdPolynomial : (SparseUnivariatePolynomial(%), SparseUnivariatePolynomial(%)) -> SparseUnivariatePolynomial(%)

from GcdDomain

inv : % -> %

from DivisionRing

latex : % -> String

from SetCategory

lcm : (%, %) -> %

from GcdDomain

lcm : List(%) -> %

from GcdDomain

lcmCoef : (%, %) -> Record(llcm_res : %, coeff1 : %, coeff2 : %)

from LeftOreRing

leftPower : (%, NonNegativeInteger) -> %

from MagmaWithUnit

leftPower : (%, PositiveInteger) -> %

from Magma

leftRecip : % -> Union(%, "failed")

from MagmaWithUnit

multiEuclidean : (List(%), %) -> Union(List(%), "failed")

from EuclideanDomain

one? : % -> Boolean

from MagmaWithUnit

opposite? : (%, %) -> Boolean

from AbelianMonoid

order : % -> OnePointCompletion(PositiveInteger)

order(a) computes the order of an element in the multiplicative group of the field. Error: if a is 0.

plenaryPower : (%, PositiveInteger) -> %

from NonAssociativeAlgebra(%)

prime? : % -> Boolean

from UniqueFactorizationDomain

primeFrobenius : % -> %

primeFrobenius(a) returns a ^ p where p is the characteristic.

primeFrobenius : (%, NonNegativeInteger) -> %

primeFrobenius(a, s) returns a^(p^s) where p is the characteristic.

principalIdeal : List(%) -> Record(coef : List(%), generator : %)

from PrincipalIdealDomain

quo : (%, %) -> %

from EuclideanDomain

recip : % -> Union(%, "failed")

from MagmaWithUnit

rem : (%, %) -> %

from EuclideanDomain

rightPower : (%, NonNegativeInteger) -> %

from MagmaWithUnit

rightPower : (%, PositiveInteger) -> %

from Magma

rightRecip : % -> Union(%, "failed")

from MagmaWithUnit

sample : () -> %

from AbelianMonoid

sizeLess? : (%, %) -> Boolean

from EuclideanDomain

squareFree : % -> Factored(%)

from UniqueFactorizationDomain

squareFreePart : % -> %

from UniqueFactorizationDomain

subtractIfCan : (%, %) -> Union(%, "failed")

from CancellationAbelianMonoid

unit? : % -> Boolean

from EntireRing

unitCanonical : % -> %

from EntireRing

unitNormal : % -> Record(unit : %, canonical : %, associate : %)

from EntireRing

zero? : % -> Boolean

from AbelianMonoid

~= : (%, %) -> Boolean

from BasicType

CharacteristicNonZero

Module(Fraction(Integer))

noZeroDivisors

LeftModule(Fraction(Integer))

RightModule(%)

Monoid

Algebra(%)

AbelianMonoid

EuclideanDomain

EntireRing

NonAssociativeAlgebra(Fraction(Integer))

CancellationAbelianMonoid

MagmaWithUnit

NonAssociativeRing

AbelianGroup

RightModule(Fraction(Integer))

CommutativeStar

canonicalUnitNormal

LeftModule(%)

Module(%)

SetCategory

LeftOreRing

Algebra(Fraction(Integer))

Rng

Field

CommutativeRing

IntegralDomain

TwoSidedRecip

Magma

UniqueFactorizationDomain

SemiGroup

BiModule(%, %)

unitsKnown

CoercibleTo(OutputForm)

AbelianSemiGroup

GcdDomain

NonAssociativeSemiRing

DivisionRing

canonicalsClosed

NonAssociativeAlgebra(%)

PrincipalIdealDomain

BiModule(Fraction(Integer), Fraction(Integer))

NonAssociativeRng

Ring

SemiRng

NonAssociativeSemiRng

BasicType

SemiRing