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 with amalgamation
Statement
Every element of has a unique normal form relative to fixed transversals. A normal word of positive length is nonidentity. The represented group and these conclusions are independent of the chosen transversals.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Let be embedded in and as in def-free-product-with-amalgamation. By def-axiom-of-choice, choose left-coset transversals containing the identity. A normal word is where (def-natural-numbers), , every is a nonidentity representative from or , and consecutive representatives come from different factors. Length zero means the word is just . The written form depends on the transversals. (Transversal normal-form data for an amalgamated free product).
With fixed transversal data, every element of and acts by a permutation on normal words. The two actions agree on , inverses act inversely, and with the library's composition convention one has . (Factor elements act consistently by permutations on amalgamated normal words).
Let and with disjoint generators, and let embed . If generates and words represent , then (A free product with amalgamation has the factor presentations plus the amalgamating relations).
Given homomorphisms and as in def-group-homomorphism, a pushout is a group with homomorphisms and such that , and such that every compatible pair , factors through a unique with and . The maps need not be injective. (Pushouts of group homomorphisms).
Proof
The compatible factor permutations give, by the pushout presentation, an action of on the set of normal words. For a factor product , applying to the length-zero word performs the deterministic normal-form rewrite of ; since inversion is a bijection of the group, every element has such a form.
The permutation attached to a normal word sends the length-zero word to the deterministic normal-form rewrite of its inverse. The resulting inversion-normalisation map is an involution: invert the represented factor product again and repeat the uniquely determined transversal rewrites. It preserves syllable length, since multiplying a nontrivial transversal representative by an element of cannot put it in . Hence a positive-length normal word cannot represent the identity, and equality of two represented elements forces equality of their inverse normal forms and then of the original words.
Thus existence and uniqueness hold, including the length-zero elements of .
Changing transversals gives another group with the same pushout universal property; the unique factor-compatible isomorphism identifies the two descriptions, so the group and its conclusions do not depend on the choices.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 39 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
- 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)