Theorems · Inductive type · commutative algebra
EuclideanDomain
Type u → Type u
A EuclideanDomain is a non-trivial commutative ring with a division and a remainder,
satisfying b * (a / b) + a % b = a.
The definition of a Euclidean domain usually includes a valuation function R → ℕ.
This definition is slightly generalised to include a well-founded relation
r with the property that r (a % b) b, instead of a valuation.
- Defined in
- Mathlib.Algebra.EuclideanDomain.Defs
- Cited by
- 124 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by162
Results whose statement or proof uses this declaration.
- EuclideanDomain.gcdstatement and proof · cited by 39
- AbsoluteValue.IsAdmissiblestatement · cited by 18
- EuclideanDomain.div_zerostatement and proof · cited by 17
- EuclideanDomain.rstatement and proof · cited by 13
- EuclideanDomain.divRadicalstatement and proof · cited by 12
- EuclideanDomain.div_add_modstatement and proof · cited by 10
- EuclideanDomain.div_selfstatement and proof · cited by 10
- ClassGroup.finsetApproxstatement and proof · cited by 9
- EuclideanDomain.eq_div_of_mul_eq_rightstatement and proof · cited by 9
- EuclideanDomain.mul_div_cancel'statement and proof · cited by 9
- AbsoluteValue.IsEuclideanstatement · cited by 9
- EuclideanDomain.gcd_dvdstatement and proof · cited by 8