Theorems · Definition · commutative algebra
EuclideanDomain.lcm
{R : Type u} → [EuclideanDomain R] → [DecidableEq R] → R → R → Rlcm a b is a (non-unique) element such that a ∣ lcm a b b ∣ lcm a b, and for
any element c such that a ∣ c and b ∣ c, then lcm a b ∣ c
- Defined in
- Mathlib.Algebra.EuclideanDomain.Defs
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses no axioms
- Assumes
- EuclideanDomainDecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- EuclideanDomainstatement and proof · cited by 124
- EuclideanDomain.gcdproof · cited by 39
Cited by9
Results whose statement or proof uses this declaration.
- EuclideanDomain.dvd_lcm_leftstatement and proof · cited by 1
- EuclideanDomain.dvd_lcm_rightstatement and proof · cited by 1
- EuclideanDomain.lcm_dvdstatement · cited by 1
- EuclideanDomain.lcm_zero_leftstatement · cited by 1
- EuclideanDomain.lcm_zero_rightstatement · cited by 1
- EuclideanDomain.gcd_mul_lcmstatement · cited by 0
- EuclideanDomain.lcm_dvd_iffstatement and proof · cited by 0
- EuclideanDomain.lcm_eq_zero_iffstatement and proof · cited by 0
- EuclideanDomain.gcdMonoidproof · cited by 0