Theorems · Theorem · commutative algebra
factorization_eq_count
∀ {α : Type u_1} [inst : CommMonoidWithZero α] [inst_1 : UniqueFactorizationMonoid α] [inst_2 : NormalizationMonoid α]
[inst_3 : DecidableEq α] {n p : α},
(factorization n) p = Multiset.count p (UniqueFactorizationMonoid.normalizedFactors n)- Cited by
- 1 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Finsuppstatement · cited by 5,255
- CommMonoidWithZerostatement and proof · cited by 913
- Multiset.countstatement and proof · cited by 302
- UniqueFactorizationMonoidstatement and proof · cited by 279
- NormalizationMonoidstatement and proof · cited by 165
- UniqueFactorizationMonoid.normalizedFactorsstatement and proof · cited by 151
- factorizationstatement · cited by 9
Cited by1
Results whose statement or proof uses this declaration.
- IsDedekindDomain.HeightOneSpectrum.factorization_eq_multiplicityproof · cited by 0