False statementConstruction: AI-adaptedVerification: AI-generatedprecheck 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.

FALSE: a free product of abelian groups is abelian

Statement

False claim: the free product of abelian groups is abelian.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Every element of $*_{i \in I} G_{i}$ has a unique reduced syllable expression. The identity is represented by the empty word, and no nonempty reduced word represents the identity. (Normal form theorem for free products).

[L2]

For every $n \in N$ , view $n$ as its canonical nonnegative integer and put $n Z : = {n k : k \in Z}$ . Then the left cosets of $n Z$ in $(Z, +)$ are exactly the congruence classes modulo $n$ , and coset addition is the published addition of congruence classes. Thus $(Z, +) / n Z = (Z / n, +)$ as the same group on the same underlying set. This includes $n = 0$ and $n = 1$ . (For every $n \in N$ , the congruence-class group $(Z / n, +)$ is the quotient group $(Z, +) / n Z$ ).

Refutation

technique · direct

1.1

Take the two abelian groups $C_{2} = ⟨ s ⟩$ and $C_{2} = ⟨ t ⟩$ .

givenL1L2

2.1

In $C_{2} * C_{2}$ , the words $s t$ and $t s$ are distinct reduced words by normal-form uniqueness.

step 1.1

3.1

Thus $s$ and $t$ do not commute, so their free product is nonabelian and the claim is false.

step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on 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)