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.
Affine linear Frobenius groups over finite fields
Example
Let be a finite field with elements, where (Finite fields and their order, Field), with additive group and multiplicative group (Field). Let
be the set of affine maps of , with composition as operation (The symmetric group : the bijections of a set under composition). Then:
- is a subgroup of of order ;
- the translation set is a normal subgroup of isomorphic to , the dilation set is a subgroup isomorphic to , and is an internal semidirect product (An internal semidirect product and a complement to a normal subgroup, Group isomorphisms, automorphisms and the set );
- is a Frobenius complement of and its Frobenius kernel is (Frobenius complement and frobenius group).
Thus the affine group acting on by is a Frobenius group whose kernel is the translation group and whose complement is the group of nontrivial dilations; the hypothesis is exactly what makes nontrivial, and is the excluded boundary case in which the action is regular.
Facts & Assumptions
Given: A finite field with , its additive group and multiplicative group , and the set of affine maps .
Field arithmetic (Field): ; is an abelian group with identity , so is a group with ; is an abelian group with identity , so is a group, where means and then has a multiplicative inverse with ; multiplication distributes over addition, so and ; from and it follows that , because is invertible; and because has the elements of except .
Composition and inversion of affine maps: for and , , and is a bijection with two-sided inverse ; in particular (The symmetric group : the bijections of a set under composition, Field).
Subgroup criterion: a nonempty subset of a group closed under products and inverses is a subgroup (One-step subgroup test: a nonempty is a subgroup iff for all ; the identity and the inverses of are then those of , Subgroup, In a group , and , the order of the last product being essential).
Cardinalities: , , , and (The cardinality of a finite set, The product rule: , and , [F1]).
Normal subgroups and internal semidirect products: means for all ; if with , and , then is an internal semidirect product (Normal subgroup: invariance under conjugation, An internal semidirect product and a complement to a normal subgroup, Subgroup).
Conjugation is an automorphism and centralizes every element of a subgroup ; fixes an element under conjugation exactly when (Conjugation is an automorphism, The conjugacy class and centralizer of an element, In a group , and , the order of the last product being essential).
Free-action criterion and kernel uniqueness: if with , , and every fixes only the identity of under conjugation, then is a Frobenius complement of ; and for a Frobenius group with complement and kernel one has , , and is the unique normal subgroup with and (Frobenius groups and fixed point free actions, Frobenius semidirect product decomposition, Normal subgroup: invariance under conjugation).
Verification
By [F2], each is a bijection , so ; contains , is closed under composition and under inverses by the formulas of [F2] (with and ), so is a subgroup of by [F3]. The map , , is bijective: it is surjective by the definition of , and if then evaluating at gives and then evaluating at gives . Hence by [F4]. This is assertion 1.
The maps , , and , , are bijections; by the composition formula [F2], and , while is the common identity; so and are group isomorphisms onto and , and , are subgroups.
For and we compute, using [F2] twice, , which lies in ; since conjugation by is a bijection and is a subgroup, for every , that is by [F5].
Also : if , evaluating at gives and then evaluating at gives , so . Moreover : for we have by [F2], and , . Finally and , because . So is an internal semidirect product by [F5], which completes assertion 2.
We verify that the conjugation action of on is free. Let with , so , since while ; and let with , so . By step 1.3 with , , and because by [F1]; hence , that is, fixes no nonidentity element of .
By [F7] applied to the internal semidirect product of step 1.4 and the free action of step 2.1, the subgroup is a Frobenius complement of ; and by the uniqueness statement of [F7], applied to the normal subgroup with and , the Frobenius kernel of with respect to is . This is assertion 3. ∎
Depends on
- Finite fields and their order
- Field
- Group and abelian group
- Subgroup
- Normal subgroup: invariance under conjugation
- An internal semidirect product and a complement to a normal subgroup
- Group isomorphisms, automorphisms and the set $\operatorname{Aut}(G)$
- Frobenius groups and fixed point free actions
- Frobenius semidirect product decomposition
- Frobenius complement and frobenius group
- Left group actions, transitive actions, and faithful actions
- The conjugacy class $\operatorname{Cl}_G(x)$ and centralizer $C_G(x)$ of an element
- Conjugation $x\mapsto gxg^{-1}$ is an automorphism
- In a group $e^{-1} = e$, $(g^{-1})^{-1} = g$ and $(gh)^{-1} = h^{-1}g^{-1}$, the order of the last product being essential
- One-step subgroup test: a nonempty $H \subseteq G$ is a subgroup iff $gh^{-1} \in H$ for all $g, h \in H$; the identity and the inverses of $H$ are then those of $G$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- If $[G:N]$ is finite then $|G/N|=[G:N]$; for finite $G$ this equals $|G|/|N|$
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
- The cardinality $\lvert A\rvert$ of a finite set
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
55 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
- Alex Bartel, Introduction to Representation Theory of Finite Groups, §6.1 (standard reference, not scraped)