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 , nontrivial actions of on exist exactly when and are unique up to automorphisms
Statement
Let be primes. A nontrivial action exists if and only if . When it exists, all nontrivial such actions give isomorphic semidirect products .
Facts & Assumptions
Given: Primes .
For prime , (, and for every prime ), and (The unit group and Euler's totient for ); together these give .
A prime divisor of a finite group order occurs as the order of an element (Cauchy's theorem: if a prime divides , then has an element of order ).
The congruence has at most solution classes ( For prime and , the congruence has at most residue-class solutions).
A homomorphism is injective exactly when its kernel is trivial (A group homomorphism is injective if and only if its kernel is trivial).
The order of a subgroup divides the order of a finite group (Lagrange's theorem: for every subgroup of a finite group ).
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).
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
[forward] A nontrivial homomorphism has a proper kernel. By [L6], its kernel has order dividing , so it is trivial. The homomorphism is therefore injective by [L5] and its image has order .
[reverse] If , [L2] and [L3] give an element of order in . Sending a generator of to this element defines a nontrivial action.
Suppose and are two distinct subgroups of order in . Their intersection is trivial, because [L8] says a nonidentity element in the intersection would generate each prime-order group. Thus contains distinct roots of , contradicting [L4]. There is consequently a unique subgroup of order .
By [L1], the target is , of order by [L2]. Its image has order by step 1.1, so [L6] gives .
Any two nontrivial actions are isomorphisms from onto this unique subgroup. Hence is an automorphism of and for every . Taking the automorphism of to be the identity, the compatibility in [L7] gives isomorphic semidirect products.
Depends on
- $\operatorname{Aut}(C_n)\cong(\mathbb Z/n\mathbb Z)^\times$
- $\varphi(1)=1$, and $\varphi(p)=p-1$ for every prime $p$
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- Cauchy's theorem: if a prime $p$ divides $|G|$, then $G$ has an element of order $p$
- For prime $q$ and $d\ge1$, the congruence $x^d\equiv1\pmod q$ has at most $d$ residue-class solutions
- Actions changed by automorphisms of the kernel and complement give isomorphic semidirect products
- A group homomorphism is injective if and only if its kernel is trivial
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- A finite group of prime order is cyclic and every nonidentity element generates it
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 136 results over 22 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- J. S. Milne, Group Theory (standard reference, not scraped)