CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-09-23 (gpt-6-sol)

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.

Finite C prime(1/6) presentations have solvable word problem

Statement

Every finite $C^{'} (1 / 6)$ presentation has solvable word problem.

Facts & Assumptions

Given: A finite presentation satisfying $C^{'} (1 / 6)$ .

[L1]

For every nonempty freely reduced null word, the original linear word contains a contiguous initial segment of a symmetrised defining relator longer than half that relator (Greendlinger shell existence from the curvature count).

[F1]

A Dehn presentation requires this long relator subword in each nonempty freely reduced null word (Dehn-reduced words and Dehn presentations).

[L2]

Every finite Dehn presentation has a terminating decision procedure for the word problem (Dehn's algorithm terminates and decides the word problem for a Dehn presentation).

Proof

technique · direct

1.1L1F1given

By [L1], every nonempty freely reduced trivial word has the required long relator subword in its original linear reading. Thus the symmetrised finite $C^{'} (1 / 6)$ presentation is a Dehn presentation in the sense of [F1].

2.1L2step 1.1∎

Apply [L2] to that Dehn presentation. The resulting Dehn algorithm decides triviality of words.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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

GAP SmallCancellation manual, Chapter 1: Small Cancellation Theory — the classical conditions (standard reference, not scraped)
Jay Williams, Universal Countable Borel Quasi-Orders (standard reference, not scraped)
Nicholas Touikan, An Introduction to Combinatorial and Geometric Group Theory, Section 3.5 (standard reference, not scraped)
Clara Löh, Geometric Group Theory: An Introduction, Section 7.4.1 (standard reference, not scraped)