Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-03
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.

Cayley's theorem: every group G is isomorphic to a subgroup of Sym⁡(G)

Statement

Every group G is isomorphic to the subgroup of Sym⁡(G) formed by its left translations λg:x↦gx.

Facts & Assumptions

Given: A group G with identity e.

[L2]

The image of a group homomorphism is a subgroup, and a homomorphism is injective exactly when its kernel is trivial (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup, A group homomorphism is injective if and only if its kernel is trivial).

[L3]

A bijective group homomorphism is an isomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)).

Proof

technique · direct
1.1

Define g⋅x=gx on the set underlying G. Then e⋅x=x and (gh)⋅x=g⋅(h⋅x), so this is a left action.

L1givenalgebra
2.1

By [L1], the action yields a homomorphism λ:G→Sym⁡(G) with λ(g)(x)=gx.

step 1.1L1
3.1

If λ(g) is the identity permutation, then evaluating it at e gives g=λ(g)(e)=e. Hence ker⁡λ={e} and λ is injective.

step 2.1L2given
4.1

The image λ[G] is a subgroup of Sym⁡(G), and the injective homomorphism λ:G→λ[G] is bijective.

step 2.1step 3.1L2
5.1

Thus λ is an isomorphism from G to a subgroup of Sym⁡(G).

step 4.1L3∎

Depends on

Used by

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