Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Free products are unique up to a unique factor-compatible isomorphism

Statement

Any two free products of the same family are connected by a unique isomorphism commuting with every canonical factor map.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

For a family (Gi)iI(G_i)_{i\in I}, a free product is a group FF with homomorphisms ιi:GiF\iota_i:G_i\to F in the sense of def-group-homomorphism, such that for every group HH and every family of homomorphisms fi:GiHf_i:G_i\to H, there is a unique homomorphism f:FHf:F\to H satisfying fιi=fif\circ\iota_i=f_i for all ii. It is denoted iIGi\ast_{i\in I}G_i. Injectivity of the maps ιi\iota_i is not part of this definition. (The free product of an arbitrary family of groups).

[L2]

Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G). An isomorphism f:GHf:G\to H is a bijective group homomorphism (def-group-homomorphism, def-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}\}. (Group isomorphisms, automorphisms and the set Aut(G)\operatorname{Aut}(G)).

Proof

technique · direct
1.1

The universal properties give unique factor-compatible homomorphisms u:FFu:F\to F' and v:FFv:F'\to F.

givenL1L2
2.1

Both vuv\circ u and idF\mathrm{id}_F agree with every factor map, so uniqueness gives vu=idFv\circ u=\mathrm{id}_F; similarly uv=idFu\circ v=\mathrm{id}_{F'}.

step 1.1
3.1

Hence uu is the unique compatible isomorphism. For the empty family both free products are trivial.

step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 10 results over 7 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