Non-zero divisors and smul-divisors

In this file we define the submonoid nonZeroDivisors and nonZeroSMulDivisors of a MonoidWithZero. We also define nonZeroDivisorsLeft and nonZeroDivisorsRight for non-commutative monoids.

Notations

This file declares the notations:

• R⁰ for the submonoid of non-zero-divisors of R, in the locale nonZeroDivisors.
• R⁰[M] for the submonoid of non-zero smul-divisors of R with respect to M, in the locale nonZeroSMulDivisors

Use the statement open scoped nonZeroDivisors nonZeroSMulDivisors to access this notation in your own code.

def nonZeroDivisorsLeft (M₀ : Type u_1) [MonoidWithZero M₀] : Submonoid M₀

The collection of elements of a MonoidWithZero that are not left zero divisors form a Submonoid.

Equations

• nonZeroDivisorsLeft M₀ = { toSubsemigroup := { carrier := {x : M₀ | ∀ (y : M₀), y * x = 0 → y = 0}, mul_mem' := ⋯ }, one_mem' := ⋯ }

@[simp]

theorem mem_nonZeroDivisorsLeft_iff (M₀ : Type u_1) [MonoidWithZero M₀] {x : M₀} : x ∈ nonZeroDivisorsLeft M₀ ↔ ∀ (y : M₀), y * x = 0 → y = 0

def nonZeroDivisorsRight (M₀ : Type u_1) [MonoidWithZero M₀] : Submonoid M₀

The collection of elements of a MonoidWithZero that are not right zero divisors form a Submonoid.

Equations

• nonZeroDivisorsRight M₀ = { toSubsemigroup := { carrier := {x : M₀ | ∀ (y : M₀), x * y = 0 → y = 0}, mul_mem' := ⋯ }, one_mem' := ⋯ }

@[simp]

theorem mem_nonZeroDivisorsRight_iff (M₀ : Type u_1) [MonoidWithZero M₀] {x : M₀} : x ∈ nonZeroDivisorsRight M₀ ↔ ∀ (y : M₀), x * y = 0 → y = 0

theorem nonZeroDivisorsLeft_eq_right (M₀ : Type u_2) [CommMonoidWithZero M₀] : nonZeroDivisorsLeft M₀ = nonZeroDivisorsRight M₀

@[simp]

theorem coe_nonZeroDivisorsLeft_eq (M₀ : Type u_1) [MonoidWithZero M₀] [NoZeroDivisors M₀] [Nontrivial M₀] : ↑(nonZeroDivisorsLeft M₀) = {x : M₀ | x ≠ 0}

@[simp]

theorem coe_nonZeroDivisorsRight_eq (M₀ : Type u_1) [MonoidWithZero M₀] [NoZeroDivisors M₀] [Nontrivial M₀] : ↑(nonZeroDivisorsRight M₀) = {x : M₀ | x ≠ 0}

def nonZeroDivisors (R : Type u_2) [MonoidWithZero R] : Submonoid R

The submonoid of non-zero-divisors of a MonoidWithZero R.

Equations

• nonZeroDivisors R = { toSubsemigroup := { carrier := {x : R | ∀ (z : R), z * x = 0 → z = 0}, mul_mem' := ⋯ }, one_mem' := ⋯ }

Instances For

• NumberField.instIsLocalizedModuleIntInstCommSemiringIntNonZeroDivisorsToMonoidWithZeroInstSemiringIntSubtypeMemSubmoduleSubalgebraToCommSemiringInstCommRingIntToSemiringToCommSemiringToCommRingToEuclideanDomainAlgebraIntToRingToDivisionRingInstMembershipInstSetLikeSubalgebraRingOfIntegersToCommRingToAddCommMonoidToNonUnitalNonAssocSemiringToNonUnitalNonAssocCommSemiringToNonUnitalNonAssocCommRingToNonUnitalCommRingToModuleToAlgebraToCommSemiringToSemifieldIdSetLikeCoeToSubmoduleNonZeroDivisorsToMonoidWithZeroToSemiringValFractionalIdealToMonoidToSemiringToDivisionSemiringSemifieldInstIsDedekindDomainSubtypeMemSubalgebraIntToCommSemiringInstCommRingIntToSemiringToCommSemiringToCommRingToEuclideanDomainAlgebraIntToRingToDivisionRingInstMembershipInstSetLikeSubalgebraRingOfIntegersToCommRingInstIsFractionRingSubtypeMemSubalgebraIntToCommSemiringInstCommRingIntToSemiringToCommSemiringToCommRingToEuclideanDomainAlgebraIntToRingToDivisionRingInstMembershipInstSetLikeSubalgebraRingOfIntegersToCommRingToAlgebraToCommSemiringToSemifieldIdAddCommMonoidIntModuleAddCommGroupToRingToAddCommGroupRestrictScalarsModuleIntModuleSubtype

def nonZeroDivisors.«term_⁰» : Lean.TrailingParserDescr

The notation for the submonoid of non-zerodivisors.

Equations

• nonZeroDivisors.«term_⁰» = Lean.ParserDescr.trailingNode `nonZeroDivisors.term_⁰ 9000 0 (Lean.ParserDescr.symbol "⁰")

def nonZeroSMulDivisors (R : Type u_2) [MonoidWithZero R] (M : Type u_3) [Zero M] [MulAction R M] : Submonoid R

Let R be a monoid with zero and M an additive monoid with an R-action, then the collection of non-zero smul-divisors forms a submonoid. These elements are also called M-regular.

Equations

• nonZeroSMulDivisors R M = { toSubsemigroup := { carrier := {r : R | ∀ (m : M), r • m = 0 → m = 0}, mul_mem' := ⋯ }, one_mem' := ⋯ }

def nonZeroSMulDivisors.«term_⁰[_]» : Lean.TrailingParserDescr

The notation for the submonoid of non-zero smul-divisors.

Equations

• One or more equations did not get rendered due to their size.

theorem mem_nonZeroDivisors_iff {M : Type u_2} [MonoidWithZero M] {r : M} : r ∈ nonZeroDivisors M ↔ ∀ (x : M), x * r = 0 → x = 0

theorem mul_right_mem_nonZeroDivisors_eq_zero_iff {M : Type u_2} [MonoidWithZero M] {x : M} {r : M} (hr : r ∈ nonZeroDivisors M) : x * r = 0 ↔ x = 0

@[simp]

theorem mul_right_coe_nonZeroDivisors_eq_zero_iff {M : Type u_2} [MonoidWithZero M] {x : M} {c : ↥(nonZeroDivisors M)} : x * ↑c = 0 ↔ x = 0

theorem mul_left_mem_nonZeroDivisors_eq_zero_iff {M₁ : Type u_4} [CommMonoidWithZero M₁] {r : M₁} {x : M₁} (hr : r ∈ nonZeroDivisors M₁) : r * x = 0 ↔ x = 0

@[simp]

theorem mul_left_coe_nonZeroDivisors_eq_zero_iff {M₁ : Type u_4} [CommMonoidWithZero M₁] {c : ↥(nonZeroDivisors M₁)} {x : M₁} : ↑c * x = 0 ↔ x = 0

theorem mul_cancel_right_mem_nonZeroDivisors {R : Type u_5} [Ring R] {x : R} {y : R} {r : R} (hr : r ∈ nonZeroDivisors R) : x * r = y * r ↔ x = y

theorem mul_cancel_right_coe_nonZeroDivisors {R : Type u_5} [Ring R] {x : R} {y : R} {c : ↥(nonZeroDivisors R)} : x * ↑c = y * ↑c ↔ x = y

@[simp]

theorem mul_cancel_left_mem_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {r : R'} (hr : r ∈ nonZeroDivisors R') : r * x = r * y ↔ x = y

theorem mul_cancel_left_coe_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {c : ↥(nonZeroDivisors R')} : ↑c * x = ↑c * y ↔ x = y

theorem dvd_cancel_right_mem_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {r : R'} (hr : r ∈ nonZeroDivisors R') : x * r ∣ y * r ↔ x ∣ y

theorem dvd_cancel_right_coe_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {c : ↥(nonZeroDivisors R')} : x * ↑c ∣ y * ↑c ↔ x ∣ y

theorem dvd_cancel_left_mem_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {r : R'} (hr : r ∈ nonZeroDivisors R') : r * x ∣ r * y ↔ x ∣ y

theorem dvd_cancel_left_coe_nonZeroDivisors {R' : Type u_6} [CommRing R'] {x : R'} {y : R'} {c : ↥(nonZeroDivisors R')} : ↑c * x ∣ ↑c * y ↔ x ∣ y

theorem zero_not_mem_nonZeroDivisors {M : Type u_2} [MonoidWithZero M] [Nontrivial M] : 0 ∉ nonZeroDivisors M

theorem nonZeroDivisors.ne_zero {M : Type u_2} [MonoidWithZero M] [Nontrivial M] {x : M} (hx : x ∈ nonZeroDivisors M) : x ≠ 0

theorem nonZeroDivisors.coe_ne_zero {M : Type u_2} [MonoidWithZero M] [Nontrivial M] (x : ↥(nonZeroDivisors M)) : ↑x ≠ 0

theorem mul_mem_nonZeroDivisors {M₁ : Type u_4} [CommMonoidWithZero M₁] {a : M₁} {b : M₁} : a * b ∈ nonZeroDivisors M₁ ↔ a ∈ nonZeroDivisors M₁ ∧ b ∈ nonZeroDivisors M₁

theorem isUnit_of_mem_nonZeroDivisors {G₀ : Type u_8} [GroupWithZero G₀] {x : G₀} (hx : x ∈ nonZeroDivisors G₀) : IsUnit x

theorem eq_zero_of_ne_zero_of_mul_right_eq_zero {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] {x : M} {y : M} (hnx : x ≠ 0) (hxy : y * x = 0) : y = 0

theorem eq_zero_of_ne_zero_of_mul_left_eq_zero {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] {x : M} {y : M} (hnx : x ≠ 0) (hxy : x * y = 0) : y = 0

theorem mem_nonZeroDivisors_of_ne_zero {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] {x : M} (hx : x ≠ 0) : x ∈ nonZeroDivisors M

theorem mem_nonZeroDivisors_iff_ne_zero {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] [Nontrivial M] {x : M} : x ∈ nonZeroDivisors M ↔ x ≠ 0

theorem map_ne_zero_of_mem_nonZeroDivisors {M : Type u_2} {M' : Type u_3} {F : Type u_7} [MonoidWithZero M] [MonoidWithZero M'] [FunLike F M M'] [Nontrivial M] [ZeroHomClass F M M'] (g : F) (hg : Function.Injective ⇑g) {x : M} (h : x ∈ nonZeroDivisors M) : g x ≠ 0

theorem map_mem_nonZeroDivisors {M : Type u_2} {M' : Type u_3} {F : Type u_7} [MonoidWithZero M] [MonoidWithZero M'] [FunLike F M M'] [Nontrivial M] [NoZeroDivisors M'] [ZeroHomClass F M M'] (g : F) (hg : Function.Injective ⇑g) {x : M} (h : x ∈ nonZeroDivisors M) : g x ∈ nonZeroDivisors M'

theorem le_nonZeroDivisors_of_noZeroDivisors {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] {S : Submonoid M} (hS : 0 ∉ S) : S ≤ nonZeroDivisors M

theorem powers_le_nonZeroDivisors_of_noZeroDivisors {M : Type u_2} [MonoidWithZero M] [NoZeroDivisors M] {a : M} (ha : a ≠ 0) : Submonoid.powers a ≤ nonZeroDivisors M

theorem map_le_nonZeroDivisors_of_injective {M : Type u_2} {M' : Type u_3} {F : Type u_7} [MonoidWithZero M] [MonoidWithZero M'] [FunLike F M M'] [NoZeroDivisors M'] [MonoidWithZeroHomClass F M M'] (f : F) (hf : Function.Injective ⇑f) {S : Submonoid M} (hS : S ≤ nonZeroDivisors M) : Submonoid.map f S ≤ nonZeroDivisors M'

theorem nonZeroDivisors_le_comap_nonZeroDivisors_of_injective {M : Type u_2} {M' : Type u_3} {F : Type u_7} [MonoidWithZero M] [MonoidWithZero M'] [FunLike F M M'] [NoZeroDivisors M'] [MonoidWithZeroHomClass F M M'] (f : F) (hf : Function.Injective ⇑f) : nonZeroDivisors M ≤ Submonoid.comap f (nonZeroDivisors M')

@[deprecated Multiset.prod_eq_zero_iff]

theorem prod_zero_iff_exists_zero {M₁ : Type u_4} [CommMonoidWithZero M₁] [NoZeroDivisors M₁] [Nontrivial M₁] {s : Multiset M₁} : Multiset.prod s = 0 ↔ ∃ (r : M₁) (_ : r ∈ s), r = 0

theorem mem_nonZeroSMulDivisors_iff {R : Type u_2} {M : Type u_3} [MonoidWithZero R] [Zero M] [MulAction R M] {x : R} : x ∈ nonZeroSMulDivisors R M ↔ ∀ (m : M), x • m = 0 → m = 0

@[simp]

theorem unop_nonZeroSMulDivisors_mulOpposite_eq_nonZeroDivisors (R : Type u_2) [MonoidWithZero R] : Submonoid.unop (nonZeroSMulDivisors Rᵐᵒᵖ R) = nonZeroDivisors R

theorem nonZeroSMulDivisors_mulOpposite_eq_op_nonZeroDivisors (R : Type u_2) [MonoidWithZero R] : nonZeroSMulDivisors Rᵐᵒᵖ R = Submonoid.op (nonZeroDivisors R)

The non-zero •-divisors with • as right multiplication correspond with the non-zero divisors. Note that the MulOpposite is needed because we defined nonZeroDivisors with multiplication on the right.