Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Normal-subgroup quotients of a fixed free group give a canonical solution set for the underlying-set functor on groups

Statement

Fix a set S and a chosen free group (F(S),iS). For every normal subgroup NF(S), let ηN:SiSU(F(S))U(qN)U(F(S)/N). The family (ηN), indexed by the set of normal subgroups of the fixed group F(S), is a solution set at S for the underlying-set functor U:GrpSet.

Facts & Assumptions

Given: A set S and the chosen free group on S.

[L1]

Every function f:SU(G) extends uniquely to a homomorphism f^:F(S)G (The free-group functor is left adjoint to the underlying-set functor).

[L2]

If a homomorphism kills a normal subgroup N, it factors uniquely through the quotient by N (A homomorphism that kills a normal subgroup factors uniquely through the quotient group).

[L3]

A subgroup NG is normal when it is invariant under conjugation by every element of G; in particular a normal subgroup is a subset of its ambient group (Normal subgroup: invariance under conjugation).

[L4]

A solution set at S is a supplied set of arrows through one of which every arrow SU(G) factors (The solution-set condition for a functor, stated object by object).

[L5]

For a group homomorphism, the image is a subgroup of the codomain and the kernel is a normal subgroup of the domain (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

Proof

technique · constructive
1.1

The normal subgroups of F(S) form a set because they are among the subsets of the fixed underlying set. This includes the empty-S case, where F(S) is trivial. Hence the displayed quotient arrows form a supplied set-indexed family.

L3L4construct
2.1

Given f:SU(G), extend it by [L1] to f^:F(S)G and put N=kerf^. By [L5], N is a normal subgroup of F(S), so f^ kills N and [L2] gives a unique fˉ:F(S)/NG with f^=fˉqN. Therefore f=U(fˉ)ηN.

step 1.1L1L2L5
3.1

The factorisation in step 2.1 is exactly the clause of [L4]. The index N is computed as a kernel rather than chosen from isomorphism representatives, so the family is canonical once the free group is chosen.

step 1.1step 2.1L4discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 50 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources