Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17
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 subgroup containing the normalizer of a Sylow subgroup is self-normalizing

Statement

Let P be a Sylow p-subgroup of a finite group G. If NG(P)≤H≤G, then NG(H)=H. In particular, NG(NG(P))=NG(P). See Sylow II: in a finite group every p-subgroup lies in a conjugate of any Sylow p-subgroup, and the Sylow p-subgroups form a single conjugacy class.

Facts & Assumptions

Given: The hypotheses and objects in the Statement.

[L1]

Let G be finite, let P be a Sylow p-subgroup, and let H≤G be a p-subgroup. There is g∈G with H≤gPg−1. In particular, for every Sylow p-subgroup Q there is g∈G with Q=gPg−1, so the Sylow p-subgroups form one conjugacy class. (Sylow II: in a finite group every p-subgroup lies in a conjugate of any Sylow p-subgroup, and the Sylow p-subgroups form a single conjugacy class).

[L2]

Let H≤G be a subgroup (def-subgroup). The normalizer of H in G is NG(H):={g∈G:gHg−1=H}. Thus g∈NG(H) exactly when the conjugation automorphism cg preserves H setwise (thm-conjugation-is-an-automorphism). The subgroup property is proved in lem-centralizers-and-normalizers-are-subgroups. (The normalizer NG(H)={g∈G:gHg−1=H} of a subgroup).

Proof

technique · direct
1.1L1L2givenalgebra

For NG(P)≤H≤G and x∈NG(H), the groups P and xPx−1 are Sylow in H.

2.1step 1.1givenalgebra

Conjugate them inside H; the resulting element puts x in H.

3.1step 2.1givenalgebra∎

Specialize to H=NG(P) to obtain NG(NG(P))=NG(P). This proves the stated claim.

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.

Sources