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≡1(modp) and np∣m when ∣G∣=pam with p∤m

Statement

Let ∣G∣=pam with p∤m. Then the number of Sylow p-subgroups satisfies np(G)≡1(modp),np(G)∣m. 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]

If P is a Sylow p-subgroup of a finite group G, then np(G)=[G:NG(P)].. (Sylow III*: np(G)=[G:NG(P)]).

[L3]

If a finite p-group P acts on a finite set X, then ∣X∣≡∣XP∣(modp).. (If a finite p-group P acts on a finite set X, then ∣X∣≡∣XP∣(modp)).

[L4]

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).

[L5]

Let G be finite, let p be prime, and write ∣G∣=pam with p∤m. Then G has a subgroup of order pa, hence a Sylow p-subgroup (Sylow I: every finite group has a Sylow p-subgroup).

Proof

technique · direct
1.1L4L5givenalgebra

By [L5] the set Syl⁡p(G) of [L4] is nonempty, so fix P∈Syl⁡p(G) and let it act by conjugation on that set; the action is well defined because a conjugate of a Sylow p-subgroup again has order pa.

2.1step 1.1L1L3L4givenalgebra

Suppose P fixes Q∈Syl⁡p(G), so P≤NG(Q), and also Q≤NG(Q). Both have order pa, the full power of p dividing ∣G∣ and hence dividing ∣NG(Q)∣, so both are Sylow p-subgroups of NG(Q); by [L1] applied inside NG(Q) they are conjugate there, and Q⊴NG(Q) makes every such conjugate equal to Q, so P=Q. Thus P itself is the only fixed point, and since P is a finite p-group acting on the finite set Syl⁡p(G), [L3] gives np(G)≡1(modp).

3.1step 1.1step 2.1L2givenalgebra∎

By [L2], np(G)=[G:NG(P)]. Since P≤NG(P)≤G, the index tower gives [G:P]=[G:NG(P)] [NG(P):P], and [G:P]=m because ∣P∣=pa; hence np(G) divides m. This proves the stated claim.

Depends on

Used by

Dependency tree · two levels

20 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