Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not suppliedSession-authored (Fable 5 assisted)‡ sources checked 2026-08-27‡ not proved here
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.

‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

CFSG enters later refinements of the O'Nan-Scott reduction

The O'Nan-Scott theorem classifies finite primitive permutation groups by the structure of their socles and actions. Later refinements, especially the detailed analysis of the almost simple and related families, bring in the classification of finite simple groups.

This page records that boundary but does not prove it here. The local argument stops at the structural reduction given by The O'Nan-Scott classification of finite primitive groups.

Depends on

Used by

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