Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 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 conjugacy when the kernel or quotient is solvable

Statement

Let N⊴G be a normal Hall subgroup of a finite group G, and let H,K≤G be complements to N. If either N or G/N is solvable, then H and K are conjugate in G.

Facts & Assumptions

Given: A finite group G, a normal Hall subgroup N⊴G, and complements H,K≤G to N.

[L1]

A normal Hall subgroup has a complement (Schur-Zassenhaus existence theorem).

[L2]

Solvability passes to quotients and subgroups (Subgroups and quotients of solvable groups are solvable).

[L3]

A nontrivial normal subgroup of a solvable group contains a nontrivial abelian subgroup normal in the whole group (A nontrivial normal subgroup of a solvable group contains a nontrivial abelian subgroup normal in the whole group).

[L5]

Cauchy's theorem produces an element of order p when 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).

Proof

technique · direct
1.1givenL1

We argue by induction on ∣G∣. The claim is trivial when N=1 or N=G. Assume from now on that 1<N<G and that the statement holds for all smaller finite groups satisfying the same solvability hypothesis.

1.2constructchoosealgebra

First consider the special case in which A⊴X is an abelian normal Hall subgroup of a finite group X, and U,V are complements to A. Write A additively. Since U is a complement, every element of X has a unique form au with a∈A and u∈U. For each u∈U, let λ(u)∈A be determined by the unique element λ(u)u∈V. Then λ(uv)=λ(u)+u⋅λ(v) because V is a subgroup. Let m=∣U∣, choose b with bm≡1(mod∣A∣), and put σ=∑u∈Uλ(u) and a=−bσ. Summing λ(ux)=λ(u)+u⋅λ(x) over x∈U gives σ=mλ(u)+u⋅σ, hence λ(u)=u⋅a−a. Therefore every element of V has the form (u⋅a−a)u=a−1ua, so V=a−1Ua. Thus complements to an abelian normal Hall subgroup are conjugate by that subgroup.

2.1L2L3step 1.2step 1.1induction

Suppose N is solvable. By [L3], choose a nontrivial abelian normal subgroup A≤N that is normal in G. In G/A, the subgroup N/A is normal Hall and the images HA/A and KA/A are complements. The induction hypothesis applies because N/A is solvable by [L2]. After conjugating K, we may assume HA=KA=:M. Inside M, the subgroup A is abelian normal Hall and H,K are complements to A, so step 1.2 makes them conjugate in M, hence in G.

2.2L2L6givenstep 1.1

Now suppose instead that G/N is solvable. Since H≅G/N, the group H is solvable by [L2]. If ∣H∣ is prime, then both H and K are Sylow subgroups of that prime order, so [L6] makes them conjugate.

2.3L3L4L5step 1.1induction

Assume ∣H∣ is not prime, and write Q=G/N. Choose a nontrivial proper abelian normal subgroup A‾⊴Q: if Q is nonabelian, apply [L3] to the solvable group Q and its normal subgroup Q; if Q is abelian of composite order, [L5] gives an element of prime order and [L4] makes the subgroup it generates a proper normal subgroup. Let M be the preimage of A‾ under the quotient map G→Q. Then M⊴G, M<G, and M/N≅A‾ is solvable. Since H and K are complements to N in G, the subgroups H∩M and K∩M are complements to N in M. The induction hypothesis applied to M therefore lets us conjugate K by an element of M so that H∩M=K∩M=:A. In particular, A is abelian and normal in both H and K.

3.1L2step 2.3step 1.1induction

Both H and K normalize A, so H,K≤NG(A). If NG(A)<G, then every element of NG(A) has the form nh with n∈N and h∈H, and because h∈NG(A) the condition nh∈NG(A) forces n=(nh)h−1∈N∩NG(A). Hence NG(A)=(N∩NG(A))H=(N∩NG(A))K. Thus N∩NG(A) is a normal Hall subgroup of the proper group NG(A), and the quotient by it is isomorphic to the solvable group H. The induction hypothesis on NG(A) makes H and K conjugate there.

3.2L2step 2.3step 1.1induction

If instead NG(A)=G, then A⊴G. In G/A, the normal Hall subgroup is NA/A, and the images H/A and K/A are complements. The quotient (G/A)/(NA/A)≅G/NA≅Q/A‾ is solvable and smaller than Q because A‾ is nontrivial. Therefore the induction hypothesis on G/A lets us conjugate K so that H/A=K/A. Since A≤H and also A≤K with A⊴G, this equality of quotient subgroups means H=K. Thus the final conjugacy is proved in this case as well.

4.1step 2.1step 2.2step 3.1step 3.2∎

Steps 2.1 and 2.2-3.2 cover the two solvability hypotheses. Therefore complements to N are conjugate in G whenever the kernel or quotient is solvable.

Depends on

Used by

Dependency tree · two levels

40 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