use crate::*;
pub const GF2: QuotientField<CheckedInts<i8>> = QuotientField {
base: I8,
modulo: 2,
};
pub const GF3: QuotientField<CheckedInts<i8>> = QuotientField {
base: I8,
modulo: 3,
};
#[derive(Clone, Debug)]
pub struct QuotientField<A>
where
A: EuclideanDomain,
{
base: A,
modulo: A::Elem,
}
impl<A> QuotientField<A>
where
A: EuclideanDomain,
{
pub fn new(base: A, modulo: A::Elem) -> Self {
assert!(base.contains(&modulo));
let one = base.one();
assert!(base.is_zero(&base.rem(&one, &one)));
QuotientField { base, modulo }
}
pub fn base(&self) -> &A {
&self.base
}
pub fn modulo(&self) -> &A::Elem {
&self.modulo
}
}
impl<A> Domain for QuotientField<A>
where
A: EuclideanDomain,
{
type Elem = A::Elem;
fn contains(&self, elem: &Self::Elem) -> bool {
self.base.reduced(elem, &self.modulo)
}
fn equals(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> bool {
self.base.equals(elem1, elem2)
}
}
impl<A> Semigroup for QuotientField<A>
where
A: EuclideanDomain,
{
fn mul(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem {
self.base.rem(&self.base.mul(elem1, elem2), &self.modulo)
}
}
impl<A> Monoid for QuotientField<A>
where
A: EuclideanDomain,
{
fn one(&self) -> Self::Elem {
self.base.one()
}
fn is_one(&self, elem: &Self::Elem) -> bool {
self.base.is_one(elem)
}
fn try_inv(&self, elem: &Self::Elem) -> Option<Self::Elem> {
if self.is_zero(elem) {
None
} else {
Some(self.inv(elem))
}
}
fn invertible(&self, elem: &Self::Elem) -> bool {
!self.is_zero(elem)
}
}
impl<A> AbelianGroup for QuotientField<A>
where
A: EuclideanDomain,
{
fn zero(&self) -> Self::Elem {
self.base.zero()
}
fn neg(&self, elem: &Self::Elem) -> Self::Elem {
self.base.rem(&self.base.neg(elem), &self.modulo)
}
fn add(&self, elem1: &Self::Elem, elem2: &Self::Elem) -> Self::Elem {
self.base.rem(&self.base.add(elem1, elem2), &self.modulo)
}
}
impl<A> UnitaryRing for QuotientField<A> where A: EuclideanDomain {}
impl<A> Field for QuotientField<A>
where
A: EuclideanDomain,
{
fn inv(&self, elem: &Self::Elem) -> Self::Elem {
assert!(!self.is_zero(elem));
let (g, _, r) = self.base.extended_gcd(&self.modulo, elem);
let a = self.base.try_inv(&g).expect("modulo was not irreducible");
self.mul(&a, &r)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn field_1721() {
let field = QuotientField::new(I32, 1721);
for a in 0..1720 {
assert!(field.contains(&a));
if a != 0 {
let b = field.inv(&a);
assert!(field.contains(&b));
println!("{} {}", a, b);
assert!(field.is_one(&field.mul(&a, &b)));
}
}
}
}