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.

5 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 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Group Homomorphisms and the Isomorphism Theorems: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

For n2n\ge2, reduction ZZ/n\mathbb Z\to\mathbb Z/n has kernel nZn\mathbb Z and realises Z/n\mathbb Z/n by the first isomorphism theorem

Example

For n2n\ge2, reduction ZZ/n\mathbb Z\to\mathbb Z/n has kernel nZn\mathbb Z and realises Z/n\mathbb Z/n by the first isomorphism theorem.

Facts & Assumptions

Given: An integer n2n\ge2 and ρn:ZZ/n\rho_n:\mathbb Z\to\mathbb Z/n, ρn(a)=[a]n\rho_n(a)=[a]_n.

[L1]

The first isomorphism theorem identifies a group modulo a homomorphism kernel with its image (First isomorphism theorem for groups: G/kerfimfG/\ker f\cong\operatorname{im}f).

[L2]

(Z,+)/nZ(\mathbb Z,+)/n\mathbb Z is the congruence-class group (Z/n,+)(\mathbb Z/n,+) (For every nNn\in\mathbb N, the congruence-class group (Z/n,+)(\mathbb Z/n,+) is the quotient group (Z,+)/nZ(\mathbb Z,+)/n\mathbb Z).

[L3]

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

[L4]

The kernel is the inverse image of the identity (The kernel and image of a group homomorphism).

[L5]

The integers form a commutative ring, hence an additive group (The integers form a commutative ring).

Verification

technique · direct
1.1

Since [a+b]n=[a]n+[b]n[a+b]_n=[a]_n+[b]_n, ρn\rho_n is a homomorphism of additive groups.

L1L2L3L4L5givenalgebra
2.1

Its kernel is {a:[a]n=[0]n}=nZ\{a:[a]_n=[0]_n\}=n\mathbb Z, and every residue class is ρn(a)\rho_n(a).

step 1.1L1L2L3L4L5givenalgebra
3.1

Therefore the kernel and image calculation yields Z/nZZ/n\mathbb Z/n\mathbb Z\cong\mathbb Z/n.

step 2.1
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-02Open item page →

The doubling endomorphism of (Z,+)(\mathbb Z,+) has trivial kernel but is not surjective

Statement refuted

An additive group homomorphism with trivial kernel must be surjective.

Facts & Assumptions

Given: The map d:(Z,+)(Z,+)d:(\mathbb Z,+)\to(\mathbb Z,+) defined by d(m)=2md(m)=2m.

[L1]

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

[L2]

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

[L3]

Surjectivity means that every codomain element is an image value (Injection, surjection, bijection).

[L4]

Z\mathbb Z is an additive group with cancellation (The integers form a commutative ring).

Counterexample

technique · direct
1.1

The equality d(a+b)=2a+2b=d(a)+d(b)d(a+b)=2a+2b=d(a)+d(b) makes dd a group homomorphism.

L1L2L3L4givenalgebra
2.1

If d(m)=0d(m)=0, then 2m=02m=0 and integer cancellation gives m=0m=0, so kerd={0}\ker d=\{0\}.

step 1.1L1L2L3L4givenalgebra
3.1

But 11 is not even and hence is not in the image of dd, refuting the stated implication.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

The trivial homomorphism GHG\to H has kernel GG and image {eH}\{e_H\}

Example

The trivial homomorphism GHG\to H has kernel GG and image {eH}\{e_H\}.

Facts & Assumptions

Given: Groups G,HG,H and t:GHt:G\to H defined by t(g)=eHt(g)=e_H.

[L1]

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

[L2]

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

[L3]

Every group has an identity element (Group and abelian group).

Verification

technique · direct
1.1

For g,hGg,h\in G, t(gh)=eH=eHeH=t(g)t(h)t(gh)=e_H=e_He_H=t(g)t(h), so tt is a homomorphism.

L1L2L3givenalgebra
2.1

Every gGg\in G satisfies t(g)=eHt(g)=e_H, while the only value of tt is eHe_H.

step 1.1L1L2L3givenalgebra
3.1

Thus kert=G\ker t=G and imt={eH}\operatorname{im}t=\{e_H\}.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Every inner automorphism of an abelian group is the identity

Example

Every inner automorphism of an abelian group is the identity.

Facts & Assumptions

Given: An abelian group GG and gGg\in G.

[L1]

An inner automorphism has the form cg(x)=gxg1c_g(x)=gxg^{-1} (Inner automorphisms and Inn(G)\operatorname{Inn}(G)).

[L2]

In an abelian group gx=xggx=xg for all g,xGg,x\in G (Group and abelian group).

[L3]

The center consists of elements commuting with every element (The center Z(G)Z(G) of a group).

Verification

technique · direct
1.1

Since GG is abelian, gZ(G)g\in Z(G) and gxg1=xgg1=xgxg^{-1}=xgg^{-1}=x.

L1L2L3givenalgebra
2.1

Hence cg=idGc_g=\operatorname{id}_G for the chosen gg.

step 1.1L1L2L3given
3.1

As gg was arbitrary, every inner automorphism is the identity.

step 2.1
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-08-02Open item page →

Conjugation by (12)(1\,2) in Sym({1,2,3})\operatorname{Sym}(\{1,2,3\}) exchanges the transpositions (13)(1\,3) and (23)(2\,3)

Example

Conjugation by (12)(1\,2) in Sym({1,2,3})\operatorname{Sym}(\{1,2,3\}) exchanges the transpositions (13)(1\,3) and (23)(2\,3).

Facts & Assumptions

Given: The symmetric group on {1,2,3}\{1,2,3\}, with composition acting right-to-left.

[L2]

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

[L3]

Elements of Sym({1,2,3})\operatorname{Sym}(\{1,2,3\}) are bijections composed right-to-left (The symmetric group Sym(X)\operatorname{Sym}(X): the bijections of a set XX under composition).

Verification

technique · direct
1.1

Direct evaluation on 1,2,31,2,3 gives (12)(13)(12)=(23)(1\,2)(1\,3)(1\,2)=(2\,3).

L1L2L3L4givenalgebra
2.1

Since (12)1=(12)(1\,2)^{-1}=(1\,2), the same computation with the roles reversed gives (12)(23)(12)=(13)(1\,2)(2\,3)(1\,2)=(1\,3).

step 1.1L1L2L3L4givenalgebra
3.1

Thus this inner automorphism exchanges the two stated transpositions.

step 2.1

Sources