Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

The two-strand braid group is infinite cyclic

Statement

The braid group B2 is cyclic, generated by σ1, and σ1 has infinite order. Hence B2 is an infinite cyclic group.

Facts & Assumptions

Given: The Artin presentation of the braid groups.

[L1]

The group B2 is presented by one generator σ1 and no braid relations (The braid group by Artin presentation).

[L2]

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

[L3]

A map of generators satisfying the relators extends uniquely from a presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1

By [L1], the presentation of B2 has one generator and no defining relator, so every element of B2 is a power of σ1. Thus B2 is cyclic.

givenL1algebra
2.1

With no relators present, the presented group is the free group on one generator. By [L2], that generator has infinite order, so σ1m1 for every nonzero integer m.

L1L2L3step 1.1algebra
3.1

Therefore the cyclic group B2=σ1 is infinite, so it is infinite cyclic.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

19 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