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 form a group under concatenation followed by seam reduction. The one-syllable maps make this group a free product of the family.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
For a family , a free product is a group with homomorphisms in the sense of def-group-homomorphism, such that for every group and every family of homomorphisms , there is a unique homomorphism satisfying for all . It is denoted . Injectivity of the maps is not part of this definition. (The free product of an arbitrary family of groups).
For groups as in def-group, a syllable is a tagged pair with and . 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).
For each and , left multiplication at the first syllable defines a permutation of the set of reduced words. One has and , so is a group homomorphism. (Factor elements act by mutually inverse permutations on reduced syllable words).
Let and be monoids (def-semigroup-and-monoid). A monoid homomorphism from to is a function such that - (H1) for all ; - (H2) . Let and be groups (def-group). A group homomorphism from to is a function satisfying (H1) alone: Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies and (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 is a monoid homomorphism, and a composite of monoid homomorphisms is one, since and ; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism. (Monoid homomorphism and group homomorphism).
Proof
Let a reduced word act by the composition of the factor permutations attached to its syllables, and define . The seam calculation gives both concatenation followed by reduction and .
Composition of permutations makes the operation associative; the empty word is the identity, and reversing a word while inverting its syllables gives the inverse.
Given homomorphisms , send to . The seam rules and homomorphism laws make this a homomorphism.
It extends every , 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.
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
- George D. Torres, Combinatorial Group Theory, §2 (standard reference, not scraped)
- B. H. Neumann, Lectures on Topics in the Theory of Infinite Groups, Ch. 9 (standard reference, not scraped)