Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-09-09 (gpt-6-astra)
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, almost simple, diagonal, product action, and twisted wreath types

Definition

For a finite primitive permutation group G≤Sym⁡(Ω), the five coarse O'Nan-Scott types used on this page are:

  • Affine type: the socle is the unique minimal normal subgroup, it is abelian and regular, and A unique abelian minimal normal subgroup gives affine type identifies it with a finite vector space.
  • Almost simple type: the socle is a nonabelian simple group and the whole group lies between that socle and its full automorphism group in the sense of Almost simple finite groups.
  • Diagonal type: the socle is a direct product Tk, with k≥2, of isomorphic nonabelian simple groups, and the action is the standard diagonal action on a coset space of a diagonal subgroup.
  • Product action type: after identifying Ω with Δℓ for some ℓ≥2, there is a primitive group H on Δ of almost simple or diagonal type, with N=Soc⁡(H), such that Nℓ=Soc⁡(G)≤G≤H≀K, where K≤Sℓ is the transitive group induced by G on the coordinates and the wreath product has its product action. If (h1,…,hℓ;k)∈Hℓ⋊K, its product action is (δ1,…,δℓ)⟼(δk−1(1)hk−1(1),…,δk−1(ℓ)hk−1(ℓ)).
  • Twisted wreath type: G is permutation equivalent to the following group on B, and this action is primitive. Take a finite nonabelian simple group T, a faithful transitive permutation group P≤Sk, k≥2, its point stabilizer Q=P1, and a homomorphism φ:Q→Aut⁡(T) whose image contains Inn⁡(T). With automorphisms composed as left operators, set B={f:P→T:f(xq)=φ(q)−1(f(x)) for every x∈P,q∈Q}. Multiplication in B is pointwise. Define αp(f)(x)=f(p−1x). The twisted wreath product is B⋊αP, with the convention of The external semidirect product N⋊αH, acting on B by (b,p)⋅c=bαp(c). Its socle is the unique minimal normal subgroup B≅Tk, acting regularly; its degree is ∣T∣k. Primitivity is a required condition on these data, not a consequence of transitivity of P alone.

The function construction is well defined: specifying values on one representative of each of the k cosets xQ determines a unique function, because φ(q1q2)−1=φ(q2)−1φ(q1)−1. Evaluation there identifies the pointwise group with Tk. The maps αp preserve its defining condition and satisfy αpαr=αpr, so The semidirect-product multiplication makes N×H a group applies and the displayed permutation formula respects multiplication. These are finite choices.

For the socle assertion, the normal subgroups of Tk are products of its factors: commutating an element of a normal subgroup with one factor isolates that coordinate, and simplicity and the trivial centre of T then give the entire factor whenever its projection is nontrivial. The transitive action of P on the factors makes B minimal normal. If an element (b,p) centralizes B, then αp is an inner automorphism of B and hence fixes every factor. Faithfulness of P forces p=1, and then b is central in B, so b=1. Any distinct minimal normal subgroup would centralize B (their commutator lies in their trivial intersection). Therefore no such subgroup exists.

These conventions implement LPS Section 1, type III(c), using left actions. Defining these types does not prove that every finite primitive group belongs to one of them, nor that a proof of that classification avoids CFSG.

Depends on

Used by

Dependency tree · two levels

20 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