AlgebraGivenByStructuralConstants(R, n, ls, gamma)¶

AlgebraGivenByStructuralConstants implements finite rank algebras over a commutative ring, given by the structural constants gamma with respect to a fixed basis [a1, .., an], where gamma is an n-vector of n by n matrices [(gammaijk) for k in 1..rank()] defined by ai * aj = gammaij1 * a1 + ... + gammaijn * an. The symbols for the fixed basis have to be given as a list of symbols.

0: %

from AbelianMonoid

*: (%, %) -> %

from Magma

*: (%, R) -> %

from RightModule R

*: (Integer, %) -> %

from AbelianGroup

*: (NonNegativeInteger, %) -> %

from AbelianMonoid

*: (PositiveInteger, %) -> %

from AbelianSemiGroup

*: (R, %) -> %

from LeftModule R

*: (SquareMatrix(n, R), %) -> %

from LeftModule SquareMatrix(n, R)

+: (%, %) -> %

from AbelianSemiGroup

-: % -> %

from AbelianGroup

-: (%, %) -> %

from AbelianGroup

=: (%, %) -> Boolean

from BasicType

^: (%, PositiveInteger) -> %

from Magma

~=: (%, %) -> Boolean

from BasicType

alternative?: () -> Boolean
antiAssociative?: () -> Boolean
antiCommutative?: () -> Boolean
antiCommutator: (%, %) -> %
apply: (Matrix R, %) -> %
associative?: () -> Boolean
associator: (%, %, %) -> %
associatorDependence: () -> List Vector R
basis: () -> Vector %

from FramedModule R

coerce: % -> OutputForm
coerce: Vector R -> %

coerce(v) converts a vector to a member of the algebra by forming a linear combination with the basis element. Note: the vector is assumed to have length equal to the dimension of the algebra.

commutative?: () -> Boolean
commutator: (%, %) -> %
conditionsForIdempotents: () -> List Polynomial R
conditionsForIdempotents: Vector % -> List Polynomial R
convert: % -> InputForm if R has Finite
convert: % -> Vector R

from FramedModule R

convert: Vector R -> %

from FramedModule R

coordinates: % -> Vector R

from FramedModule R

coordinates: (%, Vector %) -> Vector R
coordinates: (Vector %, Vector %) -> Matrix R
coordinates: Vector % -> Matrix R

from FramedModule R

elt: (%, Integer) -> R
enumerate: () -> List % if R has Finite

from Finite

flexible?: () -> Boolean
hash: % -> SingleInteger

from SetCategory

hashUpdate!: (HashState, %) -> HashState

from SetCategory

index: PositiveInteger -> % if R has Finite

from Finite

jacobiIdentity?: () -> Boolean
jordanAlgebra?: () -> Boolean
latex: % -> String

from SetCategory

leftAlternative?: () -> Boolean
leftCharacteristicPolynomial: % -> SparseUnivariatePolynomial R
leftDiscriminant: () -> R
leftDiscriminant: Vector % -> R
leftMinimalPolynomial: % -> SparseUnivariatePolynomial R
leftNorm: % -> R
leftPower: (%, PositiveInteger) -> %

from Magma

leftRankPolynomial: () -> SparseUnivariatePolynomial Polynomial R
leftRecip: % -> Union(%, failed)
leftRegularRepresentation: % -> Matrix R
leftRegularRepresentation: (%, Vector %) -> Matrix R
leftTrace: % -> R
leftTraceMatrix: () -> Matrix R
leftTraceMatrix: Vector % -> Matrix R
leftUnit: () -> Union(%, failed)
leftUnits: () -> Union(Record(particular: %, basis: List %), failed)
lieAlgebra?: () -> Boolean
lookup: % -> PositiveInteger if R has Finite

from Finite

noncommutativeJordanAlgebra?: () -> Boolean
opposite?: (%, %) -> Boolean

from AbelianMonoid

plenaryPower: (%, PositiveInteger) -> %
powerAssociative?: () -> Boolean
random: () -> % if R has Finite

from Finite

rank: () -> PositiveInteger

from FramedModule R

recip: % -> Union(%, failed)
represents: (Vector R, Vector %) -> %
represents: Vector R -> %

from FramedModule R

rightAlternative?: () -> Boolean
rightCharacteristicPolynomial: % -> SparseUnivariatePolynomial R
rightDiscriminant: () -> R
rightDiscriminant: Vector % -> R
rightMinimalPolynomial: % -> SparseUnivariatePolynomial R
rightNorm: % -> R
rightPower: (%, PositiveInteger) -> %

from Magma

rightRankPolynomial: () -> SparseUnivariatePolynomial Polynomial R
rightRecip: % -> Union(%, failed)
rightRegularRepresentation: % -> Matrix R
rightRegularRepresentation: (%, Vector %) -> Matrix R
rightTrace: % -> R
rightTraceMatrix: () -> Matrix R
rightTraceMatrix: Vector % -> Matrix R
rightUnit: () -> Union(%, failed)
rightUnits: () -> Union(Record(particular: %, basis: List %), failed)
sample: %

from AbelianMonoid

size: () -> NonNegativeInteger if R has Finite

from Finite

smaller?: (%, %) -> Boolean if R has Finite

from Comparable

someBasis: () -> Vector %
structuralConstants: () -> Vector Matrix R
structuralConstants: Vector % -> Vector Matrix R
subtractIfCan: (%, %) -> Union(%, failed)
unit: () -> Union(%, failed)
zero?: % -> Boolean

from AbelianMonoid

AbelianGroup

AbelianMonoid

AbelianSemiGroup

BasicType

BiModule(R, R)

CancellationAbelianMonoid

Comparable if R has Finite

ConvertibleTo InputForm if R has Finite

Finite if R has Finite

LeftModule SquareMatrix(n, R)

Magma

NonAssociativeRng

NonAssociativeSemiRng

SetCategory

unitsKnown