Monomorphisms and epimorphisms in Group

In this file, we prove monomorphisms in the category of groups are injective homomorphisms and epimorphisms are surjective homomorphisms.

theorem MonoidHom.ker_eq_bot_of_cancel {A : Type u} {B : Type v} [Group A] [Group B] {f : A →* B} (h : ∀ (u v : ↥f.ker →* A), f.comp u = f.comp v → u = v) : f.ker = ⊥

theorem AddMonoidHom.ker_eq_bot_of_cancel {A : Type u} {B : Type v} [AddGroup A] [AddGroup B] {f : A →+ B} (h : ∀ (u v : ↥f.ker →+ A), f.comp u = f.comp v → u = v) : f.ker = ⊥

theorem MonoidHom.range_eq_top_of_cancel {A : Type u} {B : Type v} [CommGroup A] [CommGroup B] {f : A →* B} (h : ∀ (u v : B →* B ⧸ f.range), u.comp f = v.comp f → u = v) : f.range = ⊤

theorem AddMonoidHom.range_eq_top_of_cancel {A : Type u} {B : Type v} [AddCommGroup A] [AddCommGroup B] {f : A →+ B} (h : ∀ (u v : B →+ B ⧸ f.range), u.comp f = v.comp f → u = v) : f.range = ⊤

instance Grp.instGroupα_1 (G : Grp) : Group ↑G

Equations

• G.instGroupα_1 = G.str

instance AddGrp.instGroupα_1 (G : AddGrp) : AddGroup ↑G

Equations

• G.instGroupα_1 = G.str

theorem Grp.ker_eq_bot_of_mono {A B : Grp} (f : A ⟶ B) [CategoryTheory.Mono f] : MonoidHom.ker f = ⊥

theorem AddGrp.ker_eq_bot_of_mono {A B : AddGrp} (f : A ⟶ B) [CategoryTheory.Mono f] : AddMonoidHom.ker f = ⊥

