Alphabeta Math
Session-authored (Fable 5 assisted)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

17 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Group Homomorphisms and the Isomorphism Theorems

1 · Prerequisites

2 · Summary

Groups, normal subgroups, and quotient groups supply the ambient language. A homomorphism carries the identity and inverses to their counterparts; its kernel and image record respectively the elements collapsed and the subgroup reached. The quotient-group construction and canonical projection are used to turn a homomorphism that kills a normal subgroup into a map on cosets.

The development defines isomorphisms, automorphisms, kernels, images, and inner automorphisms. It proves kernel normality, the kernel test for injectivity, factorisation through a quotient, and the first, second, third, and correspondence isomorphism theorems. The final results assemble conjugation into a homomorphism to Aut(G)\operatorname{Aut}(G) and identify its kernel and image.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G)

Definition

Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G).

An isomorphism f:GHf:G\to H is a bijective group homomorphism (Monoid homomorphism and group homomorphism, Injection, surjection, bijection). When G=HG=H, it is an automorphism of GG. Write

Aut(G):={f:GG:f is an automorphism}.\operatorname{Aut}(G):=\{f:G\to G:f\text{ is an automorphism}\}.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The inverse of a bijective group homomorphism is a group homomorphism

Statement

The inverse of a bijective group homomorphism is a group homomorphism.

If f:GHf:G\to H is a bijective group homomorphism, then its set-theoretic inverse f1:HGf^{-1}:H\to G is a group homomorphism.

Proof

technique · direct
1.1

By [L3], for u,vHu,v\in H choose x,yGx,y\in G with u=f(x)u=f(x) and v=f(y)v=f(y); then uv=f(xy)uv=f(xy) by [L2].

L1L2L3givenchoose
2.1

Therefore f1(uv)=xy=f1(u)f1(v)f^{-1}(uv)=xy=f^{-1}(u)f^{-1}(v), so the inverse preserves the group operation.

step 1.1L1L2L3givenalgebra
3.1

Hence f1:HGf^{-1}:H\to G is a group homomorphism.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

The kernel and image of a group homomorphism

Definition

The kernel and image of a group homomorphism.

For a group homomorphism f:GHf:G\to H, define

kerf:={gG:f(g)=eH},imf:={f(g):gG}.\ker f:=\{g\in G:f(g)=e_H\},\qquad\operatorname{im}f:=\{f(g):g\in G\}.

Thus ff is surjective exactly when imf=H\operatorname{im}f=H (Injection, surjection, bijection).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The image of a group homomorphism is a subgroup and its kernel is a normal subgroup

Statement

The image of a group homomorphism is a subgroup and its kernel is a normal subgroup.

For every group homomorphism f:GHf:G\to H, one has imfH\operatorname{im}f\le H and kerfG\ker f\mathrel{\trianglelefteq}G.

Facts & Assumptions

Proof

technique · direct
1.1

The image contains eH=f(eG)e_H=f(e_G) and, for f(x),f(y)imff(x),f(y)\in\operatorname{im}f, contains f(x)f(y)1=f(xy1)f(x)f(y)^{-1}=f(xy^{-1}); thus [L3] gives imfH\operatorname{im}f\le H.

L1L2L3L4givenalgebra
2.1

The kernel is a subgroup by the same calculation, and for kkerfk\in\ker f one has f(gkg1)=f(g)eHf(g)1=eHf(gkg^{-1})=f(g)e_Hf(g)^{-1}=e_H, so g(kerf)g1kerfg(\ker f)g^{-1}\subseteq\ker f; applying this to g1g^{-1} gives equality.

step 1.1L1L2L3L4givenalgebra
3.1

The conjugation calculation in step 2.1 completes both assertions.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

A group homomorphism is injective if and only if its kernel is trivial

Statement

A group homomorphism is injective if and only if its kernel is trivial.

For a group homomorphism f:GHf:G\to H, ff is injective exactly when kerf={eG}\ker f=\{e_G\}.

Facts & Assumptions

Proof

technique · direct
1.1

If ff is injective and gkerfg\in\ker f, then f(g)=eH=f(eG)f(g)=e_H=f(e_G), so g=eGg=e_G.

