ExampleConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26

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.

Free groups act geometrically on regular trees

Example

Let $F_{r}$ be a free group of rank $r \geq 2$ , and let $T_{X}$ be its Cayley graph with respect to a free basis $X$ . Then $T_{X}$ is a regular tree, and the left translation action of $F_{r}$ on its vertex set is geometric. Consequently $F_{r}$ is quasi-isometric to that tree.

Facts & Assumptions

Given: A free basis $X$ of a free group $F_{r}$ with $r \geq 2$ , and the Cayley graph $T_{X}$ .

[L1]

The Cayley graph of a free group with respect to a free basis is a tree (The Cayley graph of a free group with respect to a free basis is a tree).

[L2]

A geometric action is isometric, proper, and cobounded (Geometric actions on a metric space).

[L3]

Under a geometric action on a geodesic metric space, every orbit map is a quasi-isometry (The Svarc-Milnor lemma).

Verification

technique · direct

1.1

By [L1], the graph $T_{X}$ is a tree, hence geodesic in its path metric. Left translation sends edges to edges, so the action is isometric. It is free and transitive on vertices, hence proper and cobounded. Therefore the action is geometric by [L2].

L1L2algebra

2.1

Applying [L3] to the action of step 1.1 shows that the orbit map from $F_{r}$ to the vertex set of $T_{X}$ is a quasi-isometry.

L3step 1.1∎

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

C. Löh, Geometric Group Theory, Sections 4.4 and 5.1 (standard reference, not scraped)
C. Drutu and M. Kapovich, Lectures on Geometric Group Theory, Chapter 5 (standard reference, not scraped)