theorem Grp.mono_iff_ker_eq_bot {A B : Grp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ MonoidHom.ker f = ⊥

theorem AddGrp.mono_iff_ker_eq_bot {A B : AddGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ AddMonoidHom.ker f = ⊥

theorem Grp.mono_iff_injective {A B : Grp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑f

theorem AddGrp.mono_iff_injective {A B : AddGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑f

inductive Grp.SurjectiveOfEpiAuxs.XWithInfinity {A B : Grp} (f : A ⟶ B) : Type u

Define X' to be the set of all left cosets with an extra point at "infinity".

• fromCoset: {A B : Grp} → {f : A ⟶ B} → ↑(Set.range fun (x : ↑B) => x • ↑(MonoidHom.range f)) → Grp.SurjectiveOfEpiAuxs.XWithInfinity f
• infinity: {A B : Grp} → {f : A ⟶ B} → Grp.SurjectiveOfEpiAuxs.XWithInfinity f

instance Grp.SurjectiveOfEpiAuxs.instSMulαGroupXWithInfinity {A B : Grp} (f : A ⟶ B) : SMul (↑B) (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

Equations

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

theorem Grp.SurjectiveOfEpiAuxs.mul_smul {A B : Grp} (f : A ⟶ B) (b b' : ↑B) (x : Grp.SurjectiveOfEpiAuxs.XWithInfinity f) : (b * b') • x = b • b' • x

theorem Grp.SurjectiveOfEpiAuxs.one_smul {A B : Grp} (f : A ⟶ B) (x : Grp.SurjectiveOfEpiAuxs.XWithInfinity f) : 1 • x = x

theorem Grp.SurjectiveOfEpiAuxs.fromCoset_eq_of_mem_range {A B : Grp} (f : A ⟶ B) {b : ↑B} (hb : b ∈ MonoidHom.range f) : Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(MonoidHom.range f), ⋯⟩ = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.fromCoset_ne_of_nin_range {A B : Grp} (f : A ⟶ B) {b : ↑B} (hb : b ∉ MonoidHom.range f) : Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(MonoidHom.range f), ⋯⟩ ≠ Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩

instance Grp.SurjectiveOfEpiAuxs.instDecidableEqXWithInfinity {A B : Grp} (f : A ⟶ B) : DecidableEq (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

Equations

• Grp.SurjectiveOfEpiAuxs.instDecidableEqXWithInfinity f = Classical.decEq (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

noncomputable def Grp.SurjectiveOfEpiAuxs.tau {A B : Grp} (f : A ⟶ B) : Equiv.Perm (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

Let τ be the permutation on X' exchanging f.range and the point at infinity.

Equations

• Grp.SurjectiveOfEpiAuxs.tau f = Equiv.swap (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩) Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.τ_apply_infinity {A B : Grp} (f : A ⟶ B) : (Grp.SurjectiveOfEpiAuxs.tau f) Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.τ_apply_fromCoset {A B : Grp} (f : A ⟶ B) : (Grp.SurjectiveOfEpiAuxs.tau f) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.τ_apply_fromCoset' {A B : Grp} (f : A ⟶ B) (x : ↑B) (hx : x ∈ MonoidHom.range f) : (Grp.SurjectiveOfEpiAuxs.tau f) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨x • ↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.τ_symm_apply_fromCoset {A B : Grp} (f : A ⟶ B) : (Equiv.symm (Grp.SurjectiveOfEpiAuxs.tau f)) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.τ_symm_apply_infinity {A B : Grp} (f : A ⟶ B) : (Equiv.symm (Grp.SurjectiveOfEpiAuxs.tau f)) Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩

def Grp.SurjectiveOfEpiAuxs.g {A B : Grp} (f : A ⟶ B) : ↑B →* Equiv.Perm (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

Let g : B ⟶ S(X') be defined as such that, for any β : B, g(β) is the function sending point at infinity to point at infinity and sending coset y to β • y.

Equations

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

def Grp.SurjectiveOfEpiAuxs.h {A B : Grp} (f : A ⟶ B) : ↑B →* Equiv.Perm (Grp.SurjectiveOfEpiAuxs.XWithInfinity f)

Define h : B ⟶ S(X') to be τ g τ⁻¹

Equations

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

The strategy is the following: assuming epi f

• prove that f.range = {x | h x = g x};
• thus f ≫ h = f ≫ g so that h = g;
• but if f is not surjective, then some x ∉ f.range, then h x ≠ g x at the coset f.range.

theorem Grp.SurjectiveOfEpiAuxs.g_apply_fromCoset {A B : Grp} (f : A ⟶ B) (x : ↑B) (y : ↑(Set.range fun (x : ↑B) => x • ↑(MonoidHom.range f))) : ((Grp.SurjectiveOfEpiAuxs.g f) x) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset y) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨x • ↑y, ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.g_apply_infinity {A B : Grp} (f : A ⟶ B) (x : ↑B) : ((Grp.SurjectiveOfEpiAuxs.g f) x) Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity = Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.h_apply_infinity {A B : Grp} (f : A ⟶ B) (x : ↑B) (hx : x ∈ MonoidHom.range f) : ((Grp.SurjectiveOfEpiAuxs.h f) x) Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity = Grp.SurjectiveOfEpiAuxs.XWithInfinity.infinity

theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset {A B : Grp} (f : A ⟶ B) (x : ↑B) : ((Grp.SurjectiveOfEpiAuxs.h f) x) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(MonoidHom.range f), ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset' {A B : Grp} (f : A ⟶ B) (x b : ↑B) (hb : b ∈ MonoidHom.range f) : ((Grp.SurjectiveOfEpiAuxs.h f) x) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(MonoidHom.range f), ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.h_apply_fromCoset_nin_range {A B : Grp} (f : A ⟶ B) (x : ↑B) (hx : x ∈ MonoidHom.range f) (b : ↑B) (hb : b ∉ MonoidHom.range f) : ((Grp.SurjectiveOfEpiAuxs.h f) x) (Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(MonoidHom.range f), ⋯⟩) = Grp.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨(x * b) • ↑(MonoidHom.range f), ⋯⟩

theorem Grp.SurjectiveOfEpiAuxs.agree {A B : Grp} (f : A ⟶ B) : ↑(MonoidHom.range f) = {x : ↑B | (Grp.SurjectiveOfEpiAuxs.h f) x = (Grp.SurjectiveOfEpiAuxs.g f) x}

theorem Grp.SurjectiveOfEpiAuxs.comp_eq {A B : Grp} (f : A ⟶ B) : CategoryTheory.CategoryStruct.comp f (let_fun this := Grp.SurjectiveOfEpiAuxs.g f; this) = CategoryTheory.CategoryStruct.comp f (let_fun this := Grp.SurjectiveOfEpiAuxs.h f; this)

theorem Grp.SurjectiveOfEpiAuxs.g_ne_h {A B : Grp} (f : A ⟶ B) (x : ↑B) (hx : x ∉ MonoidHom.range f) : Grp.SurjectiveOfEpiAuxs.g f ≠ Grp.SurjectiveOfEpiAuxs.h f

theorem Grp.surjective_of_epi {A B : Grp} (f : A ⟶ B) [CategoryTheory.Epi f] : Function.Surjective ⇑f

theorem Grp.epi_iff_surjective {A B : Grp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑f

theorem Grp.epi_iff_range_eq_top {A B : Grp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ MonoidHom.range f = ⊤

theorem AddGrp.epi_iff_surjective {A B : AddGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑f

theorem AddGrp.epi_iff_range_eq_top {A B : AddGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ AddMonoidHom.range f = ⊤

instance Grp.forget_grp_preserves_mono : (CategoryTheory.forget Grp).PreservesMonomorphisms

Equations

• Grp.forget_grp_preserves_mono = ⋯

instance AddGrp.forget_grp_preserves_mono : (CategoryTheory.forget AddGrp).PreservesMonomorphisms

Equations

• AddGrp.forget_grp_preserves_mono = ⋯

instance Grp.forget_grp_preserves_epi : (CategoryTheory.forget Grp).PreservesEpimorphisms

Equations

• Grp.forget_grp_preserves_epi = ⋯

instance AddGrp.forget_grp_preserves_epi : (CategoryTheory.forget AddGrp).PreservesEpimorphisms

Equations

• AddGrp.forget_grp_preserves_epi = ⋯

theorem CommGrp.ker_eq_bot_of_mono {A B : CommGrp} (f : A ⟶ B) [CategoryTheory.Mono f] : MonoidHom.ker f = ⊥

theorem AddCommGrp.ker_eq_bot_of_mono {A B : AddCommGrp} (f : A ⟶ B) [CategoryTheory.Mono f] : AddMonoidHom.ker f = ⊥

theorem CommGrp.mono_iff_ker_eq_bot {A B : CommGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ MonoidHom.ker f = ⊥

theorem AddCommGrp.mono_iff_ker_eq_bot {A B : AddCommGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ AddMonoidHom.ker f = ⊥

theorem CommGrp.mono_iff_injective {A B : CommGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑f

theorem AddCommGrp.mono_iff_injective {A B : AddCommGrp} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑f

theorem CommGrp.range_eq_top_of_epi {A B : CommGrp} (f : A ⟶ B) [CategoryTheory.Epi f] : MonoidHom.range f = ⊤

theorem AddCommGrp.range_eq_top_of_epi {A B : AddCommGrp} (f : A ⟶ B) [CategoryTheory.Epi f] : AddMonoidHom.range f = ⊤

instance CommGrp.instCommGroupObjForget (G : CommGrp) : CommGroup ((CategoryTheory.forget CommGrp).obj G)

Equations

• G.instCommGroupObjForget = G.str

instance AddCommGrp.instAddCommGroupObjForget (G : AddCommGrp) : AddCommGroup ((CategoryTheory.forget AddCommGrp).obj G)

Equations

• G.instAddCommGroupObjForget = G.str

theorem CommGrp.epi_iff_range_eq_top {A B : CommGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ MonoidHom.range f = ⊤

theorem AddCommGrp.epi_iff_range_eq_top {A B : AddCommGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ AddMonoidHom.range f = ⊤

theorem CommGrp.epi_iff_surjective {A B : CommGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑f

theorem AddCommGrp.epi_iff_surjective {A B : AddCommGrp} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑f

instance CommGrp.forget_commGrp_preserves_mono : (CategoryTheory.forget CommGrp).PreservesMonomorphisms

Equations

• CommGrp.forget_commGrp_preserves_mono = ⋯

instance AddCommGrp.forget_commGrp_preserves_mono : (CategoryTheory.forget AddCommGrp).PreservesMonomorphisms

Equations

• AddCommGrp.forget_commGrp_preserves_mono = ⋯

instance CommGrp.forget_commGrp_preserves_epi : (CategoryTheory.forget CommGrp).PreservesEpimorphisms

Equations

• CommGrp.forget_commGrp_preserves_epi = ⋯

instance AddCommGrp.forget_commGrp_preserves_epi : (CategoryTheory.forget AddCommGrp).PreservesEpimorphisms

Equations

• AddCommGrp.forget_commGrp_preserves_epi = ⋯