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.
Normal form theorem for free products
Statement
Every element of has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity.
Facts & Assumptions
Given: The objects and hypotheses in the 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. (Reduced syllable words form the free product of a 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 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).
Proof
Let be any free product and the reduced-word model. Their universal properties give factor-compatible homomorphisms and . Each composite agrees with the identity on every factor, so uniqueness in the universal property makes the maps inverse isomorphisms.
In the model every element is literally one reduced word. Distinct reduced words act differently on the empty word, so they are distinct elements.
Consequently the empty word is the identity, every nonempty reduced word is nonidentity, and the reduced expression is unique.
Depends on
Used by
- Every canonical factor map into a free product is injective Corollary
- Finite-order elements of a free product are conjugate into factors Corollary
- The center of a free product with at least two nontrivial factors is trivial Corollary
- C₂ free-product C₂ is the infinite dihedral group, and the product of its generators has infinite order Example
- C₂ free-product C₃ has presentation with only the two factor relations and is infinite Example
- The canonical surjection from a free product to the direct product of its factors Example
- FALSE: a free product of abelian groups is abelian False statement
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 18 results over 9 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)