Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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.

Frobenius normal p complement theorem

Statement

Let G be a finite group, p a prime and P∈Syl⁡p(G) a Sylow p-subgroup (Sylow p-subgroups of a finite group). The following are equivalent.

(a) G has a normal p-complement (Normal p complement and p nilpotent group); (b) every nontrivial p-local normalizer NG(Q) with 1≠Q≤P has a normal p-complement (P local normalizer for normal complement theory); (c) P controls fusion in P with respect to G (Control of fusion in a sylow p subgroup).

Facts & Assumptions

Given: A finite group G, a prime p and a Sylow p-subgroup P≤G.

[F1]

(a) implies (b): if G has a normal p-complement, then NG(Q) has a normal p-complement for every nontrivial p-subgroup Q≤G (Normal p complements pass to subgroups and p local normalizers, P local normalizer for normal complement theory).

[F2]

(b) implies (c): if every nontrivial p-local normalizer NG(Q), 1≠Q≤P, has a normal p-complement, then P controls fusion in P with respect to G (Local normal p complements force control of fusion, Control of fusion in a sylow p subgroup).

[F3]

(c) implies (a): if P controls fusion in P with respect to G, then P∩Op(G)={1} (Fusion control forces trivial Sylow intersection with the p residual, P residual of a finite group).

[F5]

If K⊴G then PK is a subgroup of G with [G:K]=[PK:K]⋅[G:PK] in the sense that ∣G∣=∣PK∣⋅[G:PK], and PK/K≅P/(P∩K); in particular, if PK=G and P∩K={1}, then ∣G∣=∣P∣ ∣K∣ and [G:K]=∣P∣ (Second isomorphism theorem for groups: H/(H∩N)≅HN/N, First isomorphism theorem for groups: G/ker⁡f≅im⁡f, If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H, If [G:N] is finite then ∣G/N∣=[G:N]; for finite G this equals ∣G∣/∣N∣, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, Normal subgroup: invariance under conjugation, Subgroup).

[F6]

Order facts: ∣P∣ is the exact power of p dividing ∣G∣, all Sylow p-subgroups of G have this order, and 1=p0; if S≤G then ∣S∣ divides ∣G∣ (Sylow p-subgroups of a finite group, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, A finite p-group has order pn for a prime p and some n∈N).

Proof

technique · direct
1.1

(a) implies (b): this is [F1].

F1
1.2

(b) implies (c): this is [F2].

F2
1.3

(c) implies (a). Assume (c). If P={1}, then ∣P∣=1=p0 is the exact power of p dividing ∣G∣ by [F6], so p∤∣G∣; then K:=G is normal in G, p∤∣K∣ and [G:K]=1=p0 is a power of p, so G has a normal p-complement.

F6given
2.1

It remains to treat the case P≠{1} under assumption (c). By [F3] we have P∩K={1} for K:=Op(G), and by [F4] K⊴G and G=PK.

F3F4step 1.3
3.1

By [F5] applied to the normal subgroup K and the subgroup P, the equality G=PK together with P∩K={1} gives ∣G∣=∣P∣ ∣K∣ and [G:K]=∣P∣.

F5step 2.1
4.1

Hence ∣K∣=∣G∣/∣P∣ is prime to p, because ∣P∣ is the exact power of p dividing ∣G∣ by [F6]; and [G:K]=∣P∣ is a power of p. Since K⊴G, the subgroup K is a normal p-complement of G.

F4F6step 2.1step 3.1
5.1

We have proved (a)⇒(b) in step 1.1, (b)⇒(c) in step 1.2, and (c)⇒(a) in steps 1.3 and 4.1; hence the three conditions are equivalent. ∎

step 1.1step 1.2step 1.3step 4.1

Depends on

Used by

Dependency tree · two levels

85 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