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.
Distinct components commute
Statement
Distinct components of a finite group commute.
Facts & Assumptions
Given: Let and be distinct components of .
A component is a subnormal quasisimple subgroup. Quasisimple means perfect with simple central quotient. (Quasisimple groups, components, and the layer)
In a quasisimple group every proper normal subgroup is central. A perfect group's central conjugation action is trivial. (Quasisimple normal intersections and perfect central actions)
If is quasisimple and is subnormal in , then or . (A normal quasisimple subgroup and a subnormal subgroup)
Subnormality is witnessed by a finite chain of normal inclusions. (Subnormal and normal series, factors, refinements, and equivalence)
Proof
We prove two assertions simultaneously for each finite group : (A) if is a component and , then either or ; (B) distinct components commute. Assume both assertions have been proved for every group of order smaller than . Each induction call below takes place in a proper normal subgroup , so its order is strictly smaller. A subnormal chain for a component in remains a valid chain there, and conjugation by an element of preserves the chain inside because .
First prove (A). If there is nothing to show. Suppose . If , then is a proper normal subgroup of , so F2 gives . Since both and are normal in , their commutator lies in . The central-action clause of F2, applied to the perfect group , gives .
Suppose instead that is not normal in . A subnormal chain from to then has a proper term containing ; take its penultimate term after deleting repeated terms. Put . The subgroup is a component of and is not contained in . By the induction hypothesis (A) for , .
For , conjugation sends to another component of . Indeed keeps the conjugated subnormal chain inside . For each write , where ; the two normalities give this inclusion. By step 2.1, centralizes . The induction hypothesis (B) for says that either or centralizes . In the latter case, for every the equality would force . This would make the perfect quasisimple group abelian, hence trivial, contrary to its nontrivial simple central quotient. Thus for every .
It follows that normalizes and . This is a proper normal subgroup of , so F2 puts it in . The perfect central-action clause of F2 now yields . This proves (A) for without invoking (B) for itself.
Now prove (B), after assertion (A) has been established for this . If , apply F3 to and the subnormal subgroup . It gives unless . In that exceptional case ; because , F2 gives . But is nontrivial and perfect, so it cannot be abelian or lie in a center. The exceptional case is impossible.
If is not normal in , take a proper normal subgroup containing from its subnormal chain. Apply assertion (A), already proved for this same in steps 1.2–4.1, to and . If , it centralizes and hence . If , both and are distinct components of the smaller group , so the induction hypothesis (B) for gives . Thus (B) holds for in every case, completing the strong induction and the stated result.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- Stephen D. Smith, CFSG—A User’s Manual (standard reference, not scraped)