Specification of principal localization matrices used in the coherence proof of Prufer domains.

- propPLM :: (CommutativeRing a, Eq a) => Ideal a -> Matrix a -> Bool
- computePLM_B :: (BezoutDomain a, Eq a) => Ideal a -> Matrix a

# Documentation

propPLM :: (CommutativeRing a, Eq a) => Ideal a -> Matrix a -> BoolSource

A principal localization matrix for an ideal (x1,...,xn) is a matrix such that:

- The sum of the diagonal should equal 1.
- For all i, j, l in {1..n}: a_lj * x_i = a_li * x_j

computePLM_B :: (BezoutDomain a, Eq a) => Ideal a -> Matrix aSource

Principal localization matrices for ideals are computable in Bezout domains.