Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 label-preserving automorphism action on a Cayley graph is the left regular representation of Cayley's theorem

Statement

The label-preserving automorphism action on a Cayley graph is the left regular representation of Cayley's theorem.

Facts & Assumptions

Given: The hypotheses of the Statement.

[L1]

Left translation acts on a Cayley graph by label-preserving automorphisms, freely on vertices (Left translation acts on a Cayley graph by label-preserving automorphisms, freely on vertices).

[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).

[L2]

Every group G is isomorphic to the subgroup of Sym(G) formed by its left translations λg:xgx. (Cayley's theorem: every group G is isomorphic to a subgroup of Sym(G)).

[L3]

A left action of G on X is a function G×XX, written (g,x)gx, such that (Left group actions, transitive actions, and faithful actions).

[L4]

Group isomorphisms, automorphisms and the set Aut(G). (Group isomorphisms, automorphisms and the set Aut(G)).

Proof

technique · direct
1.1

Cayley’s theorem embeds a group in the symmetric group on its underlying set by left multiplication, and the action just constructed has exactly those permutations.

F1L1L2L3
2.1

So the label-preserving automorphism action is that embedding followed by the inclusion of the automorphism group in the symmetric group; the Cayley graph refines the regular action rather than supplying a second embedding theorem.

L1L2L4step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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