HaskellForMaths-0.3.1: Combinatorics, group theory, commutative algebra, non-commutative algebra

Math.Algebras.Commutative

Description

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

Synopsis

Documentation

data GlexMonomial v Source

Constructors

Glex Int [(v, Int)] 

Instances

class Monomial m whereSource

Methods

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

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

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

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.

class DivisionBasis b whereSource

Methods

dividesB :: b -> b -> BoolSource

divB :: b -> b -> bSource

Instances

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