Math.Algebras.Commutative

A module defining the algebra of commutative polynomials over a field k

Documentation

data GlexMonomial v

Constructors

Glex Int [(v, Int)]

Instances

Monomial GlexMonomial

(Eq k, Num k) => Coalgebra k (GlexMonomial v)

(Eq k, Num k, Ord v) => Algebra k (GlexMonomial v)

Eq v => Eq (GlexMonomial v)

Ord v => Ord (GlexMonomial v)

Show v => Show (GlexMonomial v)

Ord v => DivisionBasis (GlexMonomial v)

type GlexPoly k v = Vect k (GlexMonomial v)

glexVar :: Num k => v -> GlexPoly k v

glexVar creates a variable in the algebra of commutative polynomials with Glex term ordering. For example, the following code creates variables called x, y and z:

 [x,y,z] = map glexVar ["x","y","z"] :: GlexPoly Q String

class Monomial m where

Methods

var :: v -> Vect Q (m v)

powers :: m v -> [(v, Int)]

Instances

Monomial GlexMonomial

Monomial SL2

bind :: (Monomial m, Eq k, Num k, Ord b, Show b, Algebra k b) => Vect k (m v) -> (v -> Vect k b) -> Vect k b

In effect, we have (Num k, Monomial m) => Monad (v -> Vect k (m v)), with return = var, and (>>=) = bind. However, we can't express this directly in Haskell, firstly because of the Ord b constraint, secondly because Haskell doesn't support type functions.

lt :: Vect t t1 -> (t1, t)

class DivisionBasis b where

Methods

dividesB :: b -> b -> Bool

divB :: b -> b -> b

Instances

Ord v => DivisionBasis (GlexMonomial v)

dividesT :: DivisionBasis b => (b, t) -> (b, t1) -> Bool

divT :: (Fractional t1, DivisionBasis t) => (t, t1) -> (t, t1) -> (t, t1)

quotRemMP :: (Eq k, Fractional k, Ord b, Show b, Algebra k b, DivisionBasis b) => Vect k b -> [Vect k b] -> ([Vect k b], Vect k b)

(%%) :: (Eq k, Fractional k, Ord b, Show b, Algebra k b, DivisionBasis b) => Vect k b -> [Vect k b] -> Vect k b

(%%) reduces a polynomial with respect to a list of polynomials.