Homomorphisms of semirings and rings

This file defines bundled homomorphisms of (non-unital) semirings and rings. As with monoid and groups, we use the same structure RingHom a β, a.k.a. α →+* β, for both types of homomorphisms.

Main definitions

• NonUnitalRingHom: Non-unital (semi)ring homomorphisms. Additive monoid homomorphism which preserve multiplication.
• RingHom: (Semi)ring homomorphisms. Monoid homomorphisms which are also additive monoid homomorphism.

Notations

• →ₙ+*: Non-unital (semi)ring homs
• →+*: (Semi)ring homs

Implementation notes

• There's a coercion from bundled homs to fun, and the canonical notation is to use the bundled hom as a function via this coercion.

• There is no SemiringHom -- the idea is that RingHom is used. The constructor for a RingHom between semirings needs a proof of map_zero, map_one and map_add as well as map_mul; a separate constructor RingHom.mk' will construct ring homs between rings from monoid homs given only a proof that addition is preserved.

Tags

RingHom, SemiringHom

structure NonUnitalRingHom (α : Type u_5) (β : Type u_6) [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] extends MulHom : Type (max u_5 u_6)

Bundled non-unital semiring homomorphisms α →ₙ+* β; use this for bundled non-unital ring homomorphisms too.

When possible, instead of parametrizing results over (f : α →ₙ+* β), you should parametrize over (F : Type*) [NonUnitalRingHomClass F α β] (f : F).

When you extend this structure, make sure to extend NonUnitalRingHomClass.

• toFun : α → β
• map_mul' : ∀ (x y : α), self.toFun (x * y) = self.toFun x * self.toFun y
• map_zero' : self.toFun 0 = 0

  The proposition that the function preserves 0

• map_add' : ∀ (x y : α), self.toFun (x + y) = self.toFun x + self.toFun y

  The proposition that the function preserves addition

def «term_→ₙ+*_» : Lean.TrailingParserDescr

α →ₙ+* β denotes the type of non-unital ring homomorphisms from α to β.

Equations

• «term_→ₙ+*_» = Lean.ParserDescr.trailingNode `term_→ₙ+*_ 25 26 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " →ₙ+* ") (Lean.ParserDescr.cat `term 25))

@[reducible]

abbrev NonUnitalRingHom.toAddMonoidHom {α : Type u_5} {β : Type u_6} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (self : α →ₙ+* β) : α →+ β

Reinterpret a non-unital ring homomorphism f : α →ₙ+* β as an additive monoid homomorphism α →+ β. The simp-normal form is (f : α →+ β).

Equations

