Alphabeta Math
CorollaryStatement: 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 automizer criterion for p nilpotence

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). Then the following are equivalent.

(i) G has a normal p-complement (Normal p complement and p nilpotent group). (ii) For every subgroup Q with 1≠Q≤P, the automizer NG(Q)/CG(Q) is a p-group (The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup, The centralizer CG(H) of a subgroup, The quotient group G/N and coset product (gN)(hN)=ghN, A finite p-group has order pn for a prime p and some n∈N).

Facts & Assumptions

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

[F1]

(ii) implies (i): if the automizer condition (ii) holds, then by P automizer condition implies fusion control the Sylow P controls fusion in P with respect to G, and then by Frobenius normal p complement theorem G has a normal p-complement (Control of fusion in a sylow p subgroup).

[F2]

(i) implies (ii): suppose G has a normal p-complement K, let Q be a subgroup with 1≠Q≤P, and put N:=NG(Q), C:=CG(Q) and K0:=K∩N. Then K⊴G with p∤∣K∣ and [G:K] a power of p, K∩P={1}, K0⊴N, Q⊴N and Q≤N (Normal p complement and p nilpotent group, The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup, Normal subgroup: invariance under conjugation, Subgroup, Sylow p-subgroups of a finite group).

[F3]

Commutator inclusions used in step 1.2: if A⊴N and B≤N, then [A,B]≤A, since for a∈A, b∈B one has bab−1∈A and hence [a,b]=a(bab−1)−1∈A; and if B⊴N then [A,B]≤B likewise, since aba−1∈B; here [A,B]=⟨[a,b]:a∈A,b∈B⟩ with [a,b]=aba−1b−1 (Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G], Subgroup commutators and the lower central series, Normal subgroup: invariance under conjugation, In a group e−1=e, (g−1)−1=g and (gh)−1=h−1g−1, the order of the last product being essential, The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F5]

If P={1} then ∣P∣=1=p0 is the exact power of p dividing ∣G∣, so p∤∣G∣ and G itself is a normal p-complement of G; the condition (ii) is then vacuous (Sylow p-subgroups of a finite group, A finite p-group has order pn for a prime p and some n∈N, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, Normal p complement and p nilpotent group).

Proof

technique · direct
1.1

(ii) implies (i): this is [F1].

F1
1.2

(i) implies (ii). Assume that G has a normal p-complement K, retain the notation N=NG(Q), C=CG(Q), K0=K∩N of [F2] for a subgroup Q with 1≠Q≤P, and note K0⊴N with K0≤N and Q⊴N. By [F3] applied inside N to the normal subgroup K0 and the subgroup Q, we get [K0,Q]≤K0; applying it to the normal subgroup Q and the subgroup K0 gives [K0,Q]≤Q. Hence [K0,Q]≤K0∩Q≤K∩P={1}, so every generator of [K0,Q] is trivial and [K0,Q]={1}; that is, every element of K0 commutes with every element of Q, so K0≤C=CG(Q).

F2F3
2.1

Consequently K0≤C≤N with K0 and C normal in N: C⊴N because Q⊴N and by The centralizer of a normal subgroup is normal. By [F4] the quotient N/C is isomorphic to (N/K0)/(C/K0), a quotient of N/K0, and N/K0 is isomorphic to a subgroup of G/K.

F2F4step 1.2
3.1

Now G/K is a p-group by [F2], so its subgroup N/K0 is a p-group, and the quotient N/C of that p-group is a p-group by [F4]. As Q with 1≠Q≤P was arbitrary, (ii) holds.

F2F4step 2.1
4.1

If P={1} then both conditions hold by [F5]. Otherwise step 1.1 gives (ii)⇒(i) and step 3.1 gives (i)⇒(ii), so the two conditions are equivalent. ∎

F5step 1.1step 3.1

Depends on

Used by

Dependency tree · two levels

91 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