Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-02
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.

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 N⊴G, f:G→H is a homomorphism, and N⊆ker⁡f, then there is a unique homomorphism fˉ:G/N→H such that fˉ(gN)=f(g) and f=fˉ∘π.

Facts & Assumptions

Given: N⊴G, a homomorphism f:G→H, and N⊆ker⁡f.

[L1]

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

[L2]

The quotient map π(g)=gN is a surjective homomorphism (The canonical projection π:G→G/N, π(g)=gN, is a surjective group homomorphism).

[L3]

N⊆ker⁡f means that f(n)=eH for every n∈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); if gN=hN, then h−1g∈N⊆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), and f(g)=fˉ(π(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∎

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources