Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-09-09 (gpt-6-astra)
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.

A strict C prime(1/6) presentation that is a free group of rank six

Example

The presentation

G=⟨x1,…,x7∣x1x2x3x4x5x6x7⟩

is a strict C′(1/6) presentation with no proper-power relator. In fact G is isomorphic to the free group on x1,…,x6, and is torsion-free.

Facts & Assumptions

Given: The displayed one-relator presentation.

[L1]

Symmetrisation includes cyclic conjugates and inverse cyclic conjugates; a piece is a nonempty common prefix of distinct symmetrised relators; strict C′(1/6) bounds every piece by one sixth of its relator length (The symmetrisation of a relator set closes under inverses and cyclic conjugates, A piece is a common initial segment occurring in two distinct places of a symmetrised relator set, The small-cancellation conditions C(lambda) and C prime(lambda)).

[L2]

Redundant-relator moves and legal dictionary-generator deletions preserve the presented group (Tietze transformations: dictionary generators, redundant relators, renaming, and their inverses, Each Tietze transformation preserves the isomorphism type of the presented group). A presentation with no relators is the free group on its generators (Group presentation by generators and relations).

[L3]

Free groups are torsion-free (Free groups are torsion-free).

Verification

technique · direct
1.1givenL1

Write r=x1⋯x7. Its seven positive cyclic conjugates have distinct first letters, as do its seven negative inverse conjugates; no positive first letter equals a negative one. Thus no distinct symmetrised relators share a nonempty prefix, so there are no pieces and strict C′(1/6) holds vacuously. The cyclic word is not a proper power: each generator occurs exactly once, whereas a repetition at least twice would repeat each occurring letter.

2.1L2step 1.1

Add the inverse relator r−1 as a redundant relator and delete r, since each is a consequence of the other. Now r−1=x7−1w with w=(x1⋯x6)−1, which contains no x7. There are no other relators, so the legal inverse dictionary move deletes x7 and r−1. The resulting presentation is ⟨x1,…,x6∣∅⟩. Hence [L2] identifies G with the free group on these six generators.

3.1L3step 2.1∎

By [L3] that free group has no nonidentity element of finite order. An isomorphism preserves powers and the identity, so G is torsion-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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