Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

The canonical surjection from a free product to the direct product of its factors

Example

For groups G,HG,H, the factor maps g(g,e)g\mapsto(g,e) and h(e,h)h\mapsto(e,h) induce a canonical surjection π:GHG×H.\pi:G\ast H\twoheadrightarrow G\times H. Every cross-commutator lies in kerπ\ker\pi, and if g,hg,h are nonidentity then that commutator is nonidentity in the free product.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[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]

Every element of iIGi\ast_{i\in I}G_i has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L3]

Let GG and HH be groups. Their external direct product has underlying set G×H:={(g,h):gG, hH}G\times H:=\{(g,h):g\in G,\ h\in H\} and componentwise operation (g,h)(g,h):=(gg,hh).(g,h)(g',h') := (gg',hh'). The fact that this operation makes G×HG\times H a group, with the indicated identity and inverses, is proved in thm-external-direct-product-is-a-group. Until that result is used, this definition introduces only the set and its componentwise binary operation. (The external direct product G×HG\times H with componentwise multiplication).

[L4]

For groups GG and HH, the componentwise operation of def-external-direct-product-of-groups makes G×HG\times H a group. Its identity is (eG,eH)(e_G,e_H), and (g,h)1=(g1,h1).(g,h)^{-1}=(g^{-1},h^{-1}). Moreover the coordinate maps πG(g,h)=g\pi_G(g,h)=g and πH(g,h)=h\pi_H(g,h)=h are group homomorphisms. (G×HG\times H is a group with identity (eG,eH)(e_G,e_H), coordinatewise inverses, and homomorphic coordinate projections).

[L5]

Let GG be a group. For g,hGg,h\in G, their commutator is [g,h]:=ghg1h1.[g,h]:=ghg^{-1}h^{-1}. This convention is fixed throughout; some sources use its inverse. By the inverse laws of lem-group-inverse-laws, one has [g,h]1=hgh1g1=[h,g][g,h]^{-1}=hgh^{-1}g^{-1}=[h,g]. The commutator subgroup, or derived subgroup, is the subgroup generated by all commutators: [G,G]:={[g,h]:g,hG}.[G,G]:=\langle\{[g,h]:g,h\in G\}\rangle. The generated subgroup notation is that of def-generated-subgroup. (Commutators [g,h]=ghg1h1[g,h]=ghg^{-1}h^{-1} and the commutator subgroup [G,G][G,G]).

Verification

technique · direct
1.1

Free-product universality gives π\pi, and every (g,h)=(g,e)(e,h)(g,h)=(g,e)(e,h) lies in its image, so it is surjective.

givenL1L2L3L4L5
2.1

The two factor images commute in G×HG\times H, hence [g,h][g,h] maps to the identity.

step 1.1
3.1

For nonidentity gGg\in G, hHh\in H, the word ghg1h1ghg^{-1}h^{-1} is a nonempty reduced word, so normal form makes it nonidentity. Thus the kernel is generally nontrivial.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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