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.

Each factor is a retract of a free product when all other factors are sent trivially

Statement

For every iIi\in I, the factor GiG_i is a retract of jIGj\ast_{j\in I}G_j: there is ri:jGjGir_i:\ast_jG_j\to G_i with riιi=idGir_i\circ\iota_i=\mathrm{id}_{G_i}.

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]

Every canonical factor homomorphism ιi:GijGj\iota_i:G_i\to\ast_jG_j is injective. (Every canonical factor map into a free product is injective).

[L3]

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

Use the identity homomorphism on GiG_i and the trivial homomorphism GjGiG_j\to G_i for every jij\ne i.

givenL1L2L3
2.1

Free-product universality gives a unique rir_i extending this family, and its defining equation is riιi=idGir_i\circ\iota_i=\mathrm{id}_{G_i}.

step 1.1
3.1

Thus ιi\iota_i is a section and GiG_i is a retract. The assertion is made only for an index iIi\in I.

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 14 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