Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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.

The Cayley graph of Z for the generating set {1} is a line and its word metric is ∣m−n∣

Example

The Cayley graph of Z for the generating set {1} is a line and its word metric is ∣m−n∣.

Facts & Assumptions

Given: The objects and hypotheses in the Example.

[F1]

The Cayley graph of a group G with respect to a subset S has vertex set G and edge set {{g,gs}:g∈G, s∈(S∪S−1)∖{e}} (The Cayley graph of a group with respect to a subset).

[L1]

The word length ∣g∣S is the least n such that g is a product of n elements of S∪S−1 (Word length of a group element with respect to a generating set).

[L2]

The word metric of G with respect to S is dS(g,h)=∣g−1h∣S (The word metric of a group with respect to a generating set).

[L3]

The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph (The word metric is a left-invariant metric and coincides with the path metric of the Cayley graph).

[L5]

A free abelian group on a set X is an abelian group A(X) together with a map i:X→A(X) such that, for every abelian group B and every function u:X→B, there is a unique group homomorphism u^:A(X)→B satisfying (Free abelian group on a set).

Verification

technique · direct
1.1F1L5

With S={1} the symmetrised set is {1,−1} and the edges join n to n±1, so the Cayley graph is a two-way infinite path.

2.1L1L2L3step 1.1

The word length of n is ∣n∣, since n is a product of ∣n∣ copies of 1 or of −1 and no shorter expression exists.

3.1L2L4step 2.1∎

So the word metric is d(m,n)=∣m−n∣, the metric induced from the real line.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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