Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generatedPipeline-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.

A normal quasisimple subgroup and a subnormal subgroup

Statement

Let Q⊴G be quasisimple and let S be a subnormal subgroup of G. Then either Q≤S or [Q,S]=1.

Facts & Assumptions

Given: Q,S,G as in the statement.

[F1]

A subnormal subgroup has a finite chain S=S0⊴S1⊴⋯⊴Sd=G. (Subnormal and normal series, factors, refinements, and equivalence)

[F2]

If a normal subgroup of a quasisimple group is proper, it lies in the center. A perfect group is centralized by a subgroup whose conjugation commutators all lie in that center. (Quasisimple normal intersections and perfect central actions)

Proof

1.1

Choose a subnormal chain from F1. If Q≤S0=S, the first alternative holds. Otherwise, because Q≤Sd=G, there is an index j<d such that Q≤Sj+1 but Q≰Sj. We only select an index from the given finite chain.

F1given
2.1

Both Q and Sj are normal in Sj+1, since Q⊴G and Sj⊴Sj+1. Thus Q∩Sj is a proper normal subgroup of Q, and F2 puts it in Z(Q). For q∈Q and s∈Sj, their commutator lies in both Q and Sj, hence in Z(Q). Since Sj normalizes the perfect group Q, the second clause of F2 gives [Q,Sj]=1. As S≤Sj, it follows that [Q,S]=1. No finiteness of G beyond the finite subnormal chain is needed.

F2step 1.1algebra∎

Depends on

Used by

Dependency tree · two levels

8 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.