Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 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.

Sylow III*: np(G)=[G:NG(P)]

Statement

If P is a Sylow p-subgroup of a finite group G, then np(G)=[G: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]

For a finite group G and a prime p, let Syl⁡p(G) be the set of Sylow p-subgroups (def-sylow-p-subgroup). Define np(G):=∣Syl⁡p(G)∣. This cardinal is defined even before existence is proved because Syl⁡p(G) is a subset of the finite power set of G; thm-sylow-first-theorem later shows it is nonzero. (The number np(G) of Sylow p-subgroups).

[L3]

Let H≤G. The rule G/NG(H)⟶{gHg−1:g∈G},gNG(H)⟼gHg−1, is a well-defined bijection. If G is finite, the number of distinct conjugates of H is [G:NG(H)]. (The conjugates of H are in bijection with G/NG(H) and, for finite G, number [G:NG(H)]).

Proof

technique · direct
1.1L1L2L3givenalgebra

Conjugation is transitive on the Sylow p-subgroups by Sylow II, and the stabilizer of P is exactly NG(P).

2.1step 1.1L2L3givenalgebra∎

By step 1.1 the set of Sylow p-subgroups is exactly the conjugacy class of P, so [L3] counts it as [G:NG(P)], and [L2] identifies that count with np(G). If P is the unique Sylow p-subgroup, then NG(P)=G and both sides are 1; if p∤∣G∣, then P={1}, again with NG(P)=G and both sides 1. This proves the stated claim.

Depends on

Used by

Dependency tree · two levels

12 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