Alphabeta Math
TheoremStatement: 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.

Reduced syllable words form the free product of a family of groups

Statement

The reduced syllable words in (Gi)iI(G_i)_{i\in I} form a group under concatenation followed by seam reduction. The one-syllable maps GiWG_i\to W make this group a free product of the family.

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]

For groups as in def-group, a syllable is a tagged pair (i,g)(i,g) with iIi\in I and gGi{ei}g\in G_i\setminus\{e_i\}. A reduced syllable word is a finite list of syllables, indexed by a natural length as in def-natural-numbers, in which adjacent tags differ. The empty list is allowed. At a concatenation seam, adjacent syllables from the same factor are multiplied and an identity result is deleted; this elementary reduction is repeated until the seam is reduced. (Reduced syllable words in a family of groups).

[L3]

For each iIi\in I and gGig\in G_i, left multiplication at the first syllable defines a permutation Pi,gP_{i,g} of the set of reduced words. One has Pi,g1=Pi,g1P_{i,g}^{-1}=P_{i,g^{-1}} and Pi,gh=Pi,gPi,hP_{i,gh}=P_{i,g}\circ P_{i,h}, so gPi,gg\mapsto P_{i,g} is a group homomorphism. (Factor elements act by mutually inverse permutations on reduced syllable words).

[L4]

Let (M,,e)(M,\cdot,e) and (M,,e)(M',\cdot',e') be monoids (def-semigroup-and-monoid). A monoid homomorphism from MM to MM' is a function f:MMf : M \to M' such that - (H1) f(xy)=f(x)f(y)f(x \cdot y) = f(x) \cdot' f(y) for all x,yMx, y \in M; - (H2) f(e)=ef(e) = e'. Let GG and GG' be groups (def-group). A group homomorphism from GG to GG' is a function f:GGf : G \to G' satisfying (H1) alone: f(xy)  =  f(x)f(y)for all x,yG.f(xy) \;=\; f(x)\, f(y) \qquad \text{for all } x, y \in G . Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies f(e)=ef(e) = e' and f(x1)=f(x)1f(x^{-1}) = f(x)^{-1} (lem-group-homomorphism-basic-properties). For monoids it does not follow and must be assumed, which is why the two definitions differ. A homomorphism from a structure to itself is an endomorphism. The identity map of MM is a monoid homomorphism, and a composite of monoid homomorphisms is one, since (gf)(xy)=g(f(x)f(y))=g(f(x))g(f(y))(g \circ f)(xy) = g(f(x)f(y)) = g(f(x))\,g(f(y)) and (gf)(e)=g(e)=e(g \circ f)(e) = g(e') = e''; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism. (Monoid homomorphism and group homomorphism).

Proof

technique · direct
1.1

Let a reduced word uu act by the composition PuP_u of the factor permutations attached to its syllables, and define uv=Pu(v)u\cdot v=P_u(v). The seam calculation gives both concatenation followed by reduction and Puv=PuPvP_{u\cdot v}=P_u\circ P_v.

givenL1L2L3L4
2.1

Composition of permutations makes the operation associative; the empty word is the identity, and reversing a word while inverting its syllables gives the inverse.

step 1.1
3.1

Given homomorphisms fi:GiHf_i:G_i\to H, send (i1,g1)(in,gn)(i_1,g_1)\cdots(i_n,g_n) to fi1(g1)fin(gn)f_{i_1}(g_1)\cdots f_{i_n}(g_n). The seam rules and homomorphism laws make this a homomorphism.

step 2.1
4.1

It extends every fif_i, and any extension must take the displayed value on every reduced word, so it is unique. For an empty family, only the empty word remains and the group is trivial.

step 3.1

Depends on

Used by

Dependency tree · next 3 levels

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