L1L2L3L4givenalgebra
2.1

Conversely, if kerf={eG}\ker f=\{e_G\} and f(x)=f(y)f(x)=f(y), then f(y1x)=eHf(y^{-1}x)=e_H, whence y1x=eGy^{-1}x=e_G and x=yx=y.

step 1.1L1L2L3L4givenalgebra
3.1

The two implications prove the equivalence.

step 1.1step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

A subgroup is normal if and only if it is the kernel of a group homomorphism

Statement

A subgroup is normal if and only if it is the kernel of a group homomorphism.

Let NGN\le G. Then NGN\mathrel{\trianglelefteq}G exactly when there are a group HH and a homomorphism f:GHf:G\to H with kerf=N\ker f=N.

Facts & Assumptions

Given: A subgroup NGN\le G.

[L1]
[L2]

If NGN\mathrel{\trianglelefteq}G, the canonical map π:GG/N\pi:G\to G/N is a homomorphism with kernel NN (The canonical projection π:GG/N\pi:G\to G/N, π(g)=gN\pi(g)=gN, is a surjective group homomorphism).

[L3]

The kernel of ff consists of the elements sent to the identity (The kernel and image of a group homomorphism).

[L4]

Normality means invariance under conjugation (Normal subgroup: invariance under conjugation).

Proof

technique · direct
1.1

If N=kerfN=\ker f for a homomorphism, then NN is normal by [L1].

L1L2L3L4given
2.1

If NN is normal, [L2] supplies the quotient homomorphism π\pi and gives kerπ=N\ker\pi=N.

step 1.1L1L2L3L4given
3.1

Thus normal subgroups are exactly kernels.

step 1.1step 2.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Two elements have the same image under a homomorphism if and only if they lie in the same coset of its kernel

Statement

Two elements have the same image under a homomorphism if and only if they lie in the same coset of its kernel.

For a homomorphism f:GHf:G\to H and g,hGg,h\in G,

f(g)=f(h)gkerf=hkerf.f(g)=f(h)\quad\Longleftrightarrow\quad g\ker f=h\ker f.

Facts & Assumptions

Given: A group homomorphism f:GHf:G\to H and elements g,hGg,h\in G.

[L1]

kerf\ker f is the set of elements sent to eHe_H (The kernel and image of a group homomorphism).

[L3]

For KGK\le G, gK=hKgK=hK if and only if h1gKh^{-1}g\in K (xaHx\in aH iff a1xHa^{-1}x\in H, and aH=bHaH=bH iff a1bHa^{-1}b\in H).

Proof

technique · direct
1.1

If f(g)=f(h)f(g)=f(h), then [L2] gives f(h1g)=eHf(h^{-1}g)=e_H, so h1gkerfh^{-1}g\in\ker f and [L3] gives gkerf=hkerfg\ker f=h\ker f.

L1L2L3givenalgebra
2.1

If gkerf=hkerfg\ker f=h\ker f, then [L3] gives h1gkerfh^{-1}g\in\ker f, so f(h)1f(g)=eHf(h)^{-1}f(g)=e_H and f(g)=f(h)f(g)=f(h).

step 1.1L1L2L3givenalgebra
3.1

This proves the stated equivalence.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

A homomorphism that kills a normal subgroup factors uniquely through the quotient group

Statement

A homomorphism that kills a normal subgroup factors uniquely through the quotient group.

If NGN\mathrel{\trianglelefteq}G, f:GHf:G\to H is a homomorphism, and NkerfN\subseteq\ker f, then there is a unique homomorphism fˉ:G/NH\bar f:G/N\to H such that fˉ(gN)=f(g)\bar f(gN)=f(g) and f=fˉπf=\bar f\circ\pi.

Facts & Assumptions

Given: NGN\mathrel{\trianglelefteq}G, a homomorphism f:GHf:G\to H, and NkerfN\subseteq\ker f.

[L1]

G/NG/N is the group of cosets of a normal subgroup (The quotient group G/NG/N and coset product (gN)(hN)=ghN(gN)(hN)=ghN).

[L3]