• NonUnitalRingHom.toAddMonoidHom self = { toZeroHom := { toFun := self.toFun, map_zero' := ⋯ }, map_add' := ⋯ }

class NonUnitalRingHomClass (F : Type u_5) (α : outParam (Type u_6)) (β : outParam (Type u_7)) [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [FunLike F α β] extends MulHomClass , AddMonoidHomClass : Prop

NonUnitalRingHomClass F α β states that F is a type of non-unital (semi)ring homomorphisms. You should extend this class when you extend NonUnitalRingHom.

def NonUnitalRingHomClass.toNonUnitalRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [FunLike F α β] [NonUnitalRingHomClass F α β] (f : F) : α →ₙ+* β

Turn an element of a type F satisfying NonUnitalRingHomClass F α β into an actual NonUnitalRingHom. This is declared as the default coercion from F to α →ₙ+* β.

Equations

• ↑f = let __src := ↑f; let __src_1 := ↑f; { toMulHom := __src, map_zero' := ⋯, map_add' := ⋯ }

instance instCoeTCNonUnitalRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [FunLike F α β] [NonUnitalRingHomClass F α β] : CoeTC F (α →ₙ+* β)

Any type satisfying NonUnitalRingHomClass can be cast into NonUnitalRingHom via NonUnitalRingHomClass.toNonUnitalRingHom.

Equations

• instCoeTCNonUnitalRingHom = { coe := NonUnitalRingHomClass.toNonUnitalRingHom }

instance NonUnitalRingHom.instFunLikeNonUnitalRingHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : FunLike (α →ₙ+* β) α β

Equations

• NonUnitalRingHom.instFunLikeNonUnitalRingHom = { coe := fun (f : α →ₙ+* β) => f.toFun, coe_injective' := ⋯ }

instance NonUnitalRingHom.instNonUnitalRingHomClassNonUnitalRingHomInstFunLikeNonUnitalRingHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : NonUnitalRingHomClass (α →ₙ+* β) α β

Equations

• ⋯ = ⋯

@[simp]

theorem NonUnitalRingHom.coe_toMulHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) : ⇑f.toMulHom = ⇑f

@[simp]

theorem NonUnitalRingHom.coe_mulHom_mk {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α → β) (h₁ : ∀ (x y : α), f (x * y) = f x * f y) (h₂ : { toFun := f, map_mul' := h₁ }.toFun 0 = 0) (h₃ : ∀ (x y : α), { toFun := f, map_mul' := h₁ }.toFun (x + y) = { toFun := f, map_mul' := h₁ }.toFun x + { toFun := f, map_mul' := h₁ }.toFun y) : ↑{ toMulHom := { toFun := f, map_mul' := h₁ }, map_zero' := h₂, map_add' := h₃ } = { toFun := f, map_mul' := h₁ }

theorem NonUnitalRingHom.coe_toAddMonoidHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) : ⇑(NonUnitalRingHom.toAddMonoidHom f) = ⇑f

@[simp]

theorem NonUnitalRingHom.coe_addMonoidHom_mk {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α → β) (h₁ : ∀ (x y : α), f (x * y) = f x * f y) (h₂ : { toFun := f, map_mul' := h₁ }.toFun 0 = 0) (h₃ : ∀ (x y : α), { toFun := f, map_mul' := h₁ }.toFun (x + y) = { toFun := f, map_mul' := h₁ }.toFun x + { toFun := f, map_mul' := h₁ }.toFun y) : ↑{ toMulHom := { toFun := f, map_mul' := h₁ }, map_zero' := h₂, map_add' := h₃ } = { toZeroHom := { toFun := f, map_zero' := h₂ }, map_add' := h₃ }

def NonUnitalRingHom.copy {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) (f' : α → β) (h : f' = ⇑f) : α →ₙ+* β

Copy of a RingHom with a new toFun equal to the old one. Useful to fix definitional equalities.

Equations

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

@[simp]

theorem NonUnitalRingHom.coe_copy {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) (f' : α → β) (h : f' = ⇑f) : ⇑(NonUnitalRingHom.copy f f' h) = f'

theorem NonUnitalRingHom.copy_eq {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) (f' : α → β) (h : f' = ⇑f) : NonUnitalRingHom.copy f f' h = f

theorem NonUnitalRingHom.ext {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] ⦃f : α →ₙ+* β⦄ ⦃g : α →ₙ+* β⦄ : (∀ (x : α), f x = g x) → f = g

theorem NonUnitalRingHom.ext_iff {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] {f : α →ₙ+* β} {g : α →ₙ+* β} : f = g ↔ ∀ (x : α), f x = g x

@[simp]

theorem NonUnitalRingHom.mk_coe {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) (h₁ : ∀ (x y : α), f (x * y) = f x * f y) (h₂ : { toFun := ⇑f, map_mul' := h₁ }.toFun 0 = 0) (h₃ : ∀ (x y : α), { toFun := ⇑f, map_mul' := h₁ }.toFun (x + y) = { toFun := ⇑f, map_mul' := h₁ }.toFun x + { toFun := ⇑f, map_mul' := h₁ }.toFun y) : { toMulHom := { toFun := ⇑f, map_mul' := h₁ }, map_zero' := h₂, map_add' := h₃ } = f

theorem NonUnitalRingHom.coe_addMonoidHom_injective {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : Function.Injective fun (f : α →ₙ+* β) => ↑f

theorem NonUnitalRingHom.coe_mulHom_injective {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : Function.Injective fun (f : α →ₙ+* β) => ↑f

def NonUnitalRingHom.id (α : Type u_5) [NonUnitalNonAssocSemiring α] : α →ₙ+* α

The identity non-unital ring homomorphism from a non-unital semiring to itself.

Equations

• NonUnitalRingHom.id α = { toMulHom := { toFun := id, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ }

instance NonUnitalRingHom.instZeroNonUnitalRingHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : Zero (α →ₙ+* β)

Equations

• NonUnitalRingHom.instZeroNonUnitalRingHom = { zero := { toMulHom := { toFun := 0, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ } }

instance NonUnitalRingHom.instInhabitedNonUnitalRingHom {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : Inhabited (α →ₙ+* β)

Equations

• NonUnitalRingHom.instInhabitedNonUnitalRingHom = { default := 0 }

@[simp]

theorem NonUnitalRingHom.coe_zero {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] : ⇑0 = 0

@[simp]

theorem NonUnitalRingHom.zero_apply {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (x : α) : 0 x = 0

@[simp]

theorem NonUnitalRingHom.id_apply {α : Type u_2} [NonUnitalNonAssocSemiring α] (x : α) : (NonUnitalRingHom.id α) x = x

@[simp]

theorem NonUnitalRingHom.coe_addMonoidHom_id {α : Type u_2} [NonUnitalNonAssocSemiring α] : ↑(NonUnitalRingHom.id α) = AddMonoidHom.id α

@[simp]

theorem NonUnitalRingHom.coe_mulHom_id {α : Type u_2} [NonUnitalNonAssocSemiring α] : ↑(NonUnitalRingHom.id α) = MulHom.id α

def NonUnitalRingHom.comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) (f : α →ₙ+* β) : α →ₙ+* γ

Composition of non-unital ring homomorphisms is a non-unital ring homomorphism.

Equations

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

theorem NonUnitalRingHom.comp_assoc {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] {δ : Type u_5} : ∀ {x : NonUnitalNonAssocSemiring δ} (f : α →ₙ+* β) (g : β →ₙ+* γ) (h : γ →ₙ+* δ), NonUnitalRingHom.comp (NonUnitalRingHom.comp h g) f = NonUnitalRingHom.comp h (NonUnitalRingHom.comp g f)

Composition of non-unital ring homomorphisms is associative.

@[simp]

theorem NonUnitalRingHom.coe_comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) (f : α →ₙ+* β) : ⇑(NonUnitalRingHom.comp g f) = ⇑g ∘ ⇑f

@[simp]

theorem NonUnitalRingHom.comp_apply {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) (f : α →ₙ+* β) (x : α) : (NonUnitalRingHom.comp g f) x = g (f x)

@[simp]

theorem NonUnitalRingHom.coe_comp_addMonoidHom {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) (f : α →ₙ+* β) : { toZeroHom := { toFun := ⇑g ∘ ⇑f, map_zero' := ⋯ }, map_add' := ⋯ } = AddMonoidHom.comp ↑g ↑f

@[simp]

theorem NonUnitalRingHom.coe_comp_mulHom {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) (f : α →ₙ+* β) : { toFun := ⇑g ∘ ⇑f, map_mul' := ⋯ } = MulHom.comp ↑g ↑f

@[simp]

theorem NonUnitalRingHom.comp_zero {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (g : β →ₙ+* γ) : NonUnitalRingHom.comp g 0 = 0

@[simp]

theorem NonUnitalRingHom.zero_comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] (f : α →ₙ+* β) : NonUnitalRingHom.comp 0 f = 0

@[simp]

theorem NonUnitalRingHom.comp_id {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) : NonUnitalRingHom.comp f (NonUnitalRingHom.id α) = f

@[simp]

theorem NonUnitalRingHom.id_comp {α : Type u_2} {β : Type u_3} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] (f : α →ₙ+* β) : NonUnitalRingHom.comp (NonUnitalRingHom.id β) f = f

instance NonUnitalRingHom.instMonoidWithZeroNonUnitalRingHom {α : Type u_2} [NonUnitalNonAssocSemiring α] : MonoidWithZero (α →ₙ+* α)

Equations

• NonUnitalRingHom.instMonoidWithZeroNonUnitalRingHom = MonoidWithZero.mk ⋯ ⋯

theorem NonUnitalRingHom.one_def {α : Type u_2} [NonUnitalNonAssocSemiring α] : 1 = NonUnitalRingHom.id α

@[simp]

theorem NonUnitalRingHom.coe_one {α : Type u_2} [NonUnitalNonAssocSemiring α] : ⇑1 = id

theorem NonUnitalRingHom.mul_def {α : Type u_2} [NonUnitalNonAssocSemiring α] (f : α →ₙ+* α) (g : α →ₙ+* α) : f * g = NonUnitalRingHom.comp f g

@[simp]

theorem NonUnitalRingHom.coe_mul {α : Type u_2} [NonUnitalNonAssocSemiring α] (f : α →ₙ+* α) (g : α →ₙ+* α) : ⇑(f * g) = ⇑f ∘ ⇑g

@[simp]

theorem NonUnitalRingHom.cancel_right {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] {g₁ : β →ₙ+* γ} {g₂ : β →ₙ+* γ} {f : α →ₙ+* β} (hf : Function.Surjective ⇑f) : NonUnitalRingHom.comp g₁ f = NonUnitalRingHom.comp g₂ f ↔ g₁ = g₂

@[simp]

theorem NonUnitalRingHom.cancel_left {α : Type u_2} {β : Type u_3} {γ : Type u_4} [NonUnitalNonAssocSemiring α] [NonUnitalNonAssocSemiring β] [NonUnitalNonAssocSemiring γ] {g : β →ₙ+* γ} {f₁ : α →ₙ+* β} {f₂ : α →ₙ+* β} (hg : Function.Injective ⇑g) : NonUnitalRingHom.comp g f₁ = NonUnitalRingHom.comp g f₂ ↔ f₁ = f₂

structure RingHom (α : Type u_5) (β : Type u_6) [NonAssocSemiring α] [NonAssocSemiring β] extends MonoidHom : Type (max u_5 u_6)

Bundled semiring homomorphisms; use this for bundled ring homomorphisms too.

This extends from both MonoidHom and MonoidWithZeroHom in order to put the fields in a sensible order, even though MonoidWithZeroHom already extends MonoidHom.

• toFun : α → β
• map_one' : self.toFun 1 = 1
• map_mul' : ∀ (x y : α), self.toFun (x * y) = self.toFun x * self.toFun y
• map_zero' : self.toFun 0 = 0

  The proposition that the function preserves 0

• map_add' : ∀ (x y : α), self.toFun (x + y) = self.toFun x + self.toFun y

  The proposition that the function preserves addition

def «term_→+*_» : Lean.TrailingParserDescr

α →+* β denotes the type of ring homomorphisms from α to β.

Equations

• «term_→+*_» = Lean.ParserDescr.trailingNode `term_→+*_ 25 26 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " →+* ") (Lean.ParserDescr.cat `term 25))

@[reducible]

abbrev RingHom.toMonoidWithZeroHom {α : Type u_5} {β : Type u_6} [NonAssocSemiring α] [NonAssocSemiring β] (self : α →+* β) : α →*₀ β

Reinterpret a ring homomorphism f : α →+* β as a monoid with zero homomorphism α →*₀ β. The simp-normal form is (f : α →*₀ β).

Equations

• RingHom.toMonoidWithZeroHom self = { toZeroHom := { toFun := self.toFun, map_zero' := ⋯ }, map_one' := ⋯, map_mul' := ⋯ }

@[reducible]

abbrev RingHom.toAddMonoidHom {α : Type u_5} {β : Type u_6} [NonAssocSemiring α] [NonAssocSemiring β] (self : α →+* β) : α →+ β

Reinterpret a ring homomorphism f : α →+* β as an additive monoid homomorphism α →+ β. The simp-normal form is (f : α →+ β).

Equations

• RingHom.toAddMonoidHom self = { toZeroHom := { toFun := self.toFun, map_zero' := ⋯ }, map_add' := ⋯ }

@[reducible]

abbrev RingHom.toNonUnitalRingHom {α : Type u_5} {β : Type u_6} [NonAssocSemiring α] [NonAssocSemiring β] (self : α →+* β) : α →ₙ+* β

Reinterpret a ring homomorphism f : α →+* β as a non-unital ring homomorphism α →ₙ+* β. The simp-normal form is (f : α →ₙ+* β).

Equations

• RingHom.toNonUnitalRingHom self = { toMulHom := { toFun := self.toFun, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ }

class RingHomClass (F : Type u_5) (α : outParam (Type u_6)) (β : outParam (Type u_7)) [NonAssocSemiring α] [NonAssocSemiring β] [FunLike F α β] extends MonoidHomClass , AddMonoidHomClass : Prop

RingHomClass F α β states that F is a type of (semi)ring homomorphisms. You should extend this class when you extend RingHom.

This extends from both MonoidHomClass and MonoidWithZeroHomClass in order to put the fields in a sensible order, even though MonoidWithZeroHomClass already extends MonoidHomClass.

@[simp]

theorem map_bit1 {F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] [NonAssocSemiring α] [NonAssocSemiring β] [RingHomClass F α β] (f : F) (a : α) : f (bit1 a) = bit1 (f a)

Ring homomorphisms preserve bit1.

def RingHomClass.toRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → [inst : RingHomClass F α β] → F → α →+* β

Turn an element of a type F satisfying RingHomClass F α β into an actual RingHom. This is declared as the default coercion from F to α →+* β.

Equations

• ↑f = let __src := ↑f; let __src_1 := ↑f; { toMonoidHom := __src, map_zero' := ⋯, map_add' := ⋯ }

instance instCoeTCRingHom {F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → [inst : RingHomClass F α β] → CoeTC F (α →+* β)

Any type satisfying RingHomClass can be cast into RingHom via RingHomClass.toRingHom.

Equations

• instCoeTCRingHom = { coe := RingHomClass.toRingHom }

instance RingHomClass.toNonUnitalRingHomClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [FunLike F α β] : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} [inst : RingHomClass F α β], NonUnitalRingHomClass F α β

Equations

• ⋯ = ⋯

Throughout this section, some Semiring arguments are specified with {} instead of []. See note [implicit instance arguments].

instance RingHom.instFunLike {α : Type u_2} {β : Type u_3} : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → FunLike (α →+* β) α β

Equations

• RingHom.instFunLike = { coe := fun (f : α →+* β) => f.toFun, coe_injective' := ⋯ }

instance RingHom.instRingHomClass {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β}, RingHomClass (α →+* β) α β

Equations

• ⋯ = ⋯

theorem RingHom.toFun_eq_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), f.toFun = ⇑f

@[simp]

theorem RingHom.coe_mk {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →* β) (h₁ : f.toFun 0 = 0) (h₂ : ∀ (x_2 y : α), f.toFun (x_2 + y) = f.toFun x_2 + f.toFun y), ⇑{ toMonoidHom := f, map_zero' := h₁, map_add' := h₂ } = ⇑f

@[simp]

theorem RingHom.coe_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {F : Type u_5} [inst : FunLike F α β] [inst_1 : RingHomClass F α β] (f : F), ⇑↑f = ⇑f

instance RingHom.coeToMonoidHom {α : Type u_2} {β : Type u_3} : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → Coe (α →+* β) (α →* β)

Equations

• RingHom.coeToMonoidHom = { coe := RingHom.toMonoidHom }

@[simp]

theorem RingHom.toMonoidHom_eq_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), ↑f = ↑f

theorem RingHom.toMonoidWithZeroHom_eq_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), ⇑(RingHom.toMonoidWithZeroHom f) = ⇑f

@[simp]

theorem RingHom.coe_monoidHom_mk {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →* β) (h₁ : f.toFun 0 = 0) (h₂ : ∀ (x_2 y : α), f.toFun (x_2 + y) = f.toFun x_2 + f.toFun y), ↑{ toMonoidHom := f, map_zero' := h₁, map_add' := h₂ } = f

@[simp]

theorem RingHom.toAddMonoidHom_eq_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), RingHom.toAddMonoidHom f = ↑f

@[simp]

theorem RingHom.coe_addMonoidHom_mk {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α → β) (h₁ : f 1 = 1) (h₂ : ∀ (x_2 y : α), { toFun := f, map_one' := h₁ }.toFun (x_2 * y) = { toFun := f, map_one' := h₁ }.toFun x_2 * { toFun := f, map_one' := h₁ }.toFun y) (h₃ : { toOneHom := { toFun := f, map_one' := h₁ }, map_mul' := h₂ }.toFun 0 = 0) (h₄ : ∀ (x_2 y : α), { toOneHom := { toFun := f, map_one' := h₁ }, map_mul' := h₂ }.toFun (x_2 + y) = { toOneHom := { toFun := f, map_one' := h₁ }, map_mul' := h₂ }.toFun x_2 + { toOneHom := { toFun := f, map_one' := h₁ }, map_mul' := h₂ }.toFun y), ↑{ toMonoidHom := { toOneHom := { toFun := f, map_one' := h₁ }, map_mul' := h₂ }, map_zero' := h₃, map_add' := h₄ } = { toZeroHom := { toFun := f, map_zero' := h₃ }, map_add' := h₄ }

def RingHom.copy {α : Type u_2} {β : Type u_3} : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → (f : α →+* β) → (f' : α → β) → f' = ⇑f → α →+* β

Copy of a RingHom with a new toFun equal to the old one. Useful to fix definitional equalities.

Equations

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

@[simp]

theorem RingHom.coe_copy {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) (f' : α → β) (h : f' = ⇑f), ⇑(RingHom.copy f f' h) = f'

theorem RingHom.copy_eq {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) (f' : α → β) (h : f' = ⇑f), RingHom.copy f f' h = f

theorem RingHom.congr_fun {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {f g : α →+* β}, f = g → ∀ (x_2 : α), f x_2 = g x_2

theorem RingHom.congr_arg {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) {x_2 y : α}, x_2 = y → f x_2 = f y

theorem RingHom.coe_inj {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} ⦃f g : α →+* β⦄, ⇑f = ⇑g → f = g

theorem RingHom.ext {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} ⦃f g : α →+* β⦄, (∀ (x_2 : α), f x_2 = g x_2) → f = g

theorem RingHom.ext_iff {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {f g : α →+* β}, f = g ↔ ∀ (x_2 : α), f x_2 = g x_2

@[simp]

theorem RingHom.mk_coe {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) (h₁ : f 1 = 1) (h₂ : ∀ (x_2 y : α), { toFun := ⇑f, map_one' := h₁ }.toFun (x_2 * y) = { toFun := ⇑f, map_one' := h₁ }.toFun x_2 * { toFun := ⇑f, map_one' := h₁ }.toFun y) (h₃ : { toOneHom := { toFun := ⇑f, map_one' := h₁ }, map_mul' := h₂ }.toFun 0 = 0) (h₄ : ∀ (x_2 y : α), { toOneHom := { toFun := ⇑f, map_one' := h₁ }, map_mul' := h₂ }.toFun (x_2 + y) = { toOneHom := { toFun := ⇑f, map_one' := h₁ }, map_mul' := h₂ }.toFun x_2 + { toOneHom := { toFun := ⇑f, map_one' := h₁ }, map_mul' := h₂ }.toFun y), { toMonoidHom := { toOneHom := { toFun := ⇑f, map_one' := h₁ }, map_mul' := h₂ }, map_zero' := h₃, map_add' := h₄ } = f

theorem RingHom.coe_addMonoidHom_injective {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β}, Function.Injective fun (f : α →+* β) => ↑f

theorem RingHom.coe_monoidHom_injective {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β}, Function.Injective fun (f : α →+* β) => ↑f

theorem RingHom.map_zero {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), f 0 = 0

Ring homomorphisms map zero to zero.

theorem RingHom.map_one {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), f 1 = 1

Ring homomorphisms map one to one.

theorem RingHom.map_add {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) (a b : α), f (a + b) = f a + f b

Ring homomorphisms preserve addition.

theorem RingHom.map_mul {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) (a b : α), f (a * b) = f a * f b

Ring homomorphisms preserve multiplication.

@[simp]

theorem RingHom.map_ite_zero_one {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {F : Type u_5} [inst : FunLike F α β] [inst_1 : RingHomClass F α β] (f : F) (p : Prop) [inst_2 : Decidable p], f (if p then 0 else 1) = if p then 0 else 1

@[simp]

theorem RingHom.map_ite_one_zero {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {F : Type u_5} [inst : FunLike F α β] [inst_1 : RingHomClass F α β] (f : F) (p : Prop) [inst_2 : Decidable p], f (if p then 1 else 0) = if p then 1 else 0

theorem RingHom.codomain_trivial_iff_map_one_eq_zero {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), 0 = 1 ↔ f 1 = 0

f : α →+* β has a trivial codomain iff f 1 = 0.

theorem RingHom.codomain_trivial_iff_range_trivial {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), 0 = 1 ↔ ∀ (x_2 : α), f x_2 = 0

f : α →+* β has a trivial codomain iff it has a trivial range.

theorem RingHom.map_one_ne_zero {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β) [inst : Nontrivial β], f 1 ≠ 0

f : α →+* β doesn't map 1 to 0 if β is nontrivial

theorem RingHom.domain_nontrivial {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β}, (α →+* β) → ∀ [inst : Nontrivial β], Nontrivial α

If there is a homomorphism f : α →+* β and β is nontrivial, then α is nontrivial.

theorem RingHom.codomain_trivial {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β}, (α →+* β) → ∀ [h : Subsingleton α], Subsingleton β

theorem RingHom.map_neg {α : Type u_2} {β : Type u_3} [NonAssocRing α] [NonAssocRing β] (f : α →+* β) (x : α) : f (-x) = -f x

Ring homomorphisms preserve additive inverse.

theorem RingHom.map_sub {α : Type u_2} {β : Type u_3} [NonAssocRing α] [NonAssocRing β] (f : α →+* β) (x : α) (y : α) : f (x - y) = f x - f y

Ring homomorphisms preserve subtraction.

def RingHom.mk' {α : Type u_2} {β : Type u_3} [NonAssocSemiring α] [NonAssocRing β] (f : α →* β) (map_add : ∀ (a b : α), f (a + b) = f a + f b) : α →+* β

Makes a ring homomorphism from a monoid homomorphism of rings which preserves addition.

Equations

• RingHom.mk' f map_add = let __src := AddMonoidHom.mk' (⇑f) map_add; { toMonoidHom := { toOneHom := { toFun := __src.toFun, map_one' := ⋯ }, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ }

def RingHom.id (α : Type u_5) [NonAssocSemiring α] : α →+* α

The identity ring homomorphism from a semiring to itself.

Equations

• RingHom.id α = { toMonoidHom := { toOneHom := { toFun := id, map_one' := ⋯ }, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ }

instance RingHom.instInhabitedRingHom {α : Type u_2} : {x : NonAssocSemiring α} → Inhabited (α →+* α)

Equations

• RingHom.instInhabitedRingHom = { default := RingHom.id α }

@[simp]

theorem RingHom.id_apply {α : Type u_2} : ∀ {x : NonAssocSemiring α} (x_1 : α), (RingHom.id α) x_1 = x_1

@[simp]

theorem RingHom.coe_addMonoidHom_id {α : Type u_2} : ∀ {x : NonAssocSemiring α}, ↑(RingHom.id α) = AddMonoidHom.id α

@[simp]

theorem RingHom.coe_monoidHom_id {α : Type u_2} : ∀ {x : NonAssocSemiring α}, ↑(RingHom.id α) = MonoidHom.id α

def RingHom.comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} : {x : NonAssocSemiring α} → {x_1 : NonAssocSemiring β} → {x_2 : NonAssocSemiring γ} → (β →+* γ) → (α →+* β) → α →+* γ

Composition of ring homomorphisms is a ring homomorphism.

Equations

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

theorem RingHom.comp_assoc {α : Type u_2} {β : Type u_3} {γ : Type u_4} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {x_2 : NonAssocSemiring γ} {δ : Type u_5} {x_3 : NonAssocSemiring δ} (f : α →+* β) (g : β →+* γ) (h : γ →+* δ), RingHom.comp (RingHom.comp h g) f = RingHom.comp h (RingHom.comp g f)

Composition of semiring homomorphisms is associative.

@[simp]

theorem RingHom.coe_comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {x_2 : NonAssocSemiring γ} (hnp : β →+* γ) (hmn : α →+* β), ⇑(RingHom.comp hnp hmn) = ⇑hnp ∘ ⇑hmn

theorem RingHom.comp_apply {α : Type u_2} {β : Type u_3} {γ : Type u_4} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {x_2 : NonAssocSemiring γ} (hnp : β →+* γ) (hmn : α →+* β) (x_3 : α), (RingHom.comp hnp hmn) x_3 = hnp (hmn x_3)

@[simp]

theorem RingHom.comp_id {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), RingHom.comp f (RingHom.id α) = f

@[simp]

theorem RingHom.id_comp {α : Type u_2} {β : Type u_3} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} (f : α →+* β), RingHom.comp (RingHom.id β) f = f

instance RingHom.instMonoidRingHom {α : Type u_2} : {x : NonAssocSemiring α} → Monoid (α →+* α)

Equations

• RingHom.instMonoidRingHom = Monoid.mk ⋯ ⋯ npowRec ⋯ ⋯

theorem RingHom.one_def {α : Type u_2} : ∀ {x : NonAssocSemiring α}, 1 = RingHom.id α

theorem RingHom.mul_def {α : Type u_2} : ∀ {x : NonAssocSemiring α} (f g : α →+* α), f * g = RingHom.comp f g

@[simp]

theorem RingHom.coe_one {α : Type u_2} : ∀ {x : NonAssocSemiring α}, ⇑1 = id

@[simp]

theorem RingHom.coe_mul {α : Type u_2} : ∀ {x : NonAssocSemiring α} (f g : α →+* α), ⇑(f * g) = ⇑f ∘ ⇑g

@[simp]

theorem RingHom.cancel_right {α : Type u_2} {β : Type u_3} {γ : Type u_4} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {x_2 : NonAssocSemiring γ} {g₁ g₂ : β →+* γ} {f : α →+* β}, Function.Surjective ⇑f → (RingHom.comp g₁ f = RingHom.comp g₂ f ↔ g₁ = g₂)

@[simp]

theorem RingHom.cancel_left {α : Type u_2} {β : Type u_3} {γ : Type u_4} : ∀ {x : NonAssocSemiring α} {x_1 : NonAssocSemiring β} {x_2 : NonAssocSemiring γ} {g : β →+* γ} {f₁ f₂ : α →+* β}, Function.Injective ⇑g → (RingHom.comp g f₁ = RingHom.comp g f₂ ↔ f₁ = f₂)

def AddMonoidHom.mkRingHomOfMulSelfOfTwoNeZero {α : Type u_2} {β : Type u_3} [CommRing α] [IsDomain α] [CommRing β] (f : β →+ α) (h : ∀ (x : β), f (x * x) = f x * f x) (h_two : 2 ≠ 0) (h_one : f 1 = 1) : β →+* α

Make a ring homomorphism from an additive group homomorphism from a commutative ring to an integral domain that commutes with self multiplication, assumes that two is nonzero and 1 is sent to 1.

Equations

• AddMonoidHom.mkRingHomOfMulSelfOfTwoNeZero f h h_two h_one = { toMonoidHom := { toOneHom := { toFun := f.toFun, map_one' := h_one }, map_mul' := ⋯ }, map_zero' := ⋯, map_add' := ⋯ }

@[simp]

theorem AddMonoidHom.coe_fn_mkRingHomOfMulSelfOfTwoNeZero {α : Type u_2} {β : Type u_3} [CommRing α] [IsDomain α] [CommRing β] (f : β →+ α) (h : ∀ (x : β), f (x * x) = f x * f x) (h_two : 2 ≠ 0) (h_one : f 1 = 1) : ⇑(AddMonoidHom.mkRingHomOfMulSelfOfTwoNeZero f h h_two h_one) = ⇑f

theorem AddMonoidHom.coe_addMonoidHom_mkRingHomOfMulSelfOfTwoNeZero {α : Type u_2} {β : Type u_3} [CommRing α] [IsDomain α] [CommRing β] (f : β →+ α) (h : ∀ (x : β), f (x * x) = f x * f x) (h_two : 2 ≠ 0) (h_one : f 1 = 1) : ↑(AddMonoidHom.mkRingHomOfMulSelfOfTwoNeZero f h h_two h_one) = f