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 :
Example
For , the Sylow -subgroups of have order and number . Distinct ones meet trivially, and their union contains exactly nonidentity elements. See For prime , .
Facts & Assumptions
Given: The hypotheses and objects in the Example.
For every prime , . (For prime , ).
Let be a finite group, let be prime, and write with and . A subgroup is a Sylow -subgroup when . Equivalently, its order is the largest power of dividing . This is a property of a subgroup and does not presume that such a subgroup exists; existence is proved in thm-sylow-first-theorem. (Sylow -subgroups of a finite group).
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).
If is a Sylow -subgroup of a finite group , then . (Sylow III*: ).
For every prime , the operations of addition and multiplication on make it a field (def-field). (For every prime , the two operations on make it a field).
Let be a finite group and . Then Consequently, under the canonical embedding , divides . (Lagrange's theorem: for every subgroup of a finite group ).
Verification
For , the maps satisfy , so has order . Because , it is a Sylow -subgroup.
The common fixed subgroup of is , since for every exactly when . A normalizer preserves ; conversely, a coordinate automorphism preserving conjugates each to another element of .
Such an automorphism has the form with , giving choices. The normalizer-index formula therefore gives .
Two distinct order- subgroups meet trivially, so their nonidentity elements are disjoint and number . At , the normalizer has order in a group of order , giving three Sylow subgroups and three nonidentity elements. This proves the stated claim.
Depends on
- For prime $p$, $|\operatorname{Aut}((\mathbb Z/p)\times(\mathbb Z/p))|=(p^2-1)(p^2-p)$
- Sylow $p$-subgroups of a finite group
- The number $n_p(G)$ of Sylow $p$-subgroups
- Sylow III*: $n_p(G)=[G:N_G(P)]$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 103 results over 18 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)