Documentation

Mathlib.RingTheory.UniqueFactorizationDomain.Finsupp

Factors as finsupp #

Main definitions #

noncomputable def factorization {α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [NormalizationMonoid α] [DecidableEq α] (n : α) :
α →₀

This returns the multiset of irreducible factors as a Finsupp.

Instances For
    @[simp]

    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 : } :
    factorization (x ^ n) = n factorization x

    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) :