Algebra in Lean

2 Morphisms

2.1 Maps

Definition 2.1 Injective
#

Given a function \( f \) mapping from a set \( X \) to a set \( Y \):

\[ \forall x,~ x' \in X,~ f(x) = f(x') \implies x = x'. \]

Otherwise known as a “one-to-one” function.

Definition 2.2 Surjective
#

Given a function \( f \) mapping from a set \( X \) to a set \( Y \):

\[ \forall y \in Y,~ \exists x \in X,~ f(x) = y \]

Otherwise known as an “onto” function.

Definition 2.3 Bijective
#

A bijective function is one that is both injective and surjective.

2.2 Intro to Morphisms

Definition 2.4 Homomorphism
#

A homomorphism is a map \( \phi \) from a group \( G \) to a group \( H \), for elements \( g,~ h \in G \), \( \phi \) is a homomorphism if and only if:

\[ \mu (\phi (g),\phi (h)) = \phi (\mu (g,h)) \]
Definition 2.5 Isomorphism

An isomorphism \( \phi \) from a group \( G \) to a group \( H \) is a bijective homomorphism.

Theorem 2.6
#

Suppose \( \phi : G \rightarrow H \) is a homomorphism. Then \( \phi (\mathbb e) = \mathbb e \).

Theorem 2.7

Suppose \( \phi : G \rightarrow H \) is a homomorphism. If \(g \in G \), then \( \phi (\iota (g)) = \iota (\phi (g)) \).

2.3 Automorphisms

Definition 2.8 Endomorphism
#

An endomorphism is a homomorphism \( \phi \) mapping from a group \( G \) to itself.

Definition 2.9 Automorphism

An automorphism is a bijective endomorphism; i.e. an isomorphism from a group \( G \) to itself.

Definition 2.10 conjugate
#

Two elements \( a,~ b \) of a group \( G \) are conjugates if there exists another element \( g \) in \( G \) such that \( b = gag^{-1} \) (i.e.,  \( \mu (\mu (g,~ a),~ \iota (g)) \) ).

Theorem 2.11

Given a group \( G \) and an element \( a \in G \), conjugation by \( a \) is an automorphism.