Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Sylow subgroups of a normal subgroup are intersections with Sylow subgroups

Statement

Let G be a finite group, p a prime, K⊴G a normal subgroup and P∈Syl⁡p(G) a Sylow p-subgroup (Sylow p-subgroups of a finite group). Then K∩P is a Sylow p-subgroup of K. If in addition [G:K] is a power of p, then KP=G.

Facts & Assumptions

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

[F1]

Write ∣G∣=pam and ∣K∣=pcmK with p∤m, p∤mK; the p-adic valuations give c≤a, and P has order pa while a Sylow p-subgroup of K has order pc (Sylow p-subgroups of a finite group, The p-adic valuation vp(a) of a nonzero integer: the greatest k∈N with pk∣a, Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F2]

If S≤G is a p-subgroup, then S≤Q for some Sylow p-subgroup Q of G; any two Sylow p-subgroups of G are conjugate, Q=gPg−1 for some g∈G; and G has a Sylow p-subgroup (Sylow I: every finite group has a Sylow p-subgroup, 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).

[F3]

K is normal: gKg−1=K for every g∈G, and conjugation x↦gxg−1 is an automorphism, so ∣gSg−1∣=∣S∣ for every subgroup S (Normal subgroup: invariance under conjugation, Conjugation x↦gxg−1 is an automorphism).

[F4]

A subgroup of a finite p-group is a finite p-group, so its order is a power of p (Every subgroup of a finite p-group has order a power of p, A finite p-group has order pn for a prime p and some n∈N).

[F5]

If H≤G then ∣H∣ divides ∣G∣, and KP is a subgroup with ∣KP∣=∣K∣ ∣P∣/∣K∩P∣ (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G, If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H).

Proof

technique · direct
1.1

By [F2] applied inside the finite group K, there is a Sylow p-subgroup S of K, of order pc by [F1]; S is a p-subgroup of G, so by [F2] there is a Sylow Q of G with S≤Q, and Q=gPg−1 for some g∈G.

F1F2
1.2

On the other hand K∩P≤P, so K∩P is a finite p-group by [F4]; its order divides ∣K∣ by [F5], hence is a power of p dividing pcmK with p∤mK by [F1], and therefore ∣K∩P∣ divides pc.

F1F4F5
2.1

Then Sg−1=g−1Sg is a subgroup of K, because S≤K and K⊴G, and it has order ∣S∣=pc by [F3]; also Sg−1≤g−1Qg=P. Hence Sg−1≤K∩P, and ∣K∩P∣≥pc.

F3step 1.1
3.1

Combining steps 2.1 and 1.2, ∣K∩P∣=pc, the order of a Sylow p-subgroup of K; hence K∩P∈Syl⁡p(K), the first assertion.

F1step 2.1step 1.2
4.1

Suppose now that [G:K]=pr for some r≥0. Then ∣K∣=∣G∣/pr=pa−rm by [F1] and [F5], so the p-part of ∣K∣ is pa−r; by step 3.1, ∣K∩P∣=pa−r.

F1F5step 3.1algebra
5.1

Since KP is a subgroup of G by [F5], its order ∣K∣ ∣P∣/∣K∩P∣=pa−rm⋅pa/pa−r=pam=∣G∣ by [F5] and step 4.1; a subgroup of G with as many elements as G is G itself, so KP=G. ∎

F5step 4.1algebra

Depends on

Used by

Dependency tree · two levels

58 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