Localization over right Ore sets.

This file defines the localization of a monoid over a right Ore set and proves its universal mapping property. It then extends the definition and its properties first to semirings and then to rings. We show that in the case of a commutative monoid this definition coincides with the common monoid localization. Finally we show that in a ring without zero divisors, taking the Ore localization at R - {0} results in a division ring.

Notations

Introduces the notation R[S⁻¹] for the Ore localization of a monoid R at a right Ore subset S. Also defines a new heterogeneous division notation r /ₒ s for a numerator r : R and a denominator s : S.

References

• [Zoran Škoda, Noncommutative localization in noncommutative geometry][skoda2006]

Tags

localization, Ore, non-commutative

def OreLocalization.oreEqv (R : Type u_1) [Monoid R] (S : Submonoid R) [OreLocalization.OreSet S] : Setoid (R × ↥S)

The setoid on R × S used for the Ore localization.

Equations

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

def OreLocalization (R : Type u_1) [Monoid R] (S : Submonoid R) [OreLocalization.OreSet S] : Type u_1

The ore localization of a monoid and a submonoid fulfilling the ore condition.

Equations

• OreLocalization R S = Quotient (OreLocalization.oreEqv R S)

def OreLocalization.«term__[_⁻¹_]» : Lean.TrailingParserDescr

The ore localization of a monoid and a submonoid fulfilling the ore condition.

Equations

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

def OreLocalization.oreDiv {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r : R) (s : ↥S) : OreLocalization R S

The division in the ore localization R[S⁻¹], as a fraction of an element of R and S.

Equations

• r /ₒ s = Quotient.mk' (r, s)

def OreLocalization.«term_/ₒ_» : Lean.TrailingParserDescr

The division in the ore localization R[S⁻¹], as a fraction of an element of R and S.

Equations

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

theorem OreLocalization.ind {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {β : OreLocalization R S → Prop} (c : ∀ (r : R) (s : ↥S), β (r /ₒ s)) (q : OreLocalization R S) : β q

theorem OreLocalization.oreDiv_eq_iff {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r₁ : R} {r₂ : R} {s₁ : ↥S} {s₂ : ↥S} : r₁ /ₒ s₁ = r₂ /ₒ s₂ ↔ ∃ (u : ↥S) (v : R), r₂ * ↑u = r₁ * v ∧ ↑s₂ * ↑u = ↑s₁ * v

theorem OreLocalization.expand {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r : R) (s : ↥S) (t : R) (hst : ↑s * t ∈ S) : r /ₒ s = r * t /ₒ { val := ↑s * t, property := hst }

A fraction r /ₒ s is equal to its expansion by an arbitrary factor t if s * t ∈ S.

theorem OreLocalization.expand' {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r : R) (s : ↥S) (s' : ↥S) : r /ₒ s = r * ↑s' /ₒ (s * s')

A fraction is equal to its expansion by a factor from s.

