Theorems · Theorem · commutative algebra
UniqueFactorizationMonoid.primeFactors_of_isUnit
∀ {M : Type u_1} [inst : CommMonoidWithZero M] [inst_1 : NormalizationMonoid M] [inst_2 : UniqueFactorizationMonoid M]
{a : M}, IsUnit a → UniqueFactorizationMonoid.primeFactors a = ∅If x is a unit, then the finset of prime factors of x is empty.
The converse is true with a nonzero assumption, see primeFactors_eq_empty_iff.
- Defined in
- Mathlib.RingTheory.Radical.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 75 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
- Multisetproof · cited by 2,627
- IsUnitstatement and proof · cited by 1,602
- CommMonoidWithZerostatement and proof · cited by 913
- UniqueFactorizationMonoidstatement and proof · cited by 279
- Multiset.toFinsetproof · cited by 230
- NormalizationMonoidstatement and proof · cited by 165
- UniqueFactorizationMonoid.primeFactorsstatement · cited by 32
- Multiset.toFinset_zeroproof · cited by 8
- UniqueFactorizationMonoid.normalizedFactors_of_isUnitproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- UniqueFactorizationMonoid.primeFactors_mul_eq_disjUnionproof · cited by 1