Theorems · Definition · commutative algebra
factorization
{α : Type u_1} →
[inst : CommMonoidWithZero α] → [UniqueFactorizationMonoid α] → [NormalizationMonoid α] → [DecidableEq α] → α → α →₀ ℕThis returns the multiset of irreducible factors as a Finsupp.
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 82 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsuppstatement · cited by 5,255
- CommMonoidWithZerostatement and proof · cited by 913
- UniqueFactorizationMonoidstatement and proof · cited by 279
- NormalizationMonoidstatement and proof · cited by 165
- UniqueFactorizationMonoid.normalizedFactorsproof · cited by 151
- Multiset.toFinsuppproof · cited by 33
Cited by9
Results whose statement or proof uses this declaration.
- factorization_eq_countstatement · cited by 1
- IsDedekindDomain.HeightOneSpectrum.factorization_eq_multiplicitystatement · cited by 0
- factorization.congr_simpstatement and proof · cited by 0
- support_factorizationstatement · cited by 0
- factorization_mulstatement · cited by 0
- factorization_onestatement · cited by 0
- factorization_powstatement · cited by 0
- factorization_zerostatement · cited by 0
- associated_of_factorization_eqstatement and proof · cited by 0