theorem OreLocalization.eq_of_num_factor_eq {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {r' : R} {r₁ : R} {r₂ : R} {s : ↥S} {t : ↥S} (h : r * ↑t = r' * ↑t) : r₁ * r * r₂ /ₒ s = r₁ * r' * r₂ /ₒ s

Fractions which differ by a factor of the numerator can be proven equal if those factors expand to equal elements of R.

def OreLocalization.liftExpand {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {C : Sort u_2} (P : R → ↥S → C) (hP : ∀ (r t : R) (s : ↥S) (ht : ↑s * t ∈ S), P r s = P (r * t) { val := ↑s * t, property := ht }) : OreLocalization R S → C

A function or predicate over R and S can be lifted to R[S⁻¹] if it is invariant under expansion on the right.

Equations

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

@[simp]

theorem OreLocalization.liftExpand_of {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {C : Sort u_2} {P : R → ↥S → C} {hP : ∀ (r t : R) (s : ↥S) (ht : ↑s * t ∈ S), P r s = P (r * t) { val := ↑s * t, property := ht }} (r : R) (s : ↥S) : OreLocalization.liftExpand P hP (r /ₒ s) = P r s

def OreLocalization.lift₂Expand {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {C : Sort u_2} (P : R → ↥S → R → ↥S → C) (hP : ∀ (r₁ t₁ : R) (s₁ : ↥S) (ht₁ : ↑s₁ * t₁ ∈ S) (r₂ t₂ : R) (s₂ : ↥S) (ht₂ : ↑s₂ * t₂ ∈ S), P r₁ s₁ r₂ s₂ = P (r₁ * t₁) { val := ↑s₁ * t₁, property := ht₁ } (r₂ * t₂) { val := ↑s₂ * t₂, property := ht₂ }) : OreLocalization R S → OreLocalization R S → C

A version of liftExpand used to simultaneously lift functions with two arguments in R[S⁻¹].

Equations

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

@[simp]

theorem OreLocalization.lift₂Expand_of {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {C : Sort u_2} {P : R → ↥S → R → ↥S → C} {hP : ∀ (r₁ t₁ : R) (s₁ : ↥S) (ht₁ : ↑s₁ * t₁ ∈ S) (r₂ t₂ : R) (s₂ : ↥S) (ht₂ : ↑s₂ * t₂ ∈ S), P r₁ s₁ r₂ s₂ = P (r₁ * t₁) { val := ↑s₁ * t₁, property := ht₁ } (r₂ * t₂) { val := ↑s₂ * t₂, property := ht₂ }} (r₁ : R) (s₁ : ↥S) (r₂ : R) (s₂ : ↥S) : OreLocalization.lift₂Expand P hP (r₁ /ₒ s₁) (r₂ /ₒ s₂) = P r₁ s₁ r₂ s₂

def OreLocalization.mul {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : OreLocalization R S → OreLocalization R S → OreLocalization R S

The multiplication on the Ore localization of monoids.

Equations

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

instance OreLocalization.instMulOreLocalization {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : Mul (OreLocalization R S)

Equations

• OreLocalization.instMulOreLocalization = { mul := OreLocalization.mul }

theorem OreLocalization.oreDiv_mul_oreDiv {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r₁ : R} {r₂ : R} {s₁ : ↥S} {s₂ : ↥S} : r₁ /ₒ s₁ * (r₂ /ₒ s₂) = r₁ * OreLocalization.oreNum r₂ s₁ /ₒ (s₂ * OreLocalization.oreDenom r₂ s₁)

theorem OreLocalization.oreDiv_mul_char {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r₁ : R) (r₂ : R) (s₁ : ↥S) (s₂ : ↥S) (r' : R) (s' : ↥S) (huv : r₂ * ↑s' = ↑s₁ * r') : r₁ /ₒ s₁ * (r₂ /ₒ s₂) = r₁ * r' /ₒ (s₂ * s')

A characterization lemma for the multiplication on the Ore localization, allowing for a choice of Ore numerator and Ore denominator.

def OreLocalization.oreDivMulChar' {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (r₁ : R) (r₂ : R) (s₁ : ↥S) (s₂ : ↥S) : (r' : R) ×' (s' : ↥S) ×' r₂ * ↑s' = ↑s₁ * r' ∧ r₁ /ₒ s₁ * (r₂ /ₒ s₂) = r₁ * r' /ₒ (s₂ * s')

Another characterization lemma for the multiplication on the Ore localizaion delivering Ore witnesses and conditions bundled in a sigma type.

Equations

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

instance OreLocalization.instOneOreLocalization {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : One (OreLocalization R S)

Equations

• OreLocalization.instOneOreLocalization = { one := 1 /ₒ 1 }

theorem OreLocalization.one_def {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : 1 = 1 /ₒ 1

instance OreLocalization.instInhabitedOreLocalization {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : Inhabited (OreLocalization R S)

Equations

• OreLocalization.instInhabitedOreLocalization = { default := 1 }

@[simp]

theorem OreLocalization.div_eq_one' {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} (hr : r ∈ S) : r /ₒ { val := r, property := hr } = 1

@[simp]

theorem OreLocalization.div_eq_one {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {s : ↥S} : ↑s /ₒ s = 1

theorem OreLocalization.one_mul {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : 1 * x = x

theorem OreLocalization.mul_one {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : x * 1 = x

theorem OreLocalization.mul_assoc {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) (y : OreLocalization R S) (z : OreLocalization R S) : x * y * z = x * (y * z)

instance OreLocalization.instMonoidOreLocalization {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : Monoid (OreLocalization R S)

Equations

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

theorem OreLocalization.mul_inv {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (s : ↥S) (s' : ↥S) : ↑s /ₒ s' * (↑s' /ₒ s) = 1

@[simp]

theorem OreLocalization.mul_one_div {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {s : ↥S} {t : ↥S} : r /ₒ s * (1 /ₒ t) = r /ₒ (t * s)

@[simp]

theorem OreLocalization.mul_cancel {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {s : ↥S} {t : ↥S} : r /ₒ s * (↑s /ₒ t) = r /ₒ t

@[simp]

theorem OreLocalization.mul_cancel' {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r₁ : R} {r₂ : R} {s : ↥S} {t : ↥S} : r₁ /ₒ s * (↑s * r₂ /ₒ t) = r₁ * r₂ /ₒ t

@[simp]

theorem OreLocalization.div_one_mul {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {p : R} {r : R} {s : ↥S} : r /ₒ 1 * (p /ₒ s) = r * p /ₒ s

def OreLocalization.numeratorUnit {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (s : ↥S) : (OreLocalization R S)ˣ

The fraction s /ₒ 1 as a unit in R[S⁻¹], where s : S.

Equations

• OreLocalization.numeratorUnit s = { val := ↑s /ₒ 1, inv := 1 /ₒ s, val_inv := (_ : ↑s /ₒ 1 * (↑1 /ₒ s) = 1), inv_val := (_ : ↑1 /ₒ s * (↑s /ₒ 1) = 1) }

def OreLocalization.numeratorHom {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] : R →* OreLocalization R S

The multiplicative homomorphism from R to R[S⁻¹], mapping r : R to the fraction r /ₒ 1.

Equations

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

theorem OreLocalization.numeratorHom_apply {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} : OreLocalization.numeratorHom r = r /ₒ 1

theorem OreLocalization.numerator_isUnit {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] (s : ↥S) : IsUnit (OreLocalization.numeratorHom ↑s)

def OreLocalization.universalMulHom {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Monoid T] (f : R →* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) : OreLocalization R S →* T

The universal lift from a morphism R →* T, which maps elements of S to units of T, to a morphism R[S⁻¹] →* T.

Equations

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

theorem OreLocalization.universalMulHom_apply {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Monoid T] (f : R →* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) {r : R} {s : ↥S} : (OreLocalization.universalMulHom f fS hf) (r /ₒ s) = f r * ↑(fS s)⁻¹

theorem OreLocalization.universalMulHom_commutes {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Monoid T] (f : R →* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) {r : R} : (OreLocalization.universalMulHom f fS hf) (OreLocalization.numeratorHom r) = f r

theorem OreLocalization.universalMulHom_unique {R : Type u_1} [Monoid R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Monoid T] (f : R →* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) (φ : OreLocalization R S →* T) (huniv : ∀ (r : R), φ (OreLocalization.numeratorHom r) = f r) : φ = OreLocalization.universalMulHom f fS hf

The universal morphism universalMulHom is unique.

theorem OreLocalization.oreDiv_mul_oreDiv_comm {R : Type u_1} [CommMonoid R] {S : Submonoid R} [OreLocalization.OreSet S] {r₁ : R} {r₂ : R} {s₁ : ↥S} {s₂ : ↥S} : r₁ /ₒ s₁ * (r₂ /ₒ s₂) = r₁ * r₂ /ₒ (s₁ * s₂)

instance OreLocalization.instCommMonoidOreLocalizationToMonoid {R : Type u_1} [CommMonoid R] {S : Submonoid R} [OreLocalization.OreSet S] : CommMonoid (OreLocalization R S)

Equations

• OreLocalization.instCommMonoidOreLocalizationToMonoid = let src := OreLocalization.instMonoidOreLocalization; CommMonoid.mk (_ : ∀ (x y : OreLocalization R S), x * y = y * x)

def OreLocalization.localizationMap (R : Type u_1) [CommMonoid R] (S : Submonoid R) [OreLocalization.OreSet S] : Submonoid.LocalizationMap S (OreLocalization R S)

The morphism numeratorHom is a monoid localization map in the case of commutative R.

Equations

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

noncomputable def OreLocalization.equivMonoidLocalization (R : Type u_1) [CommMonoid R] (S : Submonoid R) [OreLocalization.OreSet S] : Localization S ≃* OreLocalization R S

If R is commutative, Ore localization and monoid localization are isomorphic.

Equations

• OreLocalization.equivMonoidLocalization R S = Localization.mulEquivOfQuotient (OreLocalization.localizationMap R S)

instance OreLocalization.instAddOreLocalization {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] : Add (OreLocalization R S)

Equations

• OreLocalization.instAddOreLocalization = { add := OreLocalization.add }

theorem OreLocalization.oreDiv_add_oreDiv {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {r' : R} {s : ↥S} {s' : ↥S} : r /ₒ s + r' /ₒ s' = (r * ↑(OreLocalization.oreDenom (↑s) s') + r' * OreLocalization.oreNum (↑s) s') /ₒ (s * OreLocalization.oreDenom (↑s) s')

theorem OreLocalization.oreDiv_add_char {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {r' : R} (s : ↥S) (s' : ↥S) (rb : R) (sb : ↥S) (h : ↑s * ↑sb = ↑s' * rb) : r /ₒ s + r' /ₒ s' = (r * ↑sb + r' * rb) /ₒ (s * sb)

A characterization of the addition on the Ore localizaion, allowing for arbitrary Ore numerator and Ore denominator.

def OreLocalization.oreDivAddChar' {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (r : R) (r' : R) (s : ↥S) (s' : ↥S) : (r'' : R) ×' (s'' : ↥S) ×' ↑s * ↑s'' = ↑s' * r'' ∧ r /ₒ s + r' /ₒ s' = (r * ↑s'' + r' * r'') /ₒ (s * s'')

Another characterization of the addition on the Ore localization, bundling up all witnesses and conditions into a sigma type.

Equations

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

@[simp]

theorem OreLocalization.add_oreDiv {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {r : R} {r' : R} {s : ↥S} : r /ₒ s + r' /ₒ s = (r + r') /ₒ s

theorem OreLocalization.add_assoc {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) (y : OreLocalization R S) (z : OreLocalization R S) : x + y + z = x + (y + z)

instance OreLocalization.instZeroOreLocalizationToMonoidToMonoidWithZero {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] : Zero (OreLocalization R S)

Equations

• OreLocalization.instZeroOreLocalizationToMonoidToMonoidWithZero = { zero := OreLocalization.zero }

theorem OreLocalization.zero_def {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] : 0 = 0 /ₒ 1

@[simp]

theorem OreLocalization.zero_div_eq_zero {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (s : ↥S) : 0 /ₒ s = 0

theorem OreLocalization.zero_add {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : 0 + x = x

theorem OreLocalization.add_comm {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) (y : OreLocalization R S) : x + y = y + x

instance OreLocalization.instAddCommMonoidOreLocalization {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] : AddCommMonoid (OreLocalization R S)

Equations

• OreLocalization.instAddCommMonoidOreLocalization = let src := OreLocalization.instAddOreLocalization; AddCommMonoid.mk (_ : ∀ (x y : OreLocalization R S), x + y = y + x)

theorem OreLocalization.zero_mul {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : 0 * x = 0

theorem OreLocalization.mul_zero {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : x * 0 = 0

theorem OreLocalization.left_distrib {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) (y : OreLocalization R S) (z : OreLocalization R S) : x * (y + z) = x * y + x * z

theorem OreLocalization.right_distrib {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) (y : OreLocalization R S) (z : OreLocalization R S) : (x + y) * z = x * z + y * z

instance OreLocalization.instSemiringOreLocalization {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] : Semiring (OreLocalization R S)

Equations

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

def OreLocalization.universalHom {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Semiring T] (f : R →+* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) : OreLocalization R S →+* T

The universal lift from a ring homomorphism f : R →+* T, which maps elements in S to units of T, to a ring homomorphism R[S⁻¹] →+* T. This extends the construction on monoids.

Equations

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

theorem OreLocalization.universalHom_apply {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Semiring T] (f : R →+* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) {r : R} {s : ↥S} : (OreLocalization.universalHom f fS hf) (r /ₒ s) = f r * ↑(fS s)⁻¹

theorem OreLocalization.universalHom_commutes {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Semiring T] (f : R →+* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) {r : R} : (OreLocalization.universalHom f fS hf) (OreLocalization.numeratorHom r) = f r

theorem OreLocalization.universalHom_unique {R : Type u_1} [Semiring R] {S : Submonoid R} [OreLocalization.OreSet S] {T : Type u_2} [Semiring T] (f : R →+* T) (fS : ↥S →* Tˣ) (hf : ∀ (s : ↥S), f ↑s = ↑(fS s)) (φ : OreLocalization R S →+* T) (huniv : ∀ (r : R), φ (OreLocalization.numeratorHom r) = f r) : φ = OreLocalization.universalHom f fS hf

def OreLocalization.neg {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] : OreLocalization R S → OreLocalization R S

Negation on the Ore localization is defined via negation on the numerator.

Equations

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

instance OreLocalization.instNegOreLocalization {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] : Neg (OreLocalization R S)

Equations

• OreLocalization.instNegOreLocalization = { neg := OreLocalization.neg }

@[simp]

theorem OreLocalization.neg_def {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] (r : R) (s : ↥S) : -(r /ₒ s) = -r /ₒ s

theorem OreLocalization.add_left_neg {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] (x : OreLocalization R S) : -x + x = 0

instance OreLocalization.ring {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] : Ring (OreLocalization R S)

Equations

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

theorem OreLocalization.numeratorHom_inj {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] (hS : S ≤ nonZeroDivisors R) : Function.Injective ⇑OreLocalization.numeratorHom

theorem OreLocalization.nontrivial_of_nonZeroDivisors {R : Type u_1} [Ring R] {S : Submonoid R} [OreLocalization.OreSet S] [Nontrivial R] (hS : S ≤ nonZeroDivisors R) : Nontrivial (OreLocalization R S)

instance OreLocalization.nontrivial {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] : Nontrivial (OreLocalization R (nonZeroDivisors R))

Equations

• (_ : Nontrivial (OreLocalization R (nonZeroDivisors R))) = (_ : Nontrivial (OreLocalization R (nonZeroDivisors R)))

def OreLocalization.inv {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] : OreLocalization R (nonZeroDivisors R) → OreLocalization R (nonZeroDivisors R)

The inversion of Ore fractions for a ring without zero divisors, satisying 0⁻¹ = 0 and (r /ₒ r')⁻¹ = r' /ₒ r for r ≠ 0.

Equations

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

instance OreLocalization.inv' {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] : Inv (OreLocalization R (nonZeroDivisors R))

Equations

• OreLocalization.inv' = { inv := OreLocalization.inv }

theorem OreLocalization.inv_def {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] {r : R} {s : ↥(nonZeroDivisors R)} : (r /ₒ s)⁻¹ = if hr : r = 0 then 0 else ↑s /ₒ { val := r, property := (_ : ∀ (x : R), x * r = 0 → x = 0) }

theorem OreLocalization.mul_inv_cancel {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] (x : OreLocalization R (nonZeroDivisors R)) (h : x ≠ 0) : x * x⁻¹ = 1

theorem OreLocalization.inv_zero {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] : 0⁻¹ = 0

instance OreLocalization.divisionRing {R : Type u_1} [Ring R] [Nontrivial R] [OreLocalization.OreSet (nonZeroDivisors R)] [NoZeroDivisors R] : DivisionRing (OreLocalization R (nonZeroDivisors R))

Equations

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