Factors as finsupp #
Main definitions #
UniqueFactorizationMonoid.factorization: the multiset of irreducible factors as aFinsupp.
noncomputable def factorization {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] (n : α) :
This returns the multiset of irreducible factors as a Finsupp.
Instances For
theorem factorization_eq_count {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] {n p : α} :
@[simp]
theorem factorization_zero {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] :
@[simp]
theorem factorization_one {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] :
@[simp]
theorem support_factorization {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] {n : α} :
The support of factorization n is exactly the Finset of normalized factors
@[simp]
theorem factorization_mul {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] {a b : α} (ha : a ≠ 0) (hb : b ≠ 0) :
For nonzero a and b, the power of p in a * b is the sum of the powers in a and b
theorem factorization_pow {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] {x : α} {n : ℕ} :
For any p, the power of p in x^n is n times the power in x
theorem associated_of_factorization_eq {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] (a b : α) (ha : a ≠ 0) (hb : b ≠ 0) (h : factorization a = factorization b) :
Associated a b