Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04
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.

Schur-Zassenhaus existence theorem

Statement

Let NG be a normal Hall subgroup of a finite group G. Then N has a complement in G.

Facts & Assumptions

Given: A finite group G and a normal Hall subgroup NG.

[L1]

A normal Hall subgroup gives an extension 1NGG/N1 with gcd(N,G/N)=1 (A normal Hall subgroup presents the ambient group as an extension of coprime orders).

[L3]

Cauchy's theorem produces an element of order p whenever a prime p divides the order of a finite group (Cauchy's theorem: if a prime p divides G, then G has an element of order p).

[L6]

A characteristic subgroup of a normal subgroup is normal in the ambient group (If K is characteristic in N and N is normal in G, then K is normal in G).

[L7]

Conjugation by a group element is an automorphism (Conjugation xgxg1 is an automorphism).

Proof

Proof technique: induction on G, followed in the minimal case by coprime cocycle averaging.

1.1

We argue by induction on G. If N=1, then G is a complement to N. If N=G, then G/N=1, so the trivial subgroup is a complement. Assume from now on that 1<N<G and that the statement holds for all smaller finite groups.

givenL1inductionbase
2.1

Suppose M is a normal subgroup of G with 1<M<N. Then N/M is a normal Hall subgroup of G/M, so the induction hypothesis gives a subgroup K/MG/M complementary to N/M. Thus K<G, G=NK, and NK=M. Inside the proper group K, the subgroup M is normal Hall because K/M=G/N is coprime to M. The induction hypothesis applied to K gives a complement H to M in K, so K=MH. Since HK, we have HN=H(NK)=HM=1, while NH=N(MH)=NK=G. Thus H complements N in G. For the remainder we may therefore assume that N contains no nontrivial proper subgroup normal in G.

L1step 1.1inductionihalgebra
3.1

Choose a prime p dividing N and let P be a Sylow p-subgroup of N, whose existence is supplied by [L4]; in particular P1. Because NG, every G-conjugate of P is again a Sylow p-subgroup of N. Hence [L4] gives, for each gG, an nN with gPg1=nPn1. Thus n1gNG(P) and G=NNG(P). If P<N and NG(P)=G, then P is a nontrivial proper normal subgroup of G contained in N, contrary to step 2.1. Thus P<N forces R:=NG(P)<G. Put A=RN. The subgroup A is normal in R, and G=NR gives R/AG/N; hence A is a normal Hall subgroup of R. Induction gives a complement H to A in R, so R=AH. Consequently G=NR=NH and NH=AH=1, proving the theorem when P<N. The only remaining case is P=N, so N is a p-group.

L4step 2.1inductionihalgebra
4.1

By [L5], the finite p-group N has nontrivial center. The center is characteristic in N, so [L6] makes it normal in G; step 2.1 therefore forces Z(N)=N, and N is abelian. Now Ω1(N)={xN:xp=1} is a subgroup, is nontrivial by [L3], and is characteristic because automorphisms preserve pth powers. Hence [L6] makes it normal in G, and step 2.1 again forces Ω1(N)=N. Therefore every nonidentity element of N has order p, so N is elementary abelian.

L3L5L6step 2.1step 3.1algebra
5.1

Write Q=G/N, choose a set-theoretic section s:QG with s(1)=1, and write the abelian group N additively. Because N is abelian, the formula qn=s(q)ns(q)1 does not depend on the chosen lift of q, and [L7] makes it an action of Q on N by automorphisms. Define f:Q×QN by s(q)s(r)=f(q,r)s(qr). This is well defined because π(s(q)s(r))=qr, so s(q)s(r)s(qr)1N.

L7step 4.1choosealgebra
6.1

Associativity gives f(q,r)+f(qr,t)=qf(r,t)+f(q,rt) for all q,r,tQ. Let m=Q, choose an integer b with bm1(modp), define σ(q)=xQf(q,x) and c(q)=bσ(q), and sum the cocycle identity over xQ. Since xrx is a permutation of Q, this yields mf(q,r)+σ(qr)=qσ(r)+σ(q). Because every element of the elementary abelian p-group N has order dividing p, multiplication by bm is the identity on N. Hence f(q,r)=c(q)+qc(r)c(qr).

step 4.1step 5.1choosealgebra
7.1

Define s:QG by s(q)=c(q)+s(q), meaning s(q)=i(c(q))s(q) inside the extension. Since i(c(q))N, we have π(s(q))=q. Using the formula from step 6.1, s(q)s(r)=(c(q)qc(r)+f(q,r))s(qr)=c(qr)s(qr)=s(qr). So s is a homomorphic section of GQ. By [L2], the extension splits, equivalently N has a complement in G. This completes the induction.

L2step 6.1step 5.1constructdischarge-induction

Depends on

Used by

Dependency tree · two levels

41 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