Subgroups

This file defines multiplicative and additive subgroups as an extension of submonoids, in a bundled form (unbundled subgroups are in Deprecated/Subgroups.lean).

We prove subgroups of a group form a complete lattice, and results about images and preimages of subgroups under group homomorphisms. The bundled subgroups use bundled monoid homomorphisms.

There are also theorems about the subgroups generated by an element or a subset of a group, defined both inductively and as the infimum of the set of subgroups containing a given element/subset.

Special thanks goes to Amelia Livingston and Yury Kudryashov for their help and inspiration.

Main definitions

Notation used here:

• G N are Groups

• A is an AddGroup

• H K are Subgroups of G or AddSubgroups of A

• x is an element of type G or type A

• f g : N →* G are group homomorphisms

• s k are sets of elements of type G

Definitions in the file:

• Subgroup G : the type of subgroups of a group G

• AddSubgroup A : the type of subgroups of an additive group A

• CompleteLattice (Subgroup G) : the subgroups of G form a complete lattice

• Subgroup.closure k : the minimal subgroup that includes the set k

• Subgroup.subtype : the natural group homomorphism from a subgroup of group G to G

• Subgroup.gi : closure forms a Galois insertion with the coercion to set

• Subgroup.comap H f : the preimage of a subgroup H along the group homomorphism f is also a subgroup

• Subgroup.map f H : the image of a subgroup H along the group homomorphism f is also a subgroup

• Subgroup.prod H K : the product of subgroups H, K of groups G, N respectively, H × K is a subgroup of G × N

• MonoidHom.range f : the range of the group homomorphism f is a subgroup

• MonoidHom.ker f : the kernel of a group homomorphism f is the subgroup of elements x : G such that f x = 1

• MonoidHom.eq_locus f g : given group homomorphisms f, g, the elements of G such that f x = g x form a subgroup of G

Implementation notes

Subgroup inclusion is denoted ≤ rather than ⊆, although ∈ is defined as membership of a subgroup's underlying set.

Tags

subgroup, subgroups

class InvMemClass (S : Type u_5) (G : Type u_6) [Inv G] [SetLike S G] : Prop

• inv_mem : ∀ {s : S} {x : G}, x ∈ s → x⁻¹ ∈ s

  s is closed under inverses

InvMemClass S G states S is a type of subsets s ⊆ G closed under inverses.

class NegMemClass (S : Type u_5) (G : Type u_6) [Neg G] [SetLike S G] : Prop

• neg_mem : ∀ {s : S} {x : G}, x ∈ s → -x ∈ s

  s is closed under negation

NegMemClass S G states S is a type of subsets s ⊆ G closed under negation.

class SubgroupClass (S : Type u_5) (G : Type u_6) [DivInvMonoid G] [SetLike S G] extends SubmonoidClass , InvMemClass : Prop

SubgroupClass S G states S is a type of subsets s ⊆ G that are subgroups of G.

class AddSubgroupClass (S : Type u_5) (G : Type u_6) [SubNegMonoid G] [SetLike S G] extends AddSubmonoidClass , NegMemClass : Prop

AddSubgroupClass S G states S is a type of subsets s ⊆ G that are additive subgroups of G.

@[simp]

theorem neg_mem_iff {S : Type u_5} {G : Type u_6} [InvolutiveNeg G] : ∀ {x : SetLike S G} [inst : NegMemClass S G] {H : S} {x_1 : G}, -x_1 ∈ H ↔ x_1 ∈ H

@[simp]

theorem inv_mem_iff {S : Type u_5} {G : Type u_6} [InvolutiveInv G] : ∀ {x : SetLike S G} [inst : InvMemClass S G] {H : S} {x_1 : G}, x_1⁻¹ ∈ H ↔ x_1 ∈ H

@[simp]

theorem abs_mem_iff {S : Type u_5} {G : Type u_6} [InvolutiveNeg G] [LinearOrder G] : ∀ {x : SetLike S G} [inst : NegMemClass S G] {H : S} {x_1 : G}, |x_1| ∈ H ↔ x_1 ∈ H

theorem sub_mem {M : Type u_5} {S : Type u_6} [SubNegMonoid M] [SetLike S M] [hSM : AddSubgroupClass S M] {H : S} {x : M} {y : M} (hx : x ∈ H) (hy : y ∈ H) : x - y ∈ H

An additive subgroup is closed under subtraction.

theorem div_mem {M : Type u_5} {S : Type u_6} [DivInvMonoid M] [SetLike S M] [hSM : SubgroupClass S M] {H : S} {x : M} {y : M} (hx : x ∈ H) (hy : y ∈ H) : x / y ∈ H

A subgroup is closed under division.

abbrev zsmul_mem.match_1 (motive : ℤ → Prop) : (x : ℤ) → ((n : ℕ) → motive (Int.ofNat n)) → ((n : ℕ) → motive (Int.negSucc n)) → motive x

Equations

• zsmul_mem.match_1 motive x h_1 h_2 = Int.casesOn x (fun a => h_1 a) fun a => h_2 a

theorem zsmul_mem {M : Type u_5} {S : Type u_6} [SubNegMonoid M] [SetLike S M] [hSM : AddSubgroupClass S M] {K : S} {x : M} (hx : x ∈ K) (n : ℤ) : n • x ∈ K

theorem zpow_mem {M : Type u_5} {S : Type u_6} [DivInvMonoid M] [SetLike S M] [hSM : SubgroupClass S M] {K : S} {x : M} (hx : x ∈ K) (n : ℤ) : x ^ n ∈ K

theorem sub_mem_comm_iff {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] {a : G} {b : G} : a - b ∈ H ↔ b - a ∈ H

theorem div_mem_comm_iff {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] {a : G} {b : G} : a / b ∈ H ↔ b / a ∈ H

theorem exists_neg_mem_iff_exists_mem {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] {P : G → Prop} : (∃ x, x ∈ H ∧ P (-x)) ↔ ∃ x, x ∈ H ∧ P x

theorem exists_inv_mem_iff_exists_mem {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] {P : G → Prop} : (∃ x, x ∈ H ∧ P x⁻¹) ↔ ∃ x, x ∈ H ∧ P x

theorem add_mem_cancel_right {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] {x : G} {y : G} (h : x ∈ H) : y + x ∈ H ↔ y ∈ H

theorem mul_mem_cancel_right {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] {x : G} {y : G} (h : x ∈ H) : y * x ∈ H ↔ y ∈ H

theorem add_mem_cancel_left {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] {x : G} {y : G} (h : x ∈ H) : x + y ∈ H ↔ y ∈ H

theorem mul_mem_cancel_left {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] {x : G} {y : G} (h : x ∈ H) : x * y ∈ H ↔ y ∈ H

