Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

For primes p<q, nontrivial actions of Cp on Cq exist exactly when p∣(q−1) and are unique up to automorphisms

Statement

Let p<q be primes. A nontrivial action Cp→Aut⁡(Cq) exists if and only if p∣(q−1). When it exists, all nontrivial such actions give isomorphic semidirect products Cq⋊Cp.

Facts & Assumptions

Given: Primes p<q.

[L1]

Aut⁡(Cq)≅(Z/q)× ( Aut⁡(Cn)≅(Z/nZ)×).

[L2]

For prime q, φ(q)=q−1 (φ(1)=1, and φ(p)=p−1 for every prime p), and φ(n)=∣(Z/n)×∣ (The unit group (Z/n)× and Euler's totient φ(n)=∣(Z/n)×∣ for n≥1); together these give ∣(Z/q)×∣=q−1.

[L3]

A prime divisor of a finite group order occurs as the order of an element (Cauchy's theorem: if a prime p divides ∣G∣, then G has an element of order p).

[L4]

The congruence xp≡1(modq) has at most p solution classes ( For prime q and d≥1, the congruence xd≡1(modq) has at most d residue-class solutions).

[L5]

A homomorphism is injective exactly when its kernel is trivial (A group homomorphism is injective if and only if its kernel is trivial).

[L7]

Compatible changes by automorphisms of the two factors give isomorphic semidirect products (Actions changed by automorphisms of the kernel and complement give isomorphic semidirect products).

[L8]

Every nonidentity element of a group of prime order generates that group (A finite group of prime order is cyclic and every nonidentity element generates it).

Proof

technique · iff
1.1L5L6algebra

[forward] A nontrivial homomorphism Cp→Aut⁡(Cq) has a proper kernel. By [L6], its kernel has order dividing p, so it is trivial. The homomorphism is therefore injective by [L5] and its image has order p.

1.2L1L2L3

[reverse] If p∣(q−1), [L2] and [L3] give an element of order p in (Z/q)×. Sending a generator of Cp to this element defines a nontrivial action.

1.3L4L8algebra

Suppose A and B are two distinct subgroups of order p in (Z/q)×. Their intersection is trivial, because [L8] says a nonidentity element in the intersection would generate each prime-order group. Thus A∪B contains 2p−1>p distinct roots of xp=1, contradicting [L4]. There is consequently a unique subgroup of order p.

2.1step 1.1L1L2L6

By [L1], the target is (Z/q)×, of order q−1 by [L2]. Its image has order p by step 1.1, so [L6] gives p∣(q−1).

3.1step 1.1step 1.3L7algebra∎

Any two nontrivial actions α,β are isomorphisms from Cp onto this unique subgroup. Hence v=β−1α is an automorphism of Cp and βv(h)=αh for every h. Taking the automorphism of Cq to be the identity, the compatibility in [L7] gives isomorphic semidirect products.

Depends on

Used by

Dependency tree · two levels

51 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