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

The Cayley graph of Zn for the standard basis is the integer lattice, and its word metric is the sum of coordinate differences

Example

The Cayley graph of Zn for the standard basis is the integer lattice, and its word metric is the sum of coordinate differences.

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}:gG, s(SS1){e}} (The Cayley graph of a group with respect to a subset).

[L1]

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

[L2]

The word length gS is the least n such that g is a product of n elements of SS1 (Word length of a group element with respect to a generating set).

[L3]

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

[L4]

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]

d1(x,y):=k<nxkyk,d2(x,y):= k<n(xkyk)2 ,d(x,y):=max{xkyk:k<n}. (Rn as the set of functions nR, and d1, d2, d are metrics on it).

Verification

technique · direct
1.1

With the standard basis as generating set, the neighbours of a tuple are those differing by one in a single coordinate, so the Cayley graph is the integer lattice.

F1L1
2.1

The word length of a tuple is the sum of the absolute values of its coordinates: that many steps suffice, and each step changes the sum by at most one.

L2L3L4step 1.1
3.1

So the word metric is the restriction of the 1 metric, and the inclusion into that normed space is a quasi-isometry.

L3L5step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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