mathlib documentation

group_theory.subgroup.basic

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:

Definitions in the file:

Implementation notes #

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

Tags #

subgroup, subgroups

def subgroup.to_submonoid {G : Type u_3} [group G] (self : subgroup G) :

Reinterpret a subgroup as a submonoid.

structure subgroup (G : Type u_3) [group G] :
Type u_3

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

structure add_subgroup (G : Type u_3) [add_group G] :
Type u_3

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

def add_subgroup.to_add_submonoid {G : Type u_3} [add_group G] (self : add_subgroup G) :

Reinterpret an add_subgroup as an add_submonoid.

@[instance]
def subgroup.set_like {G : Type u_1} [group G] :
Equations
@[instance]
def add_subgroup.set_like {G : Type u_1} [add_group G] :
Equations
@[simp]
theorem subgroup.mem_carrier {G : Type u_1} [group G] {s : subgroup G} {x : G} :
x s.carrier x s
@[simp]
theorem add_subgroup.mem_carrier {G : Type u_1} [add_group G] {s : add_subgroup G} {x : G} :
x s.carrier x s
@[simp]
theorem add_subgroup.mem_mk {G : Type u_1} [add_group G] {s : set G} {x : G} (h_one : 0 s) (h_mul : ∀ {a b : G}, a sb sa + b s) (h_inv : ∀ {x : G}, x s-x s) :
x {carrier := s, zero_mem' := h_one, add_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 : 1 s) (h_mul : ∀ {a b : G}, a sb sa * b s) (h_inv : ∀ {x : G}, x sx⁻¹ s) :
x {carrier := s, one_mem' := h_one, mul_mem' := h_mul, inv_mem' := h_inv} x s
@[simp]
theorem subgroup.coe_set_mk {G : Type u_1} [group G] {s : set G} (h_one : 1 s) (h_mul : ∀ {a b : G}, a sb sa * b s) (h_inv : ∀ {x : G}, x sx⁻¹ s) :
{carrier := s, one_mem' := h_one, mul_mem' := h_mul, inv_mem' := h_inv} = s
@[simp]
theorem add_subgroup.coe_set_mk {G : Type u_1} [add_group G] {s : set G} (h_one : 0 s) (h_mul : ∀ {a b : G}, a sb sa + b s) (h_inv : ∀ {x : G}, x s-x s) :
{carrier := s, zero_mem' := h_one, add_mem' := h_mul, neg_mem' := h_inv} = s
@[simp]
theorem add_subgroup.mk_le_mk {G : Type u_1} [add_group G] {s t : set G} (h_one : 0 s) (h_mul : ∀ {a b : G}, a sb sa + b s) (h_inv : ∀ {x : G}, x s-x s) (h_one' : 0 t) (h_mul' : ∀ {a b : G}, a tb ta + b t) (h_inv' : ∀ {x : G}, x t-x t) :
{carrier := s, zero_mem' := h_one, add_mem' := h_mul, neg_mem' := h_inv} {carrier := t, zero_mem' := h_one', add_mem' := h_mul', neg_mem' := h_inv'} s t
@[simp]
theorem subgroup.mk_le_mk {G : Type u_1} [group G] {s t : set G} (h_one : 1 s) (h_mul : ∀ {a b : G}, a sb sa * b s) (h_inv : ∀ {x : G}, x sx⁻¹ s) (h_one' : 1 t) (h_mul' : ∀ {a b : G}, a tb ta * b t) (h_inv' : ∀ {x : G}, x tx⁻¹ t) :
{carrier := s, one_mem' := h_one, mul_mem' := h_mul, inv_mem' := h_inv} {carrier := t, one_mem' := h_one', mul_mem' := h_mul', inv_mem' := h_inv'} s t
def subgroup.simps.coe {G : Type u_1} [group G] (S : subgroup G) :
set G

See Note [custom simps projection]

Equations
@[simp]
@[simp]
theorem subgroup.coe_to_submonoid {G : Type u_1} [group G] (K : subgroup G) :
@[simp]
theorem subgroup.mem_to_submonoid {G : Type u_1} [group G] (K : subgroup G) (x : G) :
@[simp]
theorem add_subgroup.mem_to_add_submonoid {G : Type u_1} [add_group G] (K : add_subgroup G) (x : G) :
@[instance]
def subgroup.fintype {G : Type u_1} [group G] (K : subgroup G) [d : decidable_pred (λ (_x : G), _x K)] [fintype G] :
Equations
@[instance]
def add_subgroup.fintype {G : Type u_1} [add_group G] (K : add_subgroup G) [d : decidable_pred (λ (_x : G), _x K)] [fintype G] :
Equations
@[simp]
@[simp]
theorem subgroup.to_submonoid_eq {G : Type u_1} [group G] {p q : subgroup G} :
@[simp]
theorem subgroup.to_submonoid_le {G : Type u_1} [group G] {p q : subgroup G} :

Conversion to/from additive/multiplicative #

Supgroups of a group G are isomorphic to additive subgroups of additive G.

Equations

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

Additive supgroups of an additive group A are isomorphic to subgroups of multiplicative A.

Equations

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

def subgroup.copy {G : Type u_1} [group G] (K : subgroup G) (s : set G) (hs : s = K) :

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

Equations
def add_subgroup.copy {G : Type u_1} [add_group G] (K : add_subgroup G) (s : set G) (hs : s = K) :

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

Equations
@[simp]
theorem subgroup.coe_copy {G : Type u_1} [group G] (K : subgroup G) (s : set G) (hs : s = K) :
(K.copy s hs) = s
theorem subgroup.copy_eq {G : Type u_1} [group G] (K : subgroup G) (s : set G) (hs : s = K) :
K.copy s hs = K
@[ext]
theorem subgroup.ext {G : Type u_1} [group G] {H K : subgroup G} (h : ∀ (x : G), x H x K) :
H = K

Two subgroups are equal if they have the same elements.

theorem add_subgroup.ext {G : Type u_1} [add_group G] {H K : add_subgroup G} (h : ∀ (x : G), x H x K) :
H = K

Two add_subgroups are equal if they have the same elements.

theorem subgroup.one_mem {G : Type u_1} [group G] (H : subgroup G) :
1 H

A subgroup contains the group's 1.

theorem add_subgroup.zero_mem {G : Type u_1} [add_group G] (H : add_subgroup G) :
0 H

An add_subgroup contains the group's 0.

theorem add_subgroup.add_mem {G : Type u_1} [add_group G] (H : add_subgroup G) {x y : G} :
x Hy Hx + y H

An add_subgroup is closed under addition.

theorem subgroup.mul_mem {G : Type u_1} [group G] (H : subgroup G) {x y : G} :
x Hy Hx * y H

A subgroup is closed under multiplication.

theorem subgroup.inv_mem {G : Type u_1} [group G] (H : subgroup G) {x : G} :
x Hx⁻¹ H

A subgroup is closed under inverse.

theorem add_subgroup.neg_mem {G : Type u_1} [add_group G] (H : add_subgroup G) {x : G} :
x H-x H

An add_subgroup is closed under inverse.

theorem subgroup.div_mem {G : Type u_1} [group G] (H : subgroup G) {x y : G} (hx : x H) (hy : y H) :
x / y H

A subgroup is closed under division.

theorem add_subgroup.sub_mem {G : Type u_1} [add_group G] (H : add_subgroup G) {x y : G} (hx : x H) (hy : y H) :
x - y H

An add_subgroup is closed under subtraction.

@[simp]
theorem add_subgroup.neg_mem_iff {G : Type u_1} [add_group G] (H : add_subgroup G) {x : G} :
-x H x H
@[simp]
theorem subgroup.inv_mem_iff {G : Type u_1} [group G] (H : subgroup G) {x : G} :
x⁻¹ H x H
theorem add_subgroup.sub_mem_comm_iff {G : Type u_1} [add_group G] (H : add_subgroup G) {a b : G} :
a - b H b - a H
theorem subgroup.div_mem_comm_iff {G : Type u_1} [group G] (H : subgroup G) {a b : G} :
a / b H b / a H
@[simp]
theorem add_subgroup.neg_coe_set {G : Type u_1} [add_group G] (H : add_subgroup G) :
@[simp]
theorem subgroup.inv_coe_set {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem subgroup.exists_inv_mem_iff_exists_mem {G : Type u_1} [group G] (K : subgroup G) {P : G → Prop} :
(∃ (x : G), x K P x⁻¹) ∃ (x : G) (H : x K), P x
@[simp]
theorem add_subgroup.exists_neg_mem_iff_exists_mem {G : Type u_1} [add_group G] (K : add_subgroup G) {P : G → Prop} :
(∃ (x : G), x K P (-x)) ∃ (x : G) (H : x K), P x
theorem add_subgroup.add_mem_cancel_right {G : Type u_1} [add_group G] (H : add_subgroup G) {x 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 y : G} (h : x H) :
y * x H y H
theorem subgroup.mul_mem_cancel_left {G : Type u_1} [group G] (H : subgroup G) {x y : G} (h : x H) :
x * y H y H
theorem add_subgroup.add_mem_cancel_left {G : Type u_1} [add_group G] (H : add_subgroup G) {x y : G} (h : x H) :
x + y H y H
theorem subgroup.list_prod_mem {G : Type u_1} [group G] (K : subgroup G) {l : list G} :
(∀ (x : G), x lx K)l.prod K

Product of a list of elements in a subgroup is in the subgroup.

theorem add_subgroup.list_sum_mem {G : Type u_1} [add_group G] (K : add_subgroup G) {l : list G} :
(∀ (x : G), x lx K)l.sum K

Sum of a list of elements in an add_subgroup is in the add_subgroup.

theorem add_subgroup.multiset_sum_mem {G : Type u_1} [add_comm_group G] (K : add_subgroup G) (g : multiset G) :
(∀ (a : G), a ga K)g.sum K

Sum of a multiset of elements in an add_subgroup of an add_comm_group is in the add_subgroup.

theorem subgroup.multiset_prod_mem {G : Type u_1} [comm_group G] (K : subgroup G) (g : multiset G) :
(∀ (a : G), a ga K)g.prod K

Product of a multiset of elements in a subgroup of a comm_group is in the subgroup.

theorem add_subgroup.sum_mem {G : Type u_1} [add_comm_group G] (K : add_subgroup G) {ι : Type u_2} {t : finset ι} {f : ι → G} (h : ∀ (c : ι), c tf c K) :
∑ (c : ι) in t, f c K

Sum of elements in an add_subgroup of an add_comm_group indexed by a finset is in the add_subgroup.

theorem subgroup.prod_mem {G : Type u_1} [comm_group G] (K : subgroup G) {ι : Type u_2} {t : finset ι} {f : ι → G} (h : ∀ (c : ι), c tf c K) :
∏ (c : ι) in t, f c K

Product of elements of a subgroup of a comm_group indexed by a finset is in the subgroup.

theorem subgroup.pow_mem {G : Type u_1} [group G] (K : subgroup G) {x : G} (hx : x K) (n : ) :
x ^ n K
theorem add_subgroup.nsmul_mem {G : Type u_1} [add_group G] (K : add_subgroup G) {x : G} (hx : x K) (n : ) :
n x K
theorem add_subgroup.gsmul_mem {G : Type u_1} [add_group G] (K : add_subgroup G) {x : G} (hx : x K) (n : ) :
n x K
theorem subgroup.gpow_mem {G : Type u_1} [group G] (K : subgroup G) {x : G} (hx : x K) (n : ) :
x ^ n K
def subgroup.of_div {G : Type u_1} [group G] (s : set G) (hsn : s.nonempty) (hs : ∀ (x y : G), x sy sx * y⁻¹ s) :

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

Equations
def add_subgroup.of_sub {G : Type u_1} [add_group G] (s : set G) (hsn : s.nonempty) (hs : ∀ (x y : G), x sy sx + -y s) :

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

Equations
@[instance]
def subgroup.has_mul {G : Type u_1} [group G] (H : subgroup G) :

A subgroup of a group inherits a multiplication.

Equations
@[instance]
def add_subgroup.has_add {G : Type u_1} [add_group G] (H : add_subgroup G) :

An add_subgroup of an add_group inherits an addition.

Equations
@[instance]
def subgroup.has_one {G : Type u_1} [group G] (H : subgroup G) :

A subgroup of a group inherits a 1.

Equations
@[instance]
def add_subgroup.has_zero {G : Type u_1} [add_group G] (H : add_subgroup G) :

An add_subgroup of an add_group inherits a zero.

Equations
@[instance]
def add_subgroup.has_neg {G : Type u_1} [add_group G] (H : add_subgroup G) :

A add_subgroup of a add_group inherits an inverse.

Equations
@[instance]
def subgroup.has_inv {G : Type u_1} [group G] (H : subgroup G) :

A subgroup of a group inherits an inverse.

Equations
@[instance]
def subgroup.has_div {G : Type u_1} [group G] (H : subgroup G) :

A subgroup of a group inherits a division

Equations
@[instance]
def add_subgroup.has_sub {G : Type u_1} [add_group G] (H : add_subgroup G) :

An add_subgroup of an add_group inherits a subtraction.

Equations
@[simp]
theorem add_subgroup.coe_add {G : Type u_1} [add_group G] (H : add_subgroup G) (x y : H) :
(x + y) = x + y
@[simp]
theorem subgroup.coe_mul {G : Type u_1} [group G] (H : subgroup G) (x y : H) :
x * y = (x) * y
@[simp]
theorem add_subgroup.coe_zero {G : Type u_1} [add_group G] (H : add_subgroup G) :
0 = 0
@[simp]
theorem subgroup.coe_one {G : Type u_1} [group G] (H : subgroup G) :
1 = 1
@[simp]
theorem add_subgroup.coe_neg {G : Type u_1} [add_group G] (H : add_subgroup G) (x : H) :
@[simp]
theorem subgroup.coe_inv {G : Type u_1} [group G] (H : subgroup G) (x : H) :
@[simp]
theorem subgroup.coe_div {G : Type u_1} [group G] (H : subgroup G) (x y : H) :
(x / y) = x / y
@[simp]
theorem add_subgroup.coe_sub {G : Type u_1} [add_group G] (H : add_subgroup G) (x y : H) :
(x - y) = x - y
@[simp]
theorem add_subgroup.coe_mk {G : Type u_1} [add_group G] (H : add_subgroup G) (x : G) (hx : x H) :
x, hx⟩ = x
@[simp]
theorem subgroup.coe_mk {G : Type u_1} [group G] (H : subgroup G) (x : G) (hx : x H) :
x, hx⟩ = x
@[instance]
def subgroup.to_group {G : Type u_1} [group G] (H : subgroup G) :

A subgroup of a group inherits a group structure.

Equations
@[instance]
def add_subgroup.to_add_group {G : Type u_1} [add_group G] (H : add_subgroup G) :

An add_subgroup of an add_group inherits an add_group structure.

Equations
@[instance]
def subgroup.to_comm_group {G : Type u_1} [comm_group G] (H : subgroup G) :

A subgroup of a comm_group is a comm_group.

Equations
@[instance]

An add_subgroup of an add_ordered_comm_group is an add_ordered_comm_group.

Equations
def subgroup.subtype {G : Type u_1} [group G] (H : subgroup G) :

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

Equations
def add_subgroup.subtype {G : Type u_1} [add_group G] (H : add_subgroup G) :

The natural group hom from an add_subgroup of add_group G to G.

Equations
@[simp]
theorem subgroup.coe_subtype {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem add_subgroup.coe_subtype {G : Type u_1} [add_group G] (H : add_subgroup G) :
@[simp]
theorem subgroup.coe_pow {G : Type u_1} [group G] (H : subgroup G) (x : H) (n : ) :
(x ^ n) = x ^ n
@[simp]
theorem subgroup.coe_gpow {G : Type u_1} [group G] (H : subgroup G) (x : H) (n : ) :
(x ^ n) = x ^ n
def add_subgroup.inclusion {G : Type u_1} [add_group G] {H K : add_subgroup G} (h : H K) :

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

Equations
def subgroup.inclusion {G : Type u_1} [group G] {H K : subgroup G} (h : H K) :

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

Equations
@[simp]
theorem subgroup.coe_inclusion {G : Type u_1} [group G] {H K : subgroup G} {h : H K} (a : H) :
@[simp]
theorem add_subgroup.coe_inclusion {G : Type u_1} [add_group G] {H K : add_subgroup G} {h : H K} (a : H) :
@[simp]
theorem add_subgroup.subtype_comp_inclusion {G : Type u_1} [add_group G] {H K : add_subgroup G} (hH : H K) :
@[simp]
theorem subgroup.subtype_comp_inclusion {G : Type u_1} [group G] {H K : subgroup G} (hH : H K) :
@[instance]
def add_subgroup.has_top {G : Type u_1} [add_group G] :

The add_subgroup G of the add_group G.

Equations
@[instance]
def subgroup.has_top {G : Type u_1} [group G] :

The subgroup G of the group G.

Equations
@[instance]
def add_subgroup.has_bot {G : Type u_1} [add_group G] :

The trivial add_subgroup {0} of an add_group G.

Equations
@[instance]
def subgroup.has_bot {G : Type u_1} [group G] :

The trivial subgroup {1} of an group G.

Equations
@[instance]
def add_subgroup.inhabited {G : Type u_1} [add_group G] :
Equations
@[instance]
def subgroup.inhabited {G : Type u_1} [group G] :
Equations
@[simp]
theorem subgroup.mem_bot {G : Type u_1} [group G] {x : G} :
x x = 1
@[simp]
theorem add_subgroup.mem_bot {G : Type u_1} [add_group G] {x : G} :
x x = 0
@[simp]
theorem add_subgroup.mem_top {G : Type u_1} [add_group G] (x : G) :
@[simp]
theorem subgroup.mem_top {G : Type u_1} [group G] (x : G) :
@[simp]
theorem subgroup.coe_top {G : Type u_1} [group G] :
@[simp]
theorem add_subgroup.coe_top {G : Type u_1} [add_group G] :
@[simp]
theorem add_subgroup.coe_bot {G : Type u_1} [add_group G] :
= {0}
@[simp]
theorem subgroup.coe_bot {G : Type u_1} [group G] :
= {1}
@[instance]
def subgroup.has_bot.bot.unique {G : Type u_1} [group G] :
Equations
theorem subgroup.eq_bot_iff_forall {G : Type u_1} [group G] (H : subgroup G) :
H = ∀ (x : G), x Hx = 1
theorem add_subgroup.eq_bot_iff_forall {G : Type u_1} [add_group G] (H : add_subgroup G) :
H = ∀ (x : G), x Hx = 0
theorem subgroup.eq_bot_of_subsingleton {G : Type u_1} [group G] (H : subgroup G) [subsingleton H] :
H =
@[instance]
def subgroup.fintype_bot {G : Type u_1} [group G] :
Equations
@[instance]
def add_subgroup.fintype_bot {G : Type u_1} [add_group G] :
Equations
@[simp]
theorem subgroup.card_bot {G : Type u_1} [group G] {_x : fintype } :
@[simp]
theorem add_subgroup.card_bot {G : Type u_1} [add_group G] {_x : fintype } :
theorem subgroup.eq_top_of_card_eq {G : Type u_1} [group G] (H : subgroup G) [fintype H] [fintype G] (h : fintype.card H = fintype.card G) :
H =
theorem subgroup.eq_top_of_le_card {G : Type u_1} [group G] (H : subgroup G) [fintype H] [fintype G] (h : fintype.card G fintype.card H) :
H =
theorem subgroup.eq_bot_of_card_le {G : Type u_1} [group G] (H : subgroup G) [fintype H] (h : fintype.card H 1) :
H =
theorem add_subgroup.eq_bot_of_card_le {G : Type u_1} [add_group G] (H : add_subgroup G) [fintype H] (h : fintype.card H 1) :
H =
theorem add_subgroup.eq_bot_of_card_eq {G : Type u_1} [add_group G] (H : add_subgroup G) [fintype H] (h : fintype.card H = 1) :
H =
theorem subgroup.eq_bot_of_card_eq {G : Type u_1} [group G] (H : subgroup G) [fintype H] (h : fintype.card H = 1) :
H =
theorem add_subgroup.nontrivial_iff_exists_ne_zero {G : Type u_1} [add_group G] (H : add_subgroup G) :
nontrivial H ∃ (x : G) (H : x H), x 0
theorem subgroup.nontrivial_iff_exists_ne_one {G : Type u_1} [group G] (H : subgroup G) :
nontrivial H ∃ (x : G) (H : x H), x 1
theorem subgroup.bot_or_nontrivial {G : Type u_1} [group G] (H : subgroup G) :

A subgroup is either the trivial subgroup or nontrivial.

theorem subgroup.bot_or_exists_ne_one {G : Type u_1} [group G] (H : subgroup G) :
H = ∃ (x : G) (H : x H), x 1

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

theorem add_subgroup.bot_or_exists_ne_zero {G : Type u_1} [add_group G] (H : add_subgroup G) :
H = ∃ (x : G) (H : x H), x 0
theorem subgroup.card_le_one_iff_eq_bot {G : Type u_1} [group G] (H : subgroup G) [fintype H] :
@[instance]
def subgroup.has_inf {G : Type u_1} [group G] :

The inf of two subgroups is their intersection.

Equations
@[instance]
def add_subgroup.has_inf {G : Type u_1} [add_group G] :

The inf of two add_subgroupss is their intersection.

Equations
@[simp]
theorem subgroup.coe_inf {G : Type u_1} [group G] (p p' : subgroup G) :
(p p') = p p'
@[simp]
theorem add_subgroup.coe_inf {G : Type u_1} [add_group G] (p p' : add_subgroup G) :
(p p') = p p'
@[simp]
theorem add_subgroup.mem_inf {G : Type u_1} [add_group G] {p p' : add_subgroup G} {x : G} :
x p p' x p x p'
@[simp]
theorem subgroup.mem_inf {G : Type u_1} [group G] {p p' : subgroup G} {x : G} :
x p p' x p x p'
@[instance]
def add_subgroup.has_Inf {G : Type u_1} [add_group G] :
Equations
@[instance]
def subgroup.has_Inf {G : Type u_1} [group G] :
Equations
@[simp]
theorem subgroup.coe_Inf {G : Type u_1} [group G] (H : set (subgroup G)) :
(Inf H) = ⋂ (s : subgroup G) (H : s H), s
@[simp]
theorem add_subgroup.coe_Inf {G : Type u_1} [add_group G] (H : set (add_subgroup G)) :
(Inf H) = ⋂ (s : add_subgroup G) (H : s H), s
@[simp]
theorem add_subgroup.mem_Inf {G : Type u_1} [add_group G] {S : set (add_subgroup G)} {x : G} :
x Inf S ∀ (p : add_subgroup G), p Sx p
@[simp]
theorem subgroup.mem_Inf {G : Type u_1} [group G] {S : set (subgroup G)} {x : G} :
x Inf S ∀ (p : subgroup G), p Sx p
theorem subgroup.mem_infi {G : Type u_1} [group G] {ι : Sort u_2} {S : ι → subgroup G} {x : G} :
(x ⨅ (i : ι), S i) ∀ (i : ι), x S i
theorem add_subgroup.mem_infi {G : Type u_1} [add_group G] {ι : Sort u_2} {S : ι → add_subgroup G} {x : G} :
(x ⨅ (i : ι), S i) ∀ (i : ι), x S i
@[simp]
theorem subgroup.coe_infi {G : Type u_1} [group G] {ι : Sort u_2} {S : ι → subgroup G} :
(⨅ (i : ι), S i) = ⋂ (i : ι), (S i)
@[simp]
theorem add_subgroup.coe_infi {G : Type u_1} [add_group G] {ι : Sort u_2} {S : ι → add_subgroup G} :
(⨅ (i : ι), S i) = ⋂ (i : ι), (S i)
@[instance]

Subgroups of a group form a complete lattice.

Equations
@[instance]

The add_subgroups of an add_group form a complete lattice.

Equations
theorem subgroup.mem_sup_left {G : Type u_1} [group G] {S T : subgroup G} {x : G} :
x Sx S T
theorem add_subgroup.mem_sup_left {G : Type u_1} [add_group G] {S T : add_subgroup G} {x : G} :
x Sx S T
theorem subgroup.mem_sup_right {G : Type u_1} [group G] {S T : subgroup G} {x : G} :
x Tx S T
theorem add_subgroup.mem_sup_right {G : Type u_1} [add_group G] {S T : add_subgroup G} {x : G} :
x Tx S T
theorem subgroup.mem_supr_of_mem {G : Type u_1} [group G] {ι : Type u_2} {S : ι → subgroup G} (i : ι) {x : G} :
x S ix supr S
theorem add_subgroup.mem_supr_of_mem {G : Type u_1} [add_group G] {ι : Type u_2} {S : ι → add_subgroup G} (i : ι) {x : G} :
x S ix supr S
theorem subgroup.mem_Sup_of_mem {G : Type u_1} [group G] {S : set (subgroup G)} {s : subgroup G} (hs : s S) {x : G} :
x sx Sup S
theorem add_subgroup.mem_Sup_of_mem {G : Type u_1} [add_group G] {S : set (add_subgroup G)} {s : add_subgroup G} (hs : s S) {x : G} :
x sx Sup S
@[simp]
@[simp]
theorem subgroup.nontrivial_iff {G : Type u_1} [group G] :
@[simp]
@[instance]
def add_subgroup.unique {G : Type u_1} [add_group G] [subsingleton G] :
Equations
@[instance]
def subgroup.unique {G : Type u_1} [group G] [subsingleton G] :
Equations
@[instance]
def subgroup.nontrivial {G : Type u_1} [group G] [nontrivial G] :
@[instance]
theorem add_subgroup.eq_top_iff' {G : Type u_1} [add_group G] (H : add_subgroup 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 add_subgroup.closure {G : Type u_1} [add_group G] (k : set G) :

The add_subgroup generated by a set

Equations
def subgroup.closure {G : Type u_1} [group G] (k : set G) :

The subgroup generated by a set.

Equations
theorem subgroup.mem_closure {G : Type u_1} [group G] {k : set G} {x : G} :
x subgroup.closure k ∀ (K : subgroup G), k Kx K
theorem add_subgroup.mem_closure {G : Type u_1} [add_group G] {k : set G} {x : G} :
x add_subgroup.closure k ∀ (K : add_subgroup G), k Kx K
@[simp]
theorem subgroup.subset_closure {G : Type u_1} [group G] {k : set G} :

The subgroup generated by a set includes the set.

@[simp]
theorem add_subgroup.subset_closure {G : Type u_1} [add_group G] {k : set G} :

The add_subgroup generated by a set includes the set.

theorem add_subgroup.not_mem_of_not_mem_closure {G : Type u_1} [add_group G] {k : set G} {P : G} (hP : P add_subgroup.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 subgroup.closure_le {G : Type u_1} [group G] (K : subgroup G) {k : set G} :

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

@[simp]
theorem add_subgroup.closure_le {G : Type u_1} [add_group G] (K : add_subgroup G) {k : set G} :

An additive subgroup K includes closure k if and only if it includes 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) :
theorem add_subgroup.closure_eq_of_le {G : Type u_1} [add_group G] (K : add_subgroup G) {k : set G} (h₁ : k K) (h₂ : K add_subgroup.closure 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 kp x) (H1 : p 1) (Hmul : ∀ (x y : G), p xp yp (x * y)) (Hinv : ∀ (x : G), p xp 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 add_subgroup.closure_induction {G : Type u_1} [add_group G] {k : set G} {p : G → Prop} {x : G} (h : x add_subgroup.closure k) (Hk : ∀ (x : G), x kp x) (H1 : p 0) (Hmul : ∀ (x y : G), p xp yp (x + y)) (Hinv : ∀ (x : G), p xp (-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 : (subgroup.closure k) → Prop} (Hk : ∀ (x : G) (h : x k), p x, _⟩) (H1 : p 1) (Hmul : ∀ (x y : (subgroup.closure k)), p xp yp (x * y)) (Hinv : ∀ (x : (subgroup.closure k)), p xp x⁻¹) (x : (subgroup.closure k)) :
p x

An induction principle on elements of the subtype subgroup.closure. If p holds for 1 and all elements of k, and is preserved under multiplication and inverse, then p holds for all elements x : closure k.

The difference with subgroup.closure_induction is that this acts on the subtype.

theorem add_subgroup.closure_induction' {G : Type u_1} [add_group G] (k : set G) {p : (add_subgroup.closure k) → Prop} (Hk : ∀ (x : G) (h : x k), p x, _⟩) (H1 : p 0) (Hmul : ∀ (x y : (add_subgroup.closure k)), p xp yp (x + y)) (Hinv : ∀ (x : (add_subgroup.closure k)), p xp (-x)) (x : (add_subgroup.closure k)) :
p x

An induction principle on elements of the subtype add_subgroup.closure. If p holds for 0 and all elements of k, and is preserved under addition and negation, then p holds for all elements x : closure k.

The difference with add_subgroup.closure_induction is that this acts on the subtype.

closure forms a Galois insertion with the coercion to set.

Equations

closure forms a Galois insertion with the coercion to set.

Equations
theorem subgroup.closure_mono {G : Type u_1} [group G] ⦃h k : set G⦄ (h' : h k) :

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

theorem add_subgroup.closure_mono {G : Type u_1} [add_group G] ⦃h k : set G⦄ (h' : h k) :

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

@[simp]
theorem subgroup.closure_eq {G : Type u_1} [group G] (K : subgroup G) :

Closure of a subgroup K equals K.

@[simp]
theorem add_subgroup.closure_eq {G : Type u_1} [add_group G] (K : add_subgroup G) :

Additive closure of an additive subgroup K equals K

@[simp]
@[simp]
theorem subgroup.closure_empty {G : Type u_1} [group G] :
@[simp]
theorem subgroup.closure_univ {G : Type u_1} [group G] :
theorem subgroup.closure_union {G : Type u_1} [group G] (s t : set G) :
theorem subgroup.closure_Union {G : Type u_1} [group G] {ι : Sort u_2} (s : ι → set G) :
subgroup.closure (⋃ (i : ι), s i) = ⨆ (i : ι), subgroup.closure (s i)
theorem add_subgroup.closure_Union {G : Type u_1} [add_group G] {ι : Sort u_2} (s : ι → set G) :
add_subgroup.closure (⋃ (i : ι), s i) = ⨆ (i : ι), add_subgroup.closure (s i)
theorem subgroup.closure_eq_bot_iff (G : Type u_1) [group G] (S : set G) :
theorem add_subgroup.closure_eq_bot_iff (G : Type u_1) [add_group G] (S : set G) :
theorem subgroup.mem_closure_singleton {G : Type u_1} [group G] {x 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 subgroup.closure_singleton_one {G : Type u_1} [group G] :
@[simp]
theorem subgroup.inv_subset_closure {G : Type u_1} [group G] (S : set G) :
@[simp]
theorem add_subgroup.neg_subset_closure {G : Type u_1} [add_group G] (S : set G) :
@[simp]
theorem subgroup.closure_inv {G : Type u_1} [group G] (S : set G) :
@[simp]
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 kp x) (Hk_inv : ∀ (x : G), x kp x⁻¹) (H1 : p 1) (Hmul : ∀ (x y : G), p xp yp (x * y)) :
p x

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

theorem add_subgroup.closure_induction'' {G : Type u_1} [add_group G] {k : set G} {p : G → Prop} {x : G} (h : x add_subgroup.closure k) (Hk : ∀ (x : G), x kp x) (Hk_inv : ∀ (x : G), x kp (-x)) (H1 : p 0) (Hmul : ∀ (x y : G), p xp yp (x + y)) :
p x

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

theorem add_subgroup.mem_supr_of_directed {G : Type u_1} [add_group G] {ι : Sort u_2} [hι : nonempty ι] {K : ι → add_subgroup G} (hK : directed has_le.le K) {x : G} :
x supr K ∃ (i : ι), x K i
theorem subgroup.mem_supr_of_directed {G : Type u_1} [group G] {ι : Sort u_2} [hι : nonempty ι] {K : ι → subgroup G} (hK : directed has_le.le K) {x : G} :
x supr K ∃ (i : ι), x K i
theorem subgroup.coe_supr_of_directed {G : Type u_1} [group G] {ι : Sort u_2} [nonempty ι] {S : ι → subgroup G} (hS : directed has_le.le S) :
(⨆ (i : ι), S i) = ⋃ (i : ι), (S i)
theorem add_subgroup.coe_supr_of_directed {G : Type u_1} [add_group G] {ι : Sort u_2} [nonempty ι] {S : ι → add_subgroup G} (hS : directed has_le.le S) :
(⨆ (i : ι), S i) = ⋃ (i : ι), (S i)
theorem add_subgroup.mem_Sup_of_directed_on {G : Type u_1} [add_group G] {K : set (add_subgroup G)} (Kne : K.nonempty) (hK : directed_on has_le.le K) {x : G} :
x Sup K ∃ (s : add_subgroup G) (H : s K), x s
theorem subgroup.mem_Sup_of_directed_on {G : Type u_1} [group G] {K : set (subgroup G)} (Kne : K.nonempty) (hK : directed_on has_le.le K) {x : G} :
x Sup K ∃ (s : subgroup G) (H : s K), x s
def subgroup.comap {G : Type u_1} [group G] {N : Type u_2} [group N] (f : G →* N) (H : subgroup N) :

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

Equations
def add_subgroup.comap {G : Type u_1} [add_group G] {N : Type u_2} [add_group N] (f : G →+ N) (H : add_subgroup N) :

The preimage of an add_subgroup along an add_monoid homomorphism is an add_subgroup.

Equations
@[simp]
theorem subgroup.coe_comap {G : Type u_1} [group G] {N : Type u_3} [group N] (K : subgroup N) (f : G →* N) :
@[simp]
theorem add_subgroup.coe_comap {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (K : add_subgroup N) (f : G →+ N) :
@[simp]
theorem add_subgroup.mem_comap {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {K : add_subgroup N} {f : G →+ N} {x : G} :
@[simp]
theorem subgroup.mem_comap {G : Type u_1} [group G] {N : Type u_3} [group N] {K : subgroup N} {f : G →* N} {x : G} :
theorem subgroup.comap_mono {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G →* N} {K K' : subgroup N} :
theorem add_subgroup.comap_mono {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G →+ N} {K K' : add_subgroup N} :
theorem add_subgroup.comap_comap {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {P : Type u_4} [add_group P] (K : add_subgroup P) (g : N →+ P) (f : G →+ N) :
theorem subgroup.comap_comap {G : Type u_1} [group G] {N : Type u_3} [group N] {P : Type u_4} [group P] (K : subgroup P) (g : N →* P) (f : G →* N) :
def add_subgroup.map {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) (H : add_subgroup G) :

The image of an add_subgroup along an add_monoid homomorphism is an add_subgroup.

Equations
def subgroup.map {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) (H : subgroup G) :

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

Equations
@[simp]
theorem add_subgroup.coe_map {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) (K : add_subgroup G) :
@[simp]
theorem subgroup.coe_map {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) (K : subgroup G) :
@[simp]
theorem add_subgroup.mem_map {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G →+ N} {K : add_subgroup G} {y : N} :
y add_subgroup.map f K ∃ (x : G) (H : x K), f x = y
@[simp]
theorem subgroup.mem_map {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G →* N} {K : subgroup G} {y : N} :
y subgroup.map f K ∃ (x : G) (H : x K), f x = y
theorem add_subgroup.mem_map_of_mem {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) {K : add_subgroup G} {x : G} (hx : x K) :
theorem subgroup.mem_map_of_mem {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) {K : subgroup G} {x : G} (hx : x K) :
theorem add_subgroup.apply_coe_mem_map {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) (K : add_subgroup G) (x : K) :
theorem subgroup.apply_coe_mem_map {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) (K : subgroup G) (x : K) :
theorem add_subgroup.map_mono {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G →+ N} {K K' : add_subgroup G} :
theorem subgroup.map_mono {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G →* N} {K K' : subgroup G} :
K K'subgroup.map f K subgroup.map f K'
@[simp]
theorem add_subgroup.map_id {G : Type u_1} [add_group G] (K : add_subgroup G) :
@[simp]
theorem subgroup.map_id {G : Type u_1} [group G] (K : subgroup G) :
theorem add_subgroup.map_map {G : Type u_1} [add_group G] (K : add_subgroup G) {N : Type u_3} [add_group N] {P : Type u_4} [add_group P] (g : N →+ P) (f : G →+ N) :
theorem subgroup.map_map {G : Type u_1} [group G] (K : subgroup G) {N : Type u_3} [group N] {P : Type u_4} [group P] (g : N →* P) (f : G →* N) :
theorem subgroup.mem_map_equiv {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G ≃* N} {K : subgroup G} {x : N} :
theorem add_subgroup.mem_map_equiv {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G ≃+ N} {K : add_subgroup G} {x : N} :
theorem subgroup.mem_map_iff_mem {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G →* N} (hf : function.injective f) {K : subgroup G} {x : G} :
theorem add_subgroup.mem_map_iff_mem {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G →+ N} (hf : function.injective f) {K : add_subgroup G} {x : G} :
theorem subgroup.map_equiv_eq_comap_symm {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G ≃* N) (K : subgroup G) :
theorem subgroup.comap_equiv_eq_map_symm {G : Type u_1} [group G] {N : Type u_3} [group N] (f : N ≃* G) (K : subgroup G) :
theorem add_subgroup.map_le_iff_le_comap {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {f : G →+ N} {K : add_subgroup G} {H : add_subgroup N} :
theorem subgroup.map_le_iff_le_comap {G : Type u_1} [group G] {N : Type u_3} [group N] {f : G →* N} {K : subgroup G} {H : subgroup N} :
theorem subgroup.gc_map_comap {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) :
theorem add_subgroup.gc_map_comap {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) :
theorem add_subgroup.map_sup {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H K : add_subgroup G) (f : G →+ N) :
theorem subgroup.map_sup {G : Type u_1} [group G] {N : Type u_3} [group N] (H K : subgroup G) (f : G →* N) :
theorem add_subgroup.map_supr {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {ι : Sort u_2} (f : G →+ N) (s : ι → add_subgroup G) :
add_subgroup.map f (supr s) = ⨆ (i : ι), add_subgroup.map f (s i)
theorem subgroup.map_supr {G : Type u_1} [group G] {N : Type u_3} [group N] {ι : Sort u_2} (f : G →* N) (s : ι → subgroup G) :
subgroup.map f (supr s) = ⨆ (i : ι), subgroup.map f (s i)
theorem add_subgroup.comap_sup_comap_le {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H K : add_subgroup N) (f : G →+ N) :
theorem subgroup.comap_sup_comap_le {G : Type u_1} [group G] {N : Type u_3} [group N] (H K : subgroup N) (f : G →* N) :
theorem add_subgroup.supr_comap_le {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {ι : Sort u_2} (f : G →+ N) (s : ι → add_subgroup N) :
(⨆ (i : ι), add_subgroup.comap f (s i)) add_subgroup.comap f (supr s)
theorem subgroup.supr_comap_le {G : Type u_1} [group G] {N : Type u_3} [group N] {ι : Sort u_2} (f : G →* N) (s : ι → subgroup N) :
(⨆ (i : ι), subgroup.comap f (s i)) subgroup.comap f (supr s)
theorem add_subgroup.comap_inf {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H K : add_subgroup N) (f : G →+ N) :
theorem subgroup.comap_inf {G : Type u_1} [group G] {N : Type u_3} [group N] (H K : subgroup N) (f : G →* N) :
theorem subgroup.comap_infi {G : Type u_1} [group G] {N : Type u_3} [group N] {ι : Sort u_2} (f : G →* N) (s : ι → subgroup N) :
subgroup.comap f (infi s) = ⨅ (i : ι), subgroup.comap f (s i)
theorem add_subgroup.comap_infi {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {ι : Sort u_2} (f : G →+ N) (s : ι → add_subgroup N) :
add_subgroup.comap f (infi s) = ⨅ (i : ι), add_subgroup.comap f (s i)
theorem add_subgroup.map_inf_le {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H K : add_subgroup G) (f : G →+ N) :
theorem subgroup.map_inf_le {G : Type u_1} [group G] {N : Type u_3} [group N] (H K : subgroup G) (f : G →* N) :
theorem subgroup.map_inf_eq {G : Type u_1} [group G] {N : Type u_3} [group N] (H K : subgroup G) (f : G →* N) (hf : function.injective f) :
theorem add_subgroup.map_inf_eq {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H K : add_subgroup G) (f : G →+ N) (hf : function.injective f) :
@[simp]
theorem add_subgroup.map_bot {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) :
@[simp]
theorem subgroup.map_bot {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) :
@[simp]
theorem subgroup.comap_top {G : Type u_1} [group G] {N : Type u_3} [group N] (f : G →* N) :
@[simp]
theorem add_subgroup.comap_top {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (f : G →+ N) :
@[simp]
theorem subgroup.comap_subtype_inf_left {G : Type u_1} [group G] {H K : subgroup G} :
@[simp]
theorem subgroup.comap_subtype_inf_right {G : Type u_1} [group G] {H K : subgroup G} :
def subgroup.comap_subtype_equiv_of_le {G : Type u_1} [group G] {H K : subgroup G} (h : H K) :

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

Equations

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

Equations
@[simp]
@[simp]
def add_subgroup.add_subgroup_of {G : Type u_1} [add_group G] (H K : add_subgroup G) :

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

Equations
def subgroup.subgroup_of {G : Type u_1} [group G] (H K : subgroup G) :

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

Equations
theorem subgroup.coe_subgroup_of {G : Type u_1} [group G] (H K : subgroup G) :
theorem subgroup.mem_subgroup_of {G : Type u_1} [group G] {H K : subgroup G} {h : K} :
theorem add_subgroup.mem_add_subgroup_of {G : Type u_1} [add_group G] {H K : add_subgroup G} {h : K} :
theorem subgroup.subgroup_of_map_subtype {G : Type u_1} [group G] (H K : subgroup G) :
@[simp]
@[simp]
theorem subgroup.bot_subgroup_of {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem subgroup.top_subgroup_of {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem subgroup.subgroup_of_bot_eq_bot {G : Type u_1} [group G] (H : subgroup G) :
theorem subgroup.subgroup_of_bot_eq_top {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem subgroup.subgroup_of_self {G : Type u_1} [group G] (H : subgroup G) :
@[simp]
theorem add_subgroup.add_subgroup_of_self {G : Type u_1} [add_group G] (H : add_subgroup G) :
def add_subgroup.prod {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H : add_subgroup G) (K : add_subgroup N) :

Given add_subgroups H, K of add_groups A, B respectively, H × K as an add_subgroup of A × B.

Equations
def subgroup.prod {G : Type u_1} [group G] {N : Type u_3} [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
theorem subgroup.coe_prod {G : Type u_1} [group G] {N : Type u_3} [group N] (H : subgroup G) (K : subgroup N) :
(H.prod K) = H.prod K
theorem add_subgroup.coe_prod {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H : add_subgroup G) (K : add_subgroup N) :
(H.prod K) = H.prod K
theorem add_subgroup.mem_prod {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] {H : add_subgroup G} {K : add_subgroup N} {p : G × N} :
p H.prod K p.fst H p.snd K
theorem subgroup.mem_prod {G : Type u_1} [group G] {N : Type u_3} [group N] {H : subgroup G} {K : subgroup N} {p : G × N} :
p H.prod K p.fst H p.snd K
theorem subgroup.prod_mono {G : Type u_1} [group G] {N : Type u_3} [group N] :
theorem subgroup.prod_mono_right {G : Type u_1} [group G] {N : Type u_3} [group N] (K : subgroup G) :
monotone (λ (t : subgroup N), K.prod t)
theorem add_subgroup.prod_mono_right {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (K : add_subgroup G) :
monotone (λ (t : add_subgroup N), K.prod t)
theorem add_subgroup.prod_mono_left {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H : add_subgroup N) :
monotone (λ (K : add_subgroup G), K.prod H)
theorem subgroup.prod_mono_left {G : Type u_1} [group G] {N : Type u_3} [group N] (H : subgroup N) :
monotone (λ (K : subgroup G), K.prod H)
theorem add_subgroup.prod_top {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (K : add_subgroup G) :
theorem subgroup.prod_top {G : Type u_1} [group G] {N : Type u_3} [group N] (K : subgroup G) :
theorem add_subgroup.top_prod {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H : add_subgroup N) :
theorem subgroup.top_prod {G : Type u_1} [group G] {N : Type u_3} [group N] (H : subgroup N) :
@[simp]
theorem subgroup.top_prod_top {G : Type u_1} [group G] {N : Type u_3} [group N] :
@[simp]
theorem add_subgroup.top_prod_top {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] :
theorem subgroup.bot_prod_bot {G : Type u_1} [group G] {N : Type u_3} [group N] :
theorem add_subgroup.bot_sum_bot {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] :
def subgroup.prod_equiv {G : Type u_1} [group G] {N : Type u_3} [group N] (H : subgroup G) (K : subgroup N) :

Product of subgroups is isomorphic to their product as groups.

Equations
def add_subgroup.prod_equiv {G : Type u_1} [add_group G] {N : Type u_3} [add_group N] (H : add_subgroup G) (K : add_subgroup N) :

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

Equations
@[instance]
def subgroup.normal_of_comm {G : Type u_1} [comm_group G] (H : subgroup G) :
@[instance]
def add_subgroup.normal_of_comm {G : Type u_1} [add_comm_group G] (H : add_subgroup G) :
theorem add_subgroup.normal.mem_comm {G : Type u_1} [add_group G] {H : add_subgroup G} (nH : H.normal) {a b : G} (h : a + b H) :
b + a H
theorem subgroup.normal.mem_comm {G : Type u_1} [group G] {H : subgroup G} (nH : H.normal) {a b : G} (h : a * b H) :
b * a H
theorem subgroup.normal.mem_comm_iff {G : Type u_1} [group G] {H : subgroup G} (nH : H.normal) {a b : G} :
a * b H b * a H
theorem add_subgroup.normal.mem_comm_iff {G : Type u_1} [add_group G] {H : add_subgroup G} (nH : H.normal) {a b : G} :
a + b H b + a H
@[instance]
def add_subgroup.bot_normal {G : Type u_1} [add_group G] :
@[instance]
def subgroup.bot_normal {G : Type u_1} [group G] :
@[instance]
def subgroup.top_normal {G : Type u_1} [group G] :
@[instance]
def add_subgroup.top_normal {G : Type u_1} [add_group G] :
def add_subgroup.center (G : Type u_1) [add_group G] :

The center of an additive group G is the set of elements that commute with everything in G

Equations
def subgroup.center (G : Type u_1) [group G] :

The center of a group G is the set of elements that commute with everything in G

Equations
theorem subgroup.coe_center (G : Type u_1) [group G] :
theorem subgroup.mem_center_iff {G : Type u_1} [group G] {z : G} :
z subgroup.center G ∀ (g : G), g * z = z * g
theorem add_subgroup.mem_center_iff {G : Type u_1} [add_group G] {z : G} :
z add_subgroup.center G ∀ (g : G), g + z = z + g
@[instance]
def subgroup.decidable_mem_center {G : Type u_1} [group G] [decidable_eq G] [fintype G] :
decidable_pred (λ (_x : G), _x subgroup.center G)
Equations
@[instance]
@[instance]
def subgroup.center_normal {G : Type u_1} [group G] :
def add_subgroup.normalizer {G : Type u_1} [add_group G] (H : add_subgroup G) :

The normalizer of H is the largest subgroup of G inside which H is normal.

Equations
def subgroup.normalizer {G : Type u_1} [group G] (H : subgroup G) :

The normalizer of H is the largest subgroup of G inside which H is normal.

Equations
def subgroup.set_normalizer {G : Type u_1} [group G] (S : set G) :

The set_normalizer of S is the subgroup of G whose elements satisfy g*S*g⁻¹=S

Equations
def add_subgroup.set_normalizer {G : Type u_1} [add_group G] (S : set G) :

The set_normalizer of S is the subgroup of G whose elements satisfy g+S-g=S.

Equations
theorem subgroup.mem_normalizer_fintype {G : Type u_1} [group G] {S : set G} [fintype S] {x : G} (h : ∀ (n : G), n S(x * n) * x⁻¹ S) :
theorem add_subgroup.mem_normalizer_iff {G : Type u_1} [add_group G] {H : add_subgroup G} {g : G} :
g H.normalizer ∀ (n : G), n H g + n + -g H
theorem subgroup.mem_normalizer_iff {G : Type u_1} [group G] {H : subgroup G} {g : G} :
g H.normalizer ∀ (n : G), n H (g * n) * g⁻¹ H
theorem add_subgroup.le_normalizer {G : Type u_1} [add_group G] {H : add_subgroup G} :
theorem subgroup.le_normalizer {G : Type u_1} [group G] {H : subgroup G} :
H H.