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 II: in a finite group every -subgroup lies in a conjugate of any Sylow -subgroup, and the Sylow -subgroups form a single conjugacy class
Statement
Let be finite, let be a Sylow -subgroup, and let be a -subgroup. There is with . In particular, for every Sylow -subgroup there is with , so the Sylow -subgroups form one conjugacy class. See Sylow I: every finite group has a Sylow -subgroup.
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let be finite, let be prime, and write with . Then has a subgroup of order , hence a Sylow -subgroup (def-sylow-p-subgroup). (Sylow I: every finite group has a Sylow -subgroup).
If a finite -group acts on a finite set , then . (If a finite -group acts on a finite set , then ).
For a finite group and a prime , let be the set of Sylow -subgroups (def-sylow-p-subgroup). Define This cardinal is defined even before existence is proved because is a subset of the finite power set of ; thm-sylow-first-theorem later shows it is nonzero. (The number of Sylow -subgroups).
Let be a subgroup (def-subgroup). The normalizer of in is Thus exactly when the conjugation automorphism preserves setwise (thm-conjugation-is-an-automorphism). The subgroup property is proved in lem-centralizers-and-normalizers-are-subgroups. (The normalizer of a subgroup).
Let be a finite group and . Then Consequently, under the canonical embedding , divides . (Lagrange's theorem: for every subgroup of a finite group ).
Proof
Let a finite -subgroup act by left multiplication on .
Its cardinality is prime to , so the fixed-point congruence gives a fixed coset , and the fixed-coset condition is exactly .
Taking Sylow, Lagrange's theorem turns containment into equality; applying this to any Sylow -subgroup gives .
If , then and step 2.1 returns any coset, with for every . If , then , so is the Sylow -subgroup and the only -subgroup of is itself, which is already equal to it. This proves the stated claim.
Depends on
- Sylow I: every finite group has a Sylow $p$-subgroup
- If a finite $p$-group $P$ acts on a finite set $X$, then $|X|\equiv|X^P|\pmod p$
- The number $n_p(G)$ of Sylow $p$-subgroups
- The normalizer $N_G(H)=\{g\in G:gHg^{-1}=H\}$ of a subgroup
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
Used by
- A Sylow p-subgroup is normal if and only if it is unique Corollary
- False statement: all subgroups of the same p-power order are conjugate False statement
- A subgroup containing the normalizer of a Sylow subgroup is self-normalizing Theorem
- Frattini argument: if N is normal in G and P is Sylow in N, then G=N N_G(P) Theorem
- Nilpotence lifts over the Frattini subgroup of a finite group Theorem
- Sylow III: nₚ≡1 pmod p and nₚ∣ m when |G|=pᵃ m with p∤ m Theorem
- Sylow III*: nₚ(G)=[G:N_G(P)] Theorem
- The Fitting subgroup is nilpotent and is the largest normal nilpotent subgroup of a finite group Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 82 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Keith Conrad, Consequences of the Sylow Theorems, Sections 1-5 (standard reference, not scraped)