mathlib documentation

group_theory.congruence

Congruence relations #

This file defines congruence relations: equivalence relations that preserve a binary operation, which in this case is multiplication or addition. The principal definition is a structure extending a setoid (an equivalence relation), and the inductive definition of the smallest congruence relation containing a binary relation is also given (see con_gen).

The file also proves basic properties of the quotient of a type by a congruence relation, and the complete lattice of congruence relations on a type. We then establish an order-preserving bijection between the set of congruence relations containing a congruence relation c and the set of congruence relations on the quotient by c.

The second half of the file concerns congruence relations on monoids, in which case the quotient by the congruence relation is also a monoid. There are results about the universal property of quotients of monoids, and the isomorphism theorems for monoids.

Implementation notes #

The inductive definition of a congruence relation could be a nested inductive type, defined using the equivalence closure of a binary relation eqv_gen, but the recursor generated does not work. A nested inductive definition could conceivably shorten proofs, because they would allow invocation of the corresponding lemmas about eqv_gen.

The lemmas refl, symm and trans are not tagged with @[refl], @[symm], and @[trans] respectively as these tags do not work on a structure coerced to a binary relation.

There is a coercion from elements of a type to the element's equivalence class under a congruence relation.

A congruence relation on a monoid M can be thought of as a submonoid of M × M for which membership is an equivalence relation, but whilst this fact is established in the file, it is not used, since this perspective adds more layers of definitional unfolding.

Tags #

congruence, congruence relation, quotient, quotient by congruence relation, monoid, quotient monoid, isomorphism theorems

source
structure add_con (M : Type u_1) [has_add M] :
Type u_1

A congruence relation on a type with an addition is an equivalence relation which preserves addition.

source
structure con (M : Type u_1) [has_mul M] :
Type u_1

A congruence relation on a type with a multiplication is an equivalence relation which preserves multiplication.

source
inductive add_con_gen.rel {M : Type u_1} [has_add M] (r : M → M → Prop) :
M → M → Prop

The inductively defined smallest additive congruence relation containing a given binary relation.

source
inductive con_gen.rel {M : Type u_1} [has_mul M] (r : M → M → Prop) :
M → M → Prop

The inductively defined smallest multiplicative congruence relation containing a given binary relation.

source
def add_con_gen {M : Type u_1} [has_add M] (r : M → M → Prop) :
add_con M

The inductively defined smallest additive congruence relation containing a given binary relation.

Equations
source
def con_gen {M : Type u_1} [has_mul M] (r : M → M → Prop) :
con M

The inductively defined smallest multiplicative congruence relation containing a given binary relation.

Equations
source
@[protected, instance]
def con.inhabited {M : Type u_1} [has_mul M] :
inhabited (con M)
Equations
source
@[protected, instance]
def add_con.inhabited {M : Type u_1} [has_add M] :
inhabited (add_con M)
Equations
source
@[protected, instance]
def add_con.has_coe_to_fun {M : Type u_1} [has_add M] :
has_coe_to_fun (add_con M) (λ (_x : add_con M), M → M → Prop)

A coercion from an additive congruence relation to its underlying binary relation.

Equations
source
@[protected, instance]
def con.has_coe_to_fun {M : Type u_1} [has_mul M] :
has_coe_to_fun (con M) (λ (_x : con M), M → M → Prop)

A coercion from a congruence relation to its underlying binary relation.

Equations
source
@[simp]
theorem con.rel_eq_coe {M : Type u_1} [has_mul M] (c : con M) :
setoid.r = ⇑c
source
@[simp]
theorem add_con.rel_eq_coe {M : Type u_1} [has_add M] (c : add_con M) :
setoid.r = ⇑c
source
@[protected]
theorem con.refl {M : Type u_1} [has_mul M] (c : con M) (x : M) :
⇑c x x

Congruence relations are reflexive.

source
@[protected]
theorem add_con.refl {M : Type u_1} [has_add M] (c : add_con M) (x : M) :
⇑c x x

Additive congruence relations are reflexive.

source
@[protected]
theorem add_con.symm {M : Type u_1} [has_add M] (c : add_con M) {x y : M} :
⇑c x y → ⇑c y x

Additive congruence relations are symmetric.

source
@[protected]
theorem con.symm {M : Type u_1} [has_mul M] (c : con M) {x y : M} :
⇑c x y → ⇑c y x

Congruence relations are symmetric.

source
@[protected]
theorem add_con.trans {M : Type u_1} [has_add M] (c : add_con M) {x y z : M} :
⇑c x y → ⇑c y z → ⇑c x z

Additive congruence relations are transitive.

source
@[protected]
theorem con.trans {M : Type u_1} [has_mul M] (c : con M) {x y z : M} :
⇑c x y → ⇑c y z → ⇑c x z

Congruence relations are transitive.

source
@[protected]
theorem con.mul {M : Type u_1} [has_mul M] (c : con M) {w x y z : M} :
⇑c w x → ⇑c y z → ⇑c (w * y) (x * z)

Multiplicative congruence relations preserve multiplication.

source
@[protected]
theorem add_con.add {M : Type u_1} [has_add M] (c : add_con M) {w x y z : M} :
⇑c w x → ⇑c y z → ⇑c (w + y) (x + z)

Additive congruence relations preserve addition.