theorem AddSubgroupClass.neg.proof_1 {G : Type u_1} {S : Type u_2} [SubNegMonoid G] [SetLike S G] [AddSubgroupClass S G] {H : S} (a : { x // x ∈ H }) : -↑a ∈ H

instance AddSubgroupClass.neg {G : Type u_1} {S : Type u_2} [SubNegMonoid G] [SetLike S G] [AddSubgroupClass S G] {H : S} : Neg { x // x ∈ H }

An additive subgroup of an AddGroup inherits an inverse.

Equations

• AddSubgroupClass.neg = { neg := fun a => { val := -↑a, property := (_ : -↑a ∈ H) } }

instance SubgroupClass.inv {G : Type u_1} {S : Type u_2} [DivInvMonoid G] [SetLike S G] [SubgroupClass S G] {H : S} : Inv { x // x ∈ H }

A subgroup of a group inherits an inverse.

Equations

• SubgroupClass.inv = { inv := fun a => { val := (↑a)⁻¹, property := (_ : (↑a)⁻¹ ∈ H) } }

theorem AddSubgroupClass.sub.proof_1 {G : Type u_1} {S : Type u_2} [SubNegMonoid G] [SetLike S G] [AddSubgroupClass S G] {H : S} (a : { x // x ∈ H }) (b : { x // x ∈ H }) : ↑a - ↑b ∈ H

instance AddSubgroupClass.sub {G : Type u_1} {S : Type u_2} [SubNegMonoid G] [SetLike S G] [AddSubgroupClass S G] {H : S} : Sub { x // x ∈ H }

An additive subgroup of an AddGroup inherits a subtraction.

Equations

• AddSubgroupClass.sub = { sub := fun a b => { val := ↑a - ↑b, property := (_ : ↑a - ↑b ∈ H) } }

instance SubgroupClass.div {G : Type u_1} {S : Type u_2} [DivInvMonoid G] [SetLike S G] [SubgroupClass S G] {H : S} : Div { x // x ∈ H }

A subgroup of a group inherits a division

Equations

• SubgroupClass.div = { div := fun a b => { val := ↑a / ↑b, property := (_ : ↑a / ↑b ∈ H) } }

instance AddSubgroupClass.zsmul {M : Type u_7} {S : Type u_8} [SubNegMonoid M] [SetLike S M] [AddSubgroupClass S M] {H : S} : SMul ℤ { x // x ∈ H }

An additive subgroup of an AddGroup inherits an integer scaling.

Equations

• AddSubgroupClass.zsmul = { smul := fun n a => { val := n • ↑a, property := (_ : n • ↑a ∈ H) } }

instance SubgroupClass.zpow {M : Type u_7} {S : Type u_8} [DivInvMonoid M] [SetLike S M] [SubgroupClass S M] {H : S} : Pow { x // x ∈ H } ℤ

A subgroup of a group inherits an integer power.

Equations

• SubgroupClass.zpow = { pow := fun a n => { val := ↑a ^ n, property := (_ : ↑a ^ n ∈ H) } }

@[simp]

theorem AddSubgroupClass.coe_neg {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] (x : { x // x ∈ H }) : ↑(-x) = -↑x

@[simp]

theorem SubgroupClass.coe_inv {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] (x : { x // x ∈ H }) : ↑x⁻¹ = (↑x)⁻¹

@[simp]

theorem AddSubgroupClass.coe_sub {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x - y) = ↑x - ↑y

@[simp]

theorem SubgroupClass.coe_div {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x / y) = ↑x / ↑y

theorem AddSubgroupClass.toAddGroup.proof_5 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroupClass.toAddGroup.proof_6 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroupClass.toAddGroup.proof_3 {G : Type u_1} {S : Type u_2} (H : S) [SetLike S G] : Function.Injective fun a => ↑a

theorem AddSubgroupClass.toAddGroup.proof_7 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroupClass.toAddGroup.proof_2 {G : Type u_1} [AddGroup G] {S : Type u_2} [SetLike S G] [AddSubgroupClass S G] : ZeroMemClass S G

theorem AddSubgroupClass.toAddGroup.proof_1 {G : Type u_1} [AddGroup G] {S : Type u_2} [SetLike S G] [AddSubgroupClass S G] : AddSubmonoidClass S G

theorem AddSubgroupClass.toAddGroup.proof_4 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ↑0 = ↑0

instance AddSubgroupClass.toAddGroup {G : Type u_1} [AddGroup G] {S : Type u_6} (H : S) [SetLike S G] [AddSubgroupClass S G] : AddGroup { x // x ∈ H }

An additive subgroup of an AddGroup inherits an AddGroup structure.

Equations

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

theorem AddSubgroupClass.toAddGroup.proof_9 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toAddGroup.proof_8 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

instance SubgroupClass.toGroup {G : Type u_1} [Group G] {S : Type u_6} (H : S) [SetLike S G] [SubgroupClass S G] : Group { x // x ∈ H }

A subgroup of a group inherits a group structure.

Equations

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

theorem AddSubgroupClass.toAddCommGroup.proof_9 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toAddCommGroup.proof_3 {S : Type u_2} (H : S) {G : Type u_1} [SetLike S G] : Function.Injective fun a => ↑a

instance AddSubgroupClass.toAddCommGroup {S : Type u_6} (H : S) {G : Type u_7} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : AddCommGroup { x // x ∈ H }

An additive subgroup of an AddCommGroup is an AddCommGroup.

Equations

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

theorem AddSubgroupClass.toAddCommGroup.proof_2 {S : Type u_2} {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : AddSubmonoidClass S G

theorem AddSubgroupClass.toAddCommGroup.proof_8 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toAddCommGroup.proof_1 {S : Type u_2} {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ZeroMemClass S G

theorem AddSubgroupClass.toAddCommGroup.proof_6 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroupClass.toAddCommGroup.proof_5 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroupClass.toAddCommGroup.proof_4 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ↑0 = ↑0

theorem AddSubgroupClass.toAddCommGroup.proof_7 {S : Type u_2} (H : S) {G : Type u_1} [AddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

instance SubgroupClass.toCommGroup {S : Type u_6} (H : S) {G : Type u_7} [CommGroup G] [SetLike S G] [SubgroupClass S G] : CommGroup { x // x ∈ H }

A subgroup of a CommGroup is a CommGroup.

Equations

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

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_8 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_9 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_1 {S : Type u_2} {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ZeroMemClass S G

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_7 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_5 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_4 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ↑0 = ↑0

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_6 {S : Type u_2} (H : S) {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_3 {S : Type u_2} (H : S) {G : Type u_1} [SetLike S G] : Function.Injective fun a => ↑a

theorem AddSubgroupClass.toOrderedAddCommGroup.proof_2 {S : Type u_2} {G : Type u_1} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : AddSubmonoidClass S G

instance AddSubgroupClass.toOrderedAddCommGroup {S : Type u_6} (H : S) {G : Type u_7} [OrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : OrderedAddCommGroup { x // x ∈ H }

An additive subgroup of an AddOrderedCommGroup is an AddOrderedCommGroup.

Equations

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

instance SubgroupClass.toOrderedCommGroup {S : Type u_6} (H : S) {G : Type u_7} [OrderedCommGroup G] [SetLike S G] [SubgroupClass S G] : OrderedCommGroup { x // x ∈ H }

A subgroup of an OrderedCommGroup is an OrderedCommGroup.

Equations

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

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_3 {S : Type u_2} (H : S) {G : Type u_1} [SetLike S G] : Function.Injective fun a => ↑a

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_4 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ↑0 = ↑0

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_5 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_2 {S : Type u_2} {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : AddSubmonoidClass S G

instance AddSubgroupClass.toLinearOrderedAddCommGroup {S : Type u_6} (H : S) {G : Type u_7} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : LinearOrderedAddCommGroup { x // x ∈ H }

An additive subgroup of a LinearOrderedAddCommGroup is a LinearOrderedAddCommGroup.

Equations

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

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_11 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x ⊓ x_1) = ↑(x ⊓ x_1)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_9 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_7 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_6 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_10 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] : ∀ (x x_1 : { x // x ∈ H }), ↑(x ⊔ x_1) = ↑(x ⊔ x_1)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_8 {S : Type u_2} (H : S) {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroupClass.toLinearOrderedAddCommGroup.proof_1 {S : Type u_2} {G : Type u_1} [LinearOrderedAddCommGroup G] [SetLike S G] [AddSubgroupClass S G] : ZeroMemClass S G

instance SubgroupClass.toLinearOrderedCommGroup {S : Type u_6} (H : S) {G : Type u_7} [LinearOrderedCommGroup G] [SetLike S G] [SubgroupClass S G] : LinearOrderedCommGroup { x // x ∈ H }

A subgroup of a LinearOrderedCommGroup is a LinearOrderedCommGroup.

Equations

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

def AddSubgroupClass.subtype {G : Type u_1} [AddGroup G] {S : Type u_6} (H : S) [SetLike S G] [AddSubgroupClass S G] : { x // x ∈ H } →+ G

The natural group hom from an additive subgroup of AddGroup G to G.

Equations

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

theorem AddSubgroupClass.subtype.proof_2 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ∀ (x x_1 : { x // x ∈ H }), ZeroHom.toFun { toFun := Subtype.val, map_zero' := (_ : ↑0 = ↑0) } (x + x_1) = ZeroHom.toFun { toFun := Subtype.val, map_zero' := (_ : ↑0 = ↑0) } (x + x_1)

theorem AddSubgroupClass.subtype.proof_1 {G : Type u_1} [AddGroup G] {S : Type u_2} (H : S) [SetLike S G] [AddSubgroupClass S G] : ↑0 = ↑0

def SubgroupClass.subtype {G : Type u_1} [Group G] {S : Type u_6} (H : S) [SetLike S G] [SubgroupClass S G] : { x // x ∈ H } →* G

The natural group hom from a subgroup of group G to G.

Equations

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

@[simp]

theorem AddSubgroupClass.coeSubtype {G : Type u_1} [AddGroup G] {S : Type u_6} (H : S) [SetLike S G] [AddSubgroupClass S G] : ↑↑H = Subtype.val

@[simp]

theorem SubgroupClass.coeSubtype {G : Type u_1} [Group G] {S : Type u_6} (H : S) [SetLike S G] [SubgroupClass S G] : ↑↑H = Subtype.val

@[simp]

theorem AddSubgroupClass.coe_nsmul {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] (x : { x // x ∈ H }) (n : ℕ) : ↑(n • x) = n • ↑x

@[simp]

theorem SubgroupClass.coe_pow {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] (x : { x // x ∈ H }) (n : ℕ) : ↑(x ^ n) = ↑x ^ n

@[simp]

theorem AddSubgroupClass.coe_zsmul {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] (x : { x // x ∈ H }) (n : ℤ) : ↑(n • x) = n • ↑x

@[simp]

theorem SubgroupClass.coe_zpow {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] (x : { x // x ∈ H }) (n : ℤ) : ↑(x ^ n) = ↑x ^ n

theorem AddSubgroupClass.inclusion.proof_1 {G : Type u_1} {S : Type u_2} [SetLike S G] {H : S} {K : S} (h : H ≤ K) (x : { x // x ∈ H }) : ↑x ∈ K

def AddSubgroupClass.inclusion {G : Type u_1} [AddGroup G] {S : Type u_6} [SetLike S G] [AddSubgroupClass S G] {H : S} {K : S} (h : H ≤ K) : { x // x ∈ H } →+ { x // x ∈ K }

The inclusion homomorphism from an additive subgroup H contained in K to K.

Equations

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

theorem AddSubgroupClass.inclusion.proof_2 {G : Type u_1} [AddGroup G] {S : Type u_2} [SetLike S G] [AddSubgroupClass S G] {H : S} {K : S} (h : H ≤ K) : ∀ (x x_1 : { x // x ∈ H }), (fun x => { val := ↑x, property := h ↑x (_ : ↑x ∈ H) }) (x + x_1) = (fun x => { val := ↑x, property := h ↑x (_ : ↑x ∈ H) }) (x + x_1)

def SubgroupClass.inclusion {G : Type u_1} [Group G] {S : Type u_6} [SetLike S G] [SubgroupClass S G] {H : S} {K : S} (h : H ≤ K) : { x // x ∈ H } →* { x // x ∈ K }

The inclusion homomorphism from a subgroup H contained in K to K.

Equations

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

@[simp]

theorem AddSubgroupClass.inclusion_self {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} [SetLike S G] [AddSubgroupClass S G] (x : { x // x ∈ H }) : ↑(AddSubgroupClass.inclusion (_ : H ≤ H)) x = x

@[simp]

theorem SubgroupClass.inclusion_self {G : Type u_1} [Group G] {S : Type u_6} {H : S} [SetLike S G] [SubgroupClass S G] (x : { x // x ∈ H }) : ↑(SubgroupClass.inclusion (_ : H ≤ H)) x = x

@[simp]

theorem AddSubgroupClass.inclusion_mk {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} {K : S} [SetLike S G] [AddSubgroupClass S G] {h : H ≤ K} (x : G) (hx : x ∈ H) : ↑(AddSubgroupClass.inclusion h) { val := x, property := hx } = { val := x, property := h x hx }

@[simp]

theorem SubgroupClass.inclusion_mk {G : Type u_1} [Group G] {S : Type u_6} {H : S} {K : S} [SetLike S G] [SubgroupClass S G] {h : H ≤ K} (x : G) (hx : x ∈ H) : ↑(SubgroupClass.inclusion h) { val := x, property := hx } = { val := x, property := h x hx }

theorem AddSubgroupClass.inclusion_right {G : Type u_1} [AddGroup G] {S : Type u_6} {H : S} {K : S} [SetLike S G] [AddSubgroupClass S G] (h : H ≤ K) (x : { x // x ∈ K }) (hx : ↑x ∈ H) : ↑(AddSubgroupClass.inclusion h) { val := ↑x, property := hx } = x

theorem SubgroupClass.inclusion_right {G : Type u_1} [Group G] {S : Type u_6} {H : S} {K : S} [SetLike S G] [SubgroupClass S G] (h : H ≤ K) (x : { x // x ∈ K }) (hx : ↑x ∈ H) : ↑(SubgroupClass.inclusion h) { val := ↑x, property := hx } = x

@[simp]

theorem SubgroupClass.inclusion_inclusion {G : Type u_1} [Group G] {S : Type u_6} {H : S} {K : S} [SetLike S G] [SubgroupClass S G] {L : S} (hHK : H ≤ K) (hKL : K ≤ L) (x : { x // x ∈ H }) : ↑(SubgroupClass.inclusion hKL) (↑(SubgroupClass.inclusion hHK) x) = ↑(SubgroupClass.inclusion (_ : H ≤ L)) x

@[simp]

theorem AddSubgroupClass.coe_inclusion {G : Type u_1} [AddGroup G] {S : Type u_6} [SetLike S G] [AddSubgroupClass S G] {H : S} {K : S} {h : H ≤ K} (a : { x // x ∈ H }) : ↑(↑(AddSubgroupClass.inclusion h) a) = ↑a

@[simp]

theorem SubgroupClass.coe_inclusion {G : Type u_1} [Group G] {S : Type u_6} [SetLike S G] [SubgroupClass S G] {H : S} {K : S} {h : H ≤ K} (a : { x // x ∈ H }) : ↑(↑(SubgroupClass.inclusion h) a) = ↑a

@[simp]

theorem AddSubgroupClass.subtype_comp_inclusion {G : Type u_1} [AddGroup G] {S : Type u_6} [SetLike S G] [AddSubgroupClass S G] {H : S} {K : S} (hH : H ≤ K) : AddMonoidHom.comp (↑K) (AddSubgroupClass.inclusion hH) = ↑H

@[simp]

theorem SubgroupClass.subtype_comp_inclusion {G : Type u_1} [Group G] {S : Type u_6} [SetLike S G] [SubgroupClass S G] {H : S} {K : S} (hH : H ≤ K) : MonoidHom.comp (↑K) (SubgroupClass.inclusion hH) = ↑H

structure Subgroup (G : Type u_5) [Group G] extends Submonoid : Type u_5

• carrier : Set G
• mul_mem' : ∀ {a b : G}, a ∈ s.carrier → b ∈ s.carrier → a * b ∈ s.carrier
• one_mem' : 1 ∈ s.carrier
• inv_mem' : ∀ {x : G}, x ∈ s.carrier → x⁻¹ ∈ s.carrier

  G is closed under inverses

A subgroup of a group G is a subset containing 1, closed under multiplication and closed under multiplicative inverse.

structure AddSubgroup (G : Type u_5) [AddGroup G] extends AddSubmonoid : Type u_5

• carrier : Set G
• add_mem' : ∀ {a b : G}, a ∈ s.carrier → b ∈ s.carrier → a + b ∈ s.carrier
• zero_mem' : 0 ∈ s.carrier
• neg_mem' : ∀ {x : G}, x ∈ s.carrier → -x ∈ s.carrier

  G is closed under negation

An additive subgroup of an additive group G is a subset containing 0, closed under addition and additive inverse.

theorem AddSubgroup.instSetLikeAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] (p : AddSubgroup G) (q : AddSubgroup G) (h : (fun s => s.carrier) p = (fun s => s.carrier) q) : p = q

instance AddSubgroup.instSetLikeAddSubgroup {G : Type u_1} [AddGroup G] : SetLike (AddSubgroup G) G

Equations

• AddSubgroup.instSetLikeAddSubgroup = { coe := fun s => s.carrier, coe_injective' := (_ : ∀ (p q : AddSubgroup G), (fun s => s.carrier) p = (fun s => s.carrier) q → p = q) }

instance Subgroup.instSetLikeSubgroup {G : Type u_1} [Group G] : SetLike (Subgroup G) G

Equations

• Subgroup.instSetLikeSubgroup = { coe := fun s => s.carrier, coe_injective' := (_ : ∀ (p q : Subgroup G), (fun s => s.carrier) p = (fun s => s.carrier) q → p = q) }

instance AddSubgroup.instAddSubgroupClassAddSubgroupToSubNegAddMonoidInstSetLikeAddSubgroup {G : Type u_1} [AddGroup G] : AddSubgroupClass (AddSubgroup G) G

Equations

• @AddSubgroup.instAddSubgroupClassAddSubgroupToSubNegAddMonoidInstSetLikeAddSubgroup = @AddSubgroup.instAddSubgroupClassAddSubgroupToSubNegAddMonoidInstSetLikeAddSubgroup.proof_1

theorem AddSubgroup.instAddSubgroupClassAddSubgroupToSubNegAddMonoidInstSetLikeAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] : AddSubgroupClass (AddSubgroup G) G

instance Subgroup.instSubgroupClassSubgroupToDivInvMonoidInstSetLikeSubgroup {G : Type u_1} [Group G] : SubgroupClass (Subgroup G) G

Equations

• @Subgroup.instSubgroupClassSubgroupToDivInvMonoidInstSetLikeSubgroup = @Subgroup.instSubgroupClassSubgroupToDivInvMonoidInstSetLikeSubgroup.proof_1

@[simp]

theorem AddSubgroup.mem_carrier {G : Type u_1} [AddGroup G] {s : AddSubgroup G} {x : G} : x ∈ s.carrier ↔ x ∈ s

@[simp]

theorem Subgroup.mem_carrier {G : Type u_1} [Group G] {s : Subgroup G} {x : G} : x ∈ s.carrier ↔ x ∈ s

@[simp]

theorem AddSubgroup.mem_mk {G : Type u_1} [AddGroup G] {s : Set G} {x : G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) (h_mul : s 0) (h_inv : ∀ {x : G}, x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier) : x ∈ { toAddSubmonoid := { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }, neg_mem' := h_inv } ↔ x ∈ s

@[simp]

theorem Subgroup.mem_mk {G : Type u_1} [Group G] {s : Set G} {x : G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a * b ∈ s) (h_mul : s 1) (h_inv : ∀ {x : G}, x ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier → x⁻¹ ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier) : x ∈ { toSubmonoid := { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }, inv_mem' := h_inv } ↔ x ∈ s

@[simp]

theorem AddSubgroup.coe_set_mk {G : Type u_1} [AddGroup G] {s : Set G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) (h_mul : s 0) (h_inv : ∀ {x : G}, x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier) : ↑{ toAddSubmonoid := { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }, neg_mem' := h_inv } = s

@[simp]

theorem Subgroup.coe_set_mk {G : Type u_1} [Group G] {s : Set G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a * b ∈ s) (h_mul : s 1) (h_inv : ∀ {x : G}, x ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier → x⁻¹ ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier) : ↑{ toSubmonoid := { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }, inv_mem' := h_inv } = s

@[simp]

theorem AddSubgroup.mk_le_mk {G : Type u_1} [AddGroup G] {s : Set G} {t : Set G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) (h_mul : s 0) (h_inv : ∀ {x : G}, x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }.toAddSubsemigroup.carrier) (h_one' : ∀ {a b : G}, a ∈ t → b ∈ t → a + b ∈ t) (h_mul' : t 0) (h_inv' : ∀ {x : G}, x ∈ { toAddSubsemigroup := { carrier := t, add_mem' := h_one' }, zero_mem' := h_mul' }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := t, add_mem' := h_one' }, zero_mem' := h_mul' }.toAddSubsemigroup.carrier) : { toAddSubmonoid := { toAddSubsemigroup := { carrier := s, add_mem' := h_one }, zero_mem' := h_mul }, neg_mem' := h_inv } ≤ { toAddSubmonoid := { toAddSubsemigroup := { carrier := t, add_mem' := h_one' }, zero_mem' := h_mul' }, neg_mem' := h_inv' } ↔ s ⊆ t

@[simp]

theorem Subgroup.mk_le_mk {G : Type u_1} [Group G] {s : Set G} {t : Set G} (h_one : ∀ {a b : G}, a ∈ s → b ∈ s → a * b ∈ s) (h_mul : s 1) (h_inv : ∀ {x : G}, x ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier → x⁻¹ ∈ { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }.toSubsemigroup.carrier) (h_one' : ∀ {a b : G}, a ∈ t → b ∈ t → a * b ∈ t) (h_mul' : t 1) (h_inv' : ∀ {x : G}, x ∈ { toSubsemigroup := { carrier := t, mul_mem' := h_one' }, one_mem' := h_mul' }.toSubsemigroup.carrier → x⁻¹ ∈ { toSubsemigroup := { carrier := t, mul_mem' := h_one' }, one_mem' := h_mul' }.toSubsemigroup.carrier) : { toSubmonoid := { toSubsemigroup := { carrier := s, mul_mem' := h_one }, one_mem' := h_mul }, inv_mem' := h_inv } ≤ { toSubmonoid := { toSubsemigroup := { carrier := t, mul_mem' := h_one' }, one_mem' := h_mul' }, inv_mem' := h_inv' } ↔ s ⊆ t

@[simp]

theorem AddSubgroup.coe_toAddSubmonoid {G : Type u_1} [AddGroup G] (K : AddSubgroup G) : ↑K.toAddSubmonoid = ↑K

@[simp]

theorem Subgroup.coe_toSubmonoid {G : Type u_1} [Group G] (K : Subgroup G) : ↑K.toSubmonoid = ↑K

@[simp]

theorem AddSubgroup.mem_toAddSubmonoid {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (x : G) : x ∈ K.toAddSubmonoid ↔ x ∈ K

@[simp]

theorem Subgroup.mem_toSubmonoid {G : Type u_1} [Group G] (K : Subgroup G) (x : G) : x ∈ K.toSubmonoid ↔ x ∈ K

theorem AddSubgroup.toAddSubmonoid_injective {G : Type u_1} [AddGroup G] : Function.Injective AddSubgroup.toAddSubmonoid

theorem Subgroup.toSubmonoid_injective {G : Type u_1} [Group G] : Function.Injective Subgroup.toSubmonoid

@[simp]

theorem AddSubgroup.toAddSubmonoid_eq {G : Type u_1} [AddGroup G] {p : AddSubgroup G} {q : AddSubgroup G} : p.toAddSubmonoid = q.toAddSubmonoid ↔ p = q

@[simp]

theorem Subgroup.toSubmonoid_eq {G : Type u_1} [Group G] {p : Subgroup G} {q : Subgroup G} : p.toSubmonoid = q.toSubmonoid ↔ p = q

theorem AddSubgroup.toAddSubmonoid_strictMono {G : Type u_1} [AddGroup G] : StrictMono AddSubgroup.toAddSubmonoid

theorem Subgroup.toSubmonoid_strictMono {G : Type u_1} [Group G] : StrictMono Subgroup.toSubmonoid

theorem AddSubgroup.toAddSubmonoid_mono {G : Type u_1} [AddGroup G] : Monotone AddSubgroup.toAddSubmonoid

theorem Subgroup.toSubmonoid_mono {G : Type u_1} [Group G] : Monotone Subgroup.toSubmonoid

@[simp]

theorem AddSubgroup.toAddSubmonoid_le {G : Type u_1} [AddGroup G] {p : AddSubgroup G} {q : AddSubgroup G} : p.toAddSubmonoid ≤ q.toAddSubmonoid ↔ p ≤ q

@[simp]

theorem Subgroup.toSubmonoid_le {G : Type u_1} [Group G] {p : Subgroup G} {q : Subgroup G} : p.toSubmonoid ≤ q.toSubmonoid ↔ p ≤ q

Conversion to/from Additive/Multiplicative

@[simp]

theorem Subgroup.toAddSubgroup_apply_coe {G : Type u_1} [Group G] (S : Subgroup G) : ↑(↑Subgroup.toAddSubgroup S) = ↑Additive.toMul ⁻¹' ↑S

@[simp]

theorem Subgroup.toAddSubgroup_symm_apply_coe {G : Type u_1} [Group G] (S : AddSubgroup (Additive G)) : ↑(↑(RelIso.symm Subgroup.toAddSubgroup) S) = ↑Multiplicative.toAdd ⁻¹' ↑S

def Subgroup.toAddSubgroup {G : Type u_1} [Group G] : Subgroup G ≃o AddSubgroup (Additive G)

Subgroups of a group G are isomorphic to additive subgroups of Additive G.

Equations

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

@[inline, reducible]

abbrev AddSubgroup.toSubgroup' {G : Type u_1} [Group G] : AddSubgroup (Additive G) ≃o Subgroup G

Additive subgroup of an additive group Additive G are isomorphic to subgroup of G.

Equations

• AddSubgroup.toSubgroup' = OrderIso.symm Subgroup.toAddSubgroup

@[simp]

theorem AddSubgroup.toSubgroup_apply_coe {A : Type u_4} [AddGroup A] (S : AddSubgroup A) : ↑(↑AddSubgroup.toSubgroup S) = ↑Multiplicative.toAdd ⁻¹' ↑S

@[simp]

theorem AddSubgroup.toSubgroup_symm_apply_coe {A : Type u_4} [AddGroup A] (S : Subgroup (Multiplicative A)) : ↑(↑(RelIso.symm AddSubgroup.toSubgroup) S) = ↑Additive.toMul ⁻¹' ↑S

def AddSubgroup.toSubgroup {A : Type u_4} [AddGroup A] : AddSubgroup A ≃o Subgroup (Multiplicative A)

Additive subgroups of an additive group A are isomorphic to subgroups of Multiplicative A.

Equations

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

@[inline, reducible]

abbrev Subgroup.toAddSubgroup' {A : Type u_4} [AddGroup A] : Subgroup (Multiplicative A) ≃o AddSubgroup A

Subgroups of an additive group Multiplicative A are isomorphic to additive subgroups of A.

Equations

• Subgroup.toAddSubgroup' = OrderIso.symm AddSubgroup.toSubgroup

theorem AddSubgroup.copy.proof_3 {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : ∀ {x : G}, x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := (_ : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) }, zero_mem' := (_ : 0 ∈ { carrier := s, add_mem' := (_ : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) }.carrier) }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := s, add_mem' := (_ : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) }, zero_mem' := (_ : 0 ∈ { carrier := s, add_mem' := (_ : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) }.carrier) }.toAddSubsemigroup.carrier

theorem AddSubgroup.copy.proof_1 {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s

theorem AddSubgroup.copy.proof_2 {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : 0 ∈ { carrier := s, add_mem' := (_ : ∀ {a b : G}, a ∈ s → b ∈ s → a + b ∈ s) }.carrier

def AddSubgroup.copy {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : AddSubgroup G

Copy of an additive subgroup with a new carrier equal to the old one. Useful to fix definitional equalities

Equations

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

def Subgroup.copy {G : Type u_1} [Group G] (K : Subgroup G) (s : Set G) (hs : s = ↑K) : Subgroup G

Copy of a subgroup with a new carrier 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 AddSubgroup.coe_copy {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : ↑(AddSubgroup.copy K s hs) = s

@[simp]

theorem Subgroup.coe_copy {G : Type u_1} [Group G] (K : Subgroup G) (s : Set G) (hs : s = ↑K) : ↑(Subgroup.copy K s hs) = s

theorem AddSubgroup.copy_eq {G : Type u_1} [AddGroup G] (K : AddSubgroup G) (s : Set G) (hs : s = ↑K) : AddSubgroup.copy K s hs = K

theorem Subgroup.copy_eq {G : Type u_1} [Group G] (K : Subgroup G) (s : Set G) (hs : s = ↑K) : Subgroup.copy K s hs = K

theorem AddSubgroup.ext {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : ∀ (x : G), x ∈ H ↔ x ∈ K) : H = K

Two AddSubgroups are equal if they have the same elements.

theorem Subgroup.ext {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : ∀ (x : G), x ∈ H ↔ x ∈ K) : H = K

Two subgroups are equal if they have the same elements.

theorem AddSubgroup.zero_mem {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : 0 ∈ H

An AddSubgroup contains the group's 0.

theorem Subgroup.one_mem {G : Type u_1} [Group G] (H : Subgroup G) : 1 ∈ H

A subgroup contains the group's 1.

theorem AddSubgroup.add_mem {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} {y : G} : x ∈ H → y ∈ H → x + y ∈ H

An AddSubgroup is closed under addition.

theorem Subgroup.mul_mem {G : Type u_1} [Group G] (H : Subgroup G) {x : G} {y : G} : x ∈ H → y ∈ H → x * y ∈ H

A subgroup is closed under multiplication.

theorem AddSubgroup.neg_mem {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} : x ∈ H → -x ∈ H

An AddSubgroup is closed under inverse.

theorem Subgroup.inv_mem {G : Type u_1} [Group G] (H : Subgroup G) {x : G} : x ∈ H → x⁻¹ ∈ H

A subgroup is closed under inverse.

theorem AddSubgroup.sub_mem {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} {y : G} (hx : x ∈ H) (hy : y ∈ H) : x - y ∈ H

An AddSubgroup is closed under subtraction.

theorem Subgroup.div_mem {G : Type u_1} [Group G] (H : Subgroup G) {x : G} {y : G} (hx : x ∈ H) (hy : y ∈ H) : x / y ∈ H

A subgroup is closed under division.

theorem AddSubgroup.neg_mem_iff {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} : -x ∈ H ↔ x ∈ H

theorem Subgroup.inv_mem_iff {G : Type u_1} [Group G] (H : Subgroup G) {x : G} : x⁻¹ ∈ H ↔ x ∈ H

theorem AddSubgroup.sub_mem_comm_iff {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {a : G} {b : G} : a - b ∈ H ↔ b - a ∈ H

theorem Subgroup.div_mem_comm_iff {G : Type u_1} [Group G] (H : Subgroup G) {a : G} {b : G} : a / b ∈ H ↔ b / a ∈ H

theorem AddSubgroup.exists_neg_mem_iff_exists_mem {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {P : G → Prop} : (∃ x, x ∈ K ∧ P (-x)) ↔ ∃ x, x ∈ K ∧ P x

theorem Subgroup.exists_inv_mem_iff_exists_mem {G : Type u_1} [Group G] (K : Subgroup G) {P : G → Prop} : (∃ x, x ∈ K ∧ P x⁻¹) ↔ ∃ x, x ∈ K ∧ P x

theorem AddSubgroup.add_mem_cancel_right {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} {y : G} (h : x ∈ H) : y + x ∈ H ↔ y ∈ H

theorem Subgroup.mul_mem_cancel_right {G : Type u_1} [Group G] (H : Subgroup G) {x : G} {y : G} (h : x ∈ H) : y * x ∈ H ↔ y ∈ H

theorem AddSubgroup.add_mem_cancel_left {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {x : G} {y : G} (h : x ∈ H) : x + y ∈ H ↔ y ∈ H

theorem Subgroup.mul_mem_cancel_left {G : Type u_1} [Group G] (H : Subgroup G) {x : G} {y : G} (h : x ∈ H) : x * y ∈ H ↔ y ∈ H

theorem AddSubgroup.nsmul_mem {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {x : G} (hx : x ∈ K) (n : ℕ) : n • x ∈ K

theorem Subgroup.pow_mem {G : Type u_1} [Group G] (K : Subgroup G) {x : G} (hx : x ∈ K) (n : ℕ) : x ^ n ∈ K

theorem AddSubgroup.zsmul_mem {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {x : G} (hx : x ∈ K) (n : ℤ) : n • x ∈ K

theorem Subgroup.zpow_mem {G : Type u_1} [Group G] (K : Subgroup G) {x : G} (hx : x ∈ K) (n : ℤ) : x ^ n ∈ K

def AddSubgroup.ofSub {G : Type u_1} [AddGroup G] (s : Set G) (hsn : Set.Nonempty s) (hs : ∀ (x : G), x ∈ s → ∀ (y : G), y ∈ s → x + -y ∈ s) : AddSubgroup G

Construct a subgroup from a nonempty set that is closed under subtraction

Equations

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

theorem AddSubgroup.ofSub.proof_1 {G : Type u_1} [AddGroup G] (s : Set G) (hsn : Set.Nonempty s) (hs : ∀ (x : G), x ∈ s → ∀ (y : G), y ∈ s → x + -y ∈ s) : 0 ∈ s

abbrev AddSubgroup.ofSub.match_1 {G : Type u_1} (s : Set G) (motive : Set.Nonempty s → Prop) : (hsn : Set.Nonempty s) → ((x : G) → (hx : x ∈ s) → motive (_ : ∃ x, x ∈ s)) → motive hsn

Equations

• AddSubgroup.ofSub.match_1 s motive hsn h_1 = Exists.casesOn hsn fun w h => h_1 w h

def Subgroup.ofDiv {G : Type u_1} [Group G] (s : Set G) (hsn : Set.Nonempty s) (hs : ∀ (x : G), x ∈ s → ∀ (y : G), y ∈ s → x * y⁻¹ ∈ s) : Subgroup G

Construct a subgroup from a nonempty set that is closed under division.

Equations

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

instance AddSubgroup.add {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Add { x // x ∈ H }

An AddSubgroup of an AddGroup inherits an addition.

Equations

• AddSubgroup.add H = AddSubmonoid.add H.toAddSubmonoid

instance Subgroup.mul {G : Type u_1} [Group G] (H : Subgroup G) : Mul { x // x ∈ H }

A subgroup of a group inherits a multiplication.

Equations

• Subgroup.mul H = Submonoid.mul H.toSubmonoid

instance AddSubgroup.zero {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Zero { x // x ∈ H }

An AddSubgroup of an AddGroup inherits a zero.

Equations

• AddSubgroup.zero H = AddSubmonoid.zero H.toAddSubmonoid

instance Subgroup.one {G : Type u_1} [Group G] (H : Subgroup G) : One { x // x ∈ H }

A subgroup of a group inherits a 1.

Equations

• Subgroup.one H = Submonoid.one H.toSubmonoid

instance AddSubgroup.neg {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Neg { x // x ∈ H }

An AddSubgroup of an AddGroup inherits an inverse.

Equations

• AddSubgroup.neg H = { neg := fun a => { val := -↑a, property := (_ : -↑a ∈ H) } }

theorem AddSubgroup.neg.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (a : { x // x ∈ H }) : -↑a ∈ H

instance Subgroup.inv {G : Type u_1} [Group G] (H : Subgroup G) : Inv { x // x ∈ H }

A subgroup of a group inherits an inverse.

Equations

• Subgroup.inv H = { inv := fun a => { val := (↑a)⁻¹, property := (_ : (↑a)⁻¹ ∈ H) } }

theorem AddSubgroup.sub.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (a : { x // x ∈ H }) (b : { x // x ∈ H }) : ↑a - ↑b ∈ H

instance AddSubgroup.sub {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Sub { x // x ∈ H }

An AddSubgroup of an AddGroup inherits a subtraction.

Equations

• AddSubgroup.sub H = { sub := fun a b => { val := ↑a - ↑b, property := (_ : ↑a - ↑b ∈ H) } }

instance Subgroup.div {G : Type u_1} [Group G] (H : Subgroup G) : Div { x // x ∈ H }

A subgroup of a group inherits a division

Equations

• Subgroup.div H = { div := fun a b => { val := ↑a / ↑b, property := (_ : ↑a / ↑b ∈ H) } }

instance AddSubgroup.nsmul {G : Type u_5} [AddGroup G] {H : AddSubgroup G} : SMul ℕ { x // x ∈ H }

An AddSubgroup of an AddGroup inherits a natural scaling.

Equations

• AddSubgroup.nsmul = { smul := fun n a => { val := ↑(n • a), property := (_ : n • ↑a ∈ H) } }

instance Subgroup.npow {G : Type u_1} [Group G] (H : Subgroup G) : Pow { x // x ∈ H } ℕ

A subgroup of a group inherits a natural power

Equations

• Subgroup.npow H = { pow := fun a n => { val := ↑(a ^ n), property := (_ : ↑a ^ n ∈ H) } }

instance AddSubgroup.zsmul {G : Type u_5} [AddGroup G] {H : AddSubgroup G} : SMul ℤ { x // x ∈ H }

An AddSubgroup of an AddGroup inherits an integer scaling.

Equations

• AddSubgroup.zsmul = { smul := fun n a => { val := ↑(n • a), property := (_ : n • ↑a ∈ H) } }

instance Subgroup.zpow {G : Type u_1} [Group G] (H : Subgroup G) : Pow { x // x ∈ H } ℤ

A subgroup of a group inherits an integer power

Equations

• Subgroup.zpow H = { pow := fun a n => { val := ↑(a ^ n), property := (_ : ↑a ^ n ∈ H) } }

@[simp]

theorem AddSubgroup.coe_add {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x + y) = ↑x + ↑y

@[simp]

theorem Subgroup.coe_mul {G : Type u_1} [Group G] (H : Subgroup G) (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x * y) = ↑x * ↑y

@[simp]

theorem AddSubgroup.coe_zero {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ↑0 = 0

@[simp]

theorem Subgroup.coe_one {G : Type u_1} [Group G] (H : Subgroup G) : ↑1 = 1

@[simp]

theorem AddSubgroup.coe_neg {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : { x // x ∈ H }) : ↑(-x) = -↑x

@[simp]

theorem Subgroup.coe_inv {G : Type u_1} [Group G] (H : Subgroup G) (x : { x // x ∈ H }) : ↑x⁻¹ = (↑x)⁻¹

@[simp]

theorem AddSubgroup.coe_sub {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x - y) = ↑x - ↑y

@[simp]

theorem Subgroup.coe_div {G : Type u_1} [Group G] (H : Subgroup G) (x : { x // x ∈ H }) (y : { x // x ∈ H }) : ↑(x / y) = ↑x / ↑y

theorem AddSubgroup.coe_mk {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : G) (hx : x ∈ H) : ↑{ val := x, property := hx } = x

theorem Subgroup.coe_mk {G : Type u_1} [Group G] (H : Subgroup G) (x : G) (hx : x ∈ H) : ↑{ val := x, property := hx } = x

@[simp]

theorem AddSubgroup.coe_nsmul {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : { x // x ∈ H }) (n : ℕ) : ↑(n • x) = n • ↑x

@[simp]

theorem Subgroup.coe_pow {G : Type u_1} [Group G] (H : Subgroup G) (x : { x // x ∈ H }) (n : ℕ) : ↑(x ^ n) = ↑x ^ n

theorem AddSubgroup.coe_zsmul {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (x : { x // x ∈ H }) (n : ℤ) : ↑(n • x) = n • ↑x

theorem Subgroup.coe_zpow {G : Type u_1} [Group G] (H : Subgroup G) (x : { x // x ∈ H }) (n : ℤ) : ↑(x ^ n) = ↑x ^ n

@[simp]

theorem AddSubgroup.mk_eq_zero_iff {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {g : G} {h : g ∈ H} : { val := g, property := h } = 0 ↔ g = 0

@[simp]

theorem Subgroup.mk_eq_one_iff {G : Type u_1} [Group G] (H : Subgroup G) {g : G} {h : g ∈ H} : { val := g, property := h } = 1 ↔ g = 1

theorem AddSubgroup.toAddGroup.proof_7 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroup.toAddGroup.proof_2 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ↑0 = ↑0

theorem AddSubgroup.toAddGroup.proof_4 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

instance AddSubgroup.toAddGroup {G : Type u_5} [AddGroup G] (H : AddSubgroup G) : AddGroup { x // x ∈ H }

An AddSubgroup of an AddGroup inherits an AddGroup structure.

Equations

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

theorem AddSubgroup.toAddGroup.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Function.Injective fun a => ↑a

theorem AddSubgroup.toAddGroup.proof_5 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroup.toAddGroup.proof_3 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroup.toAddGroup.proof_6 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

instance Subgroup.toGroup {G : Type u_5} [Group G] (H : Subgroup G) : Group { x // x ∈ H }

A subgroup of a group inherits a group structure.

Equations

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

theorem AddSubgroup.toAddCommGroup.proof_7 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroup.toAddCommGroup.proof_5 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroup.toAddCommGroup.proof_6 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

instance AddSubgroup.toAddCommGroup {G : Type u_5} [AddCommGroup G] (H : AddSubgroup G) : AddCommGroup { x // x ∈ H }

An AddSubgroup of an AddCommGroup is an AddCommGroup.

Equations

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

theorem AddSubgroup.toAddCommGroup.proof_4 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroup.toAddCommGroup.proof_3 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroup.toAddCommGroup.proof_1 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : Function.Injective fun a => ↑a

theorem AddSubgroup.toAddCommGroup.proof_2 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : ↑0 = ↑0

instance Subgroup.toCommGroup {G : Type u_5} [CommGroup G] (H : Subgroup G) : CommGroup { x // x ∈ H }

A subgroup of a CommGroup is a CommGroup.

Equations

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

theorem AddSubgroup.toOrderedAddCommGroup.proof_1 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : Function.Injective fun a => ↑a

theorem AddSubgroup.toOrderedAddCommGroup.proof_7 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroup.toOrderedAddCommGroup.proof_3 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroup.toOrderedAddCommGroup.proof_2 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ↑0 = ↑0

theorem AddSubgroup.toOrderedAddCommGroup.proof_4 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

instance AddSubgroup.toOrderedAddCommGroup {G : Type u_5} [OrderedAddCommGroup G] (H : AddSubgroup G) : OrderedAddCommGroup { x // x ∈ H }

An AddSubgroup of an AddOrderedCommGroup is an AddOrderedCommGroup.

Equations

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

theorem AddSubgroup.toOrderedAddCommGroup.proof_5 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

theorem AddSubgroup.toOrderedAddCommGroup.proof_6 {G : Type u_1} [OrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

instance Subgroup.toOrderedCommGroup {G : Type u_5} [OrderedCommGroup G] (H : Subgroup G) : OrderedCommGroup { x // x ∈ H }

A subgroup of an OrderedCommGroup is an OrderedCommGroup.

Equations

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

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_7 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℤ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_9 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x ⊓ x_1) = ↑(x ⊓ x_1)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_5 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x - x_1) = ↑(x - x_1)

instance AddSubgroup.toLinearOrderedAddCommGroup {G : Type u_5} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : LinearOrderedAddCommGroup { x // x ∈ H }

An AddSubgroup of a LinearOrderedAddCommGroup is a LinearOrderedAddCommGroup.

Equations

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

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_8 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x ⊔ x_1) = ↑(x ⊔ x_1)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_6 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }) (x_1 : ℕ), ↑(x_1 • x) = ↑(x_1 • x)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_4 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x : { x // x ∈ H }), ↑(-x) = ↑(-x)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_3 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ↑(x + x_1) = ↑(x + x_1)

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_1 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : Function.Injective fun a => ↑a

theorem AddSubgroup.toLinearOrderedAddCommGroup.proof_2 {G : Type u_1} [LinearOrderedAddCommGroup G] (H : AddSubgroup G) : ↑0 = ↑0

instance Subgroup.toLinearOrderedCommGroup {G : Type u_5} [LinearOrderedCommGroup G] (H : Subgroup G) : LinearOrderedCommGroup { x // x ∈ H }

A subgroup of a LinearOrderedCommGroup is a LinearOrderedCommGroup.

Equations

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

theorem AddSubgroup.subtype.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ↑0 = ↑0

theorem AddSubgroup.subtype.proof_2 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ∀ (x x_1 : { x // x ∈ H }), ZeroHom.toFun { toFun := Subtype.val, map_zero' := (_ : ↑0 = ↑0) } (x + x_1) = ZeroHom.toFun { toFun := Subtype.val, map_zero' := (_ : ↑0 = ↑0) } (x + x_1)

def AddSubgroup.subtype {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : { x // x ∈ H } →+ G

The natural group hom from an AddSubgroup of AddGroup G to G.

Equations

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

def Subgroup.subtype {G : Type u_1} [Group G] (H : Subgroup G) : { x // x ∈ H } →* G

The natural group hom from a subgroup of group G to G.

Equations

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

@[simp]

theorem AddSubgroup.coeSubtype {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : ↑(AddSubgroup.subtype H) = Subtype.val

@[simp]

theorem Subgroup.coeSubtype {G : Type u_1} [Group G] (H : Subgroup G) : ↑(Subgroup.subtype H) = Subtype.val

theorem AddSubgroup.subtype_injective {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Function.Injective ↑(AddSubgroup.subtype H)

theorem Subgroup.subtype_injective {G : Type u_1} [Group G] (H : Subgroup G) : Function.Injective ↑(Subgroup.subtype H)

theorem AddSubgroup.inclusion.proof_2 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) : ∀ (x x_1 : { x // x ∈ H }), (fun x => { val := ↑x, property := h ↑x (_ : ↑x ∈ H) }) (x + x_1) = (fun x => { val := ↑x, property := h ↑x (_ : ↑x ∈ H) }) (x + x_1)

def AddSubgroup.inclusion {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) : { x // x ∈ H } →+ { x // x ∈ K }

The inclusion homomorphism from an additive subgroup H contained in K to K.

Equations

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

theorem AddSubgroup.inclusion.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (x : { x // x ∈ H }) : ↑x ∈ K

def Subgroup.inclusion {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) : { x // x ∈ H } →* { x // x ∈ K }

The inclusion homomorphism from a subgroup H contained in K to K.

Equations

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

@[simp]

theorem AddSubgroup.coe_inclusion {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} {h : H ≤ K} (a : { x // x ∈ H }) : ↑(↑(AddSubgroup.inclusion h) a) = ↑a

@[simp]

theorem Subgroup.coe_inclusion {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} {h : H ≤ K} (a : { x // x ∈ H }) : ↑(↑(Subgroup.inclusion h) a) = ↑a

theorem AddSubgroup.inclusion_injective {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) : Function.Injective ↑(AddSubgroup.inclusion h)

theorem Subgroup.inclusion_injective {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) : Function.Injective ↑(Subgroup.inclusion h)

@[simp]

theorem AddSubgroup.subtype_comp_inclusion {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (hH : H ≤ K) : AddMonoidHom.comp (AddSubgroup.subtype K) (AddSubgroup.inclusion hH) = AddSubgroup.subtype H

@[simp]

theorem Subgroup.subtype_comp_inclusion {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (hH : H ≤ K) : MonoidHom.comp (Subgroup.subtype K) (Subgroup.inclusion hH) = Subgroup.subtype H

theorem AddSubgroup.instTopAddSubgroup.proof_2 {G : Type u_1} [AddGroup G] : ∀ {x : G}, x ∈ { toAddSubsemigroup := ⊤.toAddSubsemigroup, zero_mem' := (_ : 0 ∈ ⊤.carrier) }.toAddSubsemigroup.carrier → -x ∈ Set.univ

theorem AddSubgroup.instTopAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] : 0 ∈ ⊤.carrier

instance AddSubgroup.instTopAddSubgroup {G : Type u_1} [AddGroup G] : Top (AddSubgroup G)

The AddSubgroup G of the AddGroup G.

Equations

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

instance Subgroup.instTopSubgroup {G : Type u_1} [Group G] : Top (Subgroup G)

The subgroup G of the group G.

Equations

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

def AddSubgroup.topEquiv {G : Type u_1} [AddGroup G] : { x // x ∈ ⊤ } ≃+ G

The top additive subgroup is isomorphic to the additive group.

This is the additive group version of AddSubmonoid.topEquiv.

Equations

• AddSubgroup.topEquiv = AddSubmonoid.topEquiv

@[simp]

theorem AddSubgroup.topEquiv_apply {G : Type u_1} [AddGroup G] (x : { x // x ∈ ⊤ }) : ↑AddSubgroup.topEquiv x = ↑x

@[simp]

theorem Subgroup.topEquiv_symm_apply_coe {G : Type u_1} [Group G] (x : G) : ↑(↑(MulEquiv.symm Subgroup.topEquiv) x) = x

@[simp]

theorem AddSubgroup.topEquiv_symm_apply_coe {G : Type u_1} [AddGroup G] (x : G) : ↑(↑(AddEquiv.symm AddSubgroup.topEquiv) x) = x

@[simp]

theorem Subgroup.topEquiv_apply {G : Type u_1} [Group G] (x : { x // x ∈ ⊤ }) : ↑Subgroup.topEquiv x = ↑x

def Subgroup.topEquiv {G : Type u_1} [Group G] : { x // x ∈ ⊤ } ≃* G

The top subgroup is isomorphic to the group.

This is the group version of Submonoid.topEquiv.

Equations

• Subgroup.topEquiv = Submonoid.topEquiv

theorem AddSubgroup.instBotAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] : 0 ∈ ⊥.carrier

theorem AddSubgroup.instBotAddSubgroup.proof_2 {G : Type u_1} [AddGroup G] (a : G) : a ∈ ⊥.carrier → -a ∈ ⊥.carrier

instance AddSubgroup.instBotAddSubgroup {G : Type u_1} [AddGroup G] : Bot (AddSubgroup G)

The trivial AddSubgroup {0} of an AddGroup G.

Equations

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

instance Subgroup.instBotSubgroup {G : Type u_1} [Group G] : Bot (Subgroup G)

The trivial subgroup {1} of a group G.

Equations

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

instance AddSubgroup.instInhabitedAddSubgroup {G : Type u_1} [AddGroup G] : Inhabited (AddSubgroup G)

Equations

• AddSubgroup.instInhabitedAddSubgroup = { default := ⊥ }

instance Subgroup.instInhabitedSubgroup {G : Type u_1} [Group G] : Inhabited (Subgroup G)

Equations

• Subgroup.instInhabitedSubgroup = { default := ⊥ }

@[simp]

theorem AddSubgroup.mem_bot {G : Type u_1} [AddGroup G] {x : G} : x ∈ ⊥ ↔ x = 0

@[simp]

theorem Subgroup.mem_bot {G : Type u_1} [Group G] {x : G} : x ∈ ⊥ ↔ x = 1

@[simp]

theorem AddSubgroup.mem_top {G : Type u_1} [AddGroup G] (x : G) : x ∈ ⊤

@[simp]

theorem Subgroup.mem_top {G : Type u_1} [Group G] (x : G) : x ∈ ⊤

@[simp]

theorem AddSubgroup.coe_top {G : Type u_1} [AddGroup G] : ↑⊤ = Set.univ

@[simp]

theorem Subgroup.coe_top {G : Type u_1} [Group G] : ↑⊤ = Set.univ

@[simp]

theorem AddSubgroup.coe_bot {G : Type u_1} [AddGroup G] : ↑⊥ = {0}

@[simp]

theorem Subgroup.coe_bot {G : Type u_1} [Group G] : ↑⊥ = {1}

theorem AddSubgroup.instUniqueSubtypeMemAddSubgroupInstMembershipInstSetLikeAddSubgroupBotInstBotAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] (g : { x // x ∈ ⊥ }) : g = default

instance AddSubgroup.instUniqueSubtypeMemAddSubgroupInstMembershipInstSetLikeAddSubgroupBotInstBotAddSubgroup {G : Type u_1} [AddGroup G] : Unique { x // x ∈ ⊥ }

Equations

• AddSubgroup.instUniqueSubtypeMemAddSubgroupInstMembershipInstSetLikeAddSubgroupBotInstBotAddSubgroup = { toInhabited := { default := 0 }, uniq := (_ : ∀ (g : { x // x ∈ ⊥ }), g = default) }

instance Subgroup.instUniqueSubtypeMemSubgroupInstMembershipInstSetLikeSubgroupBotInstBotSubgroup {G : Type u_1} [Group G] : Unique { x // x ∈ ⊥ }

Equations

• Subgroup.instUniqueSubtypeMemSubgroupInstMembershipInstSetLikeSubgroupBotInstBotSubgroup = { toInhabited := { default := 1 }, uniq := (_ : ∀ (g : { x // x ∈ ⊥ }), g = default) }

@[simp]

theorem AddSubgroup.top_toAddSubmonoid {G : Type u_1} [AddGroup G] : ⊤.toAddSubmonoid = ⊤

@[simp]

theorem Subgroup.top_toSubmonoid {G : Type u_1} [Group G] : ⊤.toSubmonoid = ⊤

@[simp]

theorem AddSubgroup.bot_toAddSubmonoid {G : Type u_1} [AddGroup G] : ⊥.toAddSubmonoid = ⊥

@[simp]

theorem Subgroup.bot_toSubmonoid {G : Type u_1} [Group G] : ⊥.toSubmonoid = ⊥

theorem AddSubgroup.eq_bot_iff_forall {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H = ⊥ ↔ ∀ (x : G), x ∈ H → x = 0

theorem Subgroup.eq_bot_iff_forall {G : Type u_1} [Group G] (H : Subgroup G) : H = ⊥ ↔ ∀ (x : G), x ∈ H → x = 1

theorem AddSubgroup.eq_bot_of_subsingleton {G : Type u_1} [AddGroup G] (H : AddSubgroup G) [Subsingleton { x // x ∈ H }] : H = ⊥

theorem Subgroup.eq_bot_of_subsingleton {G : Type u_1} [Group G] (H : Subgroup G) [Subsingleton { x // x ∈ H }] : H = ⊥

theorem AddSubgroup.coe_eq_univ {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : ↑H = Set.univ ↔ H = ⊤

theorem Subgroup.coe_eq_univ {G : Type u_1} [Group G] {H : Subgroup G} : ↑H = Set.univ ↔ H = ⊤

theorem AddSubgroup.coe_eq_singleton {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : (∃ g, ↑H = {g}) ↔ H = ⊥

abbrev AddSubgroup.coe_eq_singleton.match_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (motive : (∃ g, ↑H = {g}) → Prop) : (x : ∃ g, ↑H = {g}) → ((g : G) → (hg : ↑H = {g}) → motive (_ : ∃ g, ↑H = {g})) → motive x

Equations

• AddSubgroup.coe_eq_singleton.match_1 motive x h_1 = Exists.casesOn x fun w h => h_1 w h

theorem Subgroup.coe_eq_singleton {G : Type u_1} [Group G] {H : Subgroup G} : (∃ g, ↑H = {g}) ↔ H = ⊥

theorem AddSubgroup.nontrivial_iff_exists_ne_zero {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Nontrivial { x // x ∈ H } ↔ ∃ x, x ∈ H ∧ x ≠ 0

theorem Subgroup.nontrivial_iff_exists_ne_one {G : Type u_1} [Group G] (H : Subgroup G) : Nontrivial { x // x ∈ H } ↔ ∃ x, x ∈ H ∧ x ≠ 1

theorem AddSubgroup.exists_ne_zero_of_nontrivial {G : Type u_1} [AddGroup G] (H : AddSubgroup G) [Nontrivial { x // x ∈ H }] : ∃ x, x ∈ H ∧ x ≠ 0

theorem Subgroup.exists_ne_one_of_nontrivial {G : Type u_1} [Group G] (H : Subgroup G) [Nontrivial { x // x ∈ H }] : ∃ x, x ∈ H ∧ x ≠ 1

theorem AddSubgroup.nontrivial_iff_ne_bot {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : Nontrivial { x // x ∈ H } ↔ H ≠ ⊥

theorem Subgroup.nontrivial_iff_ne_bot {G : Type u_1} [Group G] (H : Subgroup G) : Nontrivial { x // x ∈ H } ↔ H ≠ ⊥

theorem AddSubgroup.bot_or_nontrivial {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H = ⊥ ∨ Nontrivial { x // x ∈ H }

A subgroup is either the trivial subgroup or nontrivial.

theorem Subgroup.bot_or_nontrivial {G : Type u_1} [Group G] (H : Subgroup G) : H = ⊥ ∨ Nontrivial { x // x ∈ H }

A subgroup is either the trivial subgroup or nontrivial.

theorem AddSubgroup.bot_or_exists_ne_zero {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H = ⊥ ∨ ∃ x, x ∈ H ∧ x ≠ 0

A subgroup is either the trivial subgroup or contains a nonzero element.

theorem Subgroup.bot_or_exists_ne_one {G : Type u_1} [Group G] (H : Subgroup G) : H = ⊥ ∨ ∃ x, x ∈ H ∧ x ≠ 1

A subgroup is either the trivial subgroup or contains a non-identity element.

theorem AddSubgroup.ne_bot_iff_exists_ne_zero {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : H ≠ ⊥ ↔ ∃ a, a ≠ 0

theorem Subgroup.ne_bot_iff_exists_ne_one {G : Type u_1} [Group G] {H : Subgroup G} : H ≠ ⊥ ↔ ∃ a, a ≠ 1

instance AddSubgroup.instInfAddSubgroup {G : Type u_1} [AddGroup G] : Inf (AddSubgroup G)

The inf of two AddSubgroups is their intersection.

Equations

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

theorem AddSubgroup.instInfAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] (H₁ : AddSubgroup G) (H₂ : AddSubgroup G) : 0 ∈ (H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid).carrier

abbrev AddSubgroup.instInfAddSubgroup.match_1 {G : Type u_1} [AddGroup G] (H₁ : AddSubgroup G) (H₂ : AddSubgroup G) : {x : G} → let src := H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid; ∀ (motive : x ∈ { toAddSubsemigroup := src.toAddSubsemigroup, zero_mem' := (_ : 0 ∈ src.carrier) }.toAddSubsemigroup.carrier → Prop) (x_1 : x ∈ { toAddSubsemigroup := src.toAddSubsemigroup, zero_mem' := (_ : 0 ∈ src.carrier) }.toAddSubsemigroup.carrier), (∀ (hx : x ∈ ↑H₁.toAddSubmonoid) (hx' : x ∈ ↑H₂.toAddSubmonoid), motive (_ : x ∈ ↑H₁.toAddSubmonoid ∧ x ∈ ↑H₂.toAddSubmonoid)) → motive x_1

Equations

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

theorem AddSubgroup.instInfAddSubgroup.proof_2 {G : Type u_1} [AddGroup G] (H₁ : AddSubgroup G) (H₂ : AddSubgroup G) : ∀ {x : G}, x ∈ { toAddSubsemigroup := (H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid).toAddSubsemigroup, zero_mem' := (_ : 0 ∈ (H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid).carrier) }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := (H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid).toAddSubsemigroup, zero_mem' := (_ : 0 ∈ (H₁.toAddSubmonoid ⊓ H₂.toAddSubmonoid).carrier) }.toAddSubsemigroup.carrier

instance Subgroup.instInfSubgroup {G : Type u_1} [Group G] : Inf (Subgroup G)

The inf of two subgroups is their intersection.

Equations

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

@[simp]

theorem AddSubgroup.coe_inf {G : Type u_1} [AddGroup G] (p : AddSubgroup G) (p' : AddSubgroup G) : ↑(p ⊓ p') = ↑p ∩ ↑p'

@[simp]

theorem Subgroup.coe_inf {G : Type u_1} [Group G] (p : Subgroup G) (p' : Subgroup G) : ↑(p ⊓ p') = ↑p ∩ ↑p'

@[simp]

theorem AddSubgroup.mem_inf {G : Type u_1} [AddGroup G] {p : AddSubgroup G} {p' : AddSubgroup G} {x : G} : x ∈ p ⊓ p' ↔ x ∈ p ∧ x ∈ p'

@[simp]

theorem Subgroup.mem_inf {G : Type u_1} [Group G] {p : Subgroup G} {p' : Subgroup G} {x : G} : x ∈ p ⊓ p' ↔ x ∈ p ∧ x ∈ p'

theorem AddSubgroup.instInfSetAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) : ⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S = ↑(⨅ (i : AddSubgroup G) (_ : i ∈ s), i.toAddSubmonoid)

instance AddSubgroup.instInfSetAddSubgroup {G : Type u_1} [AddGroup G] : InfSet (AddSubgroup G)

Equations

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

theorem AddSubgroup.instInfSetAddSubgroup.proof_2 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) : 0 ∈ (AddSubmonoid.copy (⨅ (S : AddSubgroup G) (_ : S ∈ s), S.toAddSubmonoid) (⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S) (_ : ⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S = ↑(⨅ (i : AddSubgroup G) (_ : i ∈ s), i.toAddSubmonoid))).toAddSubsemigroup.carrier

theorem AddSubgroup.instInfSetAddSubgroup.proof_3 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) {x : G} (hx : x ∈ { toAddSubsemigroup := (AddSubmonoid.copy (⨅ (S : AddSubgroup G) (_ : S ∈ s), S.toAddSubmonoid) (⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S) (_ : ⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S = ↑(⨅ (i : AddSubgroup G) (_ : i ∈ s), i.toAddSubmonoid))).toAddSubsemigroup, zero_mem' := (_ : 0 ∈ (AddSubmonoid.copy (⨅ (S : AddSubgroup G) (_ : S ∈ s), S.toAddSubmonoid) (⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S) (_ : ⋂ (S : AddSubgroup G) (_ : S ∈ s), ↑S = ↑(⨅ (i : AddSubgroup G) (_ : i ∈ s), i.toAddSubmonoid))).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier) : -x ∈ ⋂ (x : AddSubgroup G) (_ : x ∈ s), ↑x

instance Subgroup.instInfSetSubgroup {G : Type u_1} [Group G] : InfSet (Subgroup G)

Equations

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

@[simp]

theorem AddSubgroup.coe_sInf {G : Type u_1} [AddGroup G] (H : Set (AddSubgroup G)) : ↑(sInf H) = ⋂ (s : AddSubgroup G) (_ : s ∈ H), ↑s

@[simp]

theorem Subgroup.coe_sInf {G : Type u_1} [Group G] (H : Set (Subgroup G)) : ↑(sInf H) = ⋂ (s : Subgroup G) (_ : s ∈ H), ↑s

@[simp]

theorem AddSubgroup.mem_sInf {G : Type u_1} [AddGroup G] {S : Set (AddSubgroup G)} {x : G} : x ∈ sInf S ↔ ∀ (p : AddSubgroup G), p ∈ S → x ∈ p

@[simp]

theorem Subgroup.mem_sInf {G : Type u_1} [Group G] {S : Set (Subgroup G)} {x : G} : x ∈ sInf S ↔ ∀ (p : Subgroup G), p ∈ S → x ∈ p

theorem AddSubgroup.mem_iInf {G : Type u_1} [AddGroup G] {ι : Sort u_5} {S : ι → AddSubgroup G} {x : G} : x ∈ ⨅ (i : ι), S i ↔ ∀ (i : ι), x ∈ S i

theorem Subgroup.mem_iInf {G : Type u_1} [Group G] {ι : Sort u_5} {S : ι → Subgroup G} {x : G} : x ∈ ⨅ (i : ι), S i ↔ ∀ (i : ι), x ∈ S i

@[simp]

theorem AddSubgroup.coe_iInf {G : Type u_1} [AddGroup G] {ι : Sort u_5} {S : ι → AddSubgroup G} : ↑(⨅ (i : ι), S i) = ⋂ (i : ι), ↑(S i)

@[simp]

theorem Subgroup.coe_iInf {G : Type u_1} [Group G] {ι : Sort u_5} {S : ι → Subgroup G} : ↑(⨅ (i : ι), S i) = ⋂ (i : ι), ↑(S i)

instance AddSubgroup.instCompleteLatticeAddSubgroup {G : Type u_1} [AddGroup G] : CompleteLattice (AddSubgroup G)

The AddSubgroups of an AddGroup form a complete lattice.

Equations

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

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] (_s : Set (AddSubgroup G)) : IsGLB _s (sInf _s)

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_8 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) (a : AddSubgroup G) : (∀ (b : AddSubgroup G), b ∈ s → a ≤ b) → a ≤ sInf s

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_9 {G : Type u_1} [AddGroup G] (S : AddSubgroup G) (_x : G) (hx : _x ∈ ⊥) : _x ∈ S

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_3 {G : Type u_1} [AddGroup G] (_a : AddSubgroup G) (_b : AddSubgroup G) (_x : G) (self : _x ∈ ↑_a.toAddSubmonoid ∧ _x ∈ ↑_b.toAddSubmonoid) : _x ∈ ↑_b.toAddSubmonoid

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_7 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) (a : AddSubgroup G) : a ∈ s → sInf s ≤ a

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_5 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) (a : AddSubgroup G) : a ∈ s → a ≤ sSup s

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_6 {G : Type u_1} [AddGroup G] (s : Set (AddSubgroup G)) (a : AddSubgroup G) : (∀ (b : AddSubgroup G), b ∈ s → b ≤ a) → sSup s ≤ a

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_4 {G : Type u_1} [AddGroup G] (_a : AddSubgroup G) (_b : AddSubgroup G) (_c : AddSubgroup G) (ha : _a ≤ _b) (hb : _a ≤ _c) (_x : G) (hx : _x ∈ _a) : _x ∈ ↑_b.toAddSubmonoid ∧ _x ∈ ↑_c.toAddSubmonoid

theorem AddSubgroup.instCompleteLatticeAddSubgroup.proof_2 {G : Type u_1} [AddGroup G] (_a : AddSubgroup G) (_b : AddSubgroup G) (_x : G) (self : _x ∈ ↑_a.toAddSubmonoid ∧ _x ∈ ↑_b.toAddSubmonoid) : _x ∈ ↑_a.toAddSubmonoid

instance Subgroup.instCompleteLatticeSubgroup {G : Type u_1} [Group G] : CompleteLattice (Subgroup G)

Subgroups of a group form a complete lattice.

Equations

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

theorem AddSubgroup.mem_sup_left {G : Type u_1} [AddGroup G] {S : AddSubgroup G} {T : AddSubgroup G} {x : G} : x ∈ S → x ∈ S ⊔ T

theorem Subgroup.mem_sup_left {G : Type u_1} [Group G] {S : Subgroup G} {T : Subgroup G} {x : G} : x ∈ S → x ∈ S ⊔ T

theorem AddSubgroup.mem_sup_right {G : Type u_1} [AddGroup G] {S : AddSubgroup G} {T : AddSubgroup G} {x : G} : x ∈ T → x ∈ S ⊔ T

theorem Subgroup.mem_sup_right {G : Type u_1} [Group G] {S : Subgroup G} {T : Subgroup G} {x : G} : x ∈ T → x ∈ S ⊔ T

theorem AddSubgroup.add_mem_sup {G : Type u_1} [AddGroup G] {S : AddSubgroup G} {T : AddSubgroup G} {x : G} {y : G} (hx : x ∈ S) (hy : y ∈ T) : x + y ∈ S ⊔ T

theorem Subgroup.mul_mem_sup {G : Type u_1} [Group G] {S : Subgroup G} {T : Subgroup G} {x : G} {y : G} (hx : x ∈ S) (hy : y ∈ T) : x * y ∈ S ⊔ T

theorem AddSubgroup.mem_iSup_of_mem {G : Type u_1} [AddGroup G] {ι : Sort u_5} {S : ι → AddSubgroup G} (i : ι) {x : G} : x ∈ S i → x ∈ iSup S

theorem Subgroup.mem_iSup_of_mem {G : Type u_1} [Group G] {ι : Sort u_5} {S : ι → Subgroup G} (i : ι) {x : G} : x ∈ S i → x ∈ iSup S

theorem AddSubgroup.mem_sSup_of_mem {G : Type u_1} [AddGroup G] {S : Set (AddSubgroup G)} {s : AddSubgroup G} (hs : s ∈ S) {x : G} : x ∈ s → x ∈ sSup S

theorem Subgroup.mem_sSup_of_mem {G : Type u_1} [Group G] {S : Set (Subgroup G)} {s : Subgroup G} (hs : s ∈ S) {x : G} : x ∈ s → x ∈ sSup S

@[simp]

theorem AddSubgroup.subsingleton_iff {G : Type u_1} [AddGroup G] : Subsingleton (AddSubgroup G) ↔ Subsingleton G

@[simp]

theorem Subgroup.subsingleton_iff {G : Type u_1} [Group G] : Subsingleton (Subgroup G) ↔ Subsingleton G

@[simp]

theorem AddSubgroup.nontrivial_iff {G : Type u_1} [AddGroup G] : Nontrivial (AddSubgroup G) ↔ Nontrivial G

@[simp]

theorem Subgroup.nontrivial_iff {G : Type u_1} [Group G] : Nontrivial (Subgroup G) ↔ Nontrivial G

theorem AddSubgroup.instUniqueAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] [Subsingleton G] (a : AddSubgroup G) : a = default

instance AddSubgroup.instUniqueAddSubgroup {G : Type u_1} [AddGroup G] [Subsingleton G] : Unique (AddSubgroup G)

Equations

• AddSubgroup.instUniqueAddSubgroup = { toInhabited := { default := ⊥ }, uniq := (_ : ∀ (a : AddSubgroup G), a = default) }

instance Subgroup.instUniqueSubgroup {G : Type u_1} [Group G] [Subsingleton G] : Unique (Subgroup G)

Equations

• Subgroup.instUniqueSubgroup = { toInhabited := { default := ⊥ }, uniq := (_ : ∀ (a : Subgroup G), a = default) }

theorem AddSubgroup.instNontrivialAddSubgroup.proof_1 {G : Type u_1} [AddGroup G] [Nontrivial G] : Nontrivial (AddSubgroup G)

instance AddSubgroup.instNontrivialAddSubgroup {G : Type u_1} [AddGroup G] [Nontrivial G] : Nontrivial (AddSubgroup G)

Equations

• @AddSubgroup.instNontrivialAddSubgroup = @AddSubgroup.instNontrivialAddSubgroup.proof_1

instance Subgroup.instNontrivialSubgroup {G : Type u_1} [Group G] [Nontrivial G] : Nontrivial (Subgroup G)

Equations

• @Subgroup.instNontrivialSubgroup = @Subgroup.instNontrivialSubgroup.proof_1

theorem AddSubgroup.eq_top_iff' {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : H = ⊤ ↔ ∀ (x : G), x ∈ H

theorem Subgroup.eq_top_iff' {G : Type u_1} [Group G] (H : Subgroup G) : H = ⊤ ↔ ∀ (x : G), x ∈ H

def AddSubgroup.closure {G : Type u_1} [AddGroup G] (k : Set G) : AddSubgroup G

The AddSubgroup generated by a set

Equations

• AddSubgroup.closure k = sInf {K | k ⊆ ↑K}

def Subgroup.closure {G : Type u_1} [Group G] (k : Set G) : Subgroup G

The Subgroup generated by a set.

Equations

• Subgroup.closure k = sInf {K | k ⊆ ↑K}

theorem AddSubgroup.mem_closure {G : Type u_1} [AddGroup G] {k : Set G} {x : G} : x ∈ AddSubgroup.closure k ↔ ∀ (K : AddSubgroup G), k ⊆ ↑K → x ∈ K

theorem Subgroup.mem_closure {G : Type u_1} [Group G] {k : Set G} {x : G} : x ∈ Subgroup.closure k ↔ ∀ (K : Subgroup G), k ⊆ ↑K → x ∈ K

@[simp]

theorem AddSubgroup.subset_closure {G : Type u_1} [AddGroup G] {k : Set G} : k ⊆ ↑(AddSubgroup.closure k)

The AddSubgroup generated by a set includes the set.

@[simp]

theorem Subgroup.subset_closure {G : Type u_1} [Group G] {k : Set G} : k ⊆ ↑(Subgroup.closure k)

The subgroup generated by a set includes the set.

theorem AddSubgroup.not_mem_of_not_mem_closure {G : Type u_1} [AddGroup G] {k : Set G} {P : G} (hP : ¬P ∈ AddSubgroup.closure k) : ¬P ∈ k

theorem Subgroup.not_mem_of_not_mem_closure {G : Type u_1} [Group G] {k : Set G} {P : G} (hP : ¬P ∈ Subgroup.closure k) : ¬P ∈ k

@[simp]

theorem AddSubgroup.closure_le {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {k : Set G} : AddSubgroup.closure k ≤ K ↔ k ⊆ ↑K

An additive subgroup K includes closure k if and only if it includes k

@[simp]

theorem Subgroup.closure_le {G : Type u_1} [Group G] (K : Subgroup G) {k : Set G} : Subgroup.closure k ≤ K ↔ k ⊆ ↑K

A subgroup K includes closure k if and only if it includes k.

theorem AddSubgroup.closure_eq_of_le {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {k : Set G} (h₁ : k ⊆ ↑K) (h₂ : K ≤ AddSubgroup.closure k) : AddSubgroup.closure k = K

theorem Subgroup.closure_eq_of_le {G : Type u_1} [Group G] (K : Subgroup G) {k : Set G} (h₁ : k ⊆ ↑K) (h₂ : K ≤ Subgroup.closure k) : Subgroup.closure k = K

theorem AddSubgroup.closure_induction {G : Type u_1} [AddGroup G] {k : Set G} {p : G → Prop} {x : G} (h : x ∈ AddSubgroup.closure k) (Hk : (x : G) → x ∈ k → p x) (H1 : p 0) (Hmul : (x y : G) → p x → p y → p (x + y)) (Hinv : (x : G) → p x → p (-x)) : p x

An induction principle for additive closure membership. If p holds for 0 and all elements of k, and is preserved under addition and inverses, then p holds for all elements of the additive closure of k.

theorem Subgroup.closure_induction {G : Type u_1} [Group G] {k : Set G} {p : G → Prop} {x : G} (h : x ∈ Subgroup.closure k) (Hk : (x : G) → x ∈ k → p x) (H1 : p 1) (Hmul : (x y : G) → p x → p y → p (x * y)) (Hinv : (x : G) → p x → p x⁻¹) : p x

An induction principle for closure membership. If p holds for 1 and all elements of k, and is preserved under multiplication and inverse, then p holds for all elements of the closure of k.

theorem AddSubgroup.closure_induction' {G : Type u_1} [AddGroup G] {k : Set G} {p : (x : G) → x ∈ AddSubgroup.closure k → Prop} (Hs : (x : G) → (h : x ∈ k) → p x (_ : x ∈ ↑(AddSubgroup.closure k))) (H1 : p 0 (_ : 0 ∈ AddSubgroup.closure k)) (Hmul : (x : G) → (hx : x ∈ AddSubgroup.closure k) → (y : G) → (hy : y ∈ AddSubgroup.closure k) → p x hx → p y hy → p (x + y) (_ : x + y ∈ AddSubgroup.closure k)) (Hinv : (x : G) → (hx : x ∈ AddSubgroup.closure k) → p x hx → p (-x) (_ : -x ∈ AddSubgroup.closure k)) {x : G} (hx : x ∈ AddSubgroup.closure k) : p x hx

A dependent version of AddSubgroup.closure_induction.

abbrev AddSubgroup.closure_induction'.match_1 {G : Type u_1} [AddGroup G] {k : Set G} {p : (x : G) → x ∈ AddSubgroup.closure k → Prop} (y : G) (motive : (∃ x, p y x) → Prop) : (x : ∃ x, p y x) → ((hy' : y ∈ AddSubgroup.closure k) → (hy : p y hy') → motive (_ : ∃ x, p y x)) → motive x

Equations

• AddSubgroup.closure_induction'.match_1 y motive x h_1 = Exists.casesOn x fun w h => h_1 w h

theorem Subgroup.closure_induction' {G : Type u_1} [Group G] {k : Set G} {p : (x : G) → x ∈ Subgroup.closure k → Prop} (Hs : (x : G) → (h : x ∈ k) → p x (_ : x ∈ ↑(Subgroup.closure k))) (H1 : p 1 (_ : 1 ∈ Subgroup.closure k)) (Hmul : (x : G) → (hx : x ∈ Subgroup.closure k) → (y : G) → (hy : y ∈ Subgroup.closure k) → p x hx → p y hy → p (x * y) (_ : x * y ∈ Subgroup.closure k)) (Hinv : (x : G) → (hx : x ∈ Subgroup.closure k) → p x hx → p x⁻¹ (_ : x⁻¹ ∈ Subgroup.closure k)) {x : G} (hx : x ∈ Subgroup.closure k) : p x hx

A dependent version of Subgroup.closure_induction.

theorem AddSubgroup.closure_induction₂ {G : Type u_1} [AddGroup G] {k : Set G} {p : G → G → Prop} {x : G} {y : G} (hx : x ∈ AddSubgroup.closure k) (hy : y ∈ AddSubgroup.closure k) (Hk : (x : G) → x ∈ k → (y : G) → y ∈ k → p x y) (H1_left : (x : G) → p 0 x) (H1_right : (x : G) → p x 0) (Hmul_left : (x₁ x₂ y : G) → p x₁ y → p x₂ y → p (x₁ + x₂) y) (Hmul_right : (x y₁ y₂ : G) → p x y₁ → p x y₂ → p x (y₁ + y₂)) (Hinv_left : (x y : G) → p x y → p (-x) y) (Hinv_right : (x y : G) → p x y → p x (-y)) : p x y

An induction principle for additive closure membership, for predicates with two arguments.

theorem Subgroup.closure_induction₂ {G : Type u_1} [Group G] {k : Set G} {p : G → G → Prop} {x : G} {y : G} (hx : x ∈ Subgroup.closure k) (hy : y ∈ Subgroup.closure k) (Hk : (x : G) → x ∈ k → (y : G) → y ∈ k → p x y) (H1_left : (x : G) → p 1 x) (H1_right : (x : G) → p x 1) (Hmul_left : (x₁ x₂ y : G) → p x₁ y → p x₂ y → p (x₁ * x₂) y) (Hmul_right : (x y₁ y₂ : G) → p x y₁ → p x y₂ → p x (y₁ * y₂)) (Hinv_left : (x y : G) → p x y → p x⁻¹ y) (Hinv_right : (x y : G) → p x y → p x y⁻¹) : p x y

An induction principle for closure membership for predicates with two arguments.

@[simp]

theorem AddSubgroup.closure_closure_coe_preimage {G : Type u_1} [AddGroup G] {k : Set G} : AddSubgroup.closure (Subtype.val ⁻¹' k) = ⊤

@[simp]

theorem Subgroup.closure_closure_coe_preimage {G : Type u_1} [Group G] {k : Set G} : Subgroup.closure (Subtype.val ⁻¹' k) = ⊤

def AddSubgroup.closureAddCommGroupOfComm {G : Type u_1} [AddGroup G] {k : Set G} (hcomm : ∀ (x : G), x ∈ k → ∀ (y : G), y ∈ k → x + y = y + x) : AddCommGroup { x // x ∈ AddSubgroup.closure k }

If all the elements of a set s commute, then closure s is an additive commutative group.

Equations

• AddSubgroup.closureAddCommGroupOfComm hcomm = let src := AddSubgroup.toAddGroup (AddSubgroup.closure k); AddCommGroup.mk (_ : ∀ (x y : { x // x ∈ AddSubgroup.closure k }), x + y = y + x)

theorem AddSubgroup.closureAddCommGroupOfComm.proof_1 {G : Type u_1} [AddGroup G] {k : Set G} (a : { x // x ∈ AddSubgroup.closure k }) : -a + a = 0

theorem AddSubgroup.closureAddCommGroupOfComm.proof_2 {G : Type u_1} [AddGroup G] {k : Set G} (hcomm : ∀ (x : G), x ∈ k → ∀ (y : G), y ∈ k → x + y = y + x) (x : { x // x ∈ AddSubgroup.closure k }) (y : { x // x ∈ AddSubgroup.closure k }) : x + y = y + x

def Subgroup.closureCommGroupOfComm {G : Type u_1} [Group G] {k : Set G} (hcomm : ∀ (x : G), x ∈ k → ∀ (y : G), y ∈ k → x * y = y * x) : CommGroup { x // x ∈ Subgroup.closure k }

If all the elements of a set s commute, then closure s is a commutative group.

Equations

• Subgroup.closureCommGroupOfComm hcomm = let src := Subgroup.toGroup (Subgroup.closure k); CommGroup.mk (_ : ∀ (x y : { x // x ∈ Subgroup.closure k }), x * y = y * x)

def AddSubgroup.gi (G : Type u_1) [AddGroup G] : GaloisInsertion AddSubgroup.closure SetLike.coe

closure forms a Galois insertion with the coercion to set.

Equations

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

theorem AddSubgroup.gi.proof_1 (G : Type u_1) [AddGroup G] (_s : AddSubgroup G) : ↑_s ⊆ ↑(AddSubgroup.closure ↑_s)

theorem AddSubgroup.gi.proof_2 (G : Type u_1) [AddGroup G] (_s : Set G) (_h : ↑(AddSubgroup.closure _s) ≤ _s) : (fun s x => AddSubgroup.closure s) _s _h = (fun s x => AddSubgroup.closure s) _s _h

def Subgroup.gi (G : Type u_1) [Group G] : GaloisInsertion Subgroup.closure SetLike.coe

closure forms a Galois insertion with the coercion to set.

Equations

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

theorem AddSubgroup.closure_mono {G : Type u_1} [AddGroup G] ⦃h : Set G⦄ ⦃k : Set G⦄ (h' : h ⊆ k) : AddSubgroup.closure h ≤ AddSubgroup.closure k

Additive subgroup closure of a set is monotone in its argument: if h ⊆ k, then closure h ≤ closure k

theorem Subgroup.closure_mono {G : Type u_1} [Group G] ⦃h : Set G⦄ ⦃k : Set G⦄ (h' : h ⊆ k) : Subgroup.closure h ≤ Subgroup.closure k

Subgroup closure of a set is monotone in its argument: if h ⊆ k, then closure h ≤ closure k.

@[simp]

theorem AddSubgroup.closure_eq {G : Type u_1} [AddGroup G] (K : AddSubgroup G) : AddSubgroup.closure ↑K = K

Additive closure of an additive subgroup K equals K

@[simp]

theorem Subgroup.closure_eq {G : Type u_1} [Group G] (K : Subgroup G) : Subgroup.closure ↑K = K

Closure of a subgroup K equals K.

@[simp]

theorem AddSubgroup.closure_empty {G : Type u_1} [AddGroup G] : AddSubgroup.closure ∅ = ⊥

@[simp]

theorem Subgroup.closure_empty {G : Type u_1} [Group G] : Subgroup.closure ∅ = ⊥

@[simp]

theorem AddSubgroup.closure_univ {G : Type u_1} [AddGroup G] : AddSubgroup.closure Set.univ = ⊤

@[simp]

theorem Subgroup.closure_univ {G : Type u_1} [Group G] : Subgroup.closure Set.univ = ⊤

theorem AddSubgroup.closure_union {G : Type u_1} [AddGroup G] (s : Set G) (t : Set G) : AddSubgroup.closure (s ∪ t) = AddSubgroup.closure s ⊔ AddSubgroup.closure t

theorem Subgroup.closure_union {G : Type u_1} [Group G] (s : Set G) (t : Set G) : Subgroup.closure (s ∪ t) = Subgroup.closure s ⊔ Subgroup.closure t

theorem AddSubgroup.sup_eq_closure {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (H' : AddSubgroup G) : H ⊔ H' = AddSubgroup.closure (↑H ∪ ↑H')

theorem Subgroup.sup_eq_closure {G : Type u_1} [Group G] (H : Subgroup G) (H' : Subgroup G) : H ⊔ H' = Subgroup.closure (↑H ∪ ↑H')

theorem AddSubgroup.closure_iUnion {G : Type u_1} [AddGroup G] {ι : Sort u_5} (s : ι → Set G) : AddSubgroup.closure (⋃ (i : ι), s i) = ⨆ (i : ι), AddSubgroup.closure (s i)

theorem Subgroup.closure_iUnion {G : Type u_1} [Group G] {ι : Sort u_5} (s : ι → Set G) : Subgroup.closure (⋃ (i : ι), s i) = ⨆ (i : ι), Subgroup.closure (s i)

theorem AddSubgroup.closure_eq_bot_iff (G : Type u_5) [AddGroup G] (S : Set G) : AddSubgroup.closure S = ⊥ ↔ S ⊆ {0}

theorem Subgroup.closure_eq_bot_iff (G : Type u_5) [Group G] (S : Set G) : Subgroup.closure S = ⊥ ↔ S ⊆ {1}

theorem AddSubgroup.iSup_eq_closure {G : Type u_1} [AddGroup G] {ι : Sort u_5} (p : ι → AddSubgroup G) : ⨆ (i : ι), p i = AddSubgroup.closure (⋃ (i : ι), ↑(p i))

theorem Subgroup.iSup_eq_closure {G : Type u_1} [Group G] {ι : Sort u_5} (p : ι → Subgroup G) : ⨆ (i : ι), p i = Subgroup.closure (⋃ (i : ι), ↑(p i))

theorem AddSubgroup.mem_closure_singleton {G : Type u_1} [AddGroup G] {x : G} {y : G} : y ∈ AddSubgroup.closure {x} ↔ ∃ n, n • x = y

The AddSubgroup generated by an element of an AddGroup equals the set of natural number multiples of the element.

abbrev AddSubgroup.mem_closure_singleton.match_1 {G : Type u_1} [AddGroup G] {x : G} {y : G} (motive : (∃ n, n • x = y) → Prop) : (x : ∃ n, n • x = y) → ((n : ℤ) → (hn : n • x = y) → motive (_ : ∃ n, n • x = y)) → motive x

Equations

• AddSubgroup.mem_closure_singleton.match_1 motive x h_1 = Exists.casesOn x fun w h => h_1 w h

theorem Subgroup.mem_closure_singleton {G : Type u_1} [Group G] {x : G} {y : G} : y ∈ Subgroup.closure {x} ↔ ∃ n, x ^ n = y

The subgroup generated by an element of a group equals the set of integer number powers of the element.

theorem AddSubgroup.closure_singleton_zero {G : Type u_1} [AddGroup G] : AddSubgroup.closure {0} = ⊥

theorem Subgroup.closure_singleton_one {G : Type u_1} [Group G] : Subgroup.closure {1} = ⊥

theorem AddSubgroup.le_closure_toAddSubmonoid {G : Type u_1} [AddGroup G] (S : Set G) : AddSubmonoid.closure S ≤ (AddSubgroup.closure S).toAddSubmonoid

theorem Subgroup.le_closure_toSubmonoid {G : Type u_1} [Group G] (S : Set G) : Submonoid.closure S ≤ (Subgroup.closure S).toSubmonoid

theorem AddSubgroup.closure_eq_top_of_mclosure_eq_top {G : Type u_1} [AddGroup G] {S : Set G} (h : AddSubmonoid.closure S = ⊤) : AddSubgroup.closure S = ⊤

theorem Subgroup.closure_eq_top_of_mclosure_eq_top {G : Type u_1} [Group G] {S : Set G} (h : Submonoid.closure S = ⊤) : Subgroup.closure S = ⊤

theorem AddSubgroup.mem_iSup_of_directed {G : Type u_1} [AddGroup G] {ι : Sort u_5} [hι : Nonempty ι] {K : ι → AddSubgroup G} (hK : Directed (fun x x_1 => x ≤ x_1) K) {x : G} : x ∈ iSup K ↔ ∃ i, x ∈ K i

abbrev AddSubgroup.mem_iSup_of_directed.match_1 {G : Type u_2} [AddGroup G] {ι : Sort u_1} {K : ι → AddSubgroup G} {x : G} (motive : (∃ i, x ∈ K i) → Prop) : (x : ∃ i, x ∈ K i) → ((i : ι) → (hi : x ∈ K i) → motive (_ : ∃ i, x ∈ K i)) → motive x

Equations

• AddSubgroup.mem_iSup_of_directed.match_1 motive x h_1 = Exists.casesOn x fun w h => h_1 w h

theorem Subgroup.mem_iSup_of_directed {G : Type u_1} [Group G] {ι : Sort u_5} [hι : Nonempty ι] {K : ι → Subgroup G} (hK : Directed (fun x x_1 => x ≤ x_1) K) {x : G} : x ∈ iSup K ↔ ∃ i, x ∈ K i

theorem AddSubgroup.coe_iSup_of_directed {G : Type u_1} [AddGroup G] {ι : Sort u_5} [Nonempty ι] {S : ι → AddSubgroup G} (hS : Directed (fun x x_1 => x ≤ x_1) S) : ↑(⨆ (i : ι), S i) = ⋃ (i : ι), ↑(S i)

theorem Subgroup.coe_iSup_of_directed {G : Type u_1} [Group G] {ι : Sort u_5} [Nonempty ι] {S : ι → Subgroup G} (hS : Directed (fun x x_1 => x ≤ x_1) S) : ↑(⨆ (i : ι), S i) = ⋃ (i : ι), ↑(S i)

theorem AddSubgroup.mem_sSup_of_directedOn {G : Type u_1} [AddGroup G] {K : Set (AddSubgroup G)} (Kne : Set.Nonempty K) (hK : DirectedOn (fun x x_1 => x ≤ x_1) K) {x : G} : x ∈ sSup K ↔ ∃ s, s ∈ K ∧ x ∈ s

theorem Subgroup.mem_sSup_of_directedOn {G : Type u_1} [Group G] {K : Set (Subgroup G)} (Kne : Set.Nonempty K) (hK : DirectedOn (fun x x_1 => x ≤ x_1) K) {x : G} : x ∈ sSup K ↔ ∃ s, s ∈ K ∧ x ∈ s

theorem AddSubgroup.comap.proof_3 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) {a : G} (ha : a ∈ { toAddSubsemigroup := { carrier := ↑f ⁻¹' ↑H, add_mem' := (_ : ∀ {a b : G}, a ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier) }, zero_mem' := (_ : 0 ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier) : ↑f (-a) ∈ H

def AddSubgroup.comap {G : Type u_1} [AddGroup G] {N : Type u_7} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : AddSubgroup G

The preimage of an AddSubgroup along an AddMonoid homomorphism is an AddSubgroup.

Equations

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

theorem AddSubgroup.comap.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : ∀ {a b : G}, a ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier

theorem AddSubgroup.comap.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : 0 ∈ (AddSubmonoid.comap f H.toAddSubmonoid).toAddSubsemigroup.carrier

def Subgroup.comap {G : Type u_1} [Group G] {N : Type u_7} [Group N] (f : G →* N) (H : Subgroup N) : Subgroup G

The preimage of a subgroup along a monoid homomorphism is a subgroup.

Equations

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

@[simp]

theorem AddSubgroup.coe_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (K : AddSubgroup N) (f : G →+ N) : ↑(AddSubgroup.comap f K) = ↑f ⁻¹' ↑K

@[simp]

theorem Subgroup.coe_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] (K : Subgroup N) (f : G →* N) : ↑(Subgroup.comap f K) = ↑f ⁻¹' ↑K

@[simp]

theorem AddSubgroup.mem_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {K : AddSubgroup N} {f : G →+ N} {x : G} : x ∈ AddSubgroup.comap f K ↔ ↑f x ∈ K

@[simp]

theorem Subgroup.mem_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {K : Subgroup N} {f : G →* N} {x : G} : x ∈ Subgroup.comap f K ↔ ↑f x ∈ K

theorem AddSubgroup.comap_mono {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup N} {K' : AddSubgroup N} : K ≤ K' → AddSubgroup.comap f K ≤ AddSubgroup.comap f K'

theorem Subgroup.comap_mono {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup N} {K' : Subgroup N} : K ≤ K' → Subgroup.comap f K ≤ Subgroup.comap f K'

theorem AddSubgroup.comap_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {P : Type u_6} [AddGroup P] (K : AddSubgroup P) (g : N →+ P) (f : G →+ N) : AddSubgroup.comap f (AddSubgroup.comap g K) = AddSubgroup.comap (AddMonoidHom.comp g f) K

theorem Subgroup.comap_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {P : Type u_6} [Group P] (K : Subgroup P) (g : N →* P) (f : G →* N) : Subgroup.comap f (Subgroup.comap g K) = Subgroup.comap (MonoidHom.comp g f) K

@[simp]

theorem AddSubgroup.comap_id {N : Type u_5} [AddGroup N] (K : AddSubgroup N) : AddSubgroup.comap (AddMonoidHom.id N) K = K

@[simp]

theorem Subgroup.comap_id {N : Type u_5} [Group N] (K : Subgroup N) : Subgroup.comap (MonoidHom.id N) K = K

def AddSubgroup.map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : AddSubgroup N

The image of an AddSubgroup along an AddMonoid homomorphism is an AddSubgroup.

Equations

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

theorem AddSubgroup.map.proof_2 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : 0 ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier

theorem AddSubgroup.map.proof_1 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : ∀ {a b : N}, a ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier

theorem AddSubgroup.map.proof_3 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : ∀ {x : N}, x ∈ { toAddSubsemigroup := { carrier := ↑f '' ↑H, add_mem' := (_ : ∀ {a b : N}, a ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier) }, zero_mem' := (_ : 0 ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier → -x ∈ { toAddSubsemigroup := { carrier := ↑f '' ↑H, add_mem' := (_ : ∀ {a b : N}, a ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier) }, zero_mem' := (_ : 0 ∈ (AddSubmonoid.map f H.toAddSubmonoid).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier

def Subgroup.map {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup G) : Subgroup N

The image of a subgroup along a monoid homomorphism is a subgroup.

Equations

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

@[simp]

theorem AddSubgroup.coe_map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (K : AddSubgroup G) : ↑(AddSubgroup.map f K) = ↑f '' ↑K

@[simp]

theorem Subgroup.coe_map {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (K : Subgroup G) : ↑(Subgroup.map f K) = ↑f '' ↑K

@[simp]

theorem AddSubgroup.mem_map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup G} {y : N} : y ∈ AddSubgroup.map f K ↔ ∃ x, x ∈ K ∧ ↑f x = y

@[simp]

theorem Subgroup.mem_map {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup G} {y : N} : y ∈ Subgroup.map f K ↔ ∃ x, x ∈ K ∧ ↑f x = y

theorem AddSubgroup.mem_map_of_mem {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) {K : AddSubgroup G} {x : G} (hx : x ∈ K) : ↑f x ∈ AddSubgroup.map f K

theorem Subgroup.mem_map_of_mem {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) {K : Subgroup G} {x : G} (hx : x ∈ K) : ↑f x ∈ Subgroup.map f K

theorem AddSubgroup.apply_coe_mem_map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (K : AddSubgroup G) (x : { x // x ∈ K }) : ↑f ↑x ∈ AddSubgroup.map f K

theorem Subgroup.apply_coe_mem_map {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (K : Subgroup G) (x : { x // x ∈ K }) : ↑f ↑x ∈ Subgroup.map f K

theorem AddSubgroup.map_mono {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup G} {K' : AddSubgroup G} : K ≤ K' → AddSubgroup.map f K ≤ AddSubgroup.map f K'

theorem Subgroup.map_mono {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup G} {K' : Subgroup G} : K ≤ K' → Subgroup.map f K ≤ Subgroup.map f K'

@[simp]

theorem AddSubgroup.map_id {G : Type u_1} [AddGroup G] (K : AddSubgroup G) : AddSubgroup.map (AddMonoidHom.id G) K = K

@[simp]

theorem Subgroup.map_id {G : Type u_1} [Group G] (K : Subgroup G) : Subgroup.map (MonoidHom.id G) K = K

theorem AddSubgroup.map_map {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {N : Type u_5} [AddGroup N] {P : Type u_6} [AddGroup P] (g : N →+ P) (f : G →+ N) : AddSubgroup.map g (AddSubgroup.map f K) = AddSubgroup.map (AddMonoidHom.comp g f) K

theorem Subgroup.map_map {G : Type u_1} [Group G] (K : Subgroup G) {N : Type u_5} [Group N] {P : Type u_6} [Group P] (g : N →* P) (f : G →* N) : Subgroup.map g (Subgroup.map f K) = Subgroup.map (MonoidHom.comp g f) K

@[simp]

theorem AddSubgroup.map_zero_eq_bot {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {N : Type u_5} [AddGroup N] : AddSubgroup.map 0 K = ⊥

@[simp]

theorem Subgroup.map_one_eq_bot {G : Type u_1} [Group G] (K : Subgroup G) {N : Type u_5} [Group N] : Subgroup.map 1 K = ⊥

theorem AddSubgroup.mem_map_equiv {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G ≃+ N} {K : AddSubgroup G} {x : N} : x ∈ AddSubgroup.map (AddEquiv.toAddMonoidHom f) K ↔ ↑(AddEquiv.symm f) x ∈ K

theorem Subgroup.mem_map_equiv {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G ≃* N} {K : Subgroup G} {x : N} : x ∈ Subgroup.map (MulEquiv.toMonoidHom f) K ↔ ↑(MulEquiv.symm f) x ∈ K

@[simp]

theorem AddSubgroup.mem_map_iff_mem {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) {K : AddSubgroup G} {x : G} : ↑f x ∈ AddSubgroup.map f K ↔ x ∈ K

@[simp]

theorem Subgroup.mem_map_iff_mem {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (hf : Function.Injective ↑f) {K : Subgroup G} {x : G} : ↑f x ∈ Subgroup.map f K ↔ x ∈ K

theorem AddSubgroup.map_equiv_eq_comap_symm {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G ≃+ N) (K : AddSubgroup G) : AddSubgroup.map (AddEquiv.toAddMonoidHom f) K = AddSubgroup.comap (AddEquiv.toAddMonoidHom (AddEquiv.symm f)) K

theorem Subgroup.map_equiv_eq_comap_symm {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G ≃* N) (K : Subgroup G) : Subgroup.map (MulEquiv.toMonoidHom f) K = Subgroup.comap (MulEquiv.toMonoidHom (MulEquiv.symm f)) K

theorem AddSubgroup.comap_equiv_eq_map_symm {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : N ≃+ G) (K : AddSubgroup G) : AddSubgroup.comap (AddEquiv.toAddMonoidHom f) K = AddSubgroup.map (AddEquiv.toAddMonoidHom (AddEquiv.symm f)) K

theorem Subgroup.comap_equiv_eq_map_symm {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : N ≃* G) (K : Subgroup G) : Subgroup.comap (MulEquiv.toMonoidHom f) K = Subgroup.map (MulEquiv.toMonoidHom (MulEquiv.symm f)) K

theorem AddSubgroup.map_symm_eq_iff_map_eq {G : Type u_1} [AddGroup G] (K : AddSubgroup G) {N : Type u_5} [AddGroup N] {H : AddSubgroup N} {e : G ≃+ N} : AddSubgroup.map (↑(AddEquiv.symm e)) H = K ↔ AddSubgroup.map (↑e) K = H

theorem Subgroup.map_symm_eq_iff_map_eq {G : Type u_1} [Group G] (K : Subgroup G) {N : Type u_5} [Group N] {H : Subgroup N} {e : G ≃* N} : Subgroup.map (↑(MulEquiv.symm e)) H = K ↔ Subgroup.map (↑e) K = H

theorem AddSubgroup.map_le_iff_le_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup G} {H : AddSubgroup N} : AddSubgroup.map f K ≤ H ↔ K ≤ AddSubgroup.comap f H

theorem Subgroup.map_le_iff_le_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup G} {H : Subgroup N} : Subgroup.map f K ≤ H ↔ K ≤ Subgroup.comap f H

theorem AddSubgroup.gc_map_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : GaloisConnection (AddSubgroup.map f) (AddSubgroup.comap f)

theorem Subgroup.gc_map_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : GaloisConnection (Subgroup.map f) (Subgroup.comap f)

theorem AddSubgroup.map_sup {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup G) (f : G →+ N) : AddSubgroup.map f (H ⊔ K) = AddSubgroup.map f H ⊔ AddSubgroup.map f K

theorem Subgroup.map_sup {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup G) (f : G →* N) : Subgroup.map f (H ⊔ K) = Subgroup.map f H ⊔ Subgroup.map f K

theorem AddSubgroup.map_iSup {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {ι : Sort u_7} (f : G →+ N) (s : ι → AddSubgroup G) : AddSubgroup.map f (iSup s) = ⨆ (i : ι), AddSubgroup.map f (s i)

theorem Subgroup.map_iSup {G : Type u_1} [Group G] {N : Type u_5} [Group N] {ι : Sort u_7} (f : G →* N) (s : ι → Subgroup G) : Subgroup.map f (iSup s) = ⨆ (i : ι), Subgroup.map f (s i)

theorem AddSubgroup.comap_sup_comap_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup N) (K : AddSubgroup N) (f : G →+ N) : AddSubgroup.comap f H ⊔ AddSubgroup.comap f K ≤ AddSubgroup.comap f (H ⊔ K)

theorem Subgroup.comap_sup_comap_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup N) (K : Subgroup N) (f : G →* N) : Subgroup.comap f H ⊔ Subgroup.comap f K ≤ Subgroup.comap f (H ⊔ K)

theorem AddSubgroup.iSup_comap_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {ι : Sort u_7} (f : G →+ N) (s : ι → AddSubgroup N) : ⨆ (i : ι), AddSubgroup.comap f (s i) ≤ AddSubgroup.comap f (iSup s)

theorem Subgroup.iSup_comap_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] {ι : Sort u_7} (f : G →* N) (s : ι → Subgroup N) : ⨆ (i : ι), Subgroup.comap f (s i) ≤ Subgroup.comap f (iSup s)

theorem AddSubgroup.comap_inf {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup N) (K : AddSubgroup N) (f : G →+ N) : AddSubgroup.comap f (H ⊓ K) = AddSubgroup.comap f H ⊓ AddSubgroup.comap f K

theorem Subgroup.comap_inf {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup N) (K : Subgroup N) (f : G →* N) : Subgroup.comap f (H ⊓ K) = Subgroup.comap f H ⊓ Subgroup.comap f K

theorem AddSubgroup.comap_iInf {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {ι : Sort u_7} (f : G →+ N) (s : ι → AddSubgroup N) : AddSubgroup.comap f (iInf s) = ⨅ (i : ι), AddSubgroup.comap f (s i)

theorem Subgroup.comap_iInf {G : Type u_1} [Group G] {N : Type u_5} [Group N] {ι : Sort u_7} (f : G →* N) (s : ι → Subgroup N) : Subgroup.comap f (iInf s) = ⨅ (i : ι), Subgroup.comap f (s i)

theorem AddSubgroup.map_inf_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup G) (f : G →+ N) : AddSubgroup.map f (H ⊓ K) ≤ AddSubgroup.map f H ⊓ AddSubgroup.map f K

theorem Subgroup.map_inf_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup G) (f : G →* N) : Subgroup.map f (H ⊓ K) ≤ Subgroup.map f H ⊓ Subgroup.map f K

theorem AddSubgroup.map_inf_eq {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) : AddSubgroup.map f (H ⊓ K) = AddSubgroup.map f H ⊓ AddSubgroup.map f K

theorem Subgroup.map_inf_eq {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup G) (f : G →* N) (hf : Function.Injective ↑f) : Subgroup.map f (H ⊓ K) = Subgroup.map f H ⊓ Subgroup.map f K

@[simp]

theorem AddSubgroup.map_bot {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddSubgroup.map f ⊥ = ⊥

@[simp]

theorem Subgroup.map_bot {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Subgroup.map f ⊥ = ⊥

@[simp]

theorem AddSubgroup.map_top_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (h : Function.Surjective ↑f) : AddSubgroup.map f ⊤ = ⊤

@[simp]

theorem Subgroup.map_top_of_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (h : Function.Surjective ↑f) : Subgroup.map f ⊤ = ⊤

@[simp]

theorem AddSubgroup.comap_top {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddSubgroup.comap f ⊤ = ⊤

@[simp]

theorem Subgroup.comap_top {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Subgroup.comap f ⊤ = ⊤

def AddSubgroup.addSubgroupOf {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : AddSubgroup { x // x ∈ K }

For any subgroups H and K, view H ⊓ K as a subgroup of K.

Equations

• AddSubgroup.addSubgroupOf H K = AddSubgroup.comap (AddSubgroup.subtype K) H

def Subgroup.subgroupOf {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Subgroup { x // x ∈ K }

For any subgroups H and K, view H ⊓ K as a subgroup of K.

Equations

• Subgroup.subgroupOf H K = Subgroup.comap (Subgroup.subtype K) H

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_3 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (g : { x // x ∈ H }) : ↑g ∈ H

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_4 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (_g : { x // x ∈ AddSubgroup.addSubgroupOf H K }) : (fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) ((fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) _g) = _g

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_2 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (g : { x // x ∈ H }) : ↑g ∈ K

def AddSubgroup.addSubgroupOfEquivOfLe {G : Type u_7} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) : { x // x ∈ AddSubgroup.addSubgroupOf H K } ≃+ { x // x ∈ H }

If H ≤ K, then H as a subgroup of K is isomorphic to H.

Equations

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

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_6 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (_g : { x // x ∈ AddSubgroup.addSubgroupOf H K }) (_h : { x // x ∈ AddSubgroup.addSubgroupOf H K }) : Equiv.toFun { toFun := fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }, invFun := fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }, left_inv := (_ : ∀ (_g : { x // x ∈ AddSubgroup.addSubgroupOf H K }), (fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) ((fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) _g) = _g), right_inv := (_ : ∀ (_g : { x // x ∈ H }), (fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) ((fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) _g) = _g) } (_g + _h) = Equiv.toFun { toFun := fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }, invFun := fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }, left_inv := (_ : ∀ (_g : { x // x ∈ AddSubgroup.addSubgroupOf H K }), (fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) ((fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) _g) = _g), right_inv := (_ : ∀ (_g : { x // x ∈ H }), (fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) ((fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) _g) = _g) } (_g + _h)

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (g : { x // x ∈ AddSubgroup.addSubgroupOf H K }) : ↑g ∈ AddSubgroup.addSubgroupOf H K

theorem AddSubgroup.addSubgroupOfEquivOfLe.proof_5 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (_g : { x // x ∈ H }) : (fun g => { val := ↑↑g, property := (_ : ↑g ∈ AddSubgroup.addSubgroupOf H K) }) ((fun g => { val := { val := ↑g, property := h ↑g (_ : ↑g ∈ H) }, property := (_ : ↑g ∈ H) }) _g) = _g

@[simp]

theorem Subgroup.subgroupOfEquivOfLe_apply_coe {G : Type u_7} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) (g : { x // x ∈ Subgroup.subgroupOf H K }) : ↑(↑(Subgroup.subgroupOfEquivOfLe h) g) = ↑↑g

@[simp]

theorem AddSubgroup.addSubgroupOfEquivOfLe_apply_coe {G : Type u_7} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (g : { x // x ∈ AddSubgroup.addSubgroupOf H K }) : ↑(↑(AddSubgroup.addSubgroupOfEquivOfLe h) g) = ↑↑g

@[simp]

theorem AddSubgroup.addSubgroupOfEquivOfLe_symm_apply_coe_coe {G : Type u_7} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) (g : { x // x ∈ H }) : ↑↑(↑(AddEquiv.symm (AddSubgroup.addSubgroupOfEquivOfLe h)) g) = ↑g

@[simp]

theorem Subgroup.subgroupOfEquivOfLe_symm_apply_coe_coe {G : Type u_7} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) (g : { x // x ∈ H }) : ↑↑(↑(MulEquiv.symm (Subgroup.subgroupOfEquivOfLe h)) g) = ↑g

def Subgroup.subgroupOfEquivOfLe {G : Type u_7} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) : { x // x ∈ Subgroup.subgroupOf H K } ≃* { x // x ∈ H }

If H ≤ K, then H as a subgroup of K is isomorphic to H.

Equations

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

@[simp]

theorem AddSubgroup.comap_subtype {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : AddSubgroup.comap (AddSubgroup.subtype K) H = AddSubgroup.addSubgroupOf H K

@[simp]

theorem Subgroup.comap_subtype {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Subgroup.comap (Subgroup.subtype K) H = Subgroup.subgroupOf H K

@[simp]

theorem AddSubgroup.comap_inclusion_addSubgroupOf {G : Type u_1} [AddGroup G] {K₁ : AddSubgroup G} {K₂ : AddSubgroup G} (h : K₁ ≤ K₂) (H : AddSubgroup G) : AddSubgroup.comap (AddSubgroup.inclusion h) (AddSubgroup.addSubgroupOf H K₂) = AddSubgroup.addSubgroupOf H K₁

@[simp]

theorem Subgroup.comap_inclusion_subgroupOf {G : Type u_1} [Group G] {K₁ : Subgroup G} {K₂ : Subgroup G} (h : K₁ ≤ K₂) (H : Subgroup G) : Subgroup.comap (Subgroup.inclusion h) (Subgroup.subgroupOf H K₂) = Subgroup.subgroupOf H K₁

theorem AddSubgroup.coe_addSubgroupOf {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : ↑(AddSubgroup.addSubgroupOf H K) = ↑(AddSubgroup.subtype K) ⁻¹' ↑H

theorem Subgroup.coe_subgroupOf {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : ↑(Subgroup.subgroupOf H K) = ↑(Subgroup.subtype K) ⁻¹' ↑H

theorem AddSubgroup.mem_addSubgroupOf {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} {h : { x // x ∈ K }} : h ∈ AddSubgroup.addSubgroupOf H K ↔ ↑h ∈ H

theorem Subgroup.mem_subgroupOf {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} {h : { x // x ∈ K }} : h ∈ Subgroup.subgroupOf H K ↔ ↑h ∈ H

@[simp]

theorem AddSubgroup.addSubgroupOf_map_subtype {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : AddSubgroup.map (AddSubgroup.subtype K) (AddSubgroup.addSubgroupOf H K) = H ⊓ K

@[simp]

theorem Subgroup.subgroupOf_map_subtype {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Subgroup.map (Subgroup.subtype K) (Subgroup.subgroupOf H K) = H ⊓ K

@[simp]

theorem AddSubgroup.bot_addSubgroupOf {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup.addSubgroupOf ⊥ H = ⊥

@[simp]

theorem Subgroup.bot_subgroupOf {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.subgroupOf ⊥ H = ⊥

@[simp]

theorem AddSubgroup.top_addSubgroupOf {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup.addSubgroupOf ⊤ H = ⊤

@[simp]

theorem Subgroup.top_subgroupOf {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.subgroupOf ⊤ H = ⊤

theorem AddSubgroup.addSubgroupOf_bot_eq_bot {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup.addSubgroupOf H ⊥ = ⊥

theorem Subgroup.subgroupOf_bot_eq_bot {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.subgroupOf H ⊥ = ⊥

theorem AddSubgroup.addSubgroupOf_bot_eq_top {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup.addSubgroupOf H ⊥ = ⊤

theorem Subgroup.subgroupOf_bot_eq_top {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.subgroupOf H ⊥ = ⊤

@[simp]

theorem AddSubgroup.addSubgroupOf_self {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup.addSubgroupOf H H = ⊤

@[simp]

theorem Subgroup.subgroupOf_self {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.subgroupOf H H = ⊤

@[simp]

theorem AddSubgroup.addSubgroupOf_inj {G : Type u_1} [AddGroup G] {H₁ : AddSubgroup G} {H₂ : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.addSubgroupOf H₁ K = AddSubgroup.addSubgroupOf H₂ K ↔ H₁ ⊓ K = H₂ ⊓ K

@[simp]

theorem Subgroup.subgroupOf_inj {G : Type u_1} [Group G] {H₁ : Subgroup G} {H₂ : Subgroup G} {K : Subgroup G} : Subgroup.subgroupOf H₁ K = Subgroup.subgroupOf H₂ K ↔ H₁ ⊓ K = H₂ ⊓ K

@[simp]

theorem AddSubgroup.inf_addSubgroupOf_right {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : AddSubgroup.addSubgroupOf (H ⊓ K) K = AddSubgroup.addSubgroupOf H K

@[simp]

theorem Subgroup.inf_subgroupOf_right {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Subgroup.subgroupOf (H ⊓ K) K = Subgroup.subgroupOf H K

@[simp]

theorem AddSubgroup.inf_addSubgroupOf_left {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : AddSubgroup.addSubgroupOf (K ⊓ H) K = AddSubgroup.addSubgroupOf H K

@[simp]

theorem Subgroup.inf_subgroupOf_left {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Subgroup.subgroupOf (K ⊓ H) K = Subgroup.subgroupOf H K

@[simp]

theorem AddSubgroup.addSubgroupOf_eq_bot {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.addSubgroupOf H K = ⊥ ↔ Disjoint H K

@[simp]

theorem Subgroup.subgroupOf_eq_bot {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} : Subgroup.subgroupOf H K = ⊥ ↔ Disjoint H K

@[simp]

theorem AddSubgroup.addSubgroupOf_eq_top {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.addSubgroupOf H K = ⊤ ↔ K ≤ H

@[simp]

theorem Subgroup.subgroupOf_eq_top {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} : Subgroup.subgroupOf H K = ⊤ ↔ K ≤ H

def AddSubgroup.prod {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : AddSubgroup (G × N)

Given AddSubgroups H, K of AddGroups A, B respectively, H × K as an AddSubgroup of A × B.

Equations

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

theorem AddSubgroup.prod.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : 0 ∈ (AddSubmonoid.prod H.toAddSubmonoid K.toAddSubmonoid).toAddSubsemigroup.carrier

theorem AddSubgroup.prod.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : ∀ {x : G × N}, x ∈ { toAddSubsemigroup := (AddSubmonoid.prod H.toAddSubmonoid K.toAddSubmonoid).toAddSubsemigroup, zero_mem' := (_ : 0 ∈ (AddSubmonoid.prod H.toAddSubmonoid K.toAddSubmonoid).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier → (-x).fst ∈ ↑H.toAddSubmonoid ∧ (-x).snd ∈ ↑K.toAddSubmonoid

def Subgroup.prod {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup N) : Subgroup (G × N)

Given Subgroups H, K of groups G, N respectively, H × K as a subgroup of G × N.

Equations

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

theorem AddSubgroup.coe_prod {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : ↑(AddSubgroup.prod H K) = ↑H ×ˢ ↑K

theorem Subgroup.coe_prod {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup N) : ↑(Subgroup.prod H K) = ↑H ×ˢ ↑K

theorem AddSubgroup.mem_prod {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup G} {K : AddSubgroup N} {p : G × N} : p ∈ AddSubgroup.prod H K ↔ p.fst ∈ H ∧ p.snd ∈ K

theorem Subgroup.mem_prod {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup G} {K : Subgroup N} {p : G × N} : p ∈ Subgroup.prod H K ↔ p.fst ∈ H ∧ p.snd ∈ K

theorem AddSubgroup.prod_mono {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] : ((fun x x_1 => x ≤ x_1) ⇒ (fun x x_1 => x ≤ x_1) ⇒ fun x x_1 => x ≤ x_1) AddSubgroup.prod AddSubgroup.prod

theorem Subgroup.prod_mono {G : Type u_1} [Group G] {N : Type u_5} [Group N] : ((fun x x_1 => x ≤ x_1) ⇒ (fun x x_1 => x ≤ x_1) ⇒ fun x x_1 => x ≤ x_1) Subgroup.prod Subgroup.prod

theorem AddSubgroup.prod_mono_right {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (K : AddSubgroup G) : Monotone fun t => AddSubgroup.prod K t

theorem Subgroup.prod_mono_right {G : Type u_1} [Group G] {N : Type u_5} [Group N] (K : Subgroup G) : Monotone fun t => Subgroup.prod K t

theorem AddSubgroup.prod_mono_left {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup N) : Monotone fun K => AddSubgroup.prod K H

theorem Subgroup.prod_mono_left {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup N) : Monotone fun K => Subgroup.prod K H

theorem AddSubgroup.prod_top {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (K : AddSubgroup G) : AddSubgroup.prod K ⊤ = AddSubgroup.comap (AddMonoidHom.fst G N) K

theorem Subgroup.prod_top {G : Type u_1} [Group G] {N : Type u_5} [Group N] (K : Subgroup G) : Subgroup.prod K ⊤ = Subgroup.comap (MonoidHom.fst G N) K

theorem AddSubgroup.top_prod {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup N) : AddSubgroup.prod ⊤ H = AddSubgroup.comap (AddMonoidHom.snd G N) H

theorem Subgroup.top_prod {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup N) : Subgroup.prod ⊤ H = Subgroup.comap (MonoidHom.snd G N) H

@[simp]

theorem AddSubgroup.top_prod_top {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] : AddSubgroup.prod ⊤ ⊤ = ⊤

@[simp]

theorem Subgroup.top_prod_top {G : Type u_1} [Group G] {N : Type u_5} [Group N] : Subgroup.prod ⊤ ⊤ = ⊤

theorem AddSubgroup.bot_sum_bot {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] : AddSubgroup.prod ⊥ ⊥ = ⊥

theorem Subgroup.bot_prod_bot {G : Type u_1} [Group G] {N : Type u_5} [Group N] : Subgroup.prod ⊥ ⊥ = ⊥

theorem AddSubgroup.le_prod_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup G} {K : AddSubgroup N} {J : AddSubgroup (G × N)} : J ≤ AddSubgroup.prod H K ↔ AddSubgroup.map (AddMonoidHom.fst G N) J ≤ H ∧ AddSubgroup.map (AddMonoidHom.snd G N) J ≤ K

theorem Subgroup.le_prod_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup G} {K : Subgroup N} {J : Subgroup (G × N)} : J ≤ Subgroup.prod H K ↔ Subgroup.map (MonoidHom.fst G N) J ≤ H ∧ Subgroup.map (MonoidHom.snd G N) J ≤ K

theorem AddSubgroup.prod_le_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup G} {K : AddSubgroup N} {J : AddSubgroup (G × N)} : AddSubgroup.prod H K ≤ J ↔ AddSubgroup.map (AddMonoidHom.inl G N) H ≤ J ∧ AddSubgroup.map (AddMonoidHom.inr G N) K ≤ J

theorem Subgroup.prod_le_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup G} {K : Subgroup N} {J : Subgroup (G × N)} : Subgroup.prod H K ≤ J ↔ Subgroup.map (MonoidHom.inl G N) H ≤ J ∧ Subgroup.map (MonoidHom.inr G N) K ≤ J

@[simp]

theorem AddSubgroup.prod_eq_bot_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup G} {K : AddSubgroup N} : AddSubgroup.prod H K = ⊥ ↔ H = ⊥ ∧ K = ⊥

@[simp]

theorem Subgroup.prod_eq_bot_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup G} {K : Subgroup N} : Subgroup.prod H K = ⊥ ↔ H = ⊥ ∧ K = ⊥

theorem AddSubgroup.prodEquiv.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : Function.RightInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun

def AddSubgroup.prodEquiv {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : { x // x ∈ AddSubgroup.prod H K } ≃+ { x // x ∈ H } × { x // x ∈ K }

Product of additive subgroups is isomorphic to their product as additive groups

Equations

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

theorem AddSubgroup.prodEquiv.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : Function.LeftInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun

theorem AddSubgroup.prodEquiv.proof_3 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) : ∀ (x x_1 : { x // x ∈ AddSubgroup.prod H K }), Equiv.toFun { toFun := (Equiv.Set.prod ↑H ↑K).toFun, invFun := (Equiv.Set.prod ↑H ↑K).invFun, left_inv := (_ : Function.LeftInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun), right_inv := (_ : Function.RightInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun) } (x + x_1) = Equiv.toFun { toFun := (Equiv.Set.prod ↑H ↑K).toFun, invFun := (Equiv.Set.prod ↑H ↑K).invFun, left_inv := (_ : Function.LeftInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun), right_inv := (_ : Function.RightInverse (Equiv.Set.prod ↑H ↑K).invFun (Equiv.Set.prod ↑H ↑K).toFun) } (x + x_1)

def Subgroup.prodEquiv {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup N) : { x // x ∈ Subgroup.prod H K } ≃* { x // x ∈ H } × { x // x ∈ K }

Product of subgroups is isomorphic to their product as groups.

Equations

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

theorem AddSubmonoid.pi.proof_1 {η : Type u_1} {f : η → Type u_2} [(i : η) → AddZeroClass (f i)] (I : Set η) (s : (i : η) → AddSubmonoid (f i)) : ∀ {a b : (i : η) → f i}, (a ∈ Set.pi I fun i => (s i).carrier) → (b ∈ Set.pi I fun i => (s i).carrier) → ∀ (i : η), i ∈ I → a i + b i ∈ s i

theorem AddSubmonoid.pi.proof_2 {η : Type u_1} {f : η → Type u_2} [(i : η) → AddZeroClass (f i)] (I : Set η) (s : (i : η) → AddSubmonoid (f i)) (i : η) : i ∈ I → 0 ∈ s i

def AddSubmonoid.pi {η : Type u_7} {f : η → Type u_8} [(i : η) → AddZeroClass (f i)] (I : Set η) (s : (i : η) → AddSubmonoid (f i)) : AddSubmonoid ((i : η) → f i)

A version of Set.pi for AddSubmonoids. Given an index set I and a family of submodules s : Π i, AddSubmonoid f i, pi I s is the AddSubmonoid of dependent functions f : Π i, f i such that f i belongs to pi I s whenever i ∈ I. -/

Equations

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

def Submonoid.pi {η : Type u_7} {f : η → Type u_8} [(i : η) → MulOneClass (f i)] (I : Set η) (s : (i : η) → Submonoid (f i)) : Submonoid ((i : η) → f i)

A version of Set.pi for submonoids. Given an index set I and a family of submodules s : Π i, Submonoid f i, pi I s is the submonoid of dependent functions f : Π i, f i such that f i belongs to Pi I s whenever i ∈ I.

Equations

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

theorem AddSubgroup.pi.proof_1 {η : Type u_1} {f : η → Type u_2} [(i : η) → AddGroup (f i)] (I : Set η) (H : (i : η) → AddSubgroup (f i)) : 0 ∈ (AddSubmonoid.pi I fun i => (H i).toAddSubmonoid).toAddSubsemigroup.carrier

def AddSubgroup.pi {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (I : Set η) (H : (i : η) → AddSubgroup (f i)) : AddSubgroup ((i : η) → f i)

A version of Set.pi for AddSubgroups. Given an index set I and a family of submodules s : Π i, AddSubgroup f i, pi I s is the AddSubgroup of dependent functions f : Π i, f i such that f i belongs to pi I s whenever i ∈ I. -/

Equations

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

theorem AddSubgroup.pi.proof_2 {η : Type u_1} {f : η → Type u_2} [(i : η) → AddGroup (f i)] (I : Set η) (H : (i : η) → AddSubgroup (f i)) : ∀ {x : (i : η) → f i}, x ∈ { toAddSubsemigroup := (AddSubmonoid.pi I fun i => (H i).toAddSubmonoid).toAddSubsemigroup, zero_mem' := (_ : 0 ∈ (AddSubmonoid.pi I fun i => (H i).toAddSubmonoid).toAddSubsemigroup.carrier) }.toAddSubsemigroup.carrier → ∀ (i : η), i ∈ I → -x i ∈ H i

def Subgroup.pi {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (I : Set η) (H : (i : η) → Subgroup (f i)) : Subgroup ((i : η) → f i)

A version of Set.pi for subgroups. Given an index set I and a family of submodules s : Π i, Subgroup f i, pi I s is the subgroup of dependent functions f : Π i, f i such that f i belongs to pi I s whenever i ∈ I.

Equations

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

theorem AddSubgroup.coe_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (I : Set η) (H : (i : η) → AddSubgroup (f i)) : ↑(AddSubgroup.pi I H) = Set.pi I fun i => ↑(H i)

theorem Subgroup.coe_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (I : Set η) (H : (i : η) → Subgroup (f i)) : ↑(Subgroup.pi I H) = Set.pi I fun i => ↑(H i)

theorem AddSubgroup.mem_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (I : Set η) {H : (i : η) → AddSubgroup (f i)} {p : (i : η) → f i} : p ∈ AddSubgroup.pi I H ↔ ∀ (i : η), i ∈ I → p i ∈ H i

theorem Subgroup.mem_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (I : Set η) {H : (i : η) → Subgroup (f i)} {p : (i : η) → f i} : p ∈ Subgroup.pi I H ↔ ∀ (i : η), i ∈ I → p i ∈ H i

theorem AddSubgroup.pi_top {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (I : Set η) : (AddSubgroup.pi I fun i => ⊤) = ⊤

theorem Subgroup.pi_top {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (I : Set η) : (Subgroup.pi I fun i => ⊤) = ⊤

theorem AddSubgroup.pi_empty {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (H : (i : η) → AddSubgroup (f i)) : AddSubgroup.pi ∅ H = ⊤

theorem Subgroup.pi_empty {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (H : (i : η) → Subgroup (f i)) : Subgroup.pi ∅ H = ⊤

theorem AddSubgroup.pi_bot {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] : (AddSubgroup.pi Set.univ fun i => ⊥) = ⊥

theorem Subgroup.pi_bot {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] : (Subgroup.pi Set.univ fun i => ⊥) = ⊥

theorem AddSubgroup.le_pi_iff {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] {I : Set η} {H : (i : η) → AddSubgroup (f i)} {J : AddSubgroup ((i : η) → f i)} : J ≤ AddSubgroup.pi I H ↔ ∀ (i : η), i ∈ I → AddSubgroup.map (Pi.evalAddMonoidHom f i) J ≤ H i

theorem Subgroup.le_pi_iff {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] {I : Set η} {H : (i : η) → Subgroup (f i)} {J : Subgroup ((i : η) → f i)} : J ≤ Subgroup.pi I H ↔ ∀ (i : η), i ∈ I → Subgroup.map (Pi.evalMonoidHom f i) J ≤ H i

@[simp]

theorem AddSubgroup.single_mem_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] [DecidableEq η] {I : Set η} {H : (i : η) → AddSubgroup (f i)} (i : η) (x : f i) : Pi.single i x ∈ AddSubgroup.pi I H ↔ i ∈ I → x ∈ H i

@[simp]

theorem Subgroup.mulSingle_mem_pi {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] [DecidableEq η] {I : Set η} {H : (i : η) → Subgroup (f i)} (i : η) (x : f i) : Pi.mulSingle i x ∈ Subgroup.pi I H ↔ i ∈ I → x ∈ H i

theorem AddSubgroup.pi_eq_bot_iff {η : Type u_7} {f : η → Type u_8} [(i : η) → AddGroup (f i)] (H : (i : η) → AddSubgroup (f i)) : AddSubgroup.pi Set.univ H = ⊥ ↔ ∀ (i : η), H i = ⊥

theorem Subgroup.pi_eq_bot_iff {η : Type u_7} {f : η → Type u_8} [(i : η) → Group (f i)] (H : (i : η) → Subgroup (f i)) : Subgroup.pi Set.univ H = ⊥ ↔ ∀ (i : η), H i = ⊥

class Subgroup.Normal {G : Type u_1} [Group G] (H : Subgroup G) : Prop

• conj_mem : ∀ (n : G), n ∈ H → ∀ (g : G), g * n * g⁻¹ ∈ H

  N is closed under conjugation

A subgroup is normal if whenever n ∈ H, then g * n * g⁻¹ ∈ H for every g : G

class AddSubgroup.Normal {A : Type u_4} [AddGroup A] (H : AddSubgroup A) : Prop

• conj_mem : ∀ (n : A), n ∈ H → ∀ (g : A), g + n + -g ∈ H

  N is closed under additive conjugation

An AddSubgroup is normal if whenever n ∈ H, then g + n - g ∈ H for every g : G

instance AddSubgroup.normal_of_comm {G : Type u_5} [AddCommGroup G] (H : AddSubgroup G) : AddSubgroup.Normal H

Equations

• @AddSubgroup.normal_of_comm = @AddSubgroup.normal_of_comm.proof_1

theorem AddSubgroup.normal_of_comm.proof_1 {G : Type u_1} [AddCommGroup G] (H : AddSubgroup G) : AddSubgroup.Normal H

instance Subgroup.normal_of_comm {G : Type u_5} [CommGroup G] (H : Subgroup G) : Subgroup.Normal H

Equations

• @Subgroup.normal_of_comm = @Subgroup.normal_of_comm.proof_1

theorem AddSubgroup.Normal.mem_comm {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (nH : AddSubgroup.Normal H) {a : G} {b : G} (h : a + b ∈ H) : b + a ∈ H

theorem Subgroup.Normal.mem_comm {G : Type u_1} [Group G] {H : Subgroup G} (nH : Subgroup.Normal H) {a : G} {b : G} (h : a * b ∈ H) : b * a ∈ H

theorem AddSubgroup.Normal.mem_comm_iff {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (nH : AddSubgroup.Normal H) {a : G} {b : G} : a + b ∈ H ↔ b + a ∈ H

theorem Subgroup.Normal.mem_comm_iff {G : Type u_1} [Group G] {H : Subgroup G} (nH : Subgroup.Normal H) {a : G} {b : G} : a * b ∈ H ↔ b * a ∈ H

class Subgroup.Characteristic {G : Type u_1} [Group G] (H : Subgroup G) : Prop

• fixed : ∀ (ϕ : G ≃* G), Subgroup.comap (MulEquiv.toMonoidHom ϕ) H = H

  H is fixed by all automorphisms

A subgroup is characteristic if it is fixed by all automorphisms. Several equivalent conditions are provided by lemmas of the form Characteristic.iff...

instance Subgroup.normal_of_characteristic {G : Type u_1} [Group G] (H : Subgroup G) [h : Subgroup.Characteristic H] : Subgroup.Normal H

Equations

• @Subgroup.normal_of_characteristic = @Subgroup.normal_of_characteristic.proof_1

class AddSubgroup.Characteristic {A : Type u_4} [AddGroup A] (H : AddSubgroup A) : Prop

• fixed : ∀ (ϕ : A ≃+ A), AddSubgroup.comap (AddEquiv.toAddMonoidHom ϕ) H = H

  H is fixed by all automorphisms

An AddSubgroup is characteristic if it is fixed by all automorphisms. Several equivalent conditions are provided by lemmas of the form Characteristic.iff...

instance AddSubgroup.normal_of_characteristic {A : Type u_4} [AddGroup A] (H : AddSubgroup A) [h : AddSubgroup.Characteristic H] : AddSubgroup.Normal H

Equations

• @AddSubgroup.normal_of_characteristic = @AddSubgroup.normal_of_characteristic.proof_1

theorem AddSubgroup.characteristic_iff_comap_eq {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), AddSubgroup.comap (AddEquiv.toAddMonoidHom ϕ) H = H

theorem Subgroup.characteristic_iff_comap_eq {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), Subgroup.comap (MulEquiv.toMonoidHom ϕ) H = H

theorem AddSubgroup.characteristic_iff_comap_le {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), AddSubgroup.comap (AddEquiv.toAddMonoidHom ϕ) H ≤ H

theorem Subgroup.characteristic_iff_comap_le {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), Subgroup.comap (MulEquiv.toMonoidHom ϕ) H ≤ H

theorem AddSubgroup.characteristic_iff_le_comap {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), H ≤ AddSubgroup.comap (AddEquiv.toAddMonoidHom ϕ) H

theorem Subgroup.characteristic_iff_le_comap {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), H ≤ Subgroup.comap (MulEquiv.toMonoidHom ϕ) H

theorem AddSubgroup.characteristic_iff_map_eq {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), AddSubgroup.map (AddEquiv.toAddMonoidHom ϕ) H = H

theorem Subgroup.characteristic_iff_map_eq {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), Subgroup.map (MulEquiv.toMonoidHom ϕ) H = H

theorem AddSubgroup.characteristic_iff_map_le {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), AddSubgroup.map (AddEquiv.toAddMonoidHom ϕ) H ≤ H

theorem Subgroup.characteristic_iff_map_le {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), Subgroup.map (MulEquiv.toMonoidHom ϕ) H ≤ H

theorem AddSubgroup.characteristic_iff_le_map {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Characteristic H ↔ ∀ (ϕ : G ≃+ G), H ≤ AddSubgroup.map (AddEquiv.toAddMonoidHom ϕ) H

theorem Subgroup.characteristic_iff_le_map {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Characteristic H ↔ ∀ (ϕ : G ≃* G), H ≤ Subgroup.map (MulEquiv.toMonoidHom ϕ) H

theorem AddSubgroup.botCharacteristic.proof_1 {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic ⊥

instance AddSubgroup.botCharacteristic {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic ⊥

Equations

• @AddSubgroup.botCharacteristic = @AddSubgroup.botCharacteristic.proof_1

instance Subgroup.botCharacteristic {G : Type u_1} [Group G] : Subgroup.Characteristic ⊥

Equations

• @Subgroup.botCharacteristic = @Subgroup.botCharacteristic.proof_1

theorem AddSubgroup.topCharacteristic.proof_1 {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic ⊤

instance AddSubgroup.topCharacteristic {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic ⊤

Equations

• @AddSubgroup.topCharacteristic = @AddSubgroup.topCharacteristic.proof_1

instance Subgroup.topCharacteristic {G : Type u_1} [Group G] : Subgroup.Characteristic ⊤

Equations

• @Subgroup.topCharacteristic = @Subgroup.topCharacteristic.proof_1

theorem AddSubgroup.center.proof_1 (G : Type u_1) [AddGroup G] : ∀ {a b : G}, a ∈ (AddSubmonoid.center G).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.center G).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.center G).toAddSubsemigroup.carrier

theorem AddSubgroup.center.proof_2 (G : Type u_1) [AddGroup G] : 0 ∈ (AddSubmonoid.center G).toAddSubsemigroup.carrier

def AddSubgroup.center (G : Type u_1) [AddGroup G] : AddSubgroup G

The center of an additive group G is the set of elements that commute with everything in G

Equations

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

def Subgroup.center (G : Type u_1) [Group G] : Subgroup G

The center of a group G is the set of elements that commute with everything in G

Equations

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

theorem AddSubgroup.coe_center (G : Type u_1) [AddGroup G] : ↑(AddSubgroup.center G) = Set.addCenter G

theorem Subgroup.coe_center (G : Type u_1) [Group G] : ↑(Subgroup.center G) = Set.center G

@[simp]

theorem AddSubgroup.center_toAddSubmonoid (G : Type u_1) [AddGroup G] : (AddSubgroup.center G).toAddSubmonoid = AddSubmonoid.center G

@[simp]

theorem Subgroup.center_toSubmonoid (G : Type u_1) [Group G] : (Subgroup.center G).toSubmonoid = Submonoid.center G

@[simp]

theorem Subgroup.val_centerUnitsEquivUnitsCenter_symm_apply_coe (G₀ : Type u_5) [GroupWithZero G₀] (u : { x // x ∈ Submonoid.center G₀ }ˣ) : ↑↑(↑(MulEquiv.symm (Subgroup.centerUnitsEquivUnitsCenter G₀)) u) = ↑↑u

@[simp]

theorem Subgroup.val_centerUnitsEquivUnitsCenter_apply_coe (G₀ : Type u_5) [GroupWithZero G₀] (a : { x // x ∈ Subgroup.center G₀ˣ }) : ↑↑(↑(Subgroup.centerUnitsEquivUnitsCenter G₀) a) = ↑↑a

def Subgroup.centerUnitsEquivUnitsCenter (G₀ : Type u_5) [GroupWithZero G₀] : { x // x ∈ Subgroup.center G₀ˣ } ≃* { x // x ∈ Submonoid.center G₀ }ˣ

For a group with zero, the center of the units is the same as the units of the center.

Equations

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

theorem AddSubgroup.mem_center_iff {G : Type u_1} [AddGroup G] {z : G} : z ∈ AddSubgroup.center G ↔ ∀ (g : G), g + z = z + g

theorem Subgroup.mem_center_iff {G : Type u_1} [Group G] {z : G} : z ∈ Subgroup.center G ↔ ∀ (g : G), g * z = z * g

instance Subgroup.decidableMemCenter {G : Type u_1} [Group G] (z : G) [Decidable (∀ (g : G), g * z = z * g)] : Decidable (z ∈ Subgroup.center G)

Equations

• Subgroup.decidableMemCenter z = decidable_of_iff' (∀ (g : G), g * z = z * g) (_ : z ∈ Subgroup.center G ↔ ∀ (g : G), g * z = z * g)

theorem AddSubgroup.centerCharacteristic.proof_1 {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic (AddSubgroup.center G)

instance AddSubgroup.centerCharacteristic {G : Type u_1} [AddGroup G] : AddSubgroup.Characteristic (AddSubgroup.center G)

Equations

• @AddSubgroup.centerCharacteristic = @AddSubgroup.centerCharacteristic.proof_1

instance Subgroup.centerCharacteristic {G : Type u_1} [Group G] : Subgroup.Characteristic (Subgroup.center G)

Equations

• @Subgroup.centerCharacteristic = @Subgroup.centerCharacteristic.proof_1

theorem CommGroup.center_eq_top {G : Type u_5} [CommGroup G] : Subgroup.center G = ⊤

def Group.commGroupOfCenterEqTop {G : Type u_1} [Group G] (h : Subgroup.center G = ⊤) : CommGroup G

A group is commutative if the center is the whole group

Equations

• Group.commGroupOfCenterEqTop h = let src := inst; CommGroup.mk (_ : ∀ (x y : G), x * y = y * x)

theorem AddSubgroup.normalizer.proof_3 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {a : G} (ha : ∀ (n : G), n ∈ H ↔ a + n + -a ∈ H) (n : G) : n ∈ H ↔ -a + n + - -a ∈ H

def AddSubgroup.normalizer {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddSubgroup G

The normalizer of H is the largest subgroup of G inside which H is normal.

Equations

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

theorem AddSubgroup.normalizer.proof_2 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (a : G) : a ∈ H ↔ 0 + a + -0 ∈ H

theorem AddSubgroup.normalizer.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {a : G} {b : G} (ha : ∀ (n : G), n ∈ H ↔ a + n + -a ∈ H) (hb : ∀ (n : G), n ∈ H ↔ b + n + -b ∈ H) (n : G) : n ∈ H ↔ a + b + n + -(a + b) ∈ H

def Subgroup.normalizer {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup G

The normalizer of H is the largest subgroup of G inside which H is normal.

Equations

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

theorem AddSubgroup.setNormalizer.proof_2 {G : Type u_1} [AddGroup G] (S : Set G) (a : G) : a ∈ S ↔ 0 + a + -0 ∈ S

theorem AddSubgroup.setNormalizer.proof_3 {G : Type u_1} [AddGroup G] (S : Set G) {a : G} (ha : ∀ (n : G), n ∈ S ↔ a + n + -a ∈ S) (n : G) : n ∈ S ↔ -a + n + - -a ∈ S

def AddSubgroup.setNormalizer {G : Type u_1} [AddGroup G] (S : Set G) : AddSubgroup G

The setNormalizer of S is the subgroup of G whose elements satisfy g+S-g=S.

Equations

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

theorem AddSubgroup.setNormalizer.proof_1 {G : Type u_1} [AddGroup G] (S : Set G) {a : G} {b : G} (ha : ∀ (n : G), n ∈ S ↔ a + n + -a ∈ S) (hb : ∀ (n : G), n ∈ S ↔ b + n + -b ∈ S) (n : G) : n ∈ S ↔ a + b + n + -(a + b) ∈ S

def Subgroup.setNormalizer {G : Type u_1} [Group G] (S : Set G) : Subgroup G

The setNormalizer of S is the subgroup of G whose elements satisfy g*S*g⁻¹=S

Equations

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

theorem AddSubgroup.mem_normalizer_iff {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {g : G} : g ∈ AddSubgroup.normalizer H ↔ ∀ (h : G), h ∈ H ↔ g + h + -g ∈ H

theorem Subgroup.mem_normalizer_iff {G : Type u_1} [Group G] {H : Subgroup G} {g : G} : g ∈ Subgroup.normalizer H ↔ ∀ (h : G), h ∈ H ↔ g * h * g⁻¹ ∈ H

theorem AddSubgroup.mem_normalizer_iff'' {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {g : G} : g ∈ AddSubgroup.normalizer H ↔ ∀ (h : G), h ∈ H ↔ -g + h + g ∈ H

theorem Subgroup.mem_normalizer_iff'' {G : Type u_1} [Group G] {H : Subgroup G} {g : G} : g ∈ Subgroup.normalizer H ↔ ∀ (h : G), h ∈ H ↔ g⁻¹ * h * g ∈ H

theorem AddSubgroup.mem_normalizer_iff' {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {g : G} : g ∈ AddSubgroup.normalizer H ↔ ∀ (n : G), n + g ∈ H ↔ g + n ∈ H

theorem Subgroup.mem_normalizer_iff' {G : Type u_1} [Group G] {H : Subgroup G} {g : G} : g ∈ Subgroup.normalizer H ↔ ∀ (n : G), n * g ∈ H ↔ g * n ∈ H

theorem AddSubgroup.le_normalizer {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : H ≤ AddSubgroup.normalizer H

theorem Subgroup.le_normalizer {G : Type u_1} [Group G] {H : Subgroup G} : H ≤ Subgroup.normalizer H

theorem AddSubgroup.normal_in_normalizer.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H (AddSubgroup.normalizer H))

instance AddSubgroup.normal_in_normalizer {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H (AddSubgroup.normalizer H))

Equations

• @AddSubgroup.normal_in_normalizer = @AddSubgroup.normal_in_normalizer.proof_1

instance Subgroup.normal_in_normalizer {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.Normal (Subgroup.subgroupOf H (Subgroup.normalizer H))

Equations

• @Subgroup.normal_in_normalizer = @Subgroup.normal_in_normalizer.proof_1

theorem AddSubgroup.normalizer_eq_top {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.normalizer H = ⊤ ↔ AddSubgroup.Normal H

theorem Subgroup.normalizer_eq_top {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.normalizer H = ⊤ ↔ Subgroup.Normal H

theorem AddSubgroup.center_le_normalizer {G : Type u_1} [AddGroup G] {H : AddSubgroup G} : AddSubgroup.center G ≤ AddSubgroup.normalizer H

theorem Subgroup.center_le_normalizer {G : Type u_1} [Group G] {H : Subgroup G} : Subgroup.center G ≤ Subgroup.normalizer H

theorem AddSubgroup.le_normalizer_of_normal {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} [hK : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H K)] (HK : H ≤ K) : K ≤ AddSubgroup.normalizer H

theorem Subgroup.le_normalizer_of_normal {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} [hK : Subgroup.Normal (Subgroup.subgroupOf H K)] (HK : H ≤ K) : K ≤ Subgroup.normalizer H

theorem AddSubgroup.le_normalizer_comap {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {N : Type u_5} [AddGroup N] (f : N →+ G) : AddSubgroup.comap f (AddSubgroup.normalizer H) ≤ AddSubgroup.normalizer (AddSubgroup.comap f H)

The preimage of the normalizer is contained in the normalizer of the preimage.

theorem Subgroup.le_normalizer_comap {G : Type u_1} [Group G] {H : Subgroup G} {N : Type u_5} [Group N] (f : N →* G) : Subgroup.comap f (Subgroup.normalizer H) ≤ Subgroup.normalizer (Subgroup.comap f H)

The preimage of the normalizer is contained in the normalizer of the preimage.

theorem AddSubgroup.le_normalizer_map {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {N : Type u_5} [AddGroup N] (f : G →+ N) : AddSubgroup.map f (AddSubgroup.normalizer H) ≤ AddSubgroup.normalizer (AddSubgroup.map f H)

The image of the normalizer is contained in the normalizer of the image.

theorem Subgroup.le_normalizer_map {G : Type u_1} [Group G] {H : Subgroup G} {N : Type u_5} [Group N] (f : G →* N) : Subgroup.map f (Subgroup.normalizer H) ≤ Subgroup.normalizer (Subgroup.map f H)

The image of the normalizer is contained in the normalizer of the image.

def NormalizerCondition (G : Type u_1) [Group G] : Prop

Every proper subgroup H of G is a proper normal subgroup of the normalizer of H in G.

Equations

• NormalizerCondition G = ∀ (H : Subgroup G), H < ⊤ → H < Subgroup.normalizer H

theorem normalizerCondition_iff_only_full_group_self_normalizing {G : Type u_1} [Group G] : NormalizerCondition G ↔ ∀ (H : Subgroup G), Subgroup.normalizer H = H → H = ⊤

Alternative phrasing of the normalizer condition: Only the full group is self-normalizing. This may be easier to work with, as it avoids inequalities and negations.

theorem Subgroup.NormalizerCondition.normal_of_coatom {G : Type u_1} [Group G] (H : Subgroup G) (hnc : NormalizerCondition G) (hmax : IsCoatom H) : Subgroup.Normal H

In a group that satisfies the normalizer condition, every maximal subgroup is normal

theorem AddSubgroup.centralizer.proof_1 {G : Type u_1} [AddGroup G] (s : Set G) : ∀ {a b : G}, a ∈ (AddSubmonoid.centralizer s).toAddSubsemigroup.carrier → b ∈ (AddSubmonoid.centralizer s).toAddSubsemigroup.carrier → a + b ∈ (AddSubmonoid.centralizer s).toAddSubsemigroup.carrier

theorem AddSubgroup.centralizer.proof_2 {G : Type u_1} [AddGroup G] (s : Set G) : 0 ∈ (AddSubmonoid.centralizer s).toAddSubsemigroup.carrier

def AddSubgroup.centralizer {G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup G

The centralizer of H is the additive subgroup of g : G commuting with every h : H.

Equations

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

def Subgroup.centralizer {G : Type u_1} [Group G] (s : Set G) : Subgroup G

The centralizer of H is the subgroup of g : G commuting with every h : H.

Equations

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

theorem AddSubgroup.mem_centralizer_iff {G : Type u_1} [AddGroup G] {g : G} {s : Set G} : g ∈ AddSubgroup.centralizer s ↔ ∀ (h : G), h ∈ s → h + g = g + h

theorem Subgroup.mem_centralizer_iff {G : Type u_1} [Group G] {g : G} {s : Set G} : g ∈ Subgroup.centralizer s ↔ ∀ (h : G), h ∈ s → h * g = g * h

theorem AddSubgroup.mem_centralizer_iff_commutator_eq_zero {G : Type u_1} [AddGroup G] {g : G} {s : Set G} : g ∈ AddSubgroup.centralizer s ↔ ∀ (h : G), h ∈ s → h + g + -h + -g = 0

theorem Subgroup.mem_centralizer_iff_commutator_eq_one {G : Type u_1} [Group G] {g : G} {s : Set G} : g ∈ Subgroup.centralizer s ↔ ∀ (h : G), h ∈ s → h * g * h⁻¹ * g⁻¹ = 1

theorem AddSubgroup.centralizer_univ {G : Type u_1} [AddGroup G] : AddSubgroup.centralizer Set.univ = AddSubgroup.center G

theorem Subgroup.centralizer_univ {G : Type u_1} [Group G] : Subgroup.centralizer Set.univ = Subgroup.center G

theorem AddSubgroup.le_centralizer_iff {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} : H ≤ AddSubgroup.centralizer ↑K ↔ K ≤ AddSubgroup.centralizer ↑H

theorem Subgroup.le_centralizer_iff {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} : H ≤ Subgroup.centralizer ↑K ↔ K ≤ Subgroup.centralizer ↑H

theorem AddSubgroup.center_le_centralizer {G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.center G ≤ AddSubgroup.centralizer s

theorem Subgroup.center_le_centralizer {G : Type u_1} [Group G] (s : Set G) : Subgroup.center G ≤ Subgroup.centralizer s

theorem AddSubgroup.centralizer_le {G : Type u_1} [AddGroup G] {s : Set G} {t : Set G} (h : s ⊆ t) : AddSubgroup.centralizer t ≤ AddSubgroup.centralizer s

theorem Subgroup.centralizer_le {G : Type u_1} [Group G] {s : Set G} {t : Set G} (h : s ⊆ t) : Subgroup.centralizer t ≤ Subgroup.centralizer s

@[simp]

theorem AddSubgroup.centralizer_eq_top_iff_subset {G : Type u_1} [AddGroup G] {s : Set G} : AddSubgroup.centralizer s = ⊤ ↔ s ⊆ ↑(AddSubgroup.center G)

@[simp]

theorem Subgroup.centralizer_eq_top_iff_subset {G : Type u_1} [Group G] {s : Set G} : Subgroup.centralizer s = ⊤ ↔ s ⊆ ↑(Subgroup.center G)

theorem AddSubgroup.Centralizer.characteristic.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} [hH : AddSubgroup.Characteristic H] : AddSubgroup.Characteristic (AddSubgroup.centralizer ↑H)

instance AddSubgroup.Centralizer.characteristic {G : Type u_1} [AddGroup G] {H : AddSubgroup G} [hH : AddSubgroup.Characteristic H] : AddSubgroup.Characteristic (AddSubgroup.centralizer ↑H)

Equations

• @AddSubgroup.Centralizer.characteristic = @AddSubgroup.Centralizer.characteristic.proof_1

instance Subgroup.Centralizer.characteristic {G : Type u_1} [Group G] {H : Subgroup G} [hH : Subgroup.Characteristic H] : Subgroup.Characteristic (Subgroup.centralizer ↑H)

Equations

• @Subgroup.Centralizer.characteristic = @Subgroup.Centralizer.characteristic.proof_1

class Subgroup.IsCommutative {G : Type u_1} [Group G] (H : Subgroup G) : Prop

• is_comm : IsCommutative { x // x ∈ H } fun x x_1 => x * x_1

  * is commutative on H

Commutativity of a subgroup

class AddSubgroup.IsCommutative {A : Type u_4} [AddGroup A] (H : AddSubgroup A) : Prop

• is_comm : IsCommutative { x // x ∈ H } fun x x_1 => x + x_1

  + is commutative on H

Commutativity of an additive subgroup

theorem AddSubgroup.IsCommutative.addCommGroup.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (a : { x // x ∈ H }) : -a + a = 0

theorem AddSubgroup.IsCommutative.addCommGroup.proof_2 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) [h : AddSubgroup.IsCommutative H] (a : { x // x ∈ H }) (b : { x // x ∈ H }) : a + b = b + a

instance AddSubgroup.IsCommutative.addCommGroup {G : Type u_1} [AddGroup G] (H : AddSubgroup G) [h : AddSubgroup.IsCommutative H] : AddCommGroup { x // x ∈ H }

A commutative subgroup is commutative.

Equations

• AddSubgroup.IsCommutative.addCommGroup H = let src := AddSubgroup.toAddGroup H; AddCommGroup.mk (_ : ∀ (a b : { x // x ∈ H }), a + b = b + a)

instance Subgroup.IsCommutative.commGroup {G : Type u_1} [Group G] (H : Subgroup G) [h : Subgroup.IsCommutative H] : CommGroup { x // x ∈ H }

A commutative subgroup is commutative.

Equations

• Subgroup.IsCommutative.commGroup H = let src := Subgroup.toGroup H; CommGroup.mk (_ : ∀ (a b : { x // x ∈ H }), a * b = b * a)

instance Subgroup.center.isCommutative {G : Type u_1} [Group G] : Subgroup.IsCommutative (Subgroup.center G)

Equations

• @Subgroup.center.isCommutative = @Subgroup.center.isCommutative.proof_1

instance AddSubgroup.map_isCommutative {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (H : AddSubgroup G) (f : G →+ G') [AddSubgroup.IsCommutative H] : AddSubgroup.IsCommutative (AddSubgroup.map f H)

Equations

• @AddSubgroup.map_isCommutative = @AddSubgroup.map_isCommutative.proof_1

theorem AddSubgroup.map_isCommutative.proof_1 {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (H : AddSubgroup G) (f : G →+ G') [AddSubgroup.IsCommutative H] : AddSubgroup.IsCommutative (AddSubgroup.map f H)

instance Subgroup.map_isCommutative {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (H : Subgroup G) (f : G →* G') [Subgroup.IsCommutative H] : Subgroup.IsCommutative (Subgroup.map f H)

Equations

• @Subgroup.map_isCommutative = @Subgroup.map_isCommutative.proof_1

theorem AddSubgroup.comap_injective_isCommutative {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (H : AddSubgroup G) {f : G' →+ G} (hf : Function.Injective ↑f) [AddSubgroup.IsCommutative H] : AddSubgroup.IsCommutative (AddSubgroup.comap f H)

theorem Subgroup.comap_injective_isCommutative {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (H : Subgroup G) {f : G' →* G} (hf : Function.Injective ↑f) [Subgroup.IsCommutative H] : Subgroup.IsCommutative (Subgroup.comap f H)

theorem AddSubgroup.addSubgroupOf_isCommutative.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {K : AddSubgroup G} [AddSubgroup.IsCommutative H] : AddSubgroup.IsCommutative (AddSubgroup.comap (AddSubgroup.subtype K) H)

instance AddSubgroup.addSubgroupOf_isCommutative {G : Type u_1} [AddGroup G] (H : AddSubgroup G) {K : AddSubgroup G} [AddSubgroup.IsCommutative H] : AddSubgroup.IsCommutative (AddSubgroup.addSubgroupOf H K)

Equations

• @AddSubgroup.addSubgroupOf_isCommutative = @AddSubgroup.addSubgroupOf_isCommutative.proof_1

instance Subgroup.subgroupOf_isCommutative {G : Type u_1} [Group G] (H : Subgroup G) {K : Subgroup G} [Subgroup.IsCommutative H] : Subgroup.IsCommutative (Subgroup.subgroupOf H K)

Equations

• @Subgroup.subgroupOf_isCommutative = @Subgroup.subgroupOf_isCommutative.proof_1

theorem AddSubgroup.le_centralizer_iff_isCommutative {G : Type u_1} [AddGroup G] {K : AddSubgroup G} : K ≤ AddSubgroup.centralizer ↑K ↔ AddSubgroup.IsCommutative K

theorem Subgroup.le_centralizer_iff_isCommutative {G : Type u_1} [Group G] {K : Subgroup G} : K ≤ Subgroup.centralizer ↑K ↔ Subgroup.IsCommutative K

theorem AddSubgroup.le_centralizer {G : Type u_1} [AddGroup G] (H : AddSubgroup G) [h : AddSubgroup.IsCommutative H] : H ≤ AddSubgroup.centralizer ↑H

theorem Subgroup.le_centralizer {G : Type u_1} [Group G] (H : Subgroup G) [h : Subgroup.IsCommutative H] : H ≤ Subgroup.centralizer ↑H

def Group.conjugatesOfSet {G : Type u_1} [Group G] (s : Set G) : Set G

Given a set s, conjugatesOfSet s is the set of all conjugates of the elements of s.

Equations

• Group.conjugatesOfSet s = ⋃ (a : G) (_ : a ∈ s), conjugatesOf a

theorem Group.mem_conjugatesOfSet_iff {G : Type u_1} [Group G] {s : Set G} {x : G} : x ∈ Group.conjugatesOfSet s ↔ ∃ a, a ∈ s ∧ IsConj a x

theorem Group.subset_conjugatesOfSet {G : Type u_1} [Group G] {s : Set G} : s ⊆ Group.conjugatesOfSet s

theorem Group.conjugatesOfSet_mono {G : Type u_1} [Group G] {s : Set G} {t : Set G} (h : s ⊆ t) : Group.conjugatesOfSet s ⊆ Group.conjugatesOfSet t

theorem Group.conjugates_subset_normal {G : Type u_1} [Group G] {N : Subgroup G} [tn : Subgroup.Normal N] {a : G} (h : a ∈ N) : conjugatesOf a ⊆ ↑N

theorem Group.conjugatesOfSet_subset {G : Type u_1} [Group G] {s : Set G} {N : Subgroup G} [Subgroup.Normal N] (h : s ⊆ ↑N) : Group.conjugatesOfSet s ⊆ ↑N

theorem Group.conj_mem_conjugatesOfSet {G : Type u_1} [Group G] {s : Set G} {x : G} {c : G} : x ∈ Group.conjugatesOfSet s → c * x * c⁻¹ ∈ Group.conjugatesOfSet s

The set of conjugates of s is closed under conjugation.

def Subgroup.normalClosure {G : Type u_1} [Group G] (s : Set G) : Subgroup G

The normal closure of a set s is the subgroup closure of all the conjugates of elements of s. It is the smallest normal subgroup containing s.

Equations

• Subgroup.normalClosure s = Subgroup.closure (Group.conjugatesOfSet s)

theorem Subgroup.conjugatesOfSet_subset_normalClosure {G : Type u_1} [Group G] {s : Set G} : Group.conjugatesOfSet s ⊆ ↑(Subgroup.normalClosure s)

theorem Subgroup.subset_normalClosure {G : Type u_1} [Group G] {s : Set G} : s ⊆ ↑(Subgroup.normalClosure s)

theorem Subgroup.le_normalClosure {G : Type u_1} [Group G] {H : Subgroup G} : H ≤ Subgroup.normalClosure ↑H

instance Subgroup.normalClosure_normal {G : Type u_1} [Group G] {s : Set G} : Subgroup.Normal (Subgroup.normalClosure s)

The normal closure of s is a normal subgroup.

Equations

• @Subgroup.normalClosure_normal = @Subgroup.normalClosure_normal.proof_1

theorem Subgroup.normalClosure_le_normal {G : Type u_1} [Group G] {s : Set G} {N : Subgroup G} [Subgroup.Normal N] (h : s ⊆ ↑N) : Subgroup.normalClosure s ≤ N

The normal closure of s is the smallest normal subgroup containing s.

theorem Subgroup.normalClosure_subset_iff {G : Type u_1} [Group G] {s : Set G} {N : Subgroup G} [Subgroup.Normal N] : s ⊆ ↑N ↔ Subgroup.normalClosure s ≤ N

theorem Subgroup.normalClosure_mono {G : Type u_1} [Group G] {s : Set G} {t : Set G} (h : s ⊆ t) : Subgroup.normalClosure s ≤ Subgroup.normalClosure t

theorem Subgroup.normalClosure_eq_iInf {G : Type u_1} [Group G] {s : Set G} : Subgroup.normalClosure s = ⨅ (N : Subgroup G) (_ : Subgroup.Normal N) (_ : s ⊆ ↑N), N

@[simp]

theorem Subgroup.normalClosure_eq_self {G : Type u_1} [Group G] (H : Subgroup G) [Subgroup.Normal H] : Subgroup.normalClosure ↑H = H

theorem Subgroup.normalClosure_idempotent {G : Type u_1} [Group G] {s : Set G} : Subgroup.normalClosure ↑(Subgroup.normalClosure s) = Subgroup.normalClosure s

theorem Subgroup.closure_le_normalClosure {G : Type u_1} [Group G] {s : Set G} : Subgroup.closure s ≤ Subgroup.normalClosure s

@[simp]

theorem Subgroup.normalClosure_closure_eq_normalClosure {G : Type u_1} [Group G] {s : Set G} : Subgroup.normalClosure ↑(Subgroup.closure s) = Subgroup.normalClosure s

def Subgroup.normalCore {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup G

The normal core of a subgroup H is the largest normal subgroup of G contained in H, as shown by Subgroup.normalCore_eq_iSup.

Equations

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

theorem Subgroup.normalCore_le {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.normalCore H ≤ H

instance Subgroup.normalCore_normal {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.Normal (Subgroup.normalCore H)

Equations

• @Subgroup.normalCore_normal = @Subgroup.normalCore_normal.proof_1

theorem Subgroup.normal_le_normalCore {G : Type u_1} [Group G] {H : Subgroup G} {N : Subgroup G} [hN : Subgroup.Normal N] : N ≤ Subgroup.normalCore H ↔ N ≤ H

theorem Subgroup.normalCore_mono {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) : Subgroup.normalCore H ≤ Subgroup.normalCore K

theorem Subgroup.normalCore_eq_iSup {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.normalCore H = ⨆ (N : Subgroup G) (_ : Subgroup.Normal N) (_ : N ≤ H), N

@[simp]

theorem Subgroup.normalCore_eq_self {G : Type u_1} [Group G] (H : Subgroup G) [Subgroup.Normal H] : Subgroup.normalCore H = H

theorem Subgroup.normalCore_idempotent {G : Type u_1} [Group G] (H : Subgroup G) : Subgroup.normalCore (Subgroup.normalCore H) = Subgroup.normalCore H

def AddMonoidHom.range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddSubgroup N

The range of an AddMonoidHom from an AddGroup is an AddSubgroup.

Equations

• AddMonoidHom.range f = AddSubgroup.copy (AddSubgroup.map f ⊤) (Set.range ↑f) (_ : Set.range ↑f = ↑f '' ↑⊤)

theorem AddMonoidHom.range.proof_1 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] (f : G →+ N) : Set.range ↑f = ↑f '' ↑⊤

def MonoidHom.range {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Subgroup N

The range of a monoid homomorphism from a group is a subgroup.

Equations

• MonoidHom.range f = Subgroup.copy (Subgroup.map f ⊤) (Set.range ↑f) (_ : Set.range ↑f = ↑f '' ↑⊤)

@[simp]

theorem AddMonoidHom.coe_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : ↑(AddMonoidHom.range f) = Set.range ↑f

@[simp]

theorem MonoidHom.coe_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : ↑(MonoidHom.range f) = Set.range ↑f

@[simp]

theorem AddMonoidHom.mem_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {y : N} : y ∈ AddMonoidHom.range f ↔ ∃ x, ↑f x = y

@[simp]

theorem MonoidHom.mem_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {y : N} : y ∈ MonoidHom.range f ↔ ∃ x, ↑f x = y

theorem AddMonoidHom.range_eq_map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddMonoidHom.range f = AddSubgroup.map f ⊤

theorem MonoidHom.range_eq_map {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : MonoidHom.range f = Subgroup.map f ⊤

@[simp]

theorem AddMonoidHom.restrict_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (K : AddSubgroup G) (f : G →+ N) : AddMonoidHom.range (AddMonoidHom.restrict f K) = AddSubgroup.map f K

@[simp]

theorem MonoidHom.restrict_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] (K : Subgroup G) (f : G →* N) : MonoidHom.range (MonoidHom.restrict f K) = Subgroup.map f K

theorem AddMonoidHom.rangeRestrict.proof_1 {N : Type u_1} [AddGroup N] : AddSubmonoidClass (AddSubgroup N) N

theorem AddMonoidHom.rangeRestrict.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (f : G →+ N) (x : G) : ∃ y, ↑f y = ↑f x

def AddMonoidHom.rangeRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : G →+ { x // x ∈ AddMonoidHom.range f }

The canonical surjective AddGroup homomorphism G →+ f(G) induced by a group homomorphism G →+ N.

Equations

• AddMonoidHom.rangeRestrict f = AddMonoidHom.codRestrict f (AddMonoidHom.range f) (_ : ∀ (x : G), ∃ y, ↑f y = ↑f x)

def MonoidHom.rangeRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : G →* { x // x ∈ MonoidHom.range f }

The canonical surjective group homomorphism G →* f(G) induced by a group homomorphism G →* N.

Equations

• MonoidHom.rangeRestrict f = MonoidHom.codRestrict f (MonoidHom.range f) (_ : ∀ (x : G), ∃ y, ↑f y = ↑f x)

@[simp]

theorem AddMonoidHom.coe_rangeRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (g : G) : ↑(↑(AddMonoidHom.rangeRestrict f) g) = ↑f g

@[simp]

theorem MonoidHom.coe_rangeRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (g : G) : ↑(↑(MonoidHom.rangeRestrict f) g) = ↑f g

theorem AddMonoidHom.coe_comp_rangeRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : Subtype.val ∘ ↑(AddMonoidHom.rangeRestrict f) = ↑f

theorem MonoidHom.coe_comp_rangeRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Subtype.val ∘ ↑(MonoidHom.rangeRestrict f) = ↑f

theorem AddMonoidHom.subtype_comp_rangeRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddMonoidHom.comp (AddSubgroup.subtype (AddMonoidHom.range f)) (AddMonoidHom.rangeRestrict f) = f

theorem MonoidHom.subtype_comp_rangeRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : MonoidHom.comp (Subgroup.subtype (MonoidHom.range f)) (MonoidHom.rangeRestrict f) = f

theorem AddMonoidHom.rangeRestrict_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : Function.Surjective ↑(AddMonoidHom.rangeRestrict f)

abbrev AddMonoidHom.rangeRestrict_surjective.match_1 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] (f : G →+ N) (motive : { x // x ∈ AddMonoidHom.range f } → Prop) : (x : { x // x ∈ AddMonoidHom.range f }) → ((g : G) → motive { val := ↑f g, property := (_ : ∃ y, ↑f y = ↑f g) }) → motive x

Equations

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

theorem MonoidHom.rangeRestrict_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Function.Surjective ↑(MonoidHom.rangeRestrict f)

@[simp]

theorem AddMonoidHom.rangeRestrict_injective_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} : Function.Injective ↑(AddMonoidHom.rangeRestrict f) ↔ Function.Injective ↑f

@[simp]

theorem MonoidHom.rangeRestrict_injective_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} : Function.Injective ↑(MonoidHom.rangeRestrict f) ↔ Function.Injective ↑f

theorem AddMonoidHom.map_range {G : Type u_1} [AddGroup G] {N : Type u_5} {P : Type u_6} [AddGroup N] [AddGroup P] (g : N →+ P) (f : G →+ N) : AddSubgroup.map g (AddMonoidHom.range f) = AddMonoidHom.range (AddMonoidHom.comp g f)

theorem MonoidHom.map_range {G : Type u_1} [Group G] {N : Type u_5} {P : Type u_6} [Group N] [Group P] (g : N →* P) (f : G →* N) : Subgroup.map g (MonoidHom.range f) = MonoidHom.range (MonoidHom.comp g f)

theorem AddMonoidHom.range_top_iff_surjective {G : Type u_1} [AddGroup G] {N : Type u_7} [AddGroup N] {f : G →+ N} : AddMonoidHom.range f = ⊤ ↔ Function.Surjective ↑f

theorem MonoidHom.range_top_iff_surjective {G : Type u_1} [Group G] {N : Type u_7} [Group N] {f : G →* N} : MonoidHom.range f = ⊤ ↔ Function.Surjective ↑f

@[simp]

theorem AddMonoidHom.range_top_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_7} [AddGroup N] (f : G →+ N) (hf : Function.Surjective ↑f) : AddMonoidHom.range f = ⊤

The range of a surjective AddMonoid homomorphism is the whole of the codomain.

@[simp]

theorem MonoidHom.range_top_of_surjective {G : Type u_1} [Group G] {N : Type u_7} [Group N] (f : G →* N) (hf : Function.Surjective ↑f) : MonoidHom.range f = ⊤

The range of a surjective monoid homomorphism is the whole of the codomain.

@[simp]

theorem AddMonoidHom.range_zero {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] : AddMonoidHom.range 0 = ⊥

@[simp]

theorem MonoidHom.range_one {G : Type u_1} [Group G] {N : Type u_5} [Group N] : MonoidHom.range 1 = ⊥

@[simp]

theorem AddSubgroup.subtype_range {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddMonoidHom.range (AddSubgroup.subtype H) = H

@[simp]

theorem Subgroup.subtype_range {G : Type u_1} [Group G] (H : Subgroup G) : MonoidHom.range (Subgroup.subtype H) = H

@[simp]

theorem AddSubgroup.inclusion_range {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h_le : H ≤ K) : AddMonoidHom.range (AddSubgroup.inclusion h_le) = AddSubgroup.addSubgroupOf H K

@[simp]

theorem Subgroup.inclusion_range {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h_le : H ≤ K) : MonoidHom.range (Subgroup.inclusion h_le) = Subgroup.subgroupOf H K

theorem AddMonoidHom.addSubgroupOf_range_eq_of_le {G₁ : Type u_7} {G₂ : Type u_8} [AddGroup G₁] [AddGroup G₂] {K : AddSubgroup G₂} (f : G₁ →+ G₂) (h : AddMonoidHom.range f ≤ K) : AddSubgroup.addSubgroupOf (AddMonoidHom.range f) K = AddMonoidHom.range (AddMonoidHom.codRestrict f K fun x => h (↑f x) (_ : ∃ y, ↑f y = ↑f x))

theorem MonoidHom.subgroupOf_range_eq_of_le {G₁ : Type u_7} {G₂ : Type u_8} [Group G₁] [Group G₂] {K : Subgroup G₂} (f : G₁ →* G₂) (h : MonoidHom.range f ≤ K) : Subgroup.subgroupOf (MonoidHom.range f) K = MonoidHom.range (MonoidHom.codRestrict f K fun x => h (↑f x) (_ : ∃ y, ↑f y = ↑f x))

def AddMonoidHom.ofLeftInverse {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {g : N →+ G} (h : Function.LeftInverse ↑g ↑f) : G ≃+ { x // x ∈ AddMonoidHom.range f }

Computable alternative to AddMonoidHom.ofInjective.

Equations

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

theorem AddMonoidHom.ofLeftInverse.proof_1 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] {f : G →+ N} {g : N →+ G} (h : Function.LeftInverse ↑g ↑f) : ∀ (x : { x // x ∈ AddMonoidHom.range f }), ↑(AddMonoidHom.rangeRestrict f) ((↑g ∘ ↑(AddSubgroup.subtype (AddMonoidHom.range f))) x) = x

theorem AddMonoidHom.ofLeftInverse.proof_2 {G : Type u_2} [AddGroup G] {N : Type u_1} [AddGroup N] {f : G →+ N} (x : G) (y : G) : ZeroHom.toFun (↑(AddMonoidHom.rangeRestrict f)) (x + y) = ZeroHom.toFun (↑(AddMonoidHom.rangeRestrict f)) x + ZeroHom.toFun (↑(AddMonoidHom.rangeRestrict f)) y

def MonoidHom.ofLeftInverse {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {g : N →* G} (h : Function.LeftInverse ↑g ↑f) : G ≃* { x // x ∈ MonoidHom.range f }

Computable alternative to MonoidHom.ofInjective.

Equations

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

@[simp]

theorem AddMonoidHom.ofLeftInverse_apply {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {g : N →+ G} (h : Function.LeftInverse ↑g ↑f) (x : G) : ↑(↑(AddMonoidHom.ofLeftInverse h) x) = ↑f x

@[simp]

theorem MonoidHom.ofLeftInverse_apply {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {g : N →* G} (h : Function.LeftInverse ↑g ↑f) (x : G) : ↑(↑(MonoidHom.ofLeftInverse h) x) = ↑f x

@[simp]

theorem AddMonoidHom.ofLeftInverse_symm_apply {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {g : N →+ G} (h : Function.LeftInverse ↑g ↑f) (x : { x // x ∈ AddMonoidHom.range f }) : ↑(AddEquiv.symm (AddMonoidHom.ofLeftInverse h)) x = ↑g ↑x

@[simp]

theorem MonoidHom.ofLeftInverse_symm_apply {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {g : N →* G} (h : Function.LeftInverse ↑g ↑f) (x : { x // x ∈ MonoidHom.range f }) : ↑(MulEquiv.symm (MonoidHom.ofLeftInverse h)) x = ↑g ↑x

theorem AddMonoidHom.ofInjective.proof_1 {N : Type u_1} [AddGroup N] : AddSubmonoidClass (AddSubgroup N) N

theorem AddMonoidHom.ofInjective.proof_3 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) : Function.Injective ↑(AddMonoidHom.codRestrict f (AddMonoidHom.range f) (_ : ∀ (x : G), ∃ y, ↑f y = ↑f x)) ∧ Function.Surjective ↑(AddMonoidHom.codRestrict f (AddMonoidHom.range f) (_ : ∀ (x : G), ∃ y, ↑f y = ↑f x))

theorem AddMonoidHom.ofInjective.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] {f : G →+ N} (x : G) : ∃ y, ↑f y = ↑f x

noncomputable def AddMonoidHom.ofInjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) : G ≃+ { x // x ∈ AddMonoidHom.range f }

The range of an injective additive group homomorphism is isomorphic to its domain.

Equations

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

noncomputable def MonoidHom.ofInjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (hf : Function.Injective ↑f) : G ≃* { x // x ∈ MonoidHom.range f }

The range of an injective group homomorphism is isomorphic to its domain.

Equations

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

theorem AddMonoidHom.ofInjective_apply {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) {x : G} : ↑(↑(AddMonoidHom.ofInjective hf) x) = ↑f x

theorem MonoidHom.ofInjective_apply {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (hf : Function.Injective ↑f) {x : G} : ↑(↑(MonoidHom.ofInjective hf) x) = ↑f x

@[simp]

theorem AddMonoidHom.apply_ofInjective_symm {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) (x : { x // x ∈ AddMonoidHom.range f }) : ↑f (↑(AddEquiv.symm (AddMonoidHom.ofInjective hf)) x) = ↑x

@[simp]

theorem MonoidHom.apply_ofInjective_symm {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (hf : Function.Injective ↑f) (x : { x // x ∈ MonoidHom.range f }) : ↑f (↑(MulEquiv.symm (MonoidHom.ofInjective hf)) x) = ↑x

theorem AddMonoidHom.ker.proof_2 {G : Type u_2} [AddGroup G] {M : Type u_1} [AddZeroClass M] (f : G →+ M) {x : G} (hx : ↑f x = 0) : ↑f (-x) = 0

def AddMonoidHom.ker {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) : AddSubgroup G

The additive kernel of an AddMonoid homomorphism is the AddSubgroup of elements such that f x = 0

Equations

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

theorem AddMonoidHom.ker.proof_1 {G : Type u_1} [AddGroup G] {M : Type u_2} [AddZeroClass M] (f : G →+ M) : 0 ∈ (AddMonoidHom.mker f).toAddSubsemigroup.carrier

def MonoidHom.ker {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) : Subgroup G

The multiplicative kernel of a monoid homomorphism is the subgroup of elements x : G such that f x = 1

Equations

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

theorem AddMonoidHom.mem_ker {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) {x : G} : x ∈ AddMonoidHom.ker f ↔ ↑f x = 0

theorem MonoidHom.mem_ker {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) {x : G} : x ∈ MonoidHom.ker f ↔ ↑f x = 1

theorem AddMonoidHom.coe_ker {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) : ↑(AddMonoidHom.ker f) = ↑f ⁻¹' {0}

theorem MonoidHom.coe_ker {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) : ↑(MonoidHom.ker f) = ↑f ⁻¹' {1}

@[simp]

theorem AddMonoidHom.ker_toHomAddUnits {G : Type u_1} [AddGroup G] {M : Type u_8} [AddMonoid M] (f : G →+ M) : AddMonoidHom.ker (AddMonoidHom.toHomAddUnits f) = AddMonoidHom.ker f

@[simp]

theorem MonoidHom.ker_toHomUnits {G : Type u_1} [Group G] {M : Type u_8} [Monoid M] (f : G →* M) : MonoidHom.ker (MonoidHom.toHomUnits f) = MonoidHom.ker f

theorem AddMonoidHom.eq_iff {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) {x : G} {y : G} : ↑f x = ↑f y ↔ -y + x ∈ AddMonoidHom.ker f

theorem MonoidHom.eq_iff {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) {x : G} {y : G} : ↑f x = ↑f y ↔ y⁻¹ * x ∈ MonoidHom.ker f

instance AddMonoidHom.decidableMemKer {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] [DecidableEq M] (f : G →+ M) : DecidablePred fun x => x ∈ AddMonoidHom.ker f

Equations

• AddMonoidHom.decidableMemKer f x = decidable_of_iff (↑f x = 0) (_ : x ∈ AddMonoidHom.ker f ↔ ↑f x = 0)

instance MonoidHom.decidableMemKer {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] [DecidableEq M] (f : G →* M) : DecidablePred fun x => x ∈ MonoidHom.ker f

Equations

• MonoidHom.decidableMemKer f x = decidable_of_iff (↑f x = 1) (_ : x ∈ MonoidHom.ker f ↔ ↑f x = 1)

theorem AddMonoidHom.comap_ker {G : Type u_1} [AddGroup G] {N : Type u_5} {P : Type u_6} [AddGroup N] [AddGroup P] (g : N →+ P) (f : G →+ N) : AddSubgroup.comap f (AddMonoidHom.ker g) = AddMonoidHom.ker (AddMonoidHom.comp g f)

theorem MonoidHom.comap_ker {G : Type u_1} [Group G] {N : Type u_5} {P : Type u_6} [Group N] [Group P] (g : N →* P) (f : G →* N) : Subgroup.comap f (MonoidHom.ker g) = MonoidHom.ker (MonoidHom.comp g f)

@[simp]

theorem AddMonoidHom.comap_bot {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddSubgroup.comap f ⊥ = AddMonoidHom.ker f

@[simp]

theorem MonoidHom.comap_bot {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : Subgroup.comap f ⊥ = MonoidHom.ker f

@[simp]

theorem AddMonoidHom.ker_restrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (K : AddSubgroup G) (f : G →+ N) : AddMonoidHom.ker (AddMonoidHom.restrict f K) = AddSubgroup.addSubgroupOf (AddMonoidHom.ker f) K

@[simp]

theorem MonoidHom.ker_restrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (K : Subgroup G) (f : G →* N) : MonoidHom.ker (MonoidHom.restrict f K) = Subgroup.subgroupOf (MonoidHom.ker f) K

@[simp]

theorem AddMonoidHom.ker_codRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {S : Type u_8} [SetLike S N] [AddSubmonoidClass S N] (f : G →+ N) (s : S) (h : ∀ (x : G), ↑f x ∈ s) : AddMonoidHom.ker (AddMonoidHom.codRestrict f s h) = AddMonoidHom.ker f

@[simp]

theorem MonoidHom.ker_codRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] {S : Type u_8} [SetLike S N] [SubmonoidClass S N] (f : G →* N) (s : S) (h : ∀ (x : G), ↑f x ∈ s) : MonoidHom.ker (MonoidHom.codRestrict f s h) = MonoidHom.ker f

@[simp]

theorem AddMonoidHom.ker_rangeRestrict {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddMonoidHom.ker (AddMonoidHom.rangeRestrict f) = AddMonoidHom.ker f

@[simp]

theorem MonoidHom.ker_rangeRestrict {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : MonoidHom.ker (MonoidHom.rangeRestrict f) = MonoidHom.ker f

@[simp]

theorem AddMonoidHom.ker_zero {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] : AddMonoidHom.ker 0 = ⊤

@[simp]

theorem MonoidHom.ker_one {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] : MonoidHom.ker 1 = ⊤

@[simp]

theorem AddMonoidHom.ker_id {G : Type u_1} [AddGroup G] : AddMonoidHom.ker (AddMonoidHom.id G) = ⊥

@[simp]

theorem MonoidHom.ker_id {G : Type u_1} [Group G] : MonoidHom.ker (MonoidHom.id G) = ⊥

theorem AddMonoidHom.ker_eq_bot_iff {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) : AddMonoidHom.ker f = ⊥ ↔ Function.Injective ↑f

theorem MonoidHom.ker_eq_bot_iff {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) : MonoidHom.ker f = ⊥ ↔ Function.Injective ↑f

@[simp]

theorem AddSubgroup.ker_subtype {G : Type u_1} [AddGroup G] (H : AddSubgroup G) : AddMonoidHom.ker (AddSubgroup.subtype H) = ⊥

@[simp]

theorem Subgroup.ker_subtype {G : Type u_1} [Group G] (H : Subgroup G) : MonoidHom.ker (Subgroup.subtype H) = ⊥

@[simp]

theorem AddSubgroup.ker_inclusion {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H ≤ K) : AddMonoidHom.ker (AddSubgroup.inclusion h) = ⊥

@[simp]

theorem Subgroup.ker_inclusion {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H ≤ K) : MonoidHom.ker (Subgroup.inclusion h) = ⊥

theorem AddMonoidHom.sumMap_comap_sum {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {G' : Type u_8} {N' : Type u_9} [AddGroup G'] [AddGroup N'] (f : G →+ N) (g : G' →+ N') (S : AddSubgroup N) (S' : AddSubgroup N') : AddSubgroup.comap (AddMonoidHom.prodMap f g) (AddSubgroup.prod S S') = AddSubgroup.prod (AddSubgroup.comap f S) (AddSubgroup.comap g S')

theorem MonoidHom.prodMap_comap_prod {G : Type u_1} [Group G] {N : Type u_5} [Group N] {G' : Type u_8} {N' : Type u_9} [Group G'] [Group N'] (f : G →* N) (g : G' →* N') (S : Subgroup N) (S' : Subgroup N') : Subgroup.comap (MonoidHom.prodMap f g) (Subgroup.prod S S') = Subgroup.prod (Subgroup.comap f S) (Subgroup.comap g S')

theorem AddMonoidHom.ker_sumMap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {G' : Type u_8} {N' : Type u_9} [AddGroup G'] [AddGroup N'] (f : G →+ N) (g : G' →+ N') : AddMonoidHom.ker (AddMonoidHom.prodMap f g) = AddSubgroup.prod (AddMonoidHom.ker f) (AddMonoidHom.ker g)

theorem MonoidHom.ker_prodMap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {G' : Type u_8} {N' : Type u_9} [Group G'] [Group N'] (f : G →* N) (g : G' →* N') : MonoidHom.ker (MonoidHom.prodMap f g) = Subgroup.prod (MonoidHom.ker f) (MonoidHom.ker g)

theorem AddMonoidHom.range_le_ker_iff {G : Type u_1} {G' : Type u_2} {G'' : Type u_3} [AddGroup G] [AddGroup G'] [AddGroup G''] (f : G →+ G') (g : G' →+ G'') : AddMonoidHom.range f ≤ AddMonoidHom.ker g ↔ AddMonoidHom.comp g f = 0

theorem MonoidHom.range_le_ker_iff {G : Type u_1} {G' : Type u_2} {G'' : Type u_3} [Group G] [Group G'] [Group G''] (f : G →* G') (g : G' →* G'') : MonoidHom.range f ≤ MonoidHom.ker g ↔ MonoidHom.comp g f = 1

instance AddMonoidHom.normal_ker {G : Type u_1} [AddGroup G] {M : Type u_7} [AddZeroClass M] (f : G →+ M) : AddSubgroup.Normal (AddMonoidHom.ker f)

Equations

• @AddMonoidHom.normal_ker = @AddMonoidHom.normal_ker.proof_1

theorem AddMonoidHom.normal_ker.proof_1 {G : Type u_1} [AddGroup G] {M : Type u_2} [AddZeroClass M] (f : G →+ M) : AddSubgroup.Normal (AddMonoidHom.ker f)

instance MonoidHom.normal_ker {G : Type u_1} [Group G] {M : Type u_7} [MulOneClass M] (f : G →* M) : Subgroup.Normal (MonoidHom.ker f)

Equations

• @MonoidHom.normal_ker = @MonoidHom.normal_ker.proof_1

@[simp]

theorem AddMonoidHom.ker_fst {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] : AddMonoidHom.ker (AddMonoidHom.fst G G') = AddSubgroup.prod ⊥ ⊤

@[simp]

theorem MonoidHom.ker_fst {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] : MonoidHom.ker (MonoidHom.fst G G') = Subgroup.prod ⊥ ⊤

@[simp]

theorem AddMonoidHom.ker_snd {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] : AddMonoidHom.ker (AddMonoidHom.snd G G') = AddSubgroup.prod ⊤ ⊥

@[simp]

theorem MonoidHom.ker_snd {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] : MonoidHom.ker (MonoidHom.snd G G') = Subgroup.prod ⊤ ⊥

theorem AddMonoidHom.eqLocus.proof_1 {G : Type u_1} [AddGroup G] {M : Type u_2} [AddMonoid M] (f : G →+ M) (g : G →+ M) : 0 ∈ (AddMonoidHom.eqLocusM f g).toAddSubsemigroup.carrier

theorem AddMonoidHom.eqLocus.proof_2 {G : Type u_2} [AddGroup G] {M : Type u_1} [AddMonoid M] (f : G →+ M) (g : G →+ M) : ∀ {x : G}, ↑f x = ↑g x → ↑f (-x) = ↑g (-x)

def AddMonoidHom.eqLocus {G : Type u_1} [AddGroup G] {M : Type u_7} [AddMonoid M] (f : G →+ M) (g : G →+ M) : AddSubgroup G

The additive subgroup of elements x : G such that f x = g x

Equations

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

def MonoidHom.eqLocus {G : Type u_1} [Group G] {M : Type u_7} [Monoid M] (f : G →* M) (g : G →* M) : Subgroup G

The subgroup of elements x : G such that f x = g x

Equations

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

@[simp]

theorem AddMonoidHom.eqLocus_same {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) : AddMonoidHom.eqLocus f f = ⊤

@[simp]

theorem MonoidHom.eqLocus_same {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) : MonoidHom.eqLocus f f = ⊤

theorem AddMonoidHom.eqOn_closure {G : Type u_1} [AddGroup G] {M : Type u_7} [AddMonoid M] {f : G →+ M} {g : G →+ M} {s : Set G} (h : Set.EqOn (↑f) (↑g) s) : Set.EqOn ↑f ↑g ↑(AddSubgroup.closure s)

If two monoid homomorphisms are equal on a set, then they are equal on its subgroup closure.

theorem MonoidHom.eqOn_closure {G : Type u_1} [Group G] {M : Type u_7} [Monoid M] {f : G →* M} {g : G →* M} {s : Set G} (h : Set.EqOn (↑f) (↑g) s) : Set.EqOn ↑f ↑g ↑(Subgroup.closure s)

If two monoid homomorphisms are equal on a set, then they are equal on its subgroup closure.

theorem AddMonoidHom.eq_of_eqOn_top {G : Type u_1} [AddGroup G] {M : Type u_7} [AddMonoid M] {f : G →+ M} {g : G →+ M} (h : Set.EqOn ↑f ↑g ↑⊤) : f = g

theorem MonoidHom.eq_of_eqOn_top {G : Type u_1} [Group G] {M : Type u_7} [Monoid M] {f : G →* M} {g : G →* M} (h : Set.EqOn ↑f ↑g ↑⊤) : f = g

theorem AddMonoidHom.eq_of_eqOn_dense {G : Type u_1} [AddGroup G] {M : Type u_7} [AddMonoid M] {s : Set G} (hs : AddSubgroup.closure s = ⊤) {f : G →+ M} {g : G →+ M} (h : Set.EqOn (↑f) (↑g) s) : f = g

theorem MonoidHom.eq_of_eqOn_dense {G : Type u_1} [Group G] {M : Type u_7} [Monoid M] {s : Set G} (hs : Subgroup.closure s = ⊤) {f : G →* M} {g : G →* M} (h : Set.EqOn (↑f) (↑g) s) : f = g

theorem AddMonoidHom.closure_preimage_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (s : Set N) : AddSubgroup.closure (↑f ⁻¹' s) ≤ AddSubgroup.comap f (AddSubgroup.closure s)

theorem MonoidHom.closure_preimage_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (s : Set N) : Subgroup.closure (↑f ⁻¹' s) ≤ Subgroup.comap f (Subgroup.closure s)

theorem AddMonoidHom.map_closure {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (s : Set G) : AddSubgroup.map f (AddSubgroup.closure s) = AddSubgroup.closure (↑f '' s)

The image under an AddMonoid hom of the AddSubgroup generated by a set equals the AddSubgroup generated by the image of the set.

theorem MonoidHom.map_closure {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (s : Set G) : Subgroup.map f (Subgroup.closure s) = Subgroup.closure (↑f '' s)

The image under a monoid homomorphism of the subgroup generated by a set equals the subgroup generated by the image of the set.

theorem AddSubgroup.Normal.map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup G} (h : AddSubgroup.Normal H) (f : G →+ N) (hf : Function.Surjective ↑f) : AddSubgroup.Normal (AddSubgroup.map f H)

theorem Subgroup.Normal.map {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup G} (h : Subgroup.Normal H) (f : G →* N) (hf : Function.Surjective ↑f) : Subgroup.Normal (Subgroup.map f H)

theorem AddSubgroup.map_eq_bot_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) {f : G →+ N} : AddSubgroup.map f H = ⊥ ↔ H ≤ AddMonoidHom.ker f

theorem Subgroup.map_eq_bot_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) {f : G →* N} : Subgroup.map f H = ⊥ ↔ H ≤ MonoidHom.ker f

theorem AddSubgroup.map_eq_bot_iff_of_injective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) {f : G →+ N} (hf : Function.Injective ↑f) : AddSubgroup.map f H = ⊥ ↔ H = ⊥

theorem Subgroup.map_eq_bot_iff_of_injective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) {f : G →* N} (hf : Function.Injective ↑f) : Subgroup.map f H = ⊥ ↔ H = ⊥

theorem AddSubgroup.map_le_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : AddSubgroup.map f H ≤ AddMonoidHom.range f

theorem Subgroup.map_le_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup G) : Subgroup.map f H ≤ MonoidHom.range f

theorem AddSubgroup.map_subtype_le {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (K : AddSubgroup { x // x ∈ H }) : AddSubgroup.map (AddSubgroup.subtype H) K ≤ H

theorem Subgroup.map_subtype_le {G : Type u_1} [Group G] {H : Subgroup G} (K : Subgroup { x // x ∈ H }) : Subgroup.map (Subgroup.subtype H) K ≤ H

theorem AddSubgroup.ker_le_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : AddMonoidHom.ker f ≤ AddSubgroup.comap f H

theorem Subgroup.ker_le_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup N) : MonoidHom.ker f ≤ Subgroup.comap f H

theorem AddSubgroup.map_comap_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : AddSubgroup.map f (AddSubgroup.comap f H) ≤ H

theorem Subgroup.map_comap_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup N) : Subgroup.map f (Subgroup.comap f H) ≤ H

theorem AddSubgroup.le_comap_map {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : H ≤ AddSubgroup.comap f (AddSubgroup.map f H)

theorem Subgroup.le_comap_map {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup G) : H ≤ Subgroup.comap f (Subgroup.map f H)

theorem AddSubgroup.map_comap_eq {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) : AddSubgroup.map f (AddSubgroup.comap f H) = AddMonoidHom.range f ⊓ H

theorem Subgroup.map_comap_eq {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup N) : Subgroup.map f (Subgroup.comap f H) = MonoidHom.range f ⊓ H

theorem AddSubgroup.comap_map_eq {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup G) : AddSubgroup.comap f (AddSubgroup.map f H) = H ⊔ AddMonoidHom.ker f

theorem Subgroup.comap_map_eq {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup G) : Subgroup.comap f (Subgroup.map f H) = H ⊔ MonoidHom.ker f

theorem AddSubgroup.map_comap_eq_self {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup N} (h : H ≤ AddMonoidHom.range f) : AddSubgroup.map f (AddSubgroup.comap f H) = H

theorem Subgroup.map_comap_eq_self {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup N} (h : H ≤ MonoidHom.range f) : Subgroup.map f (Subgroup.comap f H) = H

theorem AddSubgroup.map_comap_eq_self_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (h : Function.Surjective ↑f) (H : AddSubgroup N) : AddSubgroup.map f (AddSubgroup.comap f H) = H

theorem Subgroup.map_comap_eq_self_of_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (h : Function.Surjective ↑f) (H : Subgroup N) : Subgroup.map f (Subgroup.comap f H) = H

theorem AddSubgroup.comap_le_comap_of_le_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup N} {L : AddSubgroup N} (hf : K ≤ AddMonoidHom.range f) : AddSubgroup.comap f K ≤ AddSubgroup.comap f L ↔ K ≤ L

theorem Subgroup.comap_le_comap_of_le_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup N} {L : Subgroup N} (hf : K ≤ MonoidHom.range f) : Subgroup.comap f K ≤ Subgroup.comap f L ↔ K ≤ L

theorem AddSubgroup.comap_le_comap_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup N} {L : AddSubgroup N} (hf : Function.Surjective ↑f) : AddSubgroup.comap f K ≤ AddSubgroup.comap f L ↔ K ≤ L

theorem Subgroup.comap_le_comap_of_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup N} {L : Subgroup N} (hf : Function.Surjective ↑f) : Subgroup.comap f K ≤ Subgroup.comap f L ↔ K ≤ L

theorem AddSubgroup.comap_lt_comap_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {K : AddSubgroup N} {L : AddSubgroup N} (hf : Function.Surjective ↑f) : AddSubgroup.comap f K < AddSubgroup.comap f L ↔ K < L

theorem Subgroup.comap_lt_comap_of_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {K : Subgroup N} {L : Subgroup N} (hf : Function.Surjective ↑f) : Subgroup.comap f K < Subgroup.comap f L ↔ K < L

theorem AddSubgroup.comap_injective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (h : Function.Surjective ↑f) : Function.Injective (AddSubgroup.comap f)

theorem Subgroup.comap_injective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (h : Function.Surjective ↑f) : Function.Injective (Subgroup.comap f)

theorem AddSubgroup.comap_map_eq_self {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup G} (h : AddMonoidHom.ker f ≤ H) : AddSubgroup.comap f (AddSubgroup.map f H) = H

theorem Subgroup.comap_map_eq_self {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup G} (h : MonoidHom.ker f ≤ H) : Subgroup.comap f (Subgroup.map f H) = H

theorem AddSubgroup.comap_map_eq_self_of_injective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (h : Function.Injective ↑f) (H : AddSubgroup G) : AddSubgroup.comap f (AddSubgroup.map f H) = H

theorem Subgroup.comap_map_eq_self_of_injective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (h : Function.Injective ↑f) (H : Subgroup G) : Subgroup.comap f (Subgroup.map f H) = H

theorem AddSubgroup.map_le_map_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.map f H ≤ AddSubgroup.map f K ↔ H ≤ K ⊔ AddMonoidHom.ker f

theorem Subgroup.map_le_map_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup G} {K : Subgroup G} : Subgroup.map f H ≤ Subgroup.map f K ↔ H ≤ K ⊔ MonoidHom.ker f

theorem AddSubgroup.map_le_map_iff' {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.map f H ≤ AddSubgroup.map f K ↔ H ⊔ AddMonoidHom.ker f ≤ K ⊔ AddMonoidHom.ker f

theorem Subgroup.map_le_map_iff' {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup G} {K : Subgroup G} : Subgroup.map f H ≤ Subgroup.map f K ↔ H ⊔ MonoidHom.ker f ≤ K ⊔ MonoidHom.ker f

theorem AddSubgroup.map_eq_map_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.map f H = AddSubgroup.map f K ↔ H ⊔ AddMonoidHom.ker f = K ⊔ AddMonoidHom.ker f

theorem Subgroup.map_eq_map_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup G} {K : Subgroup G} : Subgroup.map f H = Subgroup.map f K ↔ H ⊔ MonoidHom.ker f = K ⊔ MonoidHom.ker f

theorem AddSubgroup.map_eq_range_iff {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {H : AddSubgroup G} : AddSubgroup.map f H = AddMonoidHom.range f ↔ Codisjoint H (AddMonoidHom.ker f)

theorem Subgroup.map_eq_range_iff {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {H : Subgroup G} : Subgroup.map f H = MonoidHom.range f ↔ Codisjoint H (MonoidHom.ker f)

theorem AddSubgroup.map_le_map_iff_of_injective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (hf : Function.Injective ↑f) {H : AddSubgroup G} {K : AddSubgroup G} : AddSubgroup.map f H ≤ AddSubgroup.map f K ↔ H ≤ K

theorem Subgroup.map_le_map_iff_of_injective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (hf : Function.Injective ↑f) {H : Subgroup G} {K : Subgroup G} : Subgroup.map f H ≤ Subgroup.map f K ↔ H ≤ K

@[simp]

theorem AddSubgroup.map_subtype_le_map_subtype {G : Type u_1} [AddGroup G] {G' : AddSubgroup G} {H : AddSubgroup { x // x ∈ G' }} {K : AddSubgroup { x // x ∈ G' }} : AddSubgroup.map (AddSubgroup.subtype G') H ≤ AddSubgroup.map (AddSubgroup.subtype G') K ↔ H ≤ K

@[simp]

theorem Subgroup.map_subtype_le_map_subtype {G : Type u_1} [Group G] {G' : Subgroup G} {H : Subgroup { x // x ∈ G' }} {K : Subgroup { x // x ∈ G' }} : Subgroup.map (Subgroup.subtype G') H ≤ Subgroup.map (Subgroup.subtype G') K ↔ H ≤ K

theorem AddSubgroup.map_injective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} (h : Function.Injective ↑f) : Function.Injective (AddSubgroup.map f)

theorem Subgroup.map_injective {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} (h : Function.Injective ↑f) : Function.Injective (Subgroup.map f)

theorem AddSubgroup.map_eq_comap_of_inverse {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {f : G →+ N} {g : N →+ G} (hl : Function.LeftInverse ↑g ↑f) (hr : Function.RightInverse ↑g ↑f) (H : AddSubgroup G) : AddSubgroup.map f H = AddSubgroup.comap g H

theorem Subgroup.map_eq_comap_of_inverse {G : Type u_1} [Group G] {N : Type u_5} [Group N] {f : G →* N} {g : N →* G} (hl : Function.LeftInverse ↑g ↑f) (hr : Function.RightInverse ↑g ↑f) (H : Subgroup G) : Subgroup.map f H = Subgroup.comap g H

theorem AddSubgroup.map_injective_of_ker_le {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) {H : AddSubgroup G} {K : AddSubgroup G} (hH : AddMonoidHom.ker f ≤ H) (hK : AddMonoidHom.ker f ≤ K) (hf : AddSubgroup.map f H = AddSubgroup.map f K) : H = K

Given f(A) = f(B), ker f ≤ A, and ker f ≤ B, deduce that A = B.

theorem Subgroup.map_injective_of_ker_le {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) {H : Subgroup G} {K : Subgroup G} (hH : MonoidHom.ker f ≤ H) (hK : MonoidHom.ker f ≤ K) (hf : Subgroup.map f H = Subgroup.map f K) : H = K

Given f(A) = f(B), ker f ≤ A, and ker f ≤ B, deduce that A = B.

theorem AddSubgroup.closure_preimage_eq_top {G : Type u_1} [AddGroup G] (s : Set G) : AddSubgroup.closure (↑(AddSubgroup.subtype (AddSubgroup.closure s)) ⁻¹' s) = ⊤

theorem Subgroup.closure_preimage_eq_top {G : Type u_1} [Group G] (s : Set G) : Subgroup.closure (↑(Subgroup.subtype (Subgroup.closure s)) ⁻¹' s) = ⊤

theorem AddSubgroup.comap_sup_eq_of_le_range {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) {H : AddSubgroup N} {K : AddSubgroup N} (hH : H ≤ AddMonoidHom.range f) (hK : K ≤ AddMonoidHom.range f) : AddSubgroup.comap f H ⊔ AddSubgroup.comap f K = AddSubgroup.comap f (H ⊔ K)

theorem Subgroup.comap_sup_eq_of_le_range {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) {H : Subgroup N} {K : Subgroup N} (hH : H ≤ MonoidHom.range f) (hK : K ≤ MonoidHom.range f) : Subgroup.comap f H ⊔ Subgroup.comap f K = Subgroup.comap f (H ⊔ K)

theorem AddSubgroup.comap_sup_eq {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (f : G →+ N) (H : AddSubgroup N) (K : AddSubgroup N) (hf : Function.Surjective ↑f) : AddSubgroup.comap f H ⊔ AddSubgroup.comap f K = AddSubgroup.comap f (H ⊔ K)

theorem Subgroup.comap_sup_eq {G : Type u_1} [Group G] {N : Type u_5} [Group N] (f : G →* N) (H : Subgroup N) (K : Subgroup N) (hf : Function.Surjective ↑f) : Subgroup.comap f H ⊔ Subgroup.comap f K = Subgroup.comap f (H ⊔ K)

theorem AddSubgroup.sup_addSubgroupOf_eq {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} {L : AddSubgroup G} (hH : H ≤ L) (hK : K ≤ L) : AddSubgroup.addSubgroupOf H L ⊔ AddSubgroup.addSubgroupOf K L = AddSubgroup.addSubgroupOf (H ⊔ K) L

theorem Subgroup.sup_subgroupOf_eq {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} {L : Subgroup G} (hH : H ≤ L) (hK : K ≤ L) : Subgroup.subgroupOf H L ⊔ Subgroup.subgroupOf K L = Subgroup.subgroupOf (H ⊔ K) L

theorem AddSubgroup.codisjoint_addSubgroupOf_sup {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) : Codisjoint (AddSubgroup.addSubgroupOf H (H ⊔ K)) (AddSubgroup.addSubgroupOf K (H ⊔ K))

theorem Subgroup.codisjoint_subgroupOf_sup {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) : Codisjoint (Subgroup.subgroupOf H (H ⊔ K)) (Subgroup.subgroupOf K (H ⊔ K))

noncomputable def AddSubgroup.equivMapOfInjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) : { x // x ∈ H } ≃+ { x // x ∈ AddSubgroup.map f H }

An additive subgroup is isomorphic to its image under an injective function. If you have an isomorphism, use AddEquiv.addSubgroupMap for better definitional equalities.

Equations

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

theorem AddSubgroup.equivMapOfInjective.proof_2 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) : Function.RightInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun

theorem AddSubgroup.equivMapOfInjective.proof_3 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) : ∀ (x x_1 : { x // x ∈ H }), Equiv.toFun { toFun := (Equiv.Set.image (↑f) (↑H) hf).toFun, invFun := (Equiv.Set.image (↑f) (↑H) hf).invFun, left_inv := (_ : Function.LeftInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun), right_inv := (_ : Function.RightInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun) } (x + x_1) = Equiv.toFun { toFun := (Equiv.Set.image (↑f) (↑H) hf).toFun, invFun := (Equiv.Set.image (↑f) (↑H) hf).invFun, left_inv := (_ : Function.LeftInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun), right_inv := (_ : Function.RightInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun) } x + Equiv.toFun { toFun := (Equiv.Set.image (↑f) (↑H) hf).toFun, invFun := (Equiv.Set.image (↑f) (↑H) hf).invFun, left_inv := (_ : Function.LeftInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun), right_inv := (_ : Function.RightInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun) } x_1

theorem AddSubgroup.equivMapOfInjective.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) : Function.LeftInverse (Equiv.Set.image (↑f) (↑H) hf).invFun (Equiv.Set.image (↑f) (↑H) hf).toFun

noncomputable def Subgroup.equivMapOfInjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (f : G →* N) (hf : Function.Injective ↑f) : { x // x ∈ H } ≃* { x // x ∈ Subgroup.map f H }

A subgroup is isomorphic to its image under an injective function. If you have an isomorphism, use MulEquiv.subgroupMap for better definitional equalities.

Equations

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

@[simp]

theorem AddSubgroup.coe_equivMapOfInjective_apply {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (f : G →+ N) (hf : Function.Injective ↑f) (h : { x // x ∈ H }) : ↑(↑(AddSubgroup.equivMapOfInjective H f hf) h) = ↑f ↑h

@[simp]

theorem Subgroup.coe_equivMapOfInjective_apply {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (f : G →* N) (hf : Function.Injective ↑f) (h : { x // x ∈ H }) : ↑(↑(Subgroup.equivMapOfInjective H f hf) h) = ↑f ↑h

theorem AddSubgroup.comap_normalizer_eq_of_surjective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) {f : N →+ G} (hf : Function.Surjective ↑f) : AddSubgroup.comap f (AddSubgroup.normalizer H) = AddSubgroup.normalizer (AddSubgroup.comap f H)

The preimage of the normalizer is equal to the normalizer of the preimage of a surjective function.

theorem Subgroup.comap_normalizer_eq_of_surjective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) {f : N →* G} (hf : Function.Surjective ↑f) : Subgroup.comap f (Subgroup.normalizer H) = Subgroup.normalizer (Subgroup.comap f H)

The preimage of the normalizer is equal to the normalizer of the preimage of a surjective function.

theorem AddSubgroup.comap_normalizer_eq_of_injective_of_le_range {G : Type u_1} [AddGroup G] {N : Type u_6} [AddGroup N] (H : AddSubgroup G) {f : N →+ G} (hf : Function.Injective ↑f) (h : AddSubgroup.normalizer H ≤ AddMonoidHom.range f) : AddSubgroup.comap f (AddSubgroup.normalizer H) = AddSubgroup.normalizer (AddSubgroup.comap f H)

theorem Subgroup.comap_normalizer_eq_of_injective_of_le_range {G : Type u_1} [Group G] {N : Type u_6} [Group N] (H : Subgroup G) {f : N →* G} (hf : Function.Injective ↑f) (h : Subgroup.normalizer H ≤ MonoidHom.range f) : Subgroup.comap f (Subgroup.normalizer H) = Subgroup.normalizer (Subgroup.comap f H)

theorem AddSubgroup.addSubgroupOf_normalizer_eq {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {N : AddSubgroup G} (h : AddSubgroup.normalizer H ≤ N) : AddSubgroup.addSubgroupOf (AddSubgroup.normalizer H) N = AddSubgroup.normalizer (AddSubgroup.addSubgroupOf H N)

theorem Subgroup.subgroupOf_normalizer_eq {G : Type u_1} [Group G] {H : Subgroup G} {N : Subgroup G} (h : Subgroup.normalizer H ≤ N) : Subgroup.subgroupOf (Subgroup.normalizer H) N = Subgroup.normalizer (Subgroup.subgroupOf H N)

theorem AddSubgroup.map_equiv_normalizer_eq {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (f : G ≃+ N) : AddSubgroup.map (AddEquiv.toAddMonoidHom f) (AddSubgroup.normalizer H) = AddSubgroup.normalizer (AddSubgroup.map (AddEquiv.toAddMonoidHom f) H)

The image of the normalizer is equal to the normalizer of the image of an isomorphism.

theorem Subgroup.map_equiv_normalizer_eq {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (f : G ≃* N) : Subgroup.map (MulEquiv.toMonoidHom f) (Subgroup.normalizer H) = Subgroup.normalizer (Subgroup.map (MulEquiv.toMonoidHom f) H)

The image of the normalizer is equal to the normalizer of the image of an isomorphism.

theorem AddSubgroup.map_normalizer_eq_of_bijective {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) {f : G →+ N} (hf : Function.Bijective ↑f) : AddSubgroup.map f (AddSubgroup.normalizer H) = AddSubgroup.normalizer (AddSubgroup.map f H)

The image of the normalizer is equal to the normalizer of the image of a bijective function.

theorem Subgroup.map_normalizer_eq_of_bijective {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) {f : G →* N} (hf : Function.Bijective ↑f) : Subgroup.map f (Subgroup.normalizer H) = Subgroup.normalizer (Subgroup.map f H)

The image of the normalizer is equal to the normalizer of the image of a bijective function.

theorem AddMonoidHom.liftOfRightInverseAux.proof_2 {G₁ : Type u_3} {G₂ : Type u_2} {G₃ : Type u_1} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →+ G₃) (hg : AddMonoidHom.ker f ≤ AddMonoidHom.ker g) (x : G₂) (y : G₂) : ZeroHom.toFun { toFun := fun b => ↑g (f_inv b), map_zero' := hg (f_inv 0) (hf 0) } (x + y) = ZeroHom.toFun { toFun := fun b => ↑g (f_inv b), map_zero' := hg (f_inv 0) (hf 0) } x + ZeroHom.toFun { toFun := fun b => ↑g (f_inv b), map_zero' := hg (f_inv 0) (hf 0) } y

theorem AddMonoidHom.liftOfRightInverseAux.proof_1 {G₁ : Type u_1} {G₂ : Type u_2} {G₃ : Type u_3} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →+ G₃) (hg : AddMonoidHom.ker f ≤ AddMonoidHom.ker g) : f_inv 0 ∈ AddMonoidHom.ker g

def AddMonoidHom.liftOfRightInverseAux {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →+ G₃) (hg : AddMonoidHom.ker f ≤ AddMonoidHom.ker g) : G₂ →+ G₃

Auxiliary definition used to define liftOfRightInverse

Equations

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

def MonoidHom.liftOfRightInverseAux {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →* G₃) (hg : MonoidHom.ker f ≤ MonoidHom.ker g) : G₂ →* G₃

Auxiliary definition used to define liftOfRightInverse

Equations

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

@[simp]

theorem AddMonoidHom.liftOfRightInverseAux_comp_apply {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →+ G₃) (hg : AddMonoidHom.ker f ≤ AddMonoidHom.ker g) (x : G₁) : ↑(AddMonoidHom.liftOfRightInverseAux f f_inv hf g hg) (↑f x) = ↑g x

@[simp]

theorem MonoidHom.liftOfRightInverseAux_comp_apply {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →* G₃) (hg : MonoidHom.ker f ≤ MonoidHom.ker g) (x : G₁) : ↑(MonoidHom.liftOfRightInverseAux f f_inv hf g hg) (↑f x) = ↑g x

theorem AddMonoidHom.liftOfRightInverse.proof_2 {G₁ : Type u_1} {G₂ : Type u_2} {G₃ : Type u_3} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (φ : G₂ →+ G₃) (x : G₁) (hx : x ∈ AddMonoidHom.ker f) : x ∈ AddMonoidHom.ker (AddMonoidHom.comp φ f)

theorem AddMonoidHom.liftOfRightInverse.proof_1 {G₁ : Type u_1} {G₂ : Type u_2} {G₃ : Type u_3} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (g : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g }) : AddMonoidHom.ker f ≤ AddMonoidHom.ker ↑g

def AddMonoidHom.liftOfRightInverse {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g } ≃ (G₂ →+ G₃)

liftOfRightInverse f f_inv hf g hg is the unique additive group homomorphism φ

• such that φ.comp f = g (AddMonoidHom.liftOfRightInverse_comp),
• where f : G₁ →+ G₂ has a RightInverse f_inv (hf),
• and g : G₂ →+ G₃ satisfies hg : f.ker ≤ g.ker. See AddMonoidHom.eq_liftOfRightInverse for the uniqueness lemma.

   G₁.
   |  \
 f |   \ g
   |    \
   v     \⌟
   G₂----> G₃
      ∃!φ

Equations

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

theorem AddMonoidHom.liftOfRightInverse.proof_3 {G₁ : Type u_1} {G₂ : Type u_3} {G₃ : Type u_2} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g }) : (fun φ => { val := AddMonoidHom.comp φ f, property := (_ : ∀ (x : G₁), x ∈ AddMonoidHom.ker f → x ∈ AddMonoidHom.ker (AddMonoidHom.comp φ f)) }) ((fun g => AddMonoidHom.liftOfRightInverseAux f f_inv hf ↑g (_ : AddMonoidHom.ker f ≤ AddMonoidHom.ker ↑g)) g) = g

theorem AddMonoidHom.liftOfRightInverse.proof_4 {G₁ : Type u_3} {G₂ : Type u_2} {G₃ : Type u_1} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (φ : G₂ →+ G₃) : (fun g => AddMonoidHom.liftOfRightInverseAux f f_inv hf ↑g (_ : AddMonoidHom.ker f ≤ AddMonoidHom.ker ↑g)) ((fun φ => { val := AddMonoidHom.comp φ f, property := (_ : ∀ (x : G₁), x ∈ AddMonoidHom.ker f → x ∈ AddMonoidHom.ker (AddMonoidHom.comp φ f)) }) φ) = φ

def MonoidHom.liftOfRightInverse {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) : { g // MonoidHom.ker f ≤ MonoidHom.ker g } ≃ (G₂ →* G₃)

liftOfRightInverse f hf g hg is the unique group homomorphism φ

• such that φ.comp f = g (MonoidHom.liftOfRightInverse_comp),
• where f : G₁ →+* G₂ has a RightInverse f_inv (hf),
• and g : G₂ →+* G₃ satisfies hg : f.ker ≤ g.ker.

See MonoidHom.eq_liftOfRightInverse for the uniqueness lemma.

   G₁.
   |  \
 f |   \ g
   |    \
   v     \⌟
   G₂----> G₃
      ∃!φ

Equations

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

noncomputable abbrev AddMonoidHom.liftOfSurjective {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (hf : Function.Surjective ↑f) : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g } ≃ (G₂ →+ G₃)

A non-computable version of AddMonoidHom.liftOfRightInverse for when no computable right inverse is available.

Equations

• AddMonoidHom.liftOfSurjective f hf = AddMonoidHom.liftOfRightInverse f (Function.surjInv hf) (_ : Function.RightInverse (Function.surjInv hf) ↑f)

theorem AddMonoidHom.liftOfSurjective.proof_1 {G₁ : Type u_1} {G₂ : Type u_2} [AddGroup G₁] [AddGroup G₂] (f : G₁ →+ G₂) (hf : Function.Surjective ↑f) : Function.RightInverse (Function.surjInv hf) ↑f

@[inline, reducible]

noncomputable abbrev MonoidHom.liftOfSurjective {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (hf : Function.Surjective ↑f) : { g // MonoidHom.ker f ≤ MonoidHom.ker g } ≃ (G₂ →* G₃)

A non-computable version of MonoidHom.liftOfRightInverse for when no computable right inverse is available, that uses Function.surjInv.

Equations

• MonoidHom.liftOfSurjective f hf = MonoidHom.liftOfRightInverse f (Function.surjInv hf) (_ : Function.RightInverse (Function.surjInv hf) ↑f)

@[simp]

theorem AddMonoidHom.liftOfRightInverse_comp_apply {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g }) (x : G₁) : ↑(↑(AddMonoidHom.liftOfRightInverse f f_inv hf) g) (↑f x) = ↑↑g x

@[simp]

theorem MonoidHom.liftOfRightInverse_comp_apply {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : { g // MonoidHom.ker f ≤ MonoidHom.ker g }) (x : G₁) : ↑(↑(MonoidHom.liftOfRightInverse f f_inv hf) g) (↑f x) = ↑↑g x

@[simp]

theorem AddMonoidHom.liftOfRightInverse_comp {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : { g // AddMonoidHom.ker f ≤ AddMonoidHom.ker g }) : AddMonoidHom.comp (↑(AddMonoidHom.liftOfRightInverse f f_inv hf) g) f = ↑g

@[simp]

theorem MonoidHom.liftOfRightInverse_comp {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : { g // MonoidHom.ker f ≤ MonoidHom.ker g }) : MonoidHom.comp (↑(MonoidHom.liftOfRightInverse f f_inv hf) g) f = ↑g

theorem AddMonoidHom.eq_liftOfRightInverse {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [AddGroup G₁] [AddGroup G₂] [AddGroup G₃] (f : G₁ →+ G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →+ G₃) (hg : AddMonoidHom.ker f ≤ AddMonoidHom.ker g) (h : G₂ →+ G₃) (hh : AddMonoidHom.comp h f = g) : h = ↑(AddMonoidHom.liftOfRightInverse f f_inv hf) { val := g, property := hg }

theorem MonoidHom.eq_liftOfRightInverse {G₁ : Type u_5} {G₂ : Type u_6} {G₃ : Type u_7} [Group G₁] [Group G₂] [Group G₃] (f : G₁ →* G₂) (f_inv : G₂ → G₁) (hf : Function.RightInverse f_inv ↑f) (g : G₁ →* G₃) (hg : MonoidHom.ker f ≤ MonoidHom.ker g) (h : G₂ →* G₃) (hh : MonoidHom.comp h f = g) : h = ↑(MonoidHom.liftOfRightInverse f f_inv hf) { val := g, property := hg }

theorem AddSubgroup.Normal.comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup N} (hH : AddSubgroup.Normal H) (f : G →+ N) : AddSubgroup.Normal (AddSubgroup.comap f H)

theorem Subgroup.Normal.comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup N} (hH : Subgroup.Normal H) (f : G →* N) : Subgroup.Normal (Subgroup.comap f H)

instance AddSubgroup.normal_comap {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H : AddSubgroup N} [nH : AddSubgroup.Normal H] (f : G →+ N) : AddSubgroup.Normal (AddSubgroup.comap f H)

Equations

• (_ : AddSubgroup.Normal (AddSubgroup.comap f H)) = (_ : AddSubgroup.Normal (AddSubgroup.comap f H))

instance Subgroup.normal_comap {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H : Subgroup N} [nH : Subgroup.Normal H] (f : G →* N) : Subgroup.Normal (Subgroup.comap f H)

Equations

• (_ : Subgroup.Normal (Subgroup.comap f H)) = (_ : Subgroup.Normal (Subgroup.comap f H))

theorem AddSubgroup.Normal.addSubgroupOf {G : Type u_1} [AddGroup G] {H : AddSubgroup G} (hH : AddSubgroup.Normal H) (K : AddSubgroup G) : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H K)

theorem Subgroup.Normal.subgroupOf {G : Type u_1} [Group G] {H : Subgroup G} (hH : Subgroup.Normal H) (K : Subgroup G) : Subgroup.Normal (Subgroup.subgroupOf H K)

instance AddSubgroup.normal_addSubgroupOf {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {N : AddSubgroup G} [AddSubgroup.Normal N] : AddSubgroup.Normal (AddSubgroup.addSubgroupOf N H)

Equations

• @AddSubgroup.normal_addSubgroupOf = @AddSubgroup.normal_addSubgroupOf.proof_1

theorem AddSubgroup.normal_addSubgroupOf.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {N : AddSubgroup G} [AddSubgroup.Normal N] : AddSubgroup.Normal (AddSubgroup.comap (AddSubgroup.subtype H) N)

instance Subgroup.normal_subgroupOf {G : Type u_1} [Group G] {H : Subgroup G} {N : Subgroup G} [Subgroup.Normal N] : Subgroup.Normal (Subgroup.subgroupOf N H)

Equations

• @Subgroup.normal_subgroupOf = @Subgroup.normal_subgroupOf.proof_1

def AddMonoidHom.addSubgroupComap {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (f : G →+ G') (H' : AddSubgroup G') : { x // x ∈ AddSubgroup.comap f H' } →+ { x // x ∈ H' }

the AddMonoidHom from the preimage of an additive subgroup to itself.

Equations

• AddMonoidHom.addSubgroupComap f H' = AddMonoidHom.addSubmonoidComap f H'.toAddSubmonoid

@[simp]

theorem MonoidHom.subgroupComap_apply_coe {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (f : G →* G') (H' : Subgroup G') (x : { x // x ∈ Submonoid.comap f H'.toSubmonoid }) : ↑(↑(MonoidHom.subgroupComap f H') x) = ↑f ↑x

@[simp]

theorem AddMonoidHom.addSubgroupComap_apply_coe {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (f : G →+ G') (H' : AddSubgroup G') (x : { x // x ∈ AddSubmonoid.comap f H'.toAddSubmonoid }) : ↑(↑(AddMonoidHom.addSubgroupComap f H') x) = ↑f ↑x

def MonoidHom.subgroupComap {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (f : G →* G') (H' : Subgroup G') : { x // x ∈ Subgroup.comap f H' } →* { x // x ∈ H' }

The MonoidHom from the preimage of a subgroup to itself.

Equations

• MonoidHom.subgroupComap f H' = MonoidHom.submonoidComap f H'.toSubmonoid

def AddMonoidHom.addSubgroupMap {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (f : G →+ G') (H : AddSubgroup G) : { x // x ∈ H } →+ { x // x ∈ AddSubgroup.map f H }

the AddMonoidHom from an additive subgroup to its image

Equations

• AddMonoidHom.addSubgroupMap f H = AddMonoidHom.addSubmonoidMap f H.toAddSubmonoid

@[simp]

theorem AddMonoidHom.addSubgroupMap_apply_coe {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (f : G →+ G') (H : AddSubgroup G) (x : { x // x ∈ H.toAddSubmonoid }) : ↑(↑(AddMonoidHom.addSubgroupMap f H) x) = ↑f ↑x

@[simp]

theorem MonoidHom.subgroupMap_apply_coe {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (f : G →* G') (H : Subgroup G) (x : { x // x ∈ H.toSubmonoid }) : ↑(↑(MonoidHom.subgroupMap f H) x) = ↑f ↑x

def MonoidHom.subgroupMap {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (f : G →* G') (H : Subgroup G) : { x // x ∈ H } →* { x // x ∈ Subgroup.map f H }

The MonoidHom from a subgroup to its image.

Equations

• MonoidHom.subgroupMap f H = MonoidHom.submonoidMap f H.toSubmonoid

theorem AddMonoidHom.addSubgroupMap_surjective {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (f : G →+ G') (H : AddSubgroup G) : Function.Surjective ↑(AddMonoidHom.addSubgroupMap f H)

theorem MonoidHom.subgroupMap_surjective {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (f : G →* G') (H : Subgroup G) : Function.Surjective ↑(MonoidHom.subgroupMap f H)

theorem AddEquiv.addSubgroupCongr.proof_3 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H = K) : Function.RightInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun

theorem AddEquiv.addSubgroupCongr.proof_2 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H = K) : Function.LeftInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun

def AddEquiv.addSubgroupCongr {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H = K) : { x // x ∈ H } ≃+ { x // x ∈ K }

Makes the identity additive isomorphism from a proof two subgroups of an additive group are equal.

Equations

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

theorem AddEquiv.addSubgroupCongr.proof_4 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H = K) : ∀ (x x_1 : { x // x ∈ H }), Equiv.toFun { toFun := (Equiv.setCongr (_ : ↑H = ↑K)).toFun, invFun := (Equiv.setCongr (_ : ↑H = ↑K)).invFun, left_inv := (_ : Function.LeftInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun), right_inv := (_ : Function.RightInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun) } (x + x_1) = Equiv.toFun { toFun := (Equiv.setCongr (_ : ↑H = ↑K)).toFun, invFun := (Equiv.setCongr (_ : ↑H = ↑K)).invFun, left_inv := (_ : Function.LeftInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun), right_inv := (_ : Function.RightInverse (Equiv.setCongr (_ : ↑H = ↑K)).invFun (Equiv.setCongr (_ : ↑H = ↑K)).toFun) } (x + x_1)

theorem AddEquiv.addSubgroupCongr.proof_1 {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (h : H = K) : ↑H = ↑K

def MulEquiv.subgroupCongr {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (h : H = K) : { x // x ∈ H } ≃* { x // x ∈ K }

Makes the identity isomorphism from a proof two subgroups of a multiplicative group are equal.

Equations

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

def AddEquiv.addSubgroupMap {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (e : G ≃+ G') (H : AddSubgroup G) : { x // x ∈ H } ≃+ { x // x ∈ AddSubgroup.map (↑e) H }

An additive subgroup is isomorphic to its image under an isomorphism. If you only have an injective map, use AddSubgroup.equiv_map_of_injective.

Equations

• AddEquiv.addSubgroupMap e H = AddEquiv.addSubmonoidMap e H.toAddSubmonoid

def MulEquiv.subgroupMap {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (e : G ≃* G') (H : Subgroup G) : { x // x ∈ H } ≃* { x // x ∈ Subgroup.map (↑e) H }

A subgroup is isomorphic to its image under an isomorphism. If you only have an injective map, use Subgroup.equiv_map_of_injective.

Equations

• MulEquiv.subgroupMap e H = MulEquiv.submonoidMap e H.toSubmonoid

@[simp]

theorem AddEquiv.coe_addSubgroupMap_apply {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (e : G ≃+ G') (H : AddSubgroup G) (g : { x // x ∈ H }) : ↑(↑(AddEquiv.addSubgroupMap e H) g) = ↑e ↑g

@[simp]

theorem MulEquiv.coe_subgroupMap_apply {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (e : G ≃* G') (H : Subgroup G) (g : { x // x ∈ H }) : ↑(↑(MulEquiv.subgroupMap e H) g) = ↑e ↑g

@[simp]

theorem AddEquiv.addSubgroupMap_symm_apply {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (e : G ≃+ G') (H : AddSubgroup G) (g : { x // x ∈ AddSubgroup.map (↑e) H }) : ↑(AddEquiv.symm (AddEquiv.addSubgroupMap e H)) g = { val := ↑(AddEquiv.symm e) ↑g, property := (_ : ↑(AddEquiv.symm e) ↑g ∈ H) }

@[simp]

theorem MulEquiv.subgroupMap_symm_apply {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (e : G ≃* G') (H : Subgroup G) (g : { x // x ∈ Subgroup.map (↑e) H }) : ↑(MulEquiv.symm (MulEquiv.subgroupMap e H)) g = { val := ↑(MulEquiv.symm e) ↑g, property := (_ : ↑(MulEquiv.symm e) ↑g ∈ H) }

@[simp]

theorem AddSubgroup.equivMapOfInjective_coe_addEquiv {G : Type u_1} {G' : Type u_2} [AddGroup G] [AddGroup G'] (H : AddSubgroup G) (e : G ≃+ G') : AddSubgroup.equivMapOfInjective H ↑e (_ : Function.Injective ↑e) = AddEquiv.addSubgroupMap e H

@[simp]

theorem Subgroup.equivMapOfInjective_coe_mulEquiv {G : Type u_1} {G' : Type u_2} [Group G] [Group G'] (H : Subgroup G) (e : G ≃* G') : Subgroup.equivMapOfInjective H ↑e (_ : Function.Injective ↑e) = MulEquiv.subgroupMap e H

theorem AddSubgroup.mem_sup {C : Type u_6} [AddCommGroup C] {s : AddSubgroup C} {t : AddSubgroup C} {x : C} : x ∈ s ⊔ t ↔ ∃ y, y ∈ s ∧ ∃ z, z ∈ t ∧ y + z = x

theorem Subgroup.mem_sup {C : Type u_6} [CommGroup C] {s : Subgroup C} {t : Subgroup C} {x : C} : x ∈ s ⊔ t ↔ ∃ y, y ∈ s ∧ ∃ z, z ∈ t ∧ y * z = x

theorem AddSubgroup.mem_sup' {C : Type u_6} [AddCommGroup C] {s : AddSubgroup C} {t : AddSubgroup C} {x : C} : x ∈ s ⊔ t ↔ ∃ y z, ↑y + ↑z = x

theorem Subgroup.mem_sup' {C : Type u_6} [CommGroup C] {s : Subgroup C} {t : Subgroup C} {x : C} : x ∈ s ⊔ t ↔ ∃ y z, ↑y * ↑z = x

theorem AddSubgroup.mem_closure_pair {C : Type u_6} [AddCommGroup C] {x : C} {y : C} {z : C} : z ∈ AddSubgroup.closure {x, y} ↔ ∃ m n, m • x + n • y = z

theorem Subgroup.mem_closure_pair {C : Type u_6} [CommGroup C] {x : C} {y : C} {z : C} : z ∈ Subgroup.closure {x, y} ↔ ∃ m n, x ^ m * y ^ n = z

instance AddSubgroup.instIsModularLatticeAddSubgroupToAddGroupToLatticeInstCompleteLatticeAddSubgroup {C : Type u_6} [AddCommGroup C] : IsModularLattice (AddSubgroup C)

Equations

• @AddSubgroup.instIsModularLatticeAddSubgroupToAddGroupToLatticeInstCompleteLatticeAddSubgroup = @AddSubgroup.instIsModularLatticeAddSubgroupToAddGroupToLatticeInstCompleteLatticeAddSubgroup.proof_1

theorem AddSubgroup.instIsModularLatticeAddSubgroupToAddGroupToLatticeInstCompleteLatticeAddSubgroup.proof_1 {C : Type u_1} [AddCommGroup C] : IsModularLattice (AddSubgroup C)

instance Subgroup.instIsModularLatticeSubgroupToGroupToLatticeInstCompleteLatticeSubgroup {C : Type u_6} [CommGroup C] : IsModularLattice (Subgroup C)

Equations

• @Subgroup.instIsModularLatticeSubgroupToGroupToLatticeInstCompleteLatticeSubgroup = @Subgroup.instIsModularLatticeSubgroupToGroupToLatticeInstCompleteLatticeSubgroup.proof_1

theorem AddSubgroup.normal_addSubgroupOf_iff {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (hHK : H ≤ K) : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H K) ↔ ∀ (h k : G), h ∈ H → k ∈ K → k + h + -k ∈ H

theorem Subgroup.normal_subgroupOf_iff {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (hHK : H ≤ K) : Subgroup.Normal (Subgroup.subgroupOf H K) ↔ ∀ (h k : G), h ∈ H → k ∈ K → k * h * k⁻¹ ∈ H

instance AddSubgroup.sum_addSubgroupOf_sum_normal {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] {H₁ : AddSubgroup G} {K₁ : AddSubgroup G} {H₂ : AddSubgroup N} {K₂ : AddSubgroup N} [h₁ : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H₁ K₁)] [h₂ : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H₂ K₂)] : AddSubgroup.Normal (AddSubgroup.addSubgroupOf (AddSubgroup.prod H₁ H₂) (AddSubgroup.prod K₁ K₂))

Equations

• @AddSubgroup.sum_addSubgroupOf_sum_normal = @AddSubgroup.sum_addSubgroupOf_sum_normal.proof_1

theorem AddSubgroup.sum_addSubgroupOf_sum_normal.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] {H₁ : AddSubgroup G} {K₁ : AddSubgroup G} {H₂ : AddSubgroup N} {K₂ : AddSubgroup N} [h₁ : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H₁ K₁)] [h₂ : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H₂ K₂)] : AddSubgroup.Normal (AddSubgroup.addSubgroupOf (AddSubgroup.prod H₁ H₂) (AddSubgroup.prod K₁ K₂))

instance Subgroup.prod_subgroupOf_prod_normal {G : Type u_1} [Group G] {N : Type u_5} [Group N] {H₁ : Subgroup G} {K₁ : Subgroup G} {H₂ : Subgroup N} {K₂ : Subgroup N} [h₁ : Subgroup.Normal (Subgroup.subgroupOf H₁ K₁)] [h₂ : Subgroup.Normal (Subgroup.subgroupOf H₂ K₂)] : Subgroup.Normal (Subgroup.subgroupOf (Subgroup.prod H₁ H₂) (Subgroup.prod K₁ K₂))

Equations

• @Subgroup.prod_subgroupOf_prod_normal = @Subgroup.prod_subgroupOf_prod_normal.proof_1

instance AddSubgroup.sum_normal {G : Type u_1} [AddGroup G] {N : Type u_5} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) [hH : AddSubgroup.Normal H] [hK : AddSubgroup.Normal K] : AddSubgroup.Normal (AddSubgroup.prod H K)

Equations

• @AddSubgroup.sum_normal = @AddSubgroup.sum_normal.proof_1

theorem AddSubgroup.sum_normal.proof_1 {G : Type u_1} [AddGroup G] {N : Type u_2} [AddGroup N] (H : AddSubgroup G) (K : AddSubgroup N) [hH : AddSubgroup.Normal H] [hK : AddSubgroup.Normal K] : AddSubgroup.Normal (AddSubgroup.prod H K)

instance Subgroup.prod_normal {G : Type u_1} [Group G] {N : Type u_5} [Group N] (H : Subgroup G) (K : Subgroup N) [hH : Subgroup.Normal H] [hK : Subgroup.Normal K] : Subgroup.Normal (Subgroup.prod H K)

Equations

• @Subgroup.prod_normal = @Subgroup.prod_normal.proof_1

theorem AddSubgroup.inf_addSubgroupOf_inf_normal_of_right {G : Type u_1} [AddGroup G] (A : AddSubgroup G) (B' : AddSubgroup G) (B : AddSubgroup G) (hB : B' ≤ B) [hN : AddSubgroup.Normal (AddSubgroup.addSubgroupOf B' B)] : AddSubgroup.Normal (AddSubgroup.addSubgroupOf (A ⊓ B') (A ⊓ B))

theorem Subgroup.inf_subgroupOf_inf_normal_of_right {G : Type u_1} [Group G] (A : Subgroup G) (B' : Subgroup G) (B : Subgroup G) (hB : B' ≤ B) [hN : Subgroup.Normal (Subgroup.subgroupOf B' B)] : Subgroup.Normal (Subgroup.subgroupOf (A ⊓ B') (A ⊓ B))

theorem AddSubgroup.inf_addSubgroupOf_inf_normal_of_left {G : Type u_1} [AddGroup G] {A' : AddSubgroup G} {A : AddSubgroup G} (B : AddSubgroup G) (hA : A' ≤ A) [hN : AddSubgroup.Normal (AddSubgroup.addSubgroupOf A' A)] : AddSubgroup.Normal (AddSubgroup.addSubgroupOf (A' ⊓ B) (A ⊓ B))

theorem Subgroup.inf_subgroupOf_inf_normal_of_left {G : Type u_1} [Group G] {A' : Subgroup G} {A : Subgroup G} (B : Subgroup G) (hA : A' ≤ A) [hN : Subgroup.Normal (Subgroup.subgroupOf A' A)] : Subgroup.Normal (Subgroup.subgroupOf (A' ⊓ B) (A ⊓ B))

instance AddSubgroup.normal_inf_normal {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) [hH : AddSubgroup.Normal H] [hK : AddSubgroup.Normal K] : AddSubgroup.Normal (H ⊓ K)

Equations

• @AddSubgroup.normal_inf_normal = @AddSubgroup.normal_inf_normal.proof_1

theorem AddSubgroup.normal_inf_normal.proof_1 {G : Type u_1} [AddGroup G] (H : AddSubgroup G) (K : AddSubgroup G) [hH : AddSubgroup.Normal H] [hK : AddSubgroup.Normal K] : AddSubgroup.Normal (H ⊓ K)

instance Subgroup.normal_inf_normal {G : Type u_1} [Group G] (H : Subgroup G) (K : Subgroup G) [hH : Subgroup.Normal H] [hK : Subgroup.Normal K] : Subgroup.Normal (H ⊓ K)

Equations

• @Subgroup.normal_inf_normal = @Subgroup.normal_inf_normal.proof_1

theorem AddSubgroup.addSubgroupOf_sup {G : Type u_1} [AddGroup G] (A : AddSubgroup G) (A' : AddSubgroup G) (B : AddSubgroup G) (hA : A ≤ B) (hA' : A' ≤ B) : AddSubgroup.addSubgroupOf (A ⊔ A') B = AddSubgroup.addSubgroupOf A B ⊔ AddSubgroup.addSubgroupOf A' B

theorem Subgroup.subgroupOf_sup {G : Type u_1} [Group G] (A : Subgroup G) (A' : Subgroup G) (B : Subgroup G) (hA : A ≤ B) (hA' : A' ≤ B) : Subgroup.subgroupOf (A ⊔ A') B = Subgroup.subgroupOf A B ⊔ Subgroup.subgroupOf A' B

theorem AddSubgroup.SubgroupNormal.mem_comm {G : Type u_1} [AddGroup G] {H : AddSubgroup G} {K : AddSubgroup G} (hK : H ≤ K) [hN : AddSubgroup.Normal (AddSubgroup.addSubgroupOf H K)] {a : G} {b : G} (hb : b ∈ K) (h : a + b ∈ H) : b + a ∈ H

theorem Subgroup.SubgroupNormal.mem_comm {G : Type u_1} [Group G] {H : Subgroup G} {K : Subgroup G} (hK : H ≤ K) [hN : Subgroup.Normal (Subgroup.subgroupOf H K)] {a : G} {b : G} (hb : b ∈ K) (h : a * b ∈ H) : b * a ∈ H

theorem AddSubgroup.commute_of_normal_of_disjoint {G : Type u_1} [AddGroup G] (H₁ : AddSubgroup G) (H₂ : AddSubgroup G) (hH₁ : AddSubgroup.Normal H₁) (hH₂ : AddSubgroup.Normal H₂) (hdis : Disjoint H₁ H₂) (x : G) (y : G) (hx : x ∈ H₁) (hy : y ∈ H₂) : AddCommute x y

Elements of disjoint, normal subgroups commute.

theorem Subgroup.commute_of_normal_of_disjoint {G : Type u_1} [Group G] (H₁ : Subgroup G) (H₂ : Subgroup G) (hH₁ : Subgroup.Normal H₁) (hH₂ : Subgroup.Normal H₂) (hdis : Disjoint H₁ H₂) (x : G) (y : G) (hx : x ∈ H₁) (hy : y ∈ H₂) : Commute x y

Elements of disjoint, normal subgroups commute.

theorem AddSubgroup.disjoint_def {G : Type u_1} [AddGroup G] {H₁ : AddSubgroup G} {H₂ : AddSubgroup G} : Disjoint H₁ H₂ ↔ ∀ {x : G}, x ∈ H₁ → x ∈ H₂ → x = 0

theorem Subgroup.disjoint_def {G : Type u_1} [Group G] {H₁ : Subgroup G} {H₂ : Subgroup G} : Disjoint H₁ H₂ ↔ ∀ {x : G}, x ∈ H₁ → x ∈ H₂ → x = 1

theorem AddSubgroup.disjoint_def' {G : Type u_1} [AddGroup G] {H₁ : AddSubgroup G} {H₂ : AddSubgroup G} : Disjoint H₁ H₂ ↔ ∀ {x y : G}, x ∈ H₁ → y ∈ H₂ → x = y → x = 0

theorem Subgroup.disjoint_def' {G : Type u_1} [Group G] {H₁ : Subgroup G} {H₂ : Subgroup G} : Disjoint H₁ H₂ ↔ ∀ {x y : G}, x ∈ H₁ → y ∈ H₂ → x = y → x = 1

theorem AddSubgroup.disjoint_iff_add_eq_zero {G : Type u_1} [AddGroup G] {H₁ : AddSubgroup G} {H₂ : AddSubgroup G} : Disjoint H₁ H₂ ↔ ∀ {x y : G}, x ∈ H₁ → y ∈ H₂ → x + y = 0 → x = 0 ∧ y = 0

theorem Subgroup.disjoint_iff_mul_eq_one {G : Type u_1} [Group G] {H₁ : Subgroup G} {H₂ : Subgroup G} : Disjoint H₁ H₂ ↔ ∀ {x y : G}, x ∈ H₁ → y ∈ H₂ → x * y = 1 → x = 1 ∧ y = 1

theorem AddSubgroup.add_injective_of_disjoint {G : Type u_1} [AddGroup G] {H₁ : AddSubgroup G} {H₂ : AddSubgroup G} (h : Disjoint H₁ H₂) : Function.Injective fun g => ↑g.fst + ↑g.snd

theorem Subgroup.mul_injective_of_disjoint {G : Type u_1} [Group G] {H₁ : Subgroup G} {H₂ : Subgroup G} (h : Disjoint H₁ H₂) : Function.Injective fun g => ↑g.fst * ↑g.snd

theorem IsConj.normalClosure_eq_top_of {G : Type u_1} [Group G] {N : Subgroup G} [hn : Subgroup.Normal N] {g : G} {g' : G} {hg : g ∈ N} {hg' : g' ∈ N} (hc : IsConj g g') (ht : Subgroup.normalClosure {{ val := g, property := hg }} = ⊤) : Subgroup.normalClosure {{ val := g', property := hg' }} = ⊤

theorem IsConj.eq_of_left_mem_center {M : Type u_6} [Monoid M] {g : M} {h : M} (H : IsConj g h) (Hg : g ∈ Set.center M) : g = h

theorem IsConj.eq_of_right_mem_center {M : Type u_6} [Monoid M] {g : M} {h : M} (H : IsConj g h) (Hh : h ∈ Set.center M) : g = h

def ConjClasses.noncenter (G : Type u_6) [Monoid G] : Set (ConjClasses G)

The conjugacy classes that are not trivial.

Equations

• ConjClasses.noncenter G = {x | Set.Nontrivial (ConjClasses.carrier x)}

@[simp]

theorem ConjClasses.mem_noncenter {G : Type u_1} [Monoid G] (g : ConjClasses G) : g ∈ ConjClasses.noncenter G ↔ Set.Nontrivial (ConjClasses.carrier g)

theorem ConjClasses.mk_bijOn (G : Type u_6) [Group G] : Set.BijOn ConjClasses.mk (↑(Subgroup.center G)) (ConjClasses.noncenter G)ᶜ