Loogle!
Result
Found 451 declarations mentioning Irreducible. Of these, only the first 200 are shown.
- Irreducible 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] (p : M) : Prop - Irreducible.not_isUnit 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} (self : Irreducible p) : ¬IsUnit p - not_irreducible_one 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] : ¬Irreducible 1 - Irreducible.ne_one 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} (hp : Irreducible p) : p ≠ 1 - of_irreducible_mul 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {a b : M} : Irreducible (a * b) → IsUnit a ∨ IsUnit b - Irreducible.isUnit_or_isUnit 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} (self : Irreducible p) ⦃a b : M⦄ : p = a * b → IsUnit a ∨ IsUnit b - Irreducible.mk 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} (not_isUnit : ¬IsUnit p) (isUnit_or_isUnit : ∀ ⦃a b : M⦄, p = a * b → IsUnit a ∨ IsUnit b) : Irreducible p - irreducible_iff 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} : Irreducible p ↔ ¬IsUnit p ∧ ∀ ⦃a b : M⦄, p = a * b → IsUnit a ∨ IsUnit b - irreducible_or_factor 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {p : M} (hp : ¬IsUnit p) : Irreducible p ∨ ∃ a b, ¬IsUnit a ∧ ¬IsUnit b ∧ p = a * b - Irreducible.eq_one_or_eq_one 📋 Mathlib.Algebra.Group.Irreducible.Defs
{M : Type u_1} [Monoid M] {a b : M} [Subsingleton Mˣ] (hab : Irreducible (a * b)) : a = 1 ∨ b = 1 - Irreducible.not_isSquare 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x : M} (ha : Irreducible x) : ¬IsSquare x - IsSquare.not_irreducible 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x : M} (ha : IsSquare x) : ¬Irreducible x - not_irreducible_pow 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x : M} {n : ℕ} : n ≠ 1 → ¬Irreducible (x ^ n) - irreducible_isUnit_mul 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x y : M} (h : IsUnit x) : Irreducible (x * y) ↔ Irreducible y - irreducible_mul_isUnit 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x y : M} (h : IsUnit x) : Irreducible (y * x) ↔ Irreducible y - irreducible_mul_units 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {y : M} (u : Mˣ) : Irreducible (y * ↑u) ↔ Irreducible y - irreducible_units_mul 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {y : M} (u : Mˣ) : Irreducible (↑u * y) ↔ Irreducible y - irreducible_mul_iff 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{M : Type u_2} [Monoid M] {x y : M} : Irreducible (x * y) ↔ Irreducible x ∧ IsUnit y ∨ Irreducible y ∧ IsUnit x - Irreducible.map 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Monoid M] [Monoid N] {x : M} [EquivLike F M N] [MulEquivClass F M N] (f : F) : Irreducible x → Irreducible (f x) - Irreducible.of_map 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Monoid M] [Monoid N] {f : F} {x : M} [FunLike F M N] [MonoidHomClass F M N] [IsLocalHom f] (hfx : Irreducible (f x)) : Irreducible x - MulEquiv.irreducible_iff 📋 Mathlib.Algebra.Group.Irreducible.Lemmas
{F : Type u_1} {M : Type u_2} {N : Type u_3} [Monoid M] [Monoid N] {x : M} [EquivLike F M N] [MulEquivClass F M N] (f : F) : Irreducible (f x) ↔ Irreducible x - not_irreducible_zero 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [MonoidWithZero M] : ¬Irreducible 0 - Irreducible.ne_zero 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [MonoidWithZero M] {p : M} : Irreducible p → p ≠ 0 - Irreducible.prime 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] [DecompositionMonoid M] {a : M} (irr : Irreducible a) : Prime a - Irreducible.prime_of_isPrimal 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] {a : M} (irr : Irreducible a) (primal : IsPrimal a) : Prime a - Irreducible.not_dvd_isUnit 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoid M] {p u : M} (hp : Irreducible p) (hu : IsUnit u) : ¬p ∣ u - Irreducible.dvd_symm 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [Monoid M] {p q : M} (hp : Irreducible p) (hq : Irreducible q) : p ∣ q → q ∣ p - Irreducible.dvd_comm 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [Monoid M] {p q : M} (hp : Irreducible p) (hq : Irreducible q) : p ∣ q ↔ q ∣ p - Irreducible.not_dvd_unit 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoid M] {p : M} (u : Mˣ) (hp : Irreducible p) : ¬p ∣ ↑u - Irreducible.not_dvd_one 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoid M] {p : M} (hp : Irreducible p) : ¬p ∣ 1 - Prime.irreducible 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] {p : M} (hp : Prime p) : Irreducible p - irreducible_iff_prime 📋 Mathlib.Algebra.Prime.Defs
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {a : M} : Irreducible a ↔ Prime a - DvdNotUnit.isUnit_of_irreducible_right 📋 Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] {p q : M} (h : DvdNotUnit p q) (hq : Irreducible q) : IsUnit p - not_irreducible_of_not_isUnit_of_dvdNotUnit 📋 Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] {p q : M} (hp : ¬IsUnit p) (h : DvdNotUnit p q) : ¬Irreducible q - not_irreducible_of_not_unit_dvdNotUnit 📋 Mathlib.Algebra.Prime.Lemmas
{M : Type u_1} [CommMonoidWithZero M] {p q : M} (hp : ¬IsUnit p) (h : DvdNotUnit p q) : ¬Irreducible q - Associated.irreducible 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p q : M} (h : Associated p q) (hp : Irreducible p) : Irreducible q - Associated.irreducible_iff 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p q : M} (h : Associated p q) : Irreducible p ↔ Irreducible q - Irreducible.dvd_or_isRelPrime 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p n : M} (hp : Irreducible p) : p ∣ n ∨ IsRelPrime p n - Irreducible.isRelPrime_iff_not_dvd 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p n : M} (hp : Irreducible p) : IsRelPrime p n ↔ ¬p ∣ n - Irreducible.associated_of_dvd 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p q : M} (p_irr : Irreducible p) (q_irr : Irreducible q) (dvd : p ∣ q) : Associated p q - Irreducible.dvd_irreducible_iff_associated 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {p q : M} (pp : Irreducible p) (qp : Irreducible q) : p ∣ q ↔ Associated p q - Irreducible.dvd_iff 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {x y : M} (hx : Irreducible x) : y ∣ x ↔ IsUnit y ∨ Associated x y - Irreducible.isUnit_iff_not_associated_of_dvd 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [Monoid M] {x y : M} (hx : Irreducible x) (hy : y ∣ x) : IsUnit y ↔ ¬Associated x y - Associates.irreducible_mk 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] {a : M} : Irreducible (Associates.mk a) ↔ Irreducible a - Associates.irreducible_iff_prime_iff 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] : (∀ (a : M), Irreducible a ↔ Prime a) ↔ ∀ (a : Associates M), Irreducible a ↔ Prime a - associates_irreducible_iff_prime 📋 Mathlib.Algebra.GroupWithZero.Associated
{M : Type u_1} [CommMonoidWithZero M] [IsCancelMulZero M] [DecompositionMonoid M] {p : Associates M} : Irreducible p ↔ Prime p - Irreducible.coe_ne_zero 📋 Mathlib.Algebra.GroupWithZero.NonZeroDivisors
{M₀ : Type u_1} {S : Type u_2} [MonoidWithZero M₀] [SetLike S M₀] [SubmonoidClass S M₀] {s : S} {x : ↥s} (hx : Irreducible x) : ↑x ≠ 0 - Ideal.irreducible_of_isMaximal_span_singleton 📋 Mathlib.RingTheory.Ideal.Maximal
{α : Type u} [CommSemiring α] [IsDomain α] {a : α} (ha : a ≠ 0) (max : (Ideal.span {a}).IsMaximal) : Irreducible a - Ideal.irreducible_of_isMaximal_of_eq_span_singleton_of_not_isIdempotentElem 📋 Mathlib.RingTheory.Ideal.Maximal
{α : Type u} [CommSemiring α] {a : α} (max : (Ideal.span {a}).IsMaximal) (idem : ∀ (x : α), Ideal.span {a} = Ideal.span {x} → ¬IsIdempotentElem x) : Irreducible a - Ideal.instDecidableIrreducibleAssociates 📋 Mathlib.RingTheory.Ideal.Operations
{R : Type u_1} [CommSemiring R] (I : Associates (Ideal R)) : Decidable (Irreducible I) - Irreducible.isUnit_gcd_iff 📋 Mathlib.Algebra.GCDMonoid.Basic
{α : Type u_1} [CommMonoidWithZero α] [GCDMonoid α] {x y : α} (hx : Irreducible x) : IsUnit (gcd x y) ↔ ¬x ∣ y - Irreducible.gcd_eq_one_iff 📋 Mathlib.Algebra.GCDMonoid.Basic
{α : Type u_1} [CommMonoidWithZero α] [NormalizedGCDMonoid α] {x y : α} (hx : Irreducible x) : gcd x y = 1 ↔ ¬x ∣ y - UniqueFactorizationMonoid.irreducible_iff_prime 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_2} {inst✝ : CommMonoidWithZero α} [self : UniqueFactorizationMonoid α] {a : α} : Irreducible a ↔ Prime a - UniqueFactorizationMonoid.irreducible_of_factor 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} (x : α) : x ∈ UniqueFactorizationMonoid.factors a → Irreducible x - UniqueFactorizationMonoid.card_factors_of_irreducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} (ha : Irreducible a) : (UniqueFactorizationMonoid.factors a).card = 1 - UniqueFactorizationMonoid.mk 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_2} [CommMonoidWithZero α] [toIsCancelMulZero : IsCancelMulZero α] [toIsWellFounded : IsWellFounded α DvdNotUnit] (irreducible_iff_prime : ∀ {a : α}, Irreducible a ↔ Prime a) : UniqueFactorizationMonoid α - WfDvdMonoid.exists_irreducible_factor 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] {a : α} (ha : ¬IsUnit a) (ha0 : a ≠ 0) : ∃ i, Irreducible i ∧ i ∣ a - WfDvdMonoid.exists_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] (a : α) : a ≠ 0 → ∃ f, (∀ b ∈ f, Irreducible b) ∧ Associated f.prod a - WfDvdMonoid.not_isUnit_iff_exists_factors_eq 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] (a : α) (hn0 : a ≠ 0) : ¬IsUnit a ↔ ∃ f, (∀ b ∈ f, Irreducible b) ∧ f.prod = a ∧ f ≠ ∅ - WfDvdMonoid.not_unit_iff_exists_factors_eq 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] (a : α) (hn0 : a ≠ 0) : ¬IsUnit a ↔ ∃ f, (∀ b ∈ f, Irreducible b) ∧ f.prod = a ∧ f ≠ ∅ - WfDvdMonoid.induction_on_irreducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] {motive : α → Prop} (a : α) (zero : motive 0) (unit : ∀ (u : α), IsUnit u → motive u) (mul : ∀ (a i : α), a ≠ 0 → Irreducible i → motive a → motive (i * a)) : motive a - WfDvdMonoid.isRelPrime_of_no_irreducible_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Defs
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] {x y : α} (nonzero : ¬(x = 0 ∧ y = 0)) (H : ∀ (z : α), Irreducible z → z ∣ x → ¬z ∣ y) : IsRelPrime x y - PrincipalIdealRing.isMaximal_of_irreducible 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommSemiring R] [IsPrincipalIdealRing R] {p : R} (hp : Irreducible p) : Ideal.IsMaximal (R ∙ p) - dvd_or_isCoprime 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsBezout R] (x y : R) (h : Irreducible x) : x ∣ y ∨ IsCoprime x y - Irreducible.isCoprime_or_dvd 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsBezout R] {p : R} (hp : Irreducible p) (i : R) : IsCoprime p i ∨ p ∣ i - Irreducible.coprime_iff_not_dvd 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsBezout R] {p n : R} (hp : Irreducible p) : IsCoprime p n ↔ ¬p ∣ n - Irreducible.dvd_iff_not_isCoprime 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsBezout R] {p n : R} (hp : Irreducible p) : p ∣ n ↔ ¬IsCoprime p n - Ideal.irreducible_iff_isMaximal_span_singleton_of_not_isField 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommSemiring R] [IsPrincipalIdealRing R] [IsDomain R] (h : ¬IsField R) {p : R} : Irreducible p ↔ Ideal.IsMaximal (R ∙ p) - Ideal.irreducible_iff_isMaximal_span_singleton 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommSemiring R] [IsPrincipalIdealRing R] [IsDomain R] {p : R} (hp : p ≠ 0) : Irreducible p ↔ Ideal.IsMaximal (R ∙ p) - Irreducible.coprime_pow_of_not_dvd 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsBezout R] {p a : R} (m : ℕ) (hp : Irreducible p) (h : ¬p ∣ a) : IsCoprime a (p ^ m) - PrincipalIdealRing.factors_spec 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsDomain R] [IsPrincipalIdealRing R] (a : R) (h : a ≠ 0) : (∀ b ∈ PrincipalIdealRing.factors a, Irreducible b) ∧ Associated (PrincipalIdealRing.factors a).prod a - isCoprime_of_irreducible_dvd 📋 Mathlib.RingTheory.PrincipalIdealDomain
{R : Type u} [CommRing R] [IsDomain R] [IsPrincipalIdealRing R] {x y : R} (nonzero : ¬(x = 0 ∧ y = 0)) (H : ∀ (z : R), Irreducible z → z ∣ x → ¬z ∣ y) : IsCoprime x y - finite_irreducible 📋 Mathlib.Algebra.AffineMonoid.Irreducible
{M : Type u_1} [CommMonoid M] [Subsingleton Mˣ] [Monoid.FG M] : {p | Irreducible p}.Finite - irreducible_subset_of_submonoidClosure_eq_top 📋 Mathlib.Algebra.AffineMonoid.Irreducible
{M : Type u_1} [CommMonoid M] [Subsingleton Mˣ] {S : Set M} (hS : Submonoid.closure S = ⊤) : {p | Irreducible p} ⊆ S - irreducible_mem_submonoidClosure_subset 📋 Mathlib.Algebra.AffineMonoid.Irreducible
{M : Type u_1} [CommMonoid M] [Subsingleton Mˣ] {S : Set M} : {p | p ∈ Submonoid.closure S ∧ Irreducible p} ⊆ S - Submonoid.FG.finite_irreducible_mem_submonoidClosure 📋 Mathlib.Algebra.AffineMonoid.Irreducible
{M : Type u_1} [CommMonoid M] [Subsingleton Mˣ] {S : Submonoid M} (hS : S.FG) : {p | p ∈ S ∧ Irreducible p}.Finite - Submonoid.closure_irreducible 📋 Mathlib.Algebra.AffineMonoid.Irreducible
{M : Type u_1} [CancelCommMonoid M] [Subsingleton Mˣ] [Monoid.FG M] : Submonoid.closure {p | Irreducible p} = ⊤ - Nat.instDecidablePredIrreducible 📋 Mathlib.Data.Nat.Prime.Defs
: DecidablePred Irreducible - Nat.irreducible_iff_nat_prime 📋 Mathlib.Data.Nat.Prime.Defs
(a : ℕ) : Irreducible a ↔ Nat.Prime a - Nat.irreducible_iff_prime 📋 Mathlib.Data.Nat.Prime.Defs
{p : ℕ} : Irreducible p ↔ Prime p - Polynomial.irreducible_mul_leadingCoeff_inv 📋 Mathlib.Algebra.Polynomial.Degree.Lemmas
{K : Type u_1} [DivisionRing K] {p : Polynomial K} : Irreducible (p * Polynomial.C p.leadingCoeff⁻¹) ↔ Irreducible p - Polynomial.Monic.irreducible_iff_natDegree 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) : Irreducible p ↔ p ≠ 1 ∧ ∀ (f g : Polynomial R), f.Monic → g.Monic → f * g = p → f.natDegree = 0 ∨ g.natDegree = 0 - Polynomial.Monic.irreducible_iff_lt_natDegree_lt 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) (hp1 : p ≠ 1) : Irreducible p ↔ ∀ (q : Polynomial R), q.Monic → q.natDegree ∈ Finset.Ioc 0 (p.natDegree / 2) → ¬q ∣ p - Polynomial.Monic.not_irreducible_iff_exists_add_mul_eq_coeff 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hm : p.Monic) (hnd : p.natDegree = 2) : ¬Irreducible p ↔ ∃ c₁ c₂, p.coeff 0 = c₁ * c₂ ∧ p.coeff 1 = c₁ + c₂ - Polynomial.Monic.irreducible_iff_natDegree' 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) : Irreducible p ↔ p ≠ 1 ∧ ∀ (f g : Polynomial R), f.Monic → g.Monic → f * g = p → g.natDegree ∉ Finset.Ioc 0 (p.natDegree / 2) - Polynomial.irreducible_of_monic 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : p.Monic) (hp1 : p ≠ 1) : Irreducible p ↔ ∀ (f g : Polynomial R), f.Monic → g.Monic → f * g = p → f = 1 ∨ g = 1 - emultiplicity_eq_zero_of_irreducible_ne 📋 Mathlib.RingTheory.Multiplicity
{R : Type u_3} [CommMonoidWithZero R] [Subsingleton Rˣ] {a b : R} (ha : Irreducible a) (hb : Irreducible b) (h : a ≠ b) : emultiplicity a b = 0 - Irreducible.subsingleton_isRoot 📋 Mathlib.Algebra.Polynomial.Div
{R : Type u} [CommRing R] {p : Polynomial R} [IsDomain R] (hi : Irreducible p) : {x | p.IsRoot x}.Subsingleton - Irreducible.not_isRoot_of_natDegree_ne_one 📋 Mathlib.Algebra.Polynomial.Div
{R : Type u} [CommRing R] {p : Polynomial R} [IsDomain R] (hi : Irreducible p) (hdeg : p.natDegree ≠ 1) {x : R} : ¬p.IsRoot x - Polynomial.degree_eq_one_of_irreducible_of_root 📋 Mathlib.Algebra.Polynomial.Div
{R : Type u} [CommRing R] {p : Polynomial R} [IsDomain R] (hi : Irreducible p) {x : R} (hx : p.IsRoot x) : p.degree = 1 - Irreducible.isRoot_eq_bot_of_natDegree_ne_one 📋 Mathlib.Algebra.Polynomial.Div
{R : Type u} [CommRing R] {p : Polynomial R} [IsDomain R] (hi : Irreducible p) (hdeg : p.natDegree ≠ 1) : p.IsRoot = ⊥ - Polynomial.irreducible_X 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} [CommRing R] [IsDomain R] : Irreducible Polynomial.X - Polynomial.Monic.irreducible_of_degree_eq_one 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp1 : p.degree = 1) (hm : p.Monic) : Irreducible p - Polynomial.irreducible_of_degree_eq_one_of_isRelPrime_coeff 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hp : p.degree = 1) (hc : IsRelPrime (p.coeff 0) (p.coeff 1)) : Irreducible p - Polynomial.irreducible_X_sub_C 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} [CommRing R] [IsDomain R] (r : R) : Irreducible (Polynomial.X - Polynomial.C r) - Irreducible.aeval_ne_zero_of_natDegree_ne_one 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} {S : Type v} [CommRing R] [IsDomain R] [Ring S] [Algebra R S] [FaithfulSMul R S] {p : Polynomial R} (hp : Irreducible p) (hdeg : p.natDegree ≠ 1) {x : S} (hx : x ∈ (algebraMap R S).range) : (Polynomial.aeval x) p ≠ 0 - Polynomial.irreducible_C_mul_X_add_C 📋 Mathlib.Algebra.Polynomial.RingDivision
{R : Type u} [CommRing R] [IsDomain R] {a b : R} (ha : a ≠ 0) (hab : IsRelPrime a b) : Irreducible (Polynomial.C a * Polynomial.X + Polynomial.C b) - Polynomial.of_irreducible_expand 📋 Mathlib.Algebra.Polynomial.Expand
{R : Type u} [CommRing R] [IsDomain R] {p : ℕ} (hp : p ≠ 0) {f : Polynomial R} (hf : Irreducible ((Polynomial.expand R p) f)) : Irreducible f - Polynomial.of_irreducible_expand_pow 📋 Mathlib.Algebra.Polynomial.Expand
{R : Type u} [CommRing R] [IsDomain R] {p : ℕ} (hp : p ≠ 0) {f : Polynomial R} {n : ℕ} : Irreducible ((Polynomial.expand R (p ^ n)) f) → Irreducible f - Polynomial.card_roots_le_one_of_irreducible 📋 Mathlib.Algebra.Polynomial.Roots
{R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hirr : Irreducible p) : p.roots.card ≤ 1 - Polynomial.roots_eq_zero_of_irreducible_of_natDegree_ne_one 📋 Mathlib.Algebra.Polynomial.Roots
{R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (hirr : Irreducible p) (hdeg : p.natDegree ≠ 1) : p.roots = 0 - Polynomial.Monic.irreducible_iff_degree_lt 📋 Mathlib.Algebra.Polynomial.Roots
{R : Type u} [CommRing R] [IsDomain R] {p : Polynomial R} (p_monic : p.Monic) (p_1 : p ≠ 1) : Irreducible p ↔ ∀ (q : Polynomial R), q.degree ≤ ↑(p.natDegree / 2) → q ∣ p → IsUnit q - EuclideanDomain.dvd_or_coprime 📋 Mathlib.RingTheory.EuclideanDomain
{α : Type u_1} [EuclideanDomain α] (x y : α) (h : Irreducible x) : x ∣ y ∨ IsCoprime x y - UniqueFactorizationMonoid.factors_eq_singleton_of_irreducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} (ha : Irreducible a) : ∃ b, Associated a b ∧ UniqueFactorizationMonoid.factors a = {b} - prime_factors_irreducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] {a : α} {f : Multiset α} (ha : Irreducible a) (pfa : (∀ b ∈ f, Prime b) ∧ Associated f.prod a) : ∃ p, Associated a p ∧ f = {p} - UniqueFactorizationMonoid.exists_mem_factors_of_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) : p ∣ a → ∃ q ∈ UniqueFactorizationMonoid.factors a, Associated p q - UniqueFactorizationMonoid.factors_unique 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {f g : Multiset α} (hf : ∀ x ∈ f, Irreducible x) (hg : ∀ x ∈ g, Irreducible x) (h : Associated f.prod g.prod) : Multiset.Rel Associated f g - irreducible_iff_prime_of_exists_prime_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [IsCancelMulZero α] (pf : ∀ (a : α), a ≠ 0 → ∃ f, (∀ b ∈ f, Prime b) ∧ Associated f.prod a) {p : α} : Irreducible p ↔ Prime p - UniqueFactorizationMonoid.of_existsUnique_irreducible_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [IsCancelMulZero α] (eif : ∀ (a : α), a ≠ 0 → ∃ f, (∀ b ∈ f, Irreducible b) ∧ Associated f.prod a) (uif : ∀ (f g : Multiset α), (∀ x ∈ f, Irreducible x) → (∀ x ∈ g, Irreducible x) → Associated f.prod g.prod → Multiset.Rel Associated f g) : UniqueFactorizationMonoid α - irreducible_iff_prime_of_existsUnique_irreducible_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [IsCancelMulZero α] (eif : ∀ (a : α), a ≠ 0 → ∃ f, (∀ b ∈ f, Irreducible b) ∧ Associated f.prod a) (uif : ∀ (f g : Multiset α), (∀ x ∈ f, Irreducible x) → (∀ x ∈ g, Irreducible x) → Associated f.prod g.prod → Multiset.Rel Associated f g) (p : α) : Irreducible p ↔ Prime p - Associates.unique' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {p q : Multiset (Associates α)} : (∀ a ∈ p, Irreducible a) → (∀ a ∈ q, Irreducible a) → p.prod = q.prod → p = q - Associates.prod_le_prod_iff_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Basic
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] {p q : Multiset (Associates α)} (hp : ∀ a ∈ p, Irreducible a) (hq : ∀ a ∈ q, Irreducible a) : p.prod ≤ q.prod ↔ p ≤ q - UniqueFactorizationMonoid.irreducible_of_normalized_factor 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {a : α} (x : α) : x ∈ UniqueFactorizationMonoid.normalizedFactors a → Irreducible x - UniqueFactorizationMonoid.normalizedFactors_irreducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {a : α} (ha : Irreducible a) : UniqueFactorizationMonoid.normalizedFactors a = {normalize a} - UniqueFactorizationMonoid.normalizedFactors_prod_eq 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] (s : Multiset α) (hs : ∀ a ∈ s, Irreducible a) : UniqueFactorizationMonoid.normalizedFactors s.prod = Multiset.map normalize s - Irreducible.normalizedFactors_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {p : α} (hp : Irreducible p) (k : ℕ) : UniqueFactorizationMonoid.normalizedFactors (p ^ k) = Multiset.replicate k (normalize p) - UniqueFactorizationMonoid.normalizedFactors_of_irreducible_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {p : α} (hp : Irreducible p) (k : ℕ) : UniqueFactorizationMonoid.normalizedFactors (p ^ k) = Multiset.replicate k (normalize p) - UniqueFactorizationMonoid.exists_mem_normalizedFactors_of_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) : p ∣ a → ∃ q ∈ UniqueFactorizationMonoid.normalizedFactors a, Associated p q - UniqueFactorizationMonoid.mem_normalizedFactors_iff' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.NormalizedFactors
{α : Type u_1} [CommMonoidWithZero α] [NormalizationMonoid α] [UniqueFactorizationMonoid α] {p x : α} (h : x ≠ 0) : p ∈ UniqueFactorizationMonoid.normalizedFactors x ↔ Irreducible p ∧ normalize p = p ∧ p ∣ x - Irreducible.natDegree_pos 📋 Mathlib.Algebra.Polynomial.FieldDivision
{F : Type u_1} [DivisionSemiring F] {f : Polynomial F} (h : Irreducible f) : 0 < f.natDegree - Irreducible.degree_pos 📋 Mathlib.Algebra.Polynomial.FieldDivision
{F : Type u_1} [DivisionSemiring F] {f : Polynomial F} (h : Irreducible f) : 0 < f.degree - Polynomial.irreducible_of_degree_eq_one 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] {p : Polynomial R} (hp1 : p.degree = 1) : Irreducible p - Polynomial.degree_pos_of_irreducible 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] {p : Polynomial R} (hp : Irreducible p) : 0 < p.degree - Polynomial.not_irreducible_C 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] (x : R) : ¬Irreducible (Polynomial.C x) - Polynomial.irreducible_iff_lt_natDegree_lt 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] {p : Polynomial R} (hp0 : p ≠ 0) (hpu : ¬IsUnit p) : Irreducible p ↔ ∀ (q : Polynomial R), q.Monic → q.natDegree ∈ Finset.Ioc 0 (p.natDegree / 2) → ¬q ∣ p - Polynomial.irreducible_iff_degree_lt 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] (p : Polynomial R) (hp0 : p ≠ 0) (hpu : ¬IsUnit p) : Irreducible p ↔ ∀ (q : Polynomial R), q.degree ≤ ↑(p.natDegree / 2) → q ∣ p → IsUnit q - Polynomial.mem_normalizedFactors_iff 📋 Mathlib.Algebra.Polynomial.FieldDivision
{R : Type u} [Field R] {p q : Polynomial R} [DecidableEq R] (hq : q ≠ 0) : p ∈ UniqueFactorizationMonoid.normalizedFactors q ↔ Irreducible p ∧ p.Monic ∧ p ∣ q - Irreducible.isPrimitive 📋 Mathlib.RingTheory.Polynomial.Content
{R : Type u_1} [CommSemiring R] [NoZeroDivisors R] {p : Polynomial R} (hp : Irreducible p) (hp' : p.natDegree ≠ 0) : p.IsPrimitive - Associates.BfactorSetMem 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] : { a // Irreducible a } → Associates.FactorSet α → Prop - Associates.factors' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) : Multiset { a // Irreducible a } - Associates.irreducible_of_mem_factorSet 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {p : Associates α} {s : Associates.FactorSet α} (h : p ∈ s) : Irreducible p - Associates.bcount 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] (p : { a // Irreducible a }) : Associates.FactorSet α → ℕ - Associates.count 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] (p : Associates α) : Associates.FactorSet α → ℕ - Associates.reducible_notMem_factorSet 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {p : Associates α} (hp : ¬Irreducible p) (s : Associates.FactorSet α) : p ∉ s - Associates.factors'_cong 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a b : α} (h : Associated a b) : Associates.factors' a = Associates.factors' b - Associates.factors_subsingleton 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Subsingleton α] {a : Associates α} : a.factors = ⊤ - Associates.mem_factors_of_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) (hd : p ∣ a) : Associates.mk p ∈ (Associates.mk a).factors - Associates.mem_factors_iff_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) : Associates.mk p ∈ (Associates.mk a).factors ↔ p ∣ a - Associates.factors_mk 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a : α) (h : a ≠ 0) : (Associates.mk a).factors = ↑(Associates.factors' a) - Associates.factors_zero 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] : Associates.factors 0 = ⊤ - Associates.prod_top 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] : ⊤.prod = 0 - Associates.mem_factorSet_top 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {p : Associates α} {hp : Irreducible p} : p ∈ ⊤ - Associates.count_self 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] [Nontrivial α] {p : Associates α} (hp : Irreducible p) : p.count p.factors = 1 - Associates.factors_eq_top_iff_zero 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : Associates α} : a.factors = ⊤ ↔ a = 0 - Associates.count_reducible 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {p : Associates α} (hp : ¬Irreducible p) : p.count = 0 - Associates.count_ne_zero_iff_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) : (Associates.mk p).count (Associates.mk a).factors ≠ 0 ↔ p ∣ a - Associates.FactorSet.prod_eq_zero_iff 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [IsCancelMulZero α] [Nontrivial α] (p : Associates.FactorSet α) : p.prod = 0 ↔ p = ⊤ - Associates.map_subtype_coe_factors' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} : Multiset.map Subtype.val (Associates.factors' a) = Multiset.map Associates.mk (UniqueFactorizationMonoid.factors a) - Associates.factors_one 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] : Associates.factors 1 = 0 - Associates.count_eq_zero_of_ne 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {p q : Associates α} (hp : Irreducible p) (hq : Irreducible q) (h : p ≠ q) : p.count q.factors = 0 - Associates.prod_add 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] (a b : Associates.FactorSet α) : (a + b).prod = a.prod * b.prod - Associates.le_of_count_ne_zero 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {m p : Associates α} (h0 : m ≠ 0) (hp : Irreducible p) : p.count m.factors ≠ 0 → p ≤ m - Associates.factors_mul 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] (a b : Associates α) : (a * b).factors = a.factors + b.factors - Associates.prod_mono 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {a b : Associates.FactorSet α} : a ≤ b → a.prod ≤ b.prod - Associates.prod_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] {a b : Associates.FactorSet α} : a.prod ≤ b.prod ↔ a ≤ b - Associates.count_le_count_of_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b p : Associates α} (hb : b ≠ 0) (hp : Irreducible p) (h : a ≤ b) : p.count a.factors ≤ p.count b.factors - Associates.count_zero 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {p : Associates α} (hp : Irreducible p) : p.count 0 = 0 - Associates.factors_mono 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a b : Associates α} : a ≤ b → a.factors ≤ b.factors - Associates.factors_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a b : Associates α} : a.factors ≤ b.factors ↔ a ≤ b - Associates.factors_eq_some_iff_ne_zero 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : Associates α} : (∃ s, a.factors = ↑s) ↔ a ≠ 0 - Associates.prod_coe 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {s : Multiset { a // Irreducible a }} : Associates.FactorSet.prod ↑s = (Multiset.map Subtype.val s).prod - Associates.dvd_count_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] [Nontrivial α] {a : Associates α} (ha : a ≠ 0) {p : Associates α} (hp : Irreducible p) (k : ℕ) : k ∣ p.count (a ^ k).factors - Associates.eq_of_eq_counts 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b : Associates α} (ha : a ≠ 0) (hb : b ≠ 0) (h : ∀ (p : Associates α), Irreducible p → p.count a.factors = p.count b.factors) : a = b - Associates.eq_factors_of_eq_counts 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b : Associates α} (ha : a ≠ 0) (hb : b ≠ 0) (h : ∀ (p : Associates α), Irreducible p → p.count a.factors = p.count b.factors) : a.factors = b.factors - Associates.count_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] [Nontrivial α] {a : Associates α} (ha : a ≠ 0) {p : Associates α} (hp : Irreducible p) (k : ℕ) : p.count (a ^ k).factors = k * p.count a.factors - Associates.prime_pow_dvd_iff_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {m p : Associates α} (h₁ : m ≠ 0) (h₂ : Irreducible p) {k : ℕ} : p ^ k ≤ m ↔ k ≤ p.count m.factors - Associates.is_pow_of_dvd_count 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a : Associates α} (ha : a ≠ 0) {k : ℕ} (hk : ∀ (p : Associates α), Irreducible p → k ∣ p.count a.factors) : ∃ b, a = b ^ k - Associates.prime_pow_le_iff_le_bcount 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] {m p : Associates α} (h₁ : m ≠ 0) (h₂ : Irreducible p) {k : ℕ} : p ^ k ≤ m ↔ k ≤ Associates.bcount ⟨p, h₂⟩ m.factors - Associates.factors_prime_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] {p : Associates α} (hp : Irreducible p) (k : ℕ) : (p ^ k).factors = ↑(Multiset.replicate k ⟨p, hp⟩) - Associates.count_mul 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a : Associates α} (ha : a ≠ 0) {b : Associates α} (hb : b ≠ 0) {p : Associates α} (hp : Irreducible p) : p.count (a * b).factors = p.count a.factors + p.count b.factors - Associates.mem_factors'_of_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) (hd : p ∣ a) : ⟨Associates.mk p, ⋯⟩ ∈ Associates.factors' a - Associates.mem_factors'_iff_dvd 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : α} (ha0 : a ≠ 0) (hp : Irreducible p) : ⟨Associates.mk p, ⋯⟩ ∈ Associates.factors' a ↔ p ∣ a - Associates.factors_self 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] {p : Associates α} (hp : Irreducible p) : p.factors = ↑{⟨p, hp⟩} - Associates.dvd_of_mem_factors' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a : α} {p : Associates α} {hp : Irreducible p} {hz : a ≠ 0} (h_mem : ⟨p, hp⟩ ∈ Associates.factors' a) : p ∣ Associates.mk a - Associates.eq_pow_count_factors_of_dvd_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {p a : Associates α} (hp : Irreducible p) {n : ℕ} (h : a ∣ p ^ n) : a = p ^ p.count a.factors - Associates.pow_factors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [Nontrivial α] {a : Associates α} {k : ℕ} : (a ^ k).factors = k • a.factors - Associates.count_le_count_of_factors_le 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b p : Associates α} (hb : b ≠ 0) (hp : Irreducible p) (h : a.factors ≤ b.factors) : p.count a.factors ≤ p.count b.factors - Associates.dvd_count_of_dvd_count_mul 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b : Associates α} (hb : b ≠ 0) {p : Associates α} (hp : Irreducible p) (hab : ∀ (d : Associates α), d ∣ a → d ∣ b → ¬Prime d) {k : ℕ} (habk : k ∣ p.count (a * b).factors) : k ∣ p.count a.factors - Associates.count_mul_of_coprime 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b : Associates α} (hb : b ≠ 0) {p : Associates α} (hp : Irreducible p) (hab : ∀ (d : Associates α), d ∣ a → d ∣ b → ¬Prime d) : p.count a.factors = 0 ∨ p.count a.factors = p.count (a * b).factors - Associates.count_mul_of_coprime' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a b p : Associates α} (hp : Irreducible p) (hab : ∀ (d : Associates α), d ∣ a → d ∣ b → ¬Prime d) : p.count (a * b).factors = p.count a.factors ∨ p.count (a * b).factors = p.count b.factors - Associates.count_of_coprime 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a : Associates α} (ha : a ≠ 0) {b : Associates α} (hb : b ≠ 0) (hab : ∀ (d : Associates α), d ∣ a → d ∣ b → ¬Prime d) {p : Associates α} (hp : Irreducible p) : p.count a.factors = 0 ∨ p.count b.factors = 0 - Associates.mem_factorSet_some 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {p : Associates α} {hp : Irreducible p} {l : Multiset { a // Irreducible a }} : p ∈ ↑l ↔ ⟨p, hp⟩ ∈ l - Associates.count_some 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {p : Associates α} (hp : Irreducible p) (s : Multiset { a // Irreducible a }) : p.count ↑s = Multiset.count ⟨p, hp⟩ s - Associates.count_factors_eq_find_of_dvd_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] [DecidableEq (Associates α)] [(p : Associates α) → Decidable (Irreducible p)] {a p : Associates α} (hp : Irreducible p) [(n : ℕ) → Decidable (a ∣ p ^ n)] {n : ℕ} (h : a ∣ p ^ n) : Nat.find ⋯ = p.count a.factors - Associates.eq_pow_find_of_dvd_irreducible_pow 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [UniqueFactorizationMonoid α] {a p : Associates α} (hp : Irreducible p) [(n : ℕ) → Decidable (a ∣ p ^ n)] {n : ℕ} (h : a ∣ p ^ n) : a = p ^ Nat.find ⋯ - Associates.FactorSet.sup_add_inf_eq_add 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] [DecidableEq (Associates α)] (a b : Associates.FactorSet α) : a ⊔ b + a ⊓ b = a + b - Associates.FactorSet.coe_add 📋 Mathlib.RingTheory.UniqueFactorizationDomain.FactorSet
{α : Type u_1} [CommMonoidWithZero α] {a b : Multiset { a // Irreducible a }} : ↑(a + b) = ↑a + ↑b - Polynomial.exists_irreducible_of_natDegree_ne_zero 📋 Mathlib.RingTheory.Polynomial.UniqueFactorization
{R : Type u_1} [CommSemiring R] [NoZeroDivisors R] [WfDvdMonoid R] {f : Polynomial R} [Nontrivial R] (hf : f.natDegree ≠ 0) : ∃ g, Irreducible g ∧ g ∣ f - Polynomial.exists_irreducible_of_natDegree_pos 📋 Mathlib.RingTheory.Polynomial.UniqueFactorization
{R : Type u_1} [CommSemiring R] [NoZeroDivisors R] [WfDvdMonoid R] {f : Polynomial R} [Nontrivial R] (hf : 0 < f.natDegree) : ∃ g, Irreducible g ∧ g ∣ f - Polynomial.exists_irreducible_of_degree_pos 📋 Mathlib.RingTheory.Polynomial.UniqueFactorization
{R : Type u_1} [CommSemiring R] [NoZeroDivisors R] [WfDvdMonoid R] {f : Polynomial R} [Nontrivial R] (hf : 0 < f.degree) : ∃ g, Irreducible g ∧ g ∣ f - Polynomial.exists_monic_irreducible_factor 📋 Mathlib.RingTheory.Polynomial.UniqueFactorization
{F : Type u_1} [Field F] (f : Polynomial F) (hu : ¬IsUnit f) : ∃ g, g.Monic ∧ Irreducible g ∧ g ∣ f - UniqueFactorizationMonoid.multiplicity_eq_count_normalizedFactors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] {a b : R} (ha : Irreducible a) (hb : b ≠ 0) : multiplicity a b = Multiset.count (normalize a) (UniqueFactorizationMonoid.normalizedFactors b) - UniqueFactorizationMonoid.emultiplicity_eq_count_normalizedFactors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] {a b : R} (ha : Irreducible a) (hb : b ≠ 0) : emultiplicity a b = ↑(Multiset.count (normalize a) (UniqueFactorizationMonoid.normalizedFactors b)) - UniqueFactorizationMonoid.le_emultiplicity_iff_replicate_le_normalizedFactors 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] {a b : R} {n : ℕ} (ha : Irreducible a) (hb : b ≠ 0) : ↑n ≤ emultiplicity a b ↔ Multiset.replicate n (normalize a) ≤ UniqueFactorizationMonoid.normalizedFactors b - WfDvdMonoid.max_power_factor 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{α : Type u_1} [CommMonoidWithZero α] [WfDvdMonoid α] {a₀ x : α} (h : a₀ ≠ 0) (hx : Irreducible x) : ∃ n a, ¬x ∣ a ∧ a₀ = x ^ n * a - UniqueFactorizationMonoid.hasFiniteMulSupport_fun_pow_multiplicity 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] {α : Type u_3} {M : Type u_4} [CommMonoid M] [Subsingleton Rˣ] (f : α → M) {g : α → R} (hgi : Function.Injective g) (hg : ∀ (s : α), Irreducible (g s)) {r : R} (hr : r ≠ 0) : Function.HasFiniteMulSupport fun s => f s ^ multiplicity (g s) r - UniqueFactorizationMonoid.count_normalizedFactors_eq 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] {p x : R} (hp : Irreducible p) (hnorm : normalize p = p) {n : ℕ} (hle : p ^ n ∣ x) (hlt : ¬p ^ (n + 1) ∣ x) : Multiset.count p (UniqueFactorizationMonoid.normalizedFactors x) = n - UniqueFactorizationMonoid.count_normalizedFactors_eq' 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] {p x : R} (hp : p = 0 ∨ Irreducible p) (hnorm : normalize p = p) {n : ℕ} (hle : p ^ n ∣ x) (hlt : ¬p ^ (n + 1) ∣ x) : Multiset.count p (UniqueFactorizationMonoid.normalizedFactors x) = n - exists_reduced_fraction' 📋 Mathlib.RingTheory.Localization.Away.Basic
{R : Type u_3} [CommRing R] (x : R) (B : Type u_4) [CommRing B] [Algebra R B] [IsLocalization.Away x B] [IsDomain R] [WfDvdMonoid R] {b : B} (hb : b ≠ 0) (hx : Irreducible x) : ∃ a n, ¬x ∣ a ∧ selfZPow x B n * (algebraMap R B) a = b - Polynomial.Splits.natDegree_le_one_of_irreducible 📋 Mathlib.Algebra.Polynomial.Splits
{R : Type u_1} [CommSemiring R] {f : Polynomial R} (hf : f.Splits) (h : Irreducible f) : f.natDegree ≤ 1
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c