source
@[simp]
theorem add_con.rel_mk {M : Type u_1} [has_add M] {s : setoid M} {h : ∀ {w x y z : M}, setoid.r w x → setoid.r y z → setoid.r (w + y) (x + z)} {a b : M} :
⇑{to_setoid := s, add' := h} a b ↔ setoid.r a b
source
@[simp]
theorem con.rel_mk {M : Type u_1} [has_mul M] {s : setoid M} {h : ∀ {w x y z : M}, setoid.r w x → setoid.r y z → setoid.r (w * y) (x * z)} {a b : M} :
⇑{to_setoid := s, mul' := h} a b ↔ setoid.r a b
source
@[protected, instance]
def con.has_mem {M : Type u_1} [has_mul M] :
has_mem (M × M) (con M)

Given a type M with a multiplication, a congruence relation c on M, and elements of M x, y, (x, y) ∈ M × M iff x is related to y by c.

Equations
source
@[protected, instance]
def add_con.has_mem {M : Type u_1} [has_add M] :
has_mem (M × M) (add_con M)

Given a type M with an addition, x, y ∈ M, and an additive congruence relation c on M, (x, y) ∈ M × M iff x is related to y by c.

Equations
source
theorem con.ext' {M : Type u_1} [has_mul M] {c d : con M} (H : setoid.r = setoid.r) :
c = d

The map sending a congruence relation to its underlying binary relation is injective.

source
theorem add_con.ext' {M : Type u_1} [has_add M] {c d : add_con M} (H : setoid.r = setoid.r) :
c = d

The map sending an additive congruence relation to its underlying binary relation is injective.

source
@[ext]
theorem con.ext {M : Type u_1} [has_mul M] {c d : con M} (H : ∀ (x y : M), ⇑c x y ↔ ⇑d x y) :
c = d

Extensionality rule for congruence relations.

source
theorem add_con.ext {M : Type u_1} [has_add M] {c d : add_con M} (H : ∀ (x y : M), ⇑c x y ↔ ⇑d x y) :
c = d

Extensionality rule for additive congruence relations.

source
theorem con.to_setoid_inj {M : Type u_1} [has_mul M] {c d : con M} (H : c.to_setoid = d.to_setoid) :
c = d

The map sending a congruence relation to its underlying equivalence relation is injective.

source
theorem add_con.to_setoid_inj {M : Type u_1} [has_add M] {c d : add_con M} (H : c.to_setoid = d.to_setoid) :
c = d

The map sending an additive congruence relation to its underlying equivalence relation is injective.

source
theorem add_con.ext_iff {M : Type u_1} [has_add M] {c d : add_con M} :
(∀ (x y : M), ⇑c x y ↔ ⇑d x y) ↔ c = d

Iff version of extensionality rule for additive congruence relations.

source
theorem con.ext_iff {M : Type u_1} [has_mul M] {c d : con M} :
(∀ (x y : M), ⇑c x y ↔ ⇑d x y) ↔ c = d

Iff version of extensionality rule for congruence relations.

source
theorem con.ext'_iff {M : Type u_1} [has_mul M] {c d : con M} :
setoid.r = setoid.r ↔ c = d

Two congruence relations are equal iff their underlying binary relations are equal.

source
theorem add_con.ext'_iff {M : Type u_1} [has_add M] {c d : add_con M} :
setoid.r = setoid.r ↔ c = d

Two additive congruence relations are equal iff their underlying binary relations are equal.

source
def add_con.add_ker {M : Type u_1} {P : Type u_3} [has_add M] [has_add P] (f : M → P) (h : ∀ (x y : M), f (x + y) = f x + f y) :
add_con M

The kernel of an addition-preserving function as an additive congruence relation.

Equations
source
def con.mul_ker {M : Type u_1} {P : Type u_3} [has_mul M] [has_mul P] (f : M → P) (h : ∀ (x y : M), f (x * y) = (f x) * f y) :
con M

The kernel of a multiplication-preserving function as a congruence relation.

Equations
source
@[protected]
def con.prod {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] (c : con M) (d : con N) :
con (M × N)

Given types with multiplications M, N, the product of two congruence relations c on M and d on N: (x₁, x₂), (y₁, y₂) ∈ M × N are related by c.prod d iff x₁ is related to y₁ by c and x₂ is related to y₂ by d.

Equations
source
@[protected]
def add_con.prod {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] (c : add_con M) (d : add_con N) :
add_con (M × N)

Given types with additions M, N, the product of two congruence relations c on M and d on N: (x₁, x₂), (y₁, y₂) ∈ M × N are related by c.prod d iff x₁ is related to y₁ by c and x₂ is related to y₂ by d.

Equations
source
def con.pi {ι : Type u_1} {f : ι → Type u_2} [Π (i : ι), has_mul (f i)] (C : Π (i : ι), con (f i)) :
con (Π (i : ι), f i)

The product of an indexed collection of congruence relations.

Equations
source
def add_con.pi {ι : Type u_1} {f : ι → Type u_2} [Π (i : ι), has_add (f i)] (C : Π (i : ι), add_con (f i)) :
add_con (Π (i : ι), f i)

The product of an indexed collection of additive congruence relations.

Equations
source
@[protected]
def add_con.quotient {M : Type u_1} [has_add M] (c : add_con M) :
Type u_1

Defining the quotient by an additive congruence relation of a type with an addition.

Equations
source
@[protected]
def con.quotient {M : Type u_1} [has_mul M] (c : con M) :
Type u_1

Defining the quotient by a congruence relation of a type with a multiplication.

Equations
source
@[protected, instance]
def con.quotient.has_coe_t {M : Type u_1} [has_mul M] (c : con M) :
has_coe_t M c.quotient

Coercion from a type with a multiplication to its quotient by a congruence relation.

See Note [use has_coe_t].

Equations
source
@[protected, instance]
def add_con.quotient.has_coe_t {M : Type u_1} [has_add M] (c : add_con M) :
has_coe_t M c.quotient

Coercion from a type with an addition to its quotient by an additive congruence relation

Equations
source
@[protected, instance]
def con.quotient.decidable_eq {M : Type u_1} [has_mul M] (c : con M) [d : Π (a b : M), decidable (⇑c a b)] :
decidable_eq c.quotient

The quotient by a decidable congruence relation has decidable equality.

Equations
source
@[protected, instance]
def add_con.quotient.decidable_eq {M : Type u_1} [has_add M] (c : add_con M) [d : Π (a b : M), decidable (⇑c a b)] :
decidable_eq c.quotient

The quotient by a decidable additive congruence relation has decidable equality.

Equations
source
@[simp]
theorem con.quot_mk_eq_coe {M : Type u_1} [has_mul M] (c : con M) (x : M) :
quot.mk ⇑c x = ↑x
source
@[simp]
theorem add_con.quot_mk_eq_coe {M : Type u_1} [has_add M] (c : add_con M) (x : M) :
quot.mk ⇑c x = ↑x
source
@[protected]
def con.lift_on {M : Type u_1} [has_mul M] {β : Sort u_2} {c : con M} (q : c.quotient) (f : M → β) (h : ∀ (a b : M), ⇑c a b → f a = f b) :
β

The function on the quotient by a congruence relation c induced by a function that is constant on c's equivalence classes.

Equations
source
@[protected]
def add_con.lift_on {M : Type u_1} [has_add M] {β : Sort u_2} {c : add_con M} (q : c.quotient) (f : M → β) (h : ∀ (a b : M), ⇑c a b → f a = f b) :
β

The function on the quotient by a congruence relation c induced by a function that is constant on c's equivalence classes.

Equations
source
@[protected]
def add_con.lift_on₂ {M : Type u_1} [has_add M] {β : Sort u_2} {c : add_con M} (q r : c.quotient) (f : M → M → β) (h : ∀ (a₁ a₂ b₁ b₂ : M), ⇑c a₁ b₁ → ⇑c a₂ b₂ → f a₁ a₂ = f b₁ b₂) :
β

The binary function on the quotient by a congruence relation c induced by a binary function that is constant on c's equivalence classes.

Equations
source
@[protected]
def con.lift_on₂ {M : Type u_1} [has_mul M] {β : Sort u_2} {c : con M} (q r : c.quotient) (f : M → M → β) (h : ∀ (a₁ a₂ b₁ b₂ : M), ⇑c a₁ b₁ → ⇑c a₂ b₂ → f a₁ a₂ = f b₁ b₂) :
β

The binary function on the quotient by a congruence relation c induced by a binary function that is constant on c's equivalence classes.

Equations
source
@[protected]
def add_con.hrec_on₂ {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] {cM : add_con M} {cN : add_con N} {φ : cM.quotient → cN.quotient → Sort u_3} (a : cM.quotient) (b : cN.quotient) (f : Π (x : M) (y : N), φ ↑x ↑y) (h : ∀ (x : M) (y : N) (x' : M) (y' : N), ⇑cM x x' → ⇑cN y y' → f x y == f x' y') :
φ a b

A version of quotient.hrec_on₂' for quotients by add_con.

Equations
source
@[protected]
def con.hrec_on₂ {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] {cM : con M} {cN : con N} {φ : cM.quotient → cN.quotient → Sort u_3} (a : cM.quotient) (b : cN.quotient) (f : Π (x : M) (y : N), φ ↑x ↑y) (h : ∀ (x : M) (y : N) (x' : M) (y' : N), ⇑cM x x' → ⇑cN y y' → f x y == f x' y') :
φ a b

A version of quotient.hrec_on₂' for quotients by con.

Equations
source
@[simp]
theorem add_con.hrec_on₂_coe {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] {cM : add_con M} {cN : add_con N} {φ : cM.quotient → cN.quotient → Sort u_3} (a : M) (b : N) (f : Π (x : M) (y : N), φ ↑x ↑y) (h : ∀ (x : M) (y : N) (x' : M) (y' : N), ⇑cM x x' → ⇑cN y y' → f x y == f x' y') :
add_con.hrec_on₂ ↑a ↑b f h = f a b
source
@[simp]
theorem con.hrec_on₂_coe {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] {cM : con M} {cN : con N} {φ : cM.quotient → cN.quotient → Sort u_3} (a : M) (b : N) (f : Π (x : M) (y : N), φ ↑x ↑y) (h : ∀ (x : M) (y : N) (x' : M) (y' : N), ⇑cM x x' → ⇑cN y y' → f x y == f x' y') :
con.hrec_on₂ ↑a ↑b f h = f a b
source
@[protected]
theorem add_con.induction_on {M : Type u_1} [has_add M] {c : add_con M} {C : c.quotient → Prop} (q : c.quotient) (H : ∀ (x : M), C ↑x) :
C q

The inductive principle used to prove propositions about the elements of a quotient by an additive congruence relation.

source
@[protected]
theorem con.induction_on {M : Type u_1} [has_mul M] {c : con M} {C : c.quotient → Prop} (q : c.quotient) (H : ∀ (x : M), C ↑x) :
C q

The inductive principle used to prove propositions about the elements of a quotient by a congruence relation.

source
@[protected]
theorem con.induction_on₂ {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] {c : con M} {d : con N} {C : c.quotient → d.quotient → Prop} (p : c.quotient) (q : d.quotient) (H : ∀ (x : M) (y : N), C ↑x ↑y) :
C p q

A version of con.induction_on for predicates which take two arguments.

source
@[protected]
theorem add_con.induction_on₂ {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] {c : add_con M} {d : add_con N} {C : c.quotient → d.quotient → Prop} (p : c.quotient) (q : d.quotient) (H : ∀ (x : M) (y : N), C ↑x ↑y) :
C p q

A version of add_con.induction_on for predicates which take two arguments.

source
@[protected, simp]
theorem con.eq {M : Type u_1} [has_mul M] (c : con M) {a b : M} :
↑a = ↑b ↔ ⇑c a b

Two elements are related by a congruence relation c iff they are represented by the same element of the quotient by c.

source
@[protected, simp]
theorem add_con.eq {M : Type u_1} [has_add M] (c : add_con M) {a b : M} :
↑a = ↑b ↔ ⇑c a b

Two elements are related by an additive congruence relation c iff they are represented by the same element of the quotient by c.

source
@[protected, instance]
def con.has_mul {M : Type u_1} [has_mul M] (c : con M) :
has_mul c.quotient

The multiplication induced on the quotient by a congruence relation on a type with a multiplication.

Equations
source
@[protected, instance]
def add_con.has_add {M : Type u_1} [has_add M] (c : add_con M) :
has_add c.quotient

The addition induced on the quotient by an additive congruence relation on a type with an addition.

Equations
source
@[simp]
theorem con.mul_ker_mk_eq {M : Type u_1} [has_mul M] (c : con M) :
con.mul_ker coe _ = c

The kernel of the quotient map induced by a congruence relation c equals c.

source
@[simp]
theorem add_con.add_ker_mk_eq {M : Type u_1} [has_add M] (c : add_con M) :
add_con.add_ker coe _ = c

The kernel of the quotient map induced by an additive congruence relation c equals c.

source
@[simp]
theorem con.coe_mul {M : Type u_1} [has_mul M] {c : con M} (x y : M) :
↑x * y = (↑x) * ↑y

The coercion to the quotient of a congruence relation commutes with multiplication (by definition).

source
@[simp]
theorem add_con.coe_add {M : Type u_1} [has_add M] {c : add_con M} (x y : M) :
↑(x + y) = ↑x + ↑y

The coercion to the quotient of an additive congruence relation commutes with addition (by definition).

source
@[protected, simp]
theorem con.lift_on_coe {M : Type u_1} [has_mul M] {β : Sort u_2} (c : con M) (f : M → β) (h : ∀ (a b : M), ⇑c a b → f a = f b) (x : M) :
con.lift_on ↑x f h = f x

Definition of the function on the quotient by a congruence relation c induced by a function that is constant on c's equivalence classes.

source
@[protected, simp]
theorem add_con.lift_on_coe {M : Type u_1} [has_add M] {β : Sort u_2} (c : add_con M) (f : M → β) (h : ∀ (a b : M), ⇑c a b → f a = f b) (x : M) :
add_con.lift_on ↑x f h = f x

Definition of the function on the quotient by an additive congruence relation c induced by a function that is constant on c's equivalence classes.

source
@[protected]
def add_con.congr {M : Type u_1} [has_add M] {c d : add_con M} (h : c = d) :
c.quotient ≃+ d.quotient

Makes an additive isomorphism of quotients by two additive congruence relations, given that the relations are equal.

Equations
source
@[protected]
def con.congr {M : Type u_1} [has_mul M] {c d : con M} (h : c = d) :
c.quotient ≃* d.quotient

Makes an isomorphism of quotients by two congruence relations, given that the relations are equal.

Equations
source
@[protected, instance]
def con.has_le {M : Type u_1} [has_mul M] :
has_le (con M)

For congruence relations c, d on a type M with a multiplication, c ≤ d iff ∀ x y ∈ M, x is related to y by d if x is related to y by c.

Equations
source
@[protected, instance]
def add_con.has_le {M : Type u_1} [has_add M] :
has_le (add_con M)

For additive congruence relations c, d on a type M with an addition, c ≤ d iff ∀ x y ∈ M, x is related to y by d if x is related to y by c.

Equations
source
theorem con.le_def {M : Type u_1} [has_mul M] {c d : con M} :
c ≤ d ↔ ∀ {x y : M}, ⇑c x y → ⇑d x y

Definition of ≤ for congruence relations.

source
theorem add_con.le_def {M : Type u_1} [has_add M] {c d : add_con M} :
c ≤ d ↔ ∀ {x y : M}, ⇑c x y → ⇑d x y

Definition of ≤ for additive congruence relations.

source
@[protected, instance]
def add_con.has_Inf {M : Type u_1} [has_add M] :
has_Inf (add_con M)

The infimum of a set of additive congruence relations on a given type with an addition.

Equations
source
@[protected, instance]
def con.has_Inf {M : Type u_1} [has_mul M] :
has_Inf (con M)

The infimum of a set of congruence relations on a given type with a multiplication.

Equations
source
theorem add_con.Inf_to_setoid {M : Type u_1} [has_add M] (S : set (add_con M)) :
(Inf S).to_setoid = Inf (add_con.to_setoid '' S)

The infimum of a set of additive congruence relations is the same as the infimum of the set's image under the map to the underlying equivalence relation.

source
theorem con.Inf_to_setoid {M : Type u_1} [has_mul M] (S : set (con M)) :
(Inf S).to_setoid = Inf (con.to_setoid '' S)

The infimum of a set of congruence relations is the same as the infimum of the set's image under the map to the underlying equivalence relation.

source
theorem add_con.Inf_def {M : Type u_1} [has_add M] (S : set (add_con M)) :
⇑(Inf S) = Inf (coe_fn '' S)

The infimum of a set of additive congruence relations is the same as the infimum of the set's image under the map to the underlying binary relation.

source
theorem con.Inf_def {M : Type u_1} [has_mul M] (S : set (con M)) :
⇑(Inf S) = Inf (coe_fn '' S)

The infimum of a set of congruence relations is the same as the infimum of the set's image under the map to the underlying binary relation.

source
@[protected, instance]
def add_con.partial_order {M : Type u_1} [has_add M] :
partial_order (add_con M)
Equations
source
@[protected, instance]
def con.partial_order {M : Type u_1} [has_mul M] :
partial_order (con M)
Equations
source
@[protected, instance]
def con.complete_lattice {M : Type u_1} [has_mul M] :
complete_lattice (con M)

The complete lattice of congruence relations on a given type with a multiplication.

Equations
source
@[protected, instance]
def add_con.complete_lattice {M : Type u_1} [has_add M] :
complete_lattice (add_con M)

The complete lattice of additive congruence relations on a given type with an addition.

Equations
source
theorem con.inf_def {M : Type u_1} [has_mul M] {c d : con M} :
setoid.r = setoid.r ⊓ setoid.r

The infimum of two congruence relations equals the infimum of the underlying binary operations.

source
theorem add_con.inf_def {M : Type u_1} [has_add M] {c d : add_con M} :
setoid.r = setoid.r ⊓ setoid.r

The infimum of two additive congruence relations equals the infimum of the underlying binary operations.

source
theorem con.inf_iff_and {M : Type u_1} [has_mul M] {c d : con M} {x y : M} :
⇑(c ⊓ d) x y ↔ ⇑c x y ∧ ⇑d x y

Definition of the infimum of two congruence relations.

source
theorem add_con.inf_iff_and {M : Type u_1} [has_add M] {c d : add_con M} {x y : M} :
⇑(c ⊓ d) x y ↔ ⇑c x y ∧ ⇑d x y

Definition of the infimum of two additive congruence relations.

source
theorem add_con.add_con_gen_eq {M : Type u_1} [has_add M] (r : M → M → Prop) :
add_con_gen r = Inf {s : add_con M | ∀ (x y : M), r x y → ⇑s x y}

The inductively defined smallest additive congruence relation containing a binary relation r equals the infimum of the set of additive congruence relations containing r.

source
theorem con.con_gen_eq {M : Type u_1} [has_mul M] (r : M → M → Prop) :
con_gen r = Inf {s : con M | ∀ (x y : M), r x y → ⇑s x y}

The inductively defined smallest congruence relation containing a binary relation r equals the infimum of the set of congruence relations containing r.

source
theorem con.con_gen_le {M : Type u_1} [has_mul M] {r : M → M → Prop} {c : con M} (h : ∀ (x y : M), r x y → setoid.r x y) :
con_gen r ≤ c

The smallest congruence relation containing a binary relation r is contained in any congruence relation containing r.

source
theorem add_con.add_con_gen_le {M : Type u_1} [has_add M] {r : M → M → Prop} {c : add_con M} (h : ∀ (x y : M), r x y → setoid.r x y) :
add_con_gen r ≤ c

The smallest additive congruence relation containing a binary relation r is contained in any additive congruence relation containing r.

source
theorem add_con.add_con_gen_mono {M : Type u_1} [has_add M] {r s : M → M → Prop} (h : ∀ (x y : M), r x y → s x y) :
add_con_gen r ≤ add_con_gen s

Given binary relations r, s with r contained in s, the smallest additive congruence relation containing s contains the smallest additive congruence relation containing r.

source
theorem con.con_gen_mono {M : Type u_1} [has_mul M] {r s : M → M → Prop} (h : ∀ (x y : M), r x y → s x y) :
con_gen r ≤ con_gen s

Given binary relations r, s with r contained in s, the smallest congruence relation containing s contains the smallest congruence relation containing r.

source
@[simp]
theorem add_con.add_con_gen_of_add_con {M : Type u_1} [has_add M] (c : add_con M) :
add_con_gen ⇑c = c

Additive congruence relations equal the smallest additive congruence relation in which they are contained.

source
@[simp]
theorem con.con_gen_of_con {M : Type u_1} [has_mul M] (c : con M) :
con_gen ⇑c = c

Congruence relations equal the smallest congruence relation in which they are contained.

source
@[simp]
theorem add_con.add_con_gen_idem {M : Type u_1} [has_add M] (r : M → M → Prop) :
add_con_gen ⇑(add_con_gen r) = add_con_gen r

The map sending a binary relation to the smallest additive congruence relation in which it is contained is idempotent.

source
@[simp]
theorem con.con_gen_idem {M : Type u_1} [has_mul M] (r : M → M → Prop) :
con_gen ⇑(con_gen r) = con_gen r

The map sending a binary relation to the smallest congruence relation in which it is contained is idempotent.

source
theorem add_con.sup_eq_add_con_gen {M : Type u_1} [has_add M] (c d : add_con M) :
c ⊔ d = add_con_gen (λ (x y : M), ⇑c x y ∨ ⇑d x y)

The supremum of additive congruence relations c, d equals the smallest additive congruence relation containing the binary relation 'x is related to y by c or d'.

source
theorem con.sup_eq_con_gen {M : Type u_1} [has_mul M] (c d : con M) :
c ⊔ d = con_gen (λ (x y : M), ⇑c x y ∨ ⇑d x y)

The supremum of congruence relations c, d equals the smallest congruence relation containing the binary relation 'x is related to y by c or d'.

source
theorem con.sup_def {M : Type u_1} [has_mul M] {c d : con M} :
c ⊔ d = con_gen (setoid.r ⊔ setoid.r)

The supremum of two congruence relations equals the smallest congruence relation containing the supremum of the underlying binary operations.

source
theorem add_con.sup_def {M : Type u_1} [has_add M] {c d : add_con M} :
c ⊔ d = add_con_gen (setoid.r ⊔ setoid.r)

The supremum of two additive congruence relations equals the smallest additive congruence relation containing the supremum of the underlying binary operations.

source
theorem con.Sup_eq_con_gen {M : Type u_1} [has_mul M] (S : set (con M)) :
Sup S = con_gen (λ (x y : M), ∃ (c : con M), c ∈ S ∧ ⇑c x y)

The supremum of a set of congruence relations S equals the smallest congruence relation containing the binary relation 'there exists c ∈ S such that x is related to y by c'.

source
theorem add_con.Sup_eq_add_con_gen {M : Type u_1} [has_add M] (S : set (add_con M)) :
Sup S = add_con_gen (λ (x y : M), ∃ (c : add_con M), c ∈ S ∧ ⇑c x y)

The supremum of a set of additive congruence relations S equals the smallest additive congruence relation containing the binary relation 'there exists c ∈ S such that x is related to y by c'.

source
theorem add_con.Sup_def {M : Type u_1} [has_add M] {S : set (add_con M)} :
Sup S = add_con_gen (Sup (coe_fn '' S))

The supremum of a set of additive congruence relations is the same as the smallest additive congruence relation containing the supremum of the set's image under the map to the underlying binary relation.

source
theorem con.Sup_def {M : Type u_1} [has_mul M] {S : set (con M)} :
Sup S = con_gen (Sup (coe_fn '' S))

The supremum of a set of congruence relations is the same as the smallest congruence relation containing the supremum of the set's image under the map to the underlying binary relation.

source
@[protected]
noncomputable def con.gi (M : Type u_1) [has_mul M] :
galois_insertion con_gen coe_fn

There is a Galois insertion of congruence relations on a type with a multiplication M into binary relations on M.

Equations
source
@[protected]
noncomputable def add_con.gi (M : Type u_1) [has_add M] :
galois_insertion add_con_gen coe_fn

There is a Galois insertion of additive congruence relations on a type with an addition M into binary relations on M.

Equations
source
def add_con.map_gen {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] (c : add_con M) (f : M → N) :
add_con N

Given a function f, the smallest additive congruence relation containing the binary relation on f's image defined by 'x ≈ y iff the elements of f⁻¹(x) are related to the elements of f⁻¹(y) by an additive congruence relation c.'

Equations
source
def con.map_gen {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] (c : con M) (f : M → N) :
con N

Given a function f, the smallest congruence relation containing the binary relation on f's image defined by 'x ≈ y iff the elements of f⁻¹(x) are related to the elements of f⁻¹(y) by a congruence relation c.'

Equations
source
def con.map_of_surjective {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] (c : con M) (f : M → N) (H : ∀ (x y : M), f (x * y) = (f x) * f y) (h : con.mul_ker f H ≤ c) (hf : function.surjective f) :
con N

Given a surjective multiplicative-preserving function f whose kernel is contained in a congruence relation c, the congruence relation on f's codomain defined by 'x ≈ y iff the elements of f⁻¹(x) are related to the elements of f⁻¹(y) by c.'

Equations
source
def add_con.map_of_surjective {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] (c : add_con M) (f : M → N) (H : ∀ (x y : M), f (x + y) = f x + f y) (h : add_con.add_ker f H ≤ c) (hf : function.surjective f) :
add_con N

Given a surjective addition-preserving function f whose kernel is contained in an additive congruence relation c, the additive congruence relation on f's codomain defined by 'x ≈ y iff the elements of f⁻¹(x) are related to the elements of f⁻¹(y) by c.'

Equations
source
theorem add_con.map_of_surjective_eq_map_gen {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] {c : add_con M} {f : M → N} (H : ∀ (x y : M), f (x + y) = f x + f y) (h : add_con.add_ker f H ≤ c) (hf : function.surjective f) :
c.map_gen f = c.map_of_surjective f H h hf

A specialization of 'the smallest additive congruence relation containing an additive congruence relation c equals c'.

source
theorem con.map_of_surjective_eq_map_gen {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] {c : con M} {f : M → N} (H : ∀ (x y : M), f (x * y) = (f x) * f y) (h : con.mul_ker f H ≤ c) (hf : function.surjective f) :
c.map_gen f = c.map_of_surjective f H h hf

A specialization of 'the smallest congruence relation containing a congruence relation c equals c'.

source
def con.comap {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] (f : M → N) (H : ∀ (x y : M), f (x * y) = (f x) * f y) (c : con N) :
con M

Given types with multiplications M, N and a congruence relation c on N, a multiplication-preserving map f : M → N induces a congruence relation on f's domain defined by 'x ≈ y iff f(x) is related to f(y) by c.'

Equations
source
def add_con.comap {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] (f : M → N) (H : ∀ (x y : M), f (x + y) = f x + f y) (c : add_con N) :
add_con M

Given types with additions M, N and an additive congruence relation c on N, an addition-preserving map f : M → N induces an additive congruence relation on f's domain defined by 'x ≈ y iff f(x) is related to f(y) by c.'

Equations
source
@[simp]
theorem add_con.comap_rel {M : Type u_1} {N : Type u_2} [has_add M] [has_add N] {f : M → N} (H : ∀ (x y : M), f (x + y) = f x + f y) {c : add_con N} {x y : M} :
⇑(add_con.comap f H c) x y ↔ ⇑c (f x) (f y)
source
@[simp]
theorem con.comap_rel {M : Type u_1} {N : Type u_2} [has_mul M] [has_mul N] {f : M → N} (H : ∀ (x y : M), f (x * y) = (f x) * f y) {c : con N} {x y : M} :
⇑(con.comap f H c) x y ↔ ⇑c (f x) (f y)
source
def con.correspondence {M : Type u_1} [has_mul M] (c : con M) :
{d // c ≤ d} ≃o con c.quotient

Given a congruence relation c on a type M with a multiplication, the order-preserving bijection between the set of congruence relations containing c and the congruence relations on the quotient of M by c.

Equations
source
def add_con.correspondence {M : Type u_1} [has_add M] (c : add_con M) :
{d // c ≤ d} ≃o add_con c.quotient

Given an additive congruence relation c on a type M with an addition, the order-preserving bijection between the set of additive congruence relations containing c and the additive congruence relations on the quotient of M by c.

Equations
source
@[protected, instance]
def con.mul_one_class {M : Type u_1} [mul_one_class M] (c : con M) :
mul_one_class c.quotient

The quotient of a monoid by a congruence relation is a monoid.

Equations
source
@[protected, instance]
def add_con.add_zero_class {M : Type u_1} [add_zero_class M] (c : add_con M) :
add_zero_class c.quotient

The quotient of an add_monoid by an additive congruence relation is an add_monoid.

Equations
source
@[simp]
theorem con.coe_one {M : Type u_1} [mul_one_class M] {c : con M} :
↑1 = 1

The 1 of the quotient of a monoid by a congruence relation is the equivalence class of the monoid's 1.

source
@[simp]
theorem add_con.coe_zero {M : Type u_1} [add_zero_class M] {c : add_con M} :
↑0 = 0

The 0 of the quotient of an add_monoid by an additive congruence relation is the equivalence class of the add_monoid's 0.

source
@[protected]
def con.submonoid (M : Type u_1) [mul_one_class M] (c : con M) :
submonoid (M × M)

The submonoid of M × M defined by a congruence relation on a monoid M.

Equations
source
@[protected]
def add_con.add_submonoid (M : Type u_1) [add_zero_class M] (c : add_con M) :
add_submonoid (M × M)

The add_submonoid of M × M defined by an additive congruence relation on an add_monoid M.

Equations
source
def con.of_submonoid {M : Type u_1} [mul_one_class M] (N : submonoid (M × M)) (H : equivalence (λ (x y : M), (x, y) ∈ N)) :
con M

The congruence relation on a monoid M from a submonoid of M × M for which membership is an equivalence relation.

Equations
source
def add_con.of_add_submonoid {M : Type u_1} [add_zero_class M] (N : add_submonoid (M × M)) (H : equivalence (λ (x y : M), (x, y) ∈ N)) :
add_con M

The additive congruence relation on an add_monoid M from an add_submonoid of M × M for which membership is an equivalence relation.

Equations
source
@[protected, instance]
def con.to_submonoid {M : Type u_1} [mul_one_class M] :
has_coe (con M) (submonoid (M × M))

Coercion from a congruence relation c on a monoid M to the submonoid of M × M whose elements are (x, y) such that x is related to y by c.

Equations
source
@[protected, instance]
def add_con.to_add_submonoid {M : Type u_1} [add_zero_class M] :
has_coe (add_con M) (add_submonoid (M × M))

Coercion from a congruence relation c on an add_monoid M to the add_submonoid of M × M whose elements are (x, y) such that x is related to y by c.

Equations
source
theorem con.mem_coe {M : Type u_1} [mul_one_class M] {c : con M} {x y : M} :
(x, y) ∈ ↑c ↔ (x, y) ∈ c
source
theorem add_con.mem_coe {M : Type u_1} [add_zero_class M] {c : add_con M} {x y : M} :
(x, y) ∈ ↑c ↔ (x, y) ∈ c
source
theorem add_con.to_add_submonoid_inj {M : Type u_1} [add_zero_class M] (c d : add_con M) (H : ↑c = ↑d) :
c = d
source
theorem con.to_submonoid_inj {M : Type u_1} [mul_one_class M] (c d : con M) (H : ↑c = ↑d) :
c = d
source
theorem add_con.le_iff {M : Type u_1} [add_zero_class M] {c d : add_con M} :
c ≤ d ↔ ↑c ≤ ↑d
source
theorem con.le_iff {M : Type u_1} [mul_one_class M] {c d : con M} :
c ≤ d ↔ ↑c ≤ ↑d
source
def con.ker {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) :
con M

The kernel of a monoid homomorphism as a congruence relation.

Equations
source
def add_con.ker {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) :
add_con M

The kernel of an add_monoid homomorphism as an additive congruence relation.

Equations
source
@[simp]
theorem con.ker_rel {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) {x y : M} :
⇑(con.ker f) x y ↔ ⇑f x = ⇑f y

The definition of the congruence relation defined by a monoid homomorphism's kernel.

source
@[simp]
theorem add_con.ker_rel {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) {x y : M} :
⇑(add_con.ker f) x y ↔ ⇑f x = ⇑f y

The definition of the additive congruence relation defined by an add_monoid homomorphism's kernel.

source
@[protected, instance]
def add_con.quotient.inhabited {M : Type u_1} [add_zero_class M] {c : add_con M} :
inhabited c.quotient

There exists an element of the quotient of an add_monoid by a congruence relation (namely 0).

Equations
source
@[protected, instance]
def con.quotient.inhabited {M : Type u_1} [mul_one_class M] {c : con M} :
inhabited c.quotient

There exists an element of the quotient of a monoid by a congruence relation (namely 1).

Equations
source
def con.mk' {M : Type u_1} [mul_one_class M] (c : con M) :
M →* c.quotient

The natural homomorphism from a monoid to its quotient by a congruence relation.

Equations
source
def add_con.mk' {M : Type u_1} [add_zero_class M] (c : add_con M) :
M →+ c.quotient

The natural homomorphism from an add_monoid to its quotient by an additive congruence relation.

Equations
source
@[simp]
theorem con.mk'_ker {M : Type u_1} [mul_one_class M] (c : con M) :
con.ker c.mk' = c

The kernel of the natural homomorphism from a monoid to its quotient by a congruence relation c equals c.

source
@[simp]
theorem add_con.mk'_ker {M : Type u_1} [add_zero_class M] (c : add_con M) :
add_con.ker c.mk' = c

The kernel of the natural homomorphism from an add_monoid to its quotient by an additive congruence relation c equals c.

source
theorem con.mk'_surjective {M : Type u_1} [mul_one_class M] {c : con M} :
function.surjective ⇑(c.mk')

The natural homomorphism from a monoid to its quotient by a congruence relation is surjective.

source
theorem add_con.mk'_surjective {M : Type u_1} [add_zero_class M] {c : add_con M} :
function.surjective ⇑(c.mk')

The natural homomorphism from an add_monoid to its quotient by a congruence relation is surjective.

source
@[simp]
theorem add_con.coe_mk' {M : Type u_1} [add_zero_class M] {c : add_con M} :
⇑(c.mk') = coe
source
@[simp]
theorem con.coe_mk' {M : Type u_1} [mul_one_class M] {c : con M} :
⇑(c.mk') = coe
source
theorem add_con.ker_apply_eq_preimage {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {f : M →+ P} (x : M) :
⇑(add_con.ker f) x = ⇑f ⁻¹' {⇑f x}

The elements related to x ∈ M, M an add_monoid, by the kernel of an add_monoid homomorphism are those in the preimage of f(x) under f.

source
theorem con.ker_apply_eq_preimage {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {f : M →* P} (x : M) :
⇑(con.ker f) x = ⇑f ⁻¹' {⇑f x}

The elements related to x ∈ M, M a monoid, by the kernel of a monoid homomorphism are those in the preimage of f(x) under f.

source
theorem con.comap_eq {M : Type u_1} {N : Type u_2} [mul_one_class M] [mul_one_class N] {c : con M} {f : N →* M} :
con.comap ⇑f _ c = con.ker (c.mk'.comp f)

Given a monoid homomorphism f : N → M and a congruence relation c on M, the congruence relation induced on N by f equals the kernel of c's quotient homomorphism composed with f.

source
theorem add_con.comap_eq {M : Type u_1} {N : Type u_2} [add_zero_class M] [add_zero_class N] {c : add_con M} {f : N →+ M} :
add_con.comap ⇑f _ c = add_con.ker (c.mk'.comp f)

Given an add_monoid homomorphism f : N → M and an additive congruence relation c on M, the additive congruence relation induced on N by f equals the kernel of c's quotient homomorphism composed with f.

source
def con.lift {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (c : con M) (f : M →* P) (H : c ≤ con.ker f) :
c.quotient →* P

The homomorphism on the quotient of a monoid by a congruence relation c induced by a homomorphism constant on c's equivalence classes.

Equations
source
def add_con.lift {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (c : add_con M) (f : M →+ P) (H : c ≤ add_con.ker f) :
c.quotient →+ P

The homomorphism on the quotient of an add_monoid by an additive congruence relation c induced by a homomorphism constant on c's equivalence classes.

Equations
source
theorem add_con.lift_mk' {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (H : c ≤ add_con.ker f) (x : M) :
⇑(c.lift f H) (⇑(c.mk') x) = ⇑f x

The diagram describing the universal property for quotients of add_monoids commutes.

source
theorem con.lift_mk' {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (H : c ≤ con.ker f) (x : M) :
⇑(c.lift f H) (⇑(c.mk') x) = ⇑f x

The diagram describing the universal property for quotients of monoids commutes.

source
@[simp]
theorem con.lift_coe {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (H : c ≤ con.ker f) (x : M) :
⇑(c.lift f H) ↑x = ⇑f x

The diagram describing the universal property for quotients of monoids commutes.

source
@[simp]
theorem add_con.lift_coe {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (H : c ≤ add_con.ker f) (x : M) :
⇑(c.lift f H) ↑x = ⇑f x

The diagram describing the universal property for quotients of add_monoids commutes.

source
@[simp]
theorem con.lift_comp_mk' {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (H : c ≤ con.ker f) :
(c.lift f H).comp c.mk' = f

The diagram describing the universal property for quotients of monoids commutes.

source
@[simp]
theorem add_con.lift_comp_mk' {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (H : c ≤ add_con.ker f) :
(c.lift f H).comp c.mk' = f

The diagram describing the universal property for quotients of add_monoids commutes.

source
@[simp]
theorem add_con.lift_apply_mk' {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} (f : c.quotient →+ P) :
c.lift (f.comp c.mk') _ = f

Given a homomorphism f from the quotient of an add_monoid by an additive congruence relation, f equals the homomorphism on the quotient induced by f composed with the natural map from the add_monoid to the quotient.

source
@[simp]
theorem con.lift_apply_mk' {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} (f : c.quotient →* P) :
c.lift (f.comp c.mk') _ = f

Given a homomorphism f from the quotient of a monoid by a congruence relation, f equals the homomorphism on the quotient induced by f composed with the natural map from the monoid to the quotient.

source
theorem add_con.lift_funext {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} (f g : c.quotient →+ P) (h : ∀ (a : M), ⇑f ↑a = ⇑g ↑a) :
f = g

Homomorphisms on the quotient of an add_monoid by an additive congruence relation are equal if they are equal on elements that are coercions from the add_monoid.

source
theorem con.lift_funext {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} (f g : c.quotient →* P) (h : ∀ (a : M), ⇑f ↑a = ⇑g ↑a) :
f = g

Homomorphisms on the quotient of a monoid by a congruence relation are equal if they are equal on elements that are coercions from the monoid.

source
theorem add_con.lift_unique {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (H : c ≤ add_con.ker f) (g : c.quotient →+ P) (Hg : g.comp c.mk' = f) :
g = c.lift f H

The uniqueness part of the universal property for quotients of add_monoids.

source
theorem con.lift_unique {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (H : c ≤ con.ker f) (g : c.quotient →* P) (Hg : g.comp c.mk' = f) :
g = c.lift f H

The uniqueness part of the universal property for quotients of monoids.

source
theorem add_con.lift_range {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (H : c ≤ add_con.ker f) :
(c.lift f H).mrange = f.mrange

Given an additive congruence relation c on an add_monoid and a homomorphism f constant on c's equivalence classes, f has the same image as the homomorphism that f induces on the quotient.

source
theorem con.lift_range {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (H : c ≤ con.ker f) :
(c.lift f H).mrange = f.mrange

Given a congruence relation c on a monoid and a homomorphism f constant on c's equivalence classes, f has the same image as the homomorphism that f induces on the quotient.

source
theorem con.lift_surjective_of_surjective {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {c : con M} {f : M →* P} (h : c ≤ con.ker f) (hf : function.surjective ⇑f) :
function.surjective ⇑(c.lift f h)

Surjective monoid homomorphisms constant on a congruence relation c's equivalence classes induce a surjective homomorphism on c's quotient.

source
theorem add_con.lift_surjective_of_surjective {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {c : add_con M} {f : M →+ P} (h : c ≤ add_con.ker f) (hf : function.surjective ⇑f) :
function.surjective ⇑(c.lift f h)

Surjective add_monoid homomorphisms constant on an additive congruence relation c's equivalence classes induce a surjective homomorphism on c's quotient.

source
theorem con.ker_eq_lift_of_injective {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (c : con M) (f : M →* P) (H : c ≤ con.ker f) (h : function.injective ⇑(c.lift f H)) :
con.ker f = c

Given a monoid homomorphism f from M to P, the kernel of f is the unique congruence relation on M whose induced map from the quotient of M to P is injective.

source
theorem add_con.ker_eq_lift_of_injective {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (c : add_con M) (f : M →+ P) (H : c ≤ add_con.ker f) (h : function.injective ⇑(c.lift f H)) :
add_con.ker f = c

Given an add_monoid homomorphism f from M to P, the kernel of f is the unique additive congruence relation on M whose induced map from the quotient of M to P is injective.

source
def add_con.ker_lift {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) :
(add_con.ker f).quotient →+ P

The homomorphism induced on the quotient of an add_monoid by the kernel of an add_monoid homomorphism.

Equations
source
def con.ker_lift {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) :
(con.ker f).quotient →* P

The homomorphism induced on the quotient of a monoid by the kernel of a monoid homomorphism.

Equations
source
@[simp]
theorem con.ker_lift_mk {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {f : M →* P} (x : M) :
⇑(con.ker_lift f) ↑x = ⇑f x

The diagram described by the universal property for quotients of monoids, when the congruence relation is the kernel of the homomorphism, commutes.

source
@[simp]
theorem add_con.ker_lift_mk {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {f : M →+ P} (x : M) :
⇑(add_con.ker_lift f) ↑x = ⇑f x

The diagram described by the universal property for quotients of add_monoids, when the additive congruence relation is the kernel of the homomorphism, commutes.

source
@[simp]
theorem add_con.ker_lift_range_eq {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] {f : M →+ P} :
(add_con.ker_lift f).mrange = f.mrange

Given an add_monoid homomorphism f, the induced homomorphism on the quotient by f's kernel has the same image as f.

source
@[simp]
theorem con.ker_lift_range_eq {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] {f : M →* P} :
(con.ker_lift f).mrange = f.mrange

Given a monoid homomorphism f, the induced homomorphism on the quotient by f's kernel has the same image as f.

source
theorem con.ker_lift_injective {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) :
function.injective ⇑(con.ker_lift f)

A monoid homomorphism f induces an injective homomorphism on the quotient by f's kernel.

source
theorem add_con.ker_lift_injective {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) :
function.injective ⇑(add_con.ker_lift f)

An add_monoid homomorphism f induces an injective homomorphism on the quotient by f's kernel.

source
def con.map {M : Type u_1} [mul_one_class M] (c d : con M) (h : c ≤ d) :
c.quotient →* d.quotient

Given congruence relations c, d on a monoid such that d contains c, d's quotient map induces a homomorphism from the quotient by c to the quotient by d.

Equations
source
def add_con.map {M : Type u_1} [add_zero_class M] (c d : add_con M) (h : c ≤ d) :
c.quotient →+ d.quotient

Given additive congruence relations c, d on an add_monoid such that d contains c, d's quotient map induces a homomorphism from the quotient by c to the quotient by d.

Equations
source
theorem add_con.map_apply {M : Type u_1} [add_zero_class M] {c d : add_con M} (h : c ≤ d) (x : c.quotient) :
⇑(c.map d h) x = ⇑(c.lift d.mk' _) x

Given additive congruence relations c, d on an add_monoid such that d contains c, the definition of the homomorphism from the quotient by c to the quotient by d induced by d's quotient map.

source
theorem con.map_apply {M : Type u_1} [mul_one_class M] {c d : con M} (h : c ≤ d) (x : c.quotient) :
⇑(c.map d h) x = ⇑(c.lift d.mk' _) x

Given congruence relations c, d on a monoid such that d contains c, the definition of the homomorphism from the quotient by c to the quotient by d induced by d's quotient map.

source
noncomputable def add_con.quotient_ker_equiv_range {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) :
(add_con.ker f).quotient ≃+ ↥(f.mrange)

The first isomorphism theorem for add_monoids.

Equations
source
noncomputable def con.quotient_ker_equiv_range {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) :
(con.ker f).quotient ≃* ↥(f.mrange)

The first isomorphism theorem for monoids.

Equations
source
def add_con.quotient_ker_equiv_of_right_inverse {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) (g : P → M) (hf : function.right_inverse g ⇑f) :
(add_con.ker f).quotient ≃+ P

The first isomorphism theorem for add_monoids in the case of a homomorphism with right inverse.

Equations
source
@[simp]
theorem con.quotient_ker_equiv_of_right_inverse_apply {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) (g : P → M) (hf : function.right_inverse g ⇑f) (ᾰ : (con.ker f).quotient) :
⇑(con.quotient_ker_equiv_of_right_inverse f g hf) ᾰ = ⇑(con.ker_lift f) ᾰ
source
@[simp]
theorem add_con.quotient_ker_equiv_of_right_inverse_symm_apply {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) (g : P → M) (hf : function.right_inverse g ⇑f) (ᾰ : P) :
⇑((add_con.quotient_ker_equiv_of_right_inverse f g hf).symm) ᾰ = (coe ∘ g) ᾰ
source
@[simp]
theorem con.quotient_ker_equiv_of_right_inverse_symm_apply {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) (g : P → M) (hf : function.right_inverse g ⇑f) (ᾰ : P) :
⇑((con.quotient_ker_equiv_of_right_inverse f g hf).symm) ᾰ = (coe ∘ g) ᾰ
source
@[simp]
theorem add_con.quotient_ker_equiv_of_right_inverse_apply {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) (g : P → M) (hf : function.right_inverse g ⇑f) (ᾰ : (add_con.ker f).quotient) :
⇑(add_con.quotient_ker_equiv_of_right_inverse f g hf) ᾰ = ⇑(add_con.ker_lift f) ᾰ
source
def con.quotient_ker_equiv_of_right_inverse {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) (g : P → M) (hf : function.right_inverse g ⇑f) :
(con.ker f).quotient ≃* P

The first isomorphism theorem for monoids in the case of a homomorphism with right inverse.

Equations
source
noncomputable def add_con.quotient_ker_equiv_of_surjective {M : Type u_1} {P : Type u_3} [add_zero_class M] [add_zero_class P] (f : M →+ P) (hf : function.surjective ⇑f) :
(add_con.ker f).quotient ≃+ P

The first isomorphism theorem for add_monoids in the case of a surjective homomorphism.

For a computable version, see add_con.quotient_ker_equiv_of_right_inverse.

Equations
source
noncomputable def con.quotient_ker_equiv_of_surjective {M : Type u_1} {P : Type u_3} [mul_one_class M] [mul_one_class P] (f : M →* P) (hf : function.surjective ⇑f) :
(con.ker f).quotient ≃* P

The first isomorphism theorem for monoids in the case of a surjective homomorphism.

For a computable version, see con.quotient_ker_equiv_of_right_inverse.

Equations
source
noncomputable def add_con.comap_quotient_equiv {M : Type u_1} {N : Type u_2} [add_zero_class M] [add_zero_class N] (c : add_con M) (f : N →+ M) :
(add_con.comap ⇑f _ c).quotient ≃+ ↥((c.mk'.comp f).mrange)

The second isomorphism theorem for add_monoids.

Equations
source
noncomputable def con.comap_quotient_equiv {M : Type u_1} {N : Type u_2} [mul_one_class M] [mul_one_class N] (c : con M) (f : N →* M) :
(con.comap ⇑f _ c).quotient ≃* ↥((c.mk'.comp f).mrange)

The second isomorphism theorem for monoids.

Equations
source
def con.quotient_quotient_equiv_quotient {M : Type u_1} [mul_one_class M] (c d : con M) (h : c ≤ d) :
(con.ker (c.map d h)).quotient ≃* d.quotient

The third isomorphism theorem for monoids.

Equations
source
def add_con.quotient_quotient_equiv_quotient {M : Type u_1} [add_zero_class M] (c d : add_con M) (h : c ≤ d) :
(add_con.ker (c.map d h)).quotient ≃+ d.quotient

The third isomorphism theorem for add_monoids.

Equations
source
@[protected]
theorem add_con.nsmul {M : Type u_1} [add_monoid M] (c : add_con M) (n : ℕ) {w x : M} :
⇑c w x → ⇑c (n • w) (n • x)

Additive congruence relations preserve natural scaling.

source
@[protected]
theorem con.pow {M : Type u_1} [monoid M] (c : con M) (n : ℕ) {w x : M} :
⇑c w x → ⇑c (w ^ n) (x ^ n)

Multiplicative congruence relations preserve natural powers.

source
@[protected, instance]
def con.quotient.has_one {M : Type u_1} [mul_one_class M] (c : con M) :
has_one c.quotient
Equations
source
@[protected, instance]
def add_con.quotient.has_zero {M : Type u_1} [add_zero_class M] (c : add_con M) :
has_zero c.quotient
Equations
source
@[protected, instance]
def add_con.quotient.has_nsmul {M : Type u_1} [add_monoid M] (c : add_con M) :
has_scalar ℕ c.quotient
Equations
source
@[protected, instance]
def con.nat.has_pow {M : Type u_1} [monoid M] (c : con M) :
has_pow c.quotient ℕ
Equations
source
@[protected, instance]
def add_con.add_semigroup {M : Type u_1} [add_semigroup M] (c : add_con M) :
add_semigroup c.quotient

The quotient of an add_semigroup by an additive congruence relation is an add_semigroup.

Equations
source
@[protected, instance]
def con.semigroup {M : Type u_1} [semigroup M] (c : con M) :
semigroup c.quotient

The quotient of a semigroup by a congruence relation is a semigroup.

Equations
source
@[protected, instance]
def add_con.add_comm_semigroup {M : Type u_1} [add_comm_semigroup M] (c : add_con M) :
add_comm_semigroup c.quotient

The quotient of an add_comm_semigroup by an additive congruence relation is an add_semigroup.

Equations
source
@[protected, instance]
def con.comm_semigroup {M : Type u_1} [comm_semigroup M] (c : con M) :
comm_semigroup c.quotient

The quotient of a commutative semigroup by a congruence relation is a semigroup.

Equations
source
@[protected, instance]
def con.monoid {M : Type u_1} [monoid M] (c : con M) :
monoid c.quotient

The quotient of a monoid by a congruence relation is a monoid.

Equations
source
@[protected, instance]
def add_con.add_monoid {M : Type u_1} [add_monoid M] (c : add_con M) :
add_monoid c.quotient

The quotient of an add_monoid by an additive congruence relation is an add_monoid.

Equations
source
@[protected, instance]
def add_con.add_comm_monoid {M : Type u_1} [add_comm_monoid M] (c : add_con M) :
add_comm_monoid c.quotient

The quotient of an add_comm_monoid by an additive congruence relation is an add_comm_monoid.

Equations
source
@[protected, instance]
def con.comm_monoid {M : Type u_1} [comm_monoid M] (c : con M) :
comm_monoid c.quotient

The quotient of a comm_monoid by a congruence relation is a comm_monoid.

Equations
source
@[protected]
theorem add_con.neg {M : Type u_1} [add_group M] (c : add_con M) {w x : M} :
⇑c w x → ⇑c (-w) (-x)

Additive congruence relations preserve negation.

source
@[protected]
theorem con.inv {M : Type u_1} [group M] (c : con M) {w x : M} :
⇑c w x → ⇑c w⁻¹ x⁻¹

Multiplicative congruence relations preserve inversion.

source
@[protected]
theorem add_con.sub {M : Type u_1} [add_group M] (c : add_con M) {w x y z : M} :
⇑c w x → ⇑c y z → ⇑c (w - y) (x - z)

Additive congruence relations preserve subtraction.

source
@[protected]
theorem con.div {M : Type u_1} [group M] (c : con M) {w x y z : M} :
⇑c w x → ⇑c y z → ⇑c (w / y) (x / z)

Multiplicative congruence relations preserve division.

source
@[protected]
theorem con.zpow {M : Type u_1} [group M] (c : con M) (n : ℤ) {w x : M} :
⇑c w x → ⇑c (w ^ n) (x ^ n)

Multiplicative congruence relations preserve integer powers.

source
@[protected]
theorem add_con.zsmul {M : Type u_1} [add_group M] (c : add_con M) (n : ℤ) {w x : M} :
⇑c w x → ⇑c (n • w) (n • x)

Additive congruence relations preserve integer scaling.

source
@[protected, instance]
def add_con.has_neg {M : Type u_1} [add_group M] (c : add_con M) :
has_neg c.quotient

The negation induced on the quotient by an additive congruence relation on a type with an negation.

Equations
source
@[protected, instance]
def con.has_inv {M : Type u_1} [group M] (c : con M) :
has_inv c.quotient

The inversion induced on the quotient by a congruence relation on a type with a inversion.

Equations
source
@[protected, instance]
def add_con.has_sub {M : Type u_1} [add_group M] (c : add_con M) :
has_sub c.quotient

The subtraction induced on the quotient by an additive congruence relation on a type with a subtraction.

Equations
source
@[protected, instance]
def con.has_div {M : Type u_1} [group M] (c : con M) :
has_div c.quotient

The division induced on the quotient by a congruence relation on a type with a division.

Equations
source
@[protected, instance]
def add_con.quotient.has_zsmul {M : Type u_1} [add_group M] (c : add_con M) :
has_scalar ℤ c.quotient

The integer scaling induced on the quotient by a congruence relation on a type with a subtraction.

Equations
source
@[protected, instance]
def con.has_zpow {M : Type u_1} [group M] (c : con M) :
has_pow c.quotient ℤ

The integer power induced on the quotient by a congruence relation on a type with a division.

Equations
source
@[protected, instance]
def add_con.add_group {M : Type u_1} [add_group M] (c : add_con M) :
add_group c.quotient

The quotient of an add_group by an additive congruence relation is an add_group.

Equations
source
@[protected, instance]
def con.group {M : Type u_1} [group M] (c : con M) :
group c.quotient

The quotient of a group by a congruence relation is a group.

Equations
source
def con.lift_on_units {M : Type u_1} {α : Type u_4} [monoid M] {c : con M} (u : units c.quotient) (f : Π (x y : M), ⇑c (x * y) 1 → ⇑c (y * x) 1 → α) (Hf : ∀ (x y : M) (hxy : ⇑c (x * y) 1) (hyx : ⇑c (y * x) 1) (x' y' : M) (hxy' : ⇑c (x' * y') 1) (hyx' : ⇑c (y' * x') 1), ⇑c x x' → ⇑c y y' → f x y hxy hyx = f x' y' hxy' hyx') :
α

In order to define a function units (con.quotient c) → α on the units of con.quotient c, where c : con M is a multiplicative congruence on a monoid, it suffices to define a function f that takes elements x y : M with proofs of c (x * y) 1 and c (y * x) 1, and returns an element of α provided that f x y _ _ = f x' y' _ _ whenever c x x' and c y y'.

Equations
source
def add_con.lift_on_add_units {M : Type u_1} {α : Type u_4} [add_monoid M] {c : add_con M} (u : add_units c.quotient) (f : Π (x y : M), ⇑c (x + y) 0 → ⇑c (y + x) 0 → α) (Hf : ∀ (x y : M) (hxy : ⇑c (x + y) 0) (hyx : ⇑c (y + x) 0) (x' y' : M) (hxy' : ⇑c (x' + y') 0) (hyx' : ⇑c (y' + x') 0), ⇑c x x' → ⇑c y y' → f x y hxy hyx = f x' y' hxy' hyx') :
α

In order to define a function units (con.quotient c) → α on the units of con.quotient c, where c : con M is a multiplicative congruence on a monoid, it suffices to define a function f that takes elements x y : M with proofs of c (x * y) 1 and c (y * x) 1, and returns an element of α provided that f x y _ _ = f x' y' _ _ whenever c x x' and c y y'.

Equations
source
@[simp]
theorem con.lift_on_units_mk {M : Type u_1} {α : Type u_4} [monoid M] {c : con M} (f : Π (x y : M), ⇑c (x * y) 1 → ⇑c (y * x) 1 → α) (Hf : ∀ (x y : M) (hxy : ⇑c (x * y) 1) (hyx : ⇑c (y * x) 1) (x' y' : M) (hxy' : ⇑c (x' * y') 1) (hyx' : ⇑c (y' * x') 1), ⇑c x x' → ⇑c y y' → f x y hxy hyx = f x' y' hxy' hyx') (x y : M) (hxy : (↑x) * ↑y = 1) (hyx : (↑y) * ↑x = 1) :
con.lift_on_units {val := ↑x, inv := ↑y, val_inv := hxy, inv_val := hyx} f Hf = f x y _ _
source
@[simp]
theorem add_con.lift_on_units_mk {M : Type u_1} {α : Type u_4} [add_monoid M] {c : add_con M} (f : Π (x y : M), ⇑c (x + y) 0 → ⇑c (y + x) 0 → α) (Hf : ∀ (x y : M) (hxy : ⇑c (x + y) 0) (hyx : ⇑c (y + x) 0) (x' y' : M) (hxy' : ⇑c (x' + y') 0) (hyx' : ⇑c (y' + x') 0), ⇑c x x' → ⇑c y y' → f x y hxy hyx = f x' y' hxy' hyx') (x y : M) (hxy : ↑x + ↑y = 0) (hyx : ↑y + ↑x = 0) :
add_con.lift_on_add_units {val := ↑x, neg := ↑y, val_neg := hxy, neg_val := hyx} f Hf = f x y _ _
source
theorem add_con.induction_on_add_units {M : Type u_1} [add_monoid M] {c : add_con M} {p : add_units c.quotient → Prop} (u : add_units c.quotient) (H : ∀ (x y : M) (hxy : ⇑c (x + y) 0) (hyx : ⇑c (y + x) 0), p {val := ↑x, neg := ↑y, val_neg := _, neg_val := _}) :
p u
source
theorem con.induction_on_units {M : Type u_1} [monoid M] {c : con M} {p : units c.quotient → Prop} (u : units c.quotient) (H : ∀ (x y : M) (hxy : ⇑c (x * y) 1) (hyx : ⇑c (y * x) 1), p {val := ↑x, inv := ↑y, val_inv := _, inv_val := _}) :
p u