Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27
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 F be a finite field with q:=∣F∣ elements, where q>2 (Finite fields and their order, Field), with additive group F+=(F,+) and multiplicative group F×=(F∖{0},⋅) (Field). Let

G:={ fa,b:F→F∣fa,b(x)=ax+b, a∈F×, b∈F }

be the set of affine maps of F, with composition as operation (The symmetric group Sym⁡(X): the bijections of a set X under composition). Then:

  1. G is a subgroup of Sym⁡(F) of order q(q−1);
  2. the translation set K:={f1,b:b∈F} is a normal subgroup of G isomorphic to F+, the dilation set H:={fa,0:a∈F×} is a subgroup isomorphic to F×, and G=K⋊H is an internal semidirect product (An internal semidirect product and a complement to a normal subgroup, Group isomorphisms, automorphisms and the set Aut⁡(G));
  3. H is a Frobenius complement of G and its Frobenius kernel is K (Frobenius complement and frobenius group).

Thus the affine group F+⋊F× acting on F by x↦ax+b is a Frobenius group whose kernel is the translation group and whose complement is the group of nontrivial dilations; the hypothesis q>2 is exactly what makes H nontrivial, and q=2 is the excluded boundary case in which the action is regular.

Facts & Assumptions

Given: A finite field F with ∣F∣=q>2, its additive group F+ and multiplicative group F×, and the set G of affine maps fa,b.

[F1]

Field arithmetic (Field): 0≠1; (F,+) is an abelian group with identity 0, so F+=(F,+) is a group with ∣F+∣=q; (F∖{0},⋅) is an abelian group with identity 1, so F×=(F∖{0},⋅) is a group, where a∈F× means a≠0 and then a has a multiplicative inverse a−1 with aa−1=1; multiplication distributes over addition, so a(x+y)=ax+ay and (a+c)x=ax+cx; from a≠1 and (a−1)b=0 it follows that b=0, because a−1≠0 is invertible; and ∣F×∣=q−1 because F×=F∖{0} has the q elements of F except 0.

[F2]

Composition and inversion of affine maps: for a,c∈F× and b,d∈F, fa,b∘fc,d=fac, ad+b, and fa,b is a bijection with two-sided inverse fa−1, −a−1b; in particular f1,0=id⁡F (The symmetric group Sym⁡(X): the bijections of a set X under composition, Field).

[F4]

Cardinalities: ∣F∣=q, ∣F×∣=q−1, ∣F××F∣=∣F×∣⋅∣F∣=(q−1)q, and ∣F+∣=q (The cardinality ∣A∣ of a finite set, The product rule: ∣A×B∣=∣A∣ ∣B∣, and ∣∏i<mAi∣=∏i<m∣Ai∣, [F1]).

[F5]

Normal subgroups and internal semidirect products: K⊴G means gKg−1=K for all g∈G; if K,H≤G with K⊴G, G=KH and K∩H={1}, then G=K⋊H is an internal semidirect product (Normal subgroup: invariance under conjugation, An internal semidirect product and a complement to a normal subgroup, Subgroup).

[F6]

Conjugation is an automorphism and c∈CG(R) centralizes every element of a subgroup R; f∈G fixes an element k∈K under conjugation exactly when fkf−1=k (Conjugation x↦gxg−1 is an automorphism, The conjugacy class Cl⁡G(x) and centralizer CG(x) of an element, In a group e−1=e, (g−1)−1=g and (gh)−1=h−1g−1, the order of the last product being essential).

[F7]

Free-action criterion and kernel uniqueness: if N,H≤G with G=N⋊H, 1<N, 1<H and every 1≠h∈H fixes only the identity of N under conjugation, then H is a Frobenius complement of G; and for a Frobenius group G with complement H and kernel N one has N⊴G, G=NH, N∩H={1} and N is the unique normal subgroup M with MH=G and M∩H={1} (Frobenius groups and fixed point free actions, Frobenius semidirect product decomposition, Normal subgroup: invariance under conjugation).

Verification

technique · direct
1.1

By [F2], each fa,b is a bijection F→F, so G⊆Sym⁡(F); G contains id⁡F=f1,0, is closed under composition and under inverses by the formulas of [F2] (with ac∈F× and a−1∈F×), so G is a subgroup of Sym⁡(F) by [F3]. The map F××F→G, (a,b)↦fa,b, is bijective: it is surjective by the definition of G, and if fa,b=fc,d then evaluating at 0 gives b=d and then evaluating at 1 gives a=c. Hence ∣G∣=∣F××F∣=(q−1)q by [F4]. This is assertion 1.

F2F3F4given
1.2

The maps τ:F+→K, τ(b)=f1,b, and δ:F×→H, δ(a)=fa,0, are bijections; by the composition formula [F2], f1,b∘f1,c=f1,b+c and fa,0∘fc,0=fac,0, while τ(0)=f1,0=id⁡F=δ(1) is the common identity; so τ and δ are group isomorphisms onto K and H, and K≤G, H≤G are subgroups.

F2F3F5given
1.3

For g=fa,c∈G and f1,b∈K we compute, using [F2] twice, g f1,b g−1=fa, ab+c∘fa−1, −a−1c=f1, a(−a−1c)+ab+c=f1,ab, which lies in K; since conjugation by g is a bijection G→G and K is a subgroup, Kg=K for every g∈G, that is K⊴G by [F5].

F2F5F6given
1.4

Also K∩H={id⁡F}: if f1,b=fa,0, evaluating at 0 gives b=0 and then evaluating at 1 gives 1=a, so f1,b=f1,0. Moreover G=KH: for fa,b∈G we have fa,b=fa,0∘f1,a−1b by [F2], and fa,0∈H, f1,a−1b∈K. Finally 1<∣K∣=q and 1<∣H∣=q−1, because q>2. So G=K⋊H is an internal semidirect product by [F5], which completes assertion 2.

F2F4F5given
2.1

We verify that the conjugation action of H on K∖{id⁡} is free. Let h=fa,0∈H with h≠id⁡F, so a≠1, since fa,0(1)=a while id⁡F(1)=1; and let k=f1,b∈K with k≠id⁡F, so b≠0. By step 1.3 with c=0, hkh−1=f1,ab, and ab≠b because (a−1)b≠0 by [F1]; hence hkh−1≠k, that is, h fixes no nonidentity element of K.

F1F6step 1.2step 1.3
3.1

By [F7] applied to the internal semidirect product G=K⋊H of step 1.4 and the free action of step 2.1, the subgroup H is a Frobenius complement of G; and by the uniqueness statement of [F7], applied to the normal subgroup K with KH=G and K∩H={1}, the Frobenius kernel of G with respect to H is K. This is assertion 3. ∎

F7step 1.4step 2.1

Depends on

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