ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-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.

The socle of a finite solvable primitive group is elementary abelian and regular

Example

If $G \leq Sym (Ω)$ is finite, solvable, faithful, primitive, and of degree at least $2$ , then its socle is the unique regular elementary abelian minimal normal subgroup.

Facts & Assumptions

Given: A finite solvable faithful primitive permutation group $G \leq Sym (Ω)$ of degree at least $2$ .

[A1]

In a finite solvable primitive group of degree at least $2$ , a minimal normal subgroup is elementary abelian and regular.

[A2]

In a finite solvable primitive group of degree at least $2$ , that minimal normal subgroup is unique.

Verification

technique · direct

1.1givenA1

Let $N$ be a minimal normal subgroup of $G$ . The primitive-solvable fact [A1] shows that $N$ is elementary abelian and regular.

2.1A2step 1.1

The uniqueness statement [A2] says that this minimal normal subgroup is the only one.

3.1step 1.1step 2.1∎

The socle is generated by the minimal normal subgroups, so with uniqueness from step 2.1 it equals $N$ . Therefore the socle of $G$ is the unique regular elementary abelian minimal normal subgroup.

Depends on

A unique abelian minimal normal subgroup gives affine type

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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

J. S. Milne, Group Theory, Exercise 6.31 (standard reference, not scraped)