NkerfN\subseteq\ker f means that f(n)=eHf(n)=e_H for every nNn\in N (The kernel and image of a group homomorphism).

[L5]

A group homomorphism preserves products (Monoid homomorphism and group homomorphism).

Proof

technique · constructive
1.1

Define fˉ(gN):=f(g)\bar f(gN):=f(g); if gN=hNgN=hN, then h1gNkerfh^{-1}g\in N\subseteq\ker f, so [L4] proves that this value is independent of the representative.

L1L2L3L4L5givenconstruct
2.1

For cosets, fˉ((gN)(hN))=f(gh)=f(g)f(h)\bar f((gN)(hN))=f(gh)=f(g)f(h), and f(g)=fˉ(π(g))f(g)=\bar f(\pi(g)).

step 1.1L1L2L3L4L5givenalgebra
3.1

The surjectivity used in step 2.1 forces any such factor map to have these values, hence proves uniqueness.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

First isomorphism theorem for groups: G/kerfimfG/\ker f\cong\operatorname{im}f

Statement

First isomorphism theorem for groups: G/kerfimfG/\ker f\cong\operatorname{im}f.

For every homomorphism f:GHf:G\to H, the rule gkerff(g)g\ker f\mapsto f(g) is an isomorphism from G/kerfG/\ker f onto imf\operatorname{im}f.

Facts & Assumptions

Given: A group homomorphism f:GHf:G\to H.

[L1]

A homomorphism killing a normal subgroup factors uniquely through the quotient (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).

[L2]

kerf\ker f is normal and imf\operatorname{im}f is a subgroup (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L3]

A homomorphism is injective exactly when its kernel is trivial (A group homomorphism is injective if and only if its kernel is trivial).

[L5]

Proof

technique · direct
1.1

By [L2] and [L1], fˉ:G/kerfimf\bar f:G/\ker f\to\operatorname{im}f, fˉ(gkerf)=f(g)\bar f(g\ker f)=f(g), is a well-defined homomorphism; [L4] also gives representative independence directly.

L1L2L3L4L5givenconstruct
2.1

Its image is all of imf\operatorname{im}f, and fˉ(gkerf)=eH\bar f(g\ker f)=e_H implies f(g)=eHf(g)=e_H, hence gkerf=kerfg\ker f=\ker f; therefore its kernel is trivial.

step 1.1L1L2L3L4L5givenalgebra
3.1

The trivial-kernel conclusion of step 2.1 makes fˉ\bar f an isomorphism.

step 2.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

If HGH\le G and NGN\mathrel{\trianglelefteq}G, then HNHN is a subgroup and HNHH\cap N\mathrel{\trianglelefteq}H

Statement

If HGH\le G and NGN\mathrel{\trianglelefteq}G, then HNHN is a subgroup and HNHH\cap N\mathrel{\trianglelefteq}H.

Here HN:={hn:hH, nN}HN:=\{hn:h\in H,\ n\in N\}.

Facts & Assumptions

Given: A subgroup HGH\le G and a normal subgroup NGN\mathrel{\trianglelefteq}G.

[L2]

Normality means gNg1=NgNg^{-1}=N for every gGg\in G (Normal subgroup: invariance under conjugation).

[L3]

A subgroup is normal if its conjugates by ambient elements lie in it (Equivalent characterisations of a normal subgroup by conjugates and left and right cosets).

Proof

technique · direct
1.1

The identity lies in HNHN; for h1n1,h2n2HNh_1n_1,h_2n_2\in HN, put m=n1n21Nm=n_1n_2^{-1}\in N, so (h1n1)(h2n2)1=h1mh21=h1h21(h2mh21)HN(h_1n_1)(h_2n_2)^{-1}=h_1mh_2^{-1}=h_1h_2^{-1}(h_2mh_2^{-1})\in HN.

L1L2L3L4givenalgebra
2.1

Thus [L1] gives HNGHN\le G; moreover for hHh\in H and xHNx\in H\cap N, both hxh1Hhxh^{-1}\in H and hxh1Nhxh^{-1}\in N, so it lies in HNH\cap N.

step 1.1L1L2L3L4givenalgebra
3.1

The conjugation closure in step 2.1 gives HNHH\cap N\mathrel{\trianglelefteq}H.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Second isomorphism theorem for groups: H/(HN)HN/NH/(H\cap N)\cong HN/N

Statement

Second isomorphism theorem for groups: H/(HN)HN/NH/(H\cap N)\cong HN/N.

If HGH\le G and NGN\mathrel{\trianglelefteq}G, then

H/(HN)HN/N.H/(H\cap N)\cong HN/N.

Facts & Assumptions

Given: A subgroup HGH\le G and a normal subgroup NGN\mathrel{\trianglelefteq}G.

[L2]
[L4]

Proof

technique · direct
1.1

Restrict the quotient map HNHN/NHN\to HN/N to ϕ:HHN/N\phi:H\to HN/N, ϕ(h)=hN\phi(h)=hN; [L1] and [L4] make this a homomorphism.

L1L2L3L4givenconstruct
2.1

Its kernel is {hH:hN=N}=HN\{h\in H:hN=N\}=H\cap N, while every hnN=hNhnN=hN shows that its image is HN/NHN/N.

step 1.1L1L2L3L4givenalgebra
3.1

The kernel and image calculation in step 2.1 gives H/(HN)HN/NH/(H\cap N)\cong HN/N.

step 2.1
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

If KGK\mathrel{\trianglelefteq}G, NGN\mathrel{\trianglelefteq}G and KNK\subseteq N, then N/KG/KN/K\mathrel{\trianglelefteq}G/K

Statement

If KGK\mathrel{\trianglelefteq}G, NGN\mathrel{\trianglelefteq}G and KNK\subseteq N, then N/KG/KN/K\mathrel{\trianglelefteq}G/K.

Facts & Assumptions

Given: Normal subgroups K,NGK,N\mathrel{\trianglelefteq}G with KNK\subseteq N.

[L1]

A normal subgroup is invariant under conjugation (Normal subgroup: invariance under conjugation).

[L2]

G/KG/K consists of cosets and has product (gK)(hK)=ghK(gK)(hK)=ghK (The quotient group G/NG/N and coset product (gN)(hN)=ghN(gN)(hN)=ghN).

Proof

technique · direct
1.1

Since KNK\subseteq N, the subset N/K={nK:nN}N/K=\{nK:n\in N\} is a subgroup of G/KG/K by the quotient product rule.

L1L2L3L4givenalgebra
2.1

For gKG/KgK\in G/K and nKN/KnK\in N/K, (gK)(nK)(gK)1=(gng1)K(gK)(nK)(gK)^{-1}=(gng^{-1})K belongs to N/KN/K because NGN\mathrel{\trianglelefteq}G.

step 1.1L1L2L3L4givenalgebra
3.1

Thus the conjugation calculation gives N/KG/KN/K\mathrel{\trianglelefteq}G/K.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Third isomorphism theorem for groups: (G/K)/(N/K)G/N(G/K)/(N/K)\cong G/N

Statement

Third isomorphism theorem for groups: (G/K)/(N/K)G/N(G/K)/(N/K)\cong G/N.

If KNK\subseteq N are normal subgroups of GG, then

(G/K)/(N/K)G/N.(G/K)/(N/K)\cong G/N.

Facts & Assumptions

Given: KNK\subseteq N with K,NGK,N\mathrel{\trianglelefteq}G.

[L2]

The first isomorphism theorem identifies a quotient by a kernel with the image (First isomorphism theorem for groups: G/kerfimfG/\ker f\cong\operatorname{im}f).

Proof

technique · direct
1.1

Define ϕ:G/KG/N\phi:G/K\to G/N by ϕ(gK)=gN\phi(gK)=gN; it is well defined because KNK\subseteq N, and [L4] shows it is a homomorphism.

L1L2L3L4givenconstruct
2.1

The map is onto and ϕ(gK)=N\phi(gK)=N exactly when gNg\in N, so kerϕ=N/K\ker\phi=N/K.

step 1.1L1L2L3L4givenalgebra
3.1

The kernel and image calculation yields (G/K)/(N/K)G/N(G/K)/(N/K)\cong G/N.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Correspondence theorem: subgroups of G/NG/N correspond to subgroups of GG containing NN, with normality preserved

Statement

Correspondence theorem: subgroups of G/NG/N correspond to subgroups of GG containing NN, with normality preserved.

For NGN\mathrel{\trianglelefteq}G, the maps HH/NH\mapsto H/N and Kπ1(K)K\mapsto\pi^{-1}(K) are inverse inclusion-preserving bijections between subgroups HH with NHGN\le H\le G and subgroups KG/NK\le G/N; they preserve normality.

Facts & Assumptions

Given: A normal subgroup NGN\mathrel{\trianglelefteq}G and the quotient map π:GG/N\pi:G\to G/N.

[L2]

Kernels and images are defined by inverse images and values (The kernel and image of a group homomorphism).

[L5]

Normality has the conjugation and coset characterisations (Equivalent characterisations of a normal subgroup by conjugates and left and right cosets).

Proof

technique · direct
1.1

For NHGN\le H\le G, H/N=π[H]H/N=\pi[H] is a subgroup, while π1(K)\pi^{-1}(K) is a subgroup containing kerπ=N\ker\pi=N.

L1L2L3L4L5L6givenconstruct
2.1

Surjectivity gives π[π1(K)]=K\pi[\pi^{-1}(K)]=K, and NHN\le H gives π1(π[H])=H\pi^{-1}(\pi[H])=H; both assignments therefore preserve inclusion and are inverse.

step 1.1L1L2L3L4L5L6givenalgebra
3.1

The image and preimage calculation of step 2.1 also preserves normality.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The automorphisms of a group form a group under composition

Statement

The automorphisms of a group form a group under composition.

Facts & Assumptions

Given: A group GG.

[L1]

Aut(G)\operatorname{Aut}(G) is the set of bijective homomorphisms GGG\to G (Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G)).

[L2]

The inverse of a bijective homomorphism is a homomorphism (The inverse of a bijective group homomorphism is a group homomorphism).

Proof

technique · direct
1.1

The identity map is an automorphism, and the composite of two automorphisms is again a bijective homomorphism.

L1L2L3L4givenalgebra
2.1

By [L2], the inverse of every automorphism is an automorphism, while associativity comes from composition of functions.

step 1.1L1L2L3L4givenalgebra
3.1

Hence the closure and inverse properties in step 2.1 give a group structure on Aut(G)\operatorname{Aut}(G).

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Conjugation xgxg1x\mapsto gxg^{-1} is an automorphism

Statement

Conjugation xgxg1x\mapsto gxg^{-1} is an automorphism.

For each gGg\in G, the map cg:GGc_g:G\to G, cg(x)=gxg1c_g(x)=gxg^{-1}, is an automorphism.

Facts & Assumptions

Proof

technique · direct
1.1

Associativity gives cg(xy)=gxyg1=(gxg1)(gyg1)c_g(xy)=gx yg^{-1}=(gxg^{-1})(gyg^{-1}), so cgc_g is a homomorphism.

L1L2givenalgebra
2.1

The map cg1c_{g^{-1}} is inverse to cgc_g by cancellation.

step 1.1L1L2givenalgebra
3.1

Thus cgc_g is a bijective homomorphism and hence an automorphism.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-02Open item page →

Inner automorphisms and Inn(G)\operatorname{Inn}(G)

Definition

Inner automorphisms and Inn(G)\operatorname{Inn}(G).

For gGg\in G, write cg(x)=gxg1c_g(x)=gxg^{-1}. By Conjugation xgxg1x\mapsto gxg^{-1} is an automorphism, cgAut(G)c_g\in\operatorname{Aut}(G). Define

Inn(G):={cg:gG}Aut(G).\operatorname{Inn}(G):=\{c_g:g\in G\}\subseteq\operatorname{Aut}(G).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The map g(xgxg1)g\mapsto(x\mapsto gxg^{-1}) is a homomorphism GAut(G)G\to\operatorname{Aut}(G) with kernel Z(G)Z(G) and image Inn(G)\operatorname{Inn}(G)

Statement

The map g(xgxg1)g\mapsto(x\mapsto gxg^{-1}) is a homomorphism GAut(G)G\to\operatorname{Aut}(G) with kernel Z(G)Z(G) and image Inn(G)\operatorname{Inn}(G).

Facts & Assumptions

Given: A group GG.

[L1]

Inn(G)={cg:gG}\operatorname{Inn}(G)=\{c_g:g\in G\} (Inner automorphisms and Inn(G)\operatorname{Inn}(G)).

[L2]

Aut(G)\operatorname{Aut}(G) is a group under composition (The automorphisms of a group form a group under composition).

[L3]

Kernels and images are defined for group homomorphisms (The kernel and image of a group homomorphism).

[L4]

Z(G)={gG:gx=xg for every xG}Z(G)=\{g\in G:gx=xg\text{ for every }x\in G\} (The center Z(G)Z(G) of a group).

[L5]

A homomorphism preserves the group operation (Monoid homomorphism and group homomorphism).

Proof

technique · direct
1.1

Define C(g)=cgC(g)=c_g; for every xx, C(gh)(x)=ghx(gh)1=g(hxh1)g1=(C(g)C(h))(x)C(gh)(x)=ghx(gh)^{-1}=g(hxh^{-1})g^{-1}=(C(g)\circ C(h))(x).

L1L2L3L4L5L6givenalgebra
2.1

Now C(g)=idGC(g)=\operatorname{id}_G exactly when gxg1=xgxg^{-1}=x for every xx, equivalently gZ(G)g\in Z(G), and its image is Inn(G)\operatorname{Inn}(G) by definition.

step 1.1L1L2L3L4L5L6givenalgebra
3.1

Thus CC is a homomorphism with kernel Z(G)Z(G) and image Inn(G)\operatorname{Inn}(G).

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

G/Z(G)Inn(G)G/Z(G)\cong\operatorname{Inn}(G)

Statement

G/Z(G)Inn(G)G/Z(G)\cong\operatorname{Inn}(G).

Facts & Assumptions

Given: A group GG.

[L2]

G/kerfimfG/\ker f\cong\operatorname{im}f for every group homomorphism ff (First isomorphism theorem for groups: G/kerfimfG/\ker f\cong\operatorname{im}f).

[L3]

Z(G)Z(G) is the center of GG (The center Z(G)Z(G) of a group).

Proof

technique · direct
1.1

Apply [L2] to the conjugation homomorphism of [L1].

L1L2L3given
2.1

Substituting its kernel and image yields G/Z(G)Inn(G)G/Z(G)\cong\operatorname{Inn}(G).

step 1.1L1L2L3given
3.1

This is the asserted isomorphism.

step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Inn(G)\operatorname{Inn}(G) is a normal subgroup of Aut(G)\operatorname{Aut}(G)

Statement

Inn(G)\operatorname{Inn}(G) is a normal subgroup of Aut(G)\operatorname{Aut}(G).

Facts & Assumptions

Given: A group GG.

[L1]

Inner automorphisms are the maps cgc_g (Inner automorphisms and Inn(G)\operatorname{Inn}(G)).

[L2]

Aut(G)\operatorname{Aut}(G) is a group under composition (The automorphisms of a group form a group under composition).

[L4]

The inverse of a bijective homomorphism is a homomorphism (The inverse of a bijective group homomorphism is a group homomorphism).

Proof

technique · direct
1.1

For φAut(G)\varphi\in\operatorname{Aut}(G) and cgInn(G)c_g\in\operatorname{Inn}(G), direct evaluation gives (φcgφ1)(x)=φ(g)xφ(g)1=cφ(g)(x)(\varphi c_g\varphi^{-1})(x)=\varphi(g)x\varphi(g)^{-1}=c_{\varphi(g)}(x).

L1L2L3L4givenalgebra
2.1

Thus conjugation by every element of Aut(G)\operatorname{Aut}(G) carries Inn(G)\operatorname{Inn}(G) into itself; applying the same statement to φ1\varphi^{-1} gives equality.

step 1.1L1L2L3L4givenalgebra
3.1

The conjugation closure in step 2.1 proves normality.

step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources