PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16

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 holomorph acts faithfully on $G$ by affine permutations $x \mapsto g α (x)$

Statement

For every group $G$ , the rule

$ρ (g, α) (x) = g α (x)$

defines a faithful action of $Hol (G)$ on the underlying set of $G$ . Equivalently, $ρ$ embeds $Hol (G)$ in $Sym (G)$ .

Facts & Assumptions

Given: A group $G$ and its holomorph.

[L1]

The holomorph multiplication is $(g, α) (h, β) = (g α (h), α β)$ ( The holomorph $Hol (G) = G ⋊ Aut (G)$ ).

[L2]

A group action is a rule satisfying the identity and compatibility laws, and it is faithful when only the identity acts trivially (Left group actions, transitive actions, and faithful actions).

[L3]

Group actions on a set correspond to homomorphisms into its symmetric group (Actions of $G$ on $X$ correspond exactly to homomorphisms $G \to Sym (X)$ , The symmetric group $Sym (X)$ : the bijections of a set $X$ under composition).

Proof

technique · direct

1.1L1algebra

Each map $x \mapsto g α (x)$ is a permutation, with inverse $x \mapsto α^{- 1} (g^{- 1} x)$ .

1.2L1L2L3

Composition gives $ρ (g, α) (ρ (h, β) (x)) = g α (h) (α β) (x)$ , which equals $ρ ((g, α) (h, β)) (x)$ by [L1]. Therefore $ρ$ is an action, equivalently a homomorphism to $Sym (G)$ , by [L2] and [L3].

2.1step 1.2L2L3algebra∎

If $ρ (g, α)$ is the identity permutation, evaluation at $1_{G}$ gives $g = 1_{G}$ . Then $α (x) = x$ for every $x \in G$ , so $α = {id}_{G}$ . Thus the action is faithful by [L2], and the corresponding homomorphism is injective: equality of two images reduces, after multiplying by an inverse, to this identity case.

Depends on

Used by

Hol(C₂× C₂)≅ S₄ Example
Hol(C₈) is the group of affine maps x↦ ax+b with a∈{1,3,5,7} Example
The affine group of the real line is ℝ⋊ℝ^× Example
A permutation group with a regular normal subgroup G embeds in Hol(G) Proposition

Dependency tree · two levels

13 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

Peter J. Cameron, The Holomorph of a Group (standard reference, not scraped)

The holomorph acts faithfully on GG by affine permutations x↦gα(x)x↦gα(x)