Alphabeta Math
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 n≥2, reduction Z→Z/n has kernel nZ and realises Z/n by the first isomorphism theorem

Example

For n≥2, reduction Z→Z/n has kernel nZ and realises Z/n by the first isomorphism theorem.

Facts & Assumptions

Given: An integer n≥2 and ρn:Z→Z/n, ρ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/ker⁡f≅im⁡f).

[L2]
[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, ρn is a homomorphism of additive groups.

L1L2L3L4L5givenalgebra
2.1

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

step 1.1L1L2L3L4L5givenalgebra
3.1

Therefore the kernel and image calculation yields Z/nZ≅Z/n.

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

The doubling endomorphism of (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,+) defined by d(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 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) makes d a group homomorphism.

L1L2L3L4givenalgebra
2.1

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

step 1.1L1L2L3L4givenalgebra
3.1

But 1 is not even and hence is not in the image of d, refuting the stated implication.

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

The trivial homomorphism G→H has kernel G and image {eH}

Example

The trivial homomorphism G→H has kernel G and image {eH}.

Facts & Assumptions

Given: Groups G,H and t:G→H defined by t(g)=eH.

[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,h∈G, t(gh)=eH=eHeH=t(g)t(h), so t is a homomorphism.

L1L2L3givenalgebra
2.1

Every g∈G satisfies t(g)=eH, while the only value of t is eH.

step 1.1L1L2L3givenalgebra
3.1

Thus ker⁡t=G and im⁡t={eH}.

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 G and g∈G.

[L1]

An inner automorphism has the form cg(x)=gxg−1 (Inner automorphisms and Inn⁡(G)).

[L2]

In an abelian group gx=xg for all g,x∈G (Group and abelian group).

[L3]

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

Verification

technique · direct
1.1

Since G is abelian, g∈Z(G) and gxg−1=xgg−1=x.

L1L2L3givenalgebra
2.1

Hence cg=id⁡G for the chosen g.

step 1.1L1L2L3given
3.1

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

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

Conjugation by (1 2) in Sym⁡({1,2,3}) exchanges the transpositions (1 3) and (2 3)

Example

Conjugation by (1 2) in Sym⁡({1,2,3}) exchanges the transpositions (1 3) and (2 3).

Facts & Assumptions

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

[L1]
[L2]

Inner automorphisms are conjugations (Inner automorphisms and Inn⁡(G)).

[L3]

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

Verification

technique · direct
1.1

Direct evaluation on 1,2,3 gives (1 2)(1 3)(1 2)=(2 3).

L1L2L3L4givenalgebra
2.1

Since (1 2)−1=(1 2), the same computation with the roles reversed gives (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