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.
Small-Cancellation Disc Diagrams and the Torsion Toolkit: Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Free Groups and Presentations
- Normal Subgroups and Quotient Groups
- Relations, Functions, and Quotients
- Small-Cancellation Disc Diagrams and the Torsion Toolkit
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
Four calculations separate the roles of curvature, strict piece lengths, literal relator roots, and free reduction. The two-face example is a curvature ledger; the three-shell example is a local length ledger. The cyclic presentation exhibits exact torsion order, while the one-edge tree shows where curvature can reside when a boundary word has not been freely reduced.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Curvature ledger for a two cell diagram
Example
Take two vertices and three disjoint-in-the-interior arcs from to , in planar order. Fill the regions between and between by two faces. This is a disc with . Give every face corner angle in units of . Both vertex curvatures are zero and both face curvatures are one.
One possible labelling is on the three arcs: the face words are and , up to orientation. This example is a curvature computation, not a claim.
Facts & Assumptions
Given: The two-face disc and its four angles described in the Example.
Curvature uses link Euler characteristic and face corner multiplicities (Arc reduction and combinatorial curvature of a disc diagram).
Total curvature of a diagram is (Euler curvature identity for an arc reduced disc diagram).
Verification
At each of the link is a path with three vertices (the three edge germs) and two edges (the two corners), so its Euler characteristic is . Its angle sum is , giving by [F1].
Each face is a bigon with two corners of angle , giving . Thus total curvature is , agreeing with in [F2]. These calculations include all four corners once in the face total and once in the vertex total with opposite sign.
A three shell after arc reduction
Example
A four-arc face has one exterior arc and three internal arcs. If its perimeter is and the internal lengths are each less than , its exterior length exceeds . Concretely use and , so the exterior arc has length .
This is a local shell length ledger. It does not assert a globally labelled presentation realizing these lengths.
Facts & Assumptions
Given: The four-arc face, with perimeter and positive internal lengths .
Arc reduction preserves word lengths and boundary incidence counts (Arc reduction and combinatorial curvature of a disc diagram).
A three-shell consists of one exterior arc and three complementary internal arcs (Boundary spur or at most three shell from curvature).
Verification
By [F1] and the three-shell description [F2], the exterior length is . The hypotheses give , hence . Equality is excluded because all three piece bounds are strict.
For the displayed instance, because , and . Thus the interior part has length nine and the exposed part length ten, verifying the asserted instance.
Diagram
Relator root versus proper power
Example
For the symmetrisation of , the root is , equal cyclic rotations do not create pieces, and is cyclic of exact order seven.
Facts & Assumptions
Given: The one-generator presentation with the symmetrised relator set of .
Pieces require distinct full symmetrised words (Sc toolkit symmetrised relators and pieces).
Relator roots are nonempty words not literally proper powers (Minimal cyclic power diagram and relator root).
Verification
The symmetrised set is exactly . Its two words start in different letters, so have no nonempty common prefix; equal positive rotations all give the first word and equal inverse rotations the second. Thus there are no pieces and holds vacuously by [F1]. The one-letter word cannot be a proper power of a nonempty shorter word, so it is a root by [F2].
Every one-generator word freely reduces to for an integer , since any change of sign in the string creates an adjacent inverse pair. The relation reduces the exponent modulo seven, so every element is one of . The exponent sum modulo seven is unchanged by free cancellation and by inserting or deleting any conjugate of : the conjugating exponents cancel and the relator contributes a multiple of seven. It therefore defines a homomorphism from the quotient to the additive residues modulo seven, taking to the residue of .
The seven displayed elements have distinct images, so they are distinct; step 1.2 also proves that they exhaust the quotient. In particular and for . This proves exact order seven, while keeping the literal word root distinct from its quotient image.
A boundary spur when free reduction is omitted
Statement refuted
Every nonempty null boundary word of a diagram over a presentation has a shell, even without requiring free reduction.
Facts & Assumptions
Given: The presentation , satisfying vacuously, and a single edge oriented from to labelled , with no faces.
A finite tree is a zero-face diagram, and its outer walk traverses a bridge in both directions (Sc toolkit labelled planar disc diagram).
A spur tip has singleton link, no corners and curvature one (Arc reduction and combinatorial curvature of a disc diagram).
Counterexample
The single closed edge is finite, connected, planar and contractible, hence is a diagram by [F1]. Its face-label condition is vacuous. Its outer word from is , a nonempty word freely reducing to the empty word and therefore null in the given free group. It is not freely reduced.
There are no faces, so there cannot be an exposed face or shell. Both endpoints have one edge germ and no corners, giving curvature one each by [F2], and the total is two. Thus positive curvature is entirely carried by spur tips, and the nonempty null boundary in step 1.1 refutes the assertion.