Theorems · Definition · commutative algebra
UniqueFactorizationMonoid.fintypeSubtypeDvd
{M : Type u_2} →
[inst : CommMonoidWithZero M] →
[UniqueFactorizationMonoid M] → [Fintype Mˣ] → (y : M) → y ≠ 0 → Fintype { x // x ∣ y }If y is a nonzero element of a unique factorization monoid with finitely
many units (e.g. ℤ, Ideal (ring_of_integers K)), it has finitely many divisors.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fintypestatement and proof · cited by 7,736
- Finset.univproof · cited by 3,473
- Unitsstatement and proof · cited by 2,804
- Multisetproof · cited by 2,627
- Units.valproof · cited by 1,966
- SProd.sprodproof · cited by 1,750
- CommMonoidWithZerostatement and proof · cited by 913
- Finset.imageproof · cited by 910
- Multiset.prodproof · cited by 528
- UniqueFactorizationMonoidstatement and proof · cited by 279
- Multiset.toFinsetproof · cited by 230
- UniqueFactorizationMonoid.normalizedFactorsproof · cited by 151
Cited by2
Results whose statement or proof uses this declaration.
- Ideal.finite_factorsproof · cited by 7
- Polynomial.fintypeSubtypeMonicDvdproof · cited by 0