Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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 K and L be distinct components of G.

[F1]

A component is a subnormal quasisimple subgroup. Quasisimple means perfect with simple central quotient. (Quasisimple groups, components, and the layer)

[F2]

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)

[F3]

If Q⊴G is quasisimple and S is subnormal in G, then Q≤S or [Q,S]=1. (A normal quasisimple subgroup and a subnormal subgroup)

[F4]

Subnormality is witnessed by a finite chain of normal inclusions. (Subnormal and normal series, factors, refinements, and equivalence)

Proof

technique · simultaneous strong induction on $|G|$
1.1F1F4induction

We prove two assertions simultaneously for each finite group G: (A) if Q is a component and N⊴G, then either Q≤N or [Q,N]=1; (B) distinct components commute. Assume both assertions have been proved for every group of order smaller than ∣G∣. Each induction call below takes place in a proper normal subgroup H<G, so its order is strictly smaller. A subnormal chain for a component in H remains a valid chain there, and conjugation by an element of G preserves the chain inside H because H⊴G.

1.2F1F2given

First prove (A). If Q≤N there is nothing to show. Suppose Q≰N. If Q⊴G, then Q∩N is a proper normal subgroup of Q, so F2 gives Q∩N≤Z(Q). Since both Q and N are normal in G, their commutator lies in Q∩N. The central-action clause of F2, applied to the perfect group Q, gives [Q,N]=1.

2.1F1F4step 1.1induction

Suppose instead that Q is not normal in G. A subnormal chain from Q to G then has a proper term H⊴G containing Q; take its penultimate term after deleting repeated terms. Put M=N∩H⊴H. The subgroup Q is a component of H and is not contained in M. By the induction hypothesis (A) for H, [Q,M]=1.

3.1F1step 1.1step 2.1inductionalgebra

For n∈N, conjugation sends Q to another component Qn=nQn−1 of H. Indeed H⊴G keeps the conjugated subnormal chain inside H. For each q∈Q write nqn−1=cqq, where cq=nqn−1q−1∈N∩H=M; the two normalities give this inclusion. By step 2.1, cq centralizes Q. The induction hypothesis (B) for H says that either Qn=Q or Qn centralizes Q. In the latter case, for every q,x∈Q the equality [cqq,x]=[q,x] would force [q,x]=1. This would make the perfect quasisimple group Q abelian, hence trivial, contrary to its nontrivial simple central quotient. Thus Qn=Q for every n∈N.

4.1F2step 3.1

It follows that N normalizes Q and [N,Q]≤N∩Q. This is a proper normal subgroup of Q, so F2 puts it in Z(Q). The perfect central-action clause of F2 now yields [N,Q]=1. This proves (A) for G without invoking (B) for G itself.

5.1F1F2F3step 4.1

Now prove (B), after assertion (A) has been established for this G. If K⊴G, apply F3 to K and the subnormal subgroup L. It gives [K,L]=1 unless K≤L. In that exceptional case K⊴L; because K≠L, F2 gives K≤Z(L). But K is nontrivial and perfect, so it cannot be abelian or lie in a center. The exceptional case is impossible.

6.1F1F4step 1.1step 4.1induction∎

If K is not normal in G, take a proper normal subgroup H⊴G containing K from its subnormal chain. Apply assertion (A), already proved for this same G in steps 1.2–4.1, to L and H. If L≰H, it centralizes H and hence K. If L≤H, both K and L are distinct components of the smaller group H, so the induction hypothesis (B) for H gives [K,L]=1. Thus (B) holds for G 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