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.
Every group of order has normal Sylow - and -subgroups and is not simple
Statement
Every group of order has normal Sylow - and -subgroups and is not simple. See Sylow III: and when with .
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let with . Then the number of Sylow -subgroups satisfies . (Sylow III: and when with ).
A Sylow -subgroup of a finite group is normal if and only if it is the unique Sylow -subgroup. (A Sylow -subgroup is normal if and only if it is unique).
If and , then is a subgroup and . Here . (If and , then is a subgroup and ).
Let . Left multiplication defines a transitive action on , and the corresponding homomorphism has (Left multiplication on is transitive, has stabiliser at , and has kernel ).
The image of a group homomorphism is a subgroup and its kernel is a normal subgroup. For every group homomorphism , one has and . (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).
First isomorphism theorem for groups: . For every homomorphism , the rule is an isomorphism from onto . (First isomorphism theorem for groups: ).
Let . If is finite, then the quotient group is finite and In particular, if is finite, then . (If is finite then ; for finite this equals ).
Let be primes. - If , every group of order is cyclic. - If , there are exactly two isomorphism classes of groups of order : the cyclic group and one nonabelian semidirect product . (Classification of groups of order for primes ).
If and is a normal Sylow -subgroup of , then . (A normal Sylow subgroup of a normal subgroup is normal in the whole group).
A group is simple if and its only normal subgroups are and , where normality is as in def-normal-subgroup. (Simple groups).
If and is finite, then ; in particular divides . (Lagrange's theorem: for every subgroup of a finite group ).
A set of cardinality has exactly bijections to itself; in particular the symmetric group on three points has order . (A finite set with has exactly bijections onto itself, and bijections onto any set of the same cardinality).
For , the core is a normal subgroup of , satisfies , and contains every normal subgroup of that is contained in . ( is the largest normal subgroup of contained in ).
Proof
The nonunique counts and would already contribute distinct nonidentity elements, so at least one of the two Sylow subgroups is normal.
Let be the normal Sylow subgroup supplied by step 1.1 and let be a Sylow subgroup for the other prime. By [L3], is a subgroup. Its multiplication map has fibres indexed by , so .
The action on the three left cosets has kernel , and by [L13]. By [L6], is isomorphic to a subgroup of the symmetric group on three points, so [L11] and [L12] give . Also [L7] and [L11] give , while gives . Hence , so and .
The order- classification [L8] makes cyclic, and its Sylow - and -subgroups are normal in and therefore normal in by [L9]. Either is a nontrivial proper normal subgroup of , so [L10] also shows that is not simple.
Depends on
- Sylow III: $n_p\equiv1\pmod p$ and $n_p\mid m$ when $|G|=p^a m$ with $p\nmid m$
- A Sylow $p$-subgroup is normal if and only if it is unique
- If $H\le G$ and $N\mathrel{\trianglelefteq}G$, then $HN$ is a subgroup and $H\cap N\mathrel{\trianglelefteq}H$
- Left multiplication on $G/H$ is transitive, has stabiliser $H$ at $H$, and has kernel $\operatorname{Core}_G(H)$
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- If $[G:N]$ is finite then $|G/N|=[G:N]$; for finite $G$ this equals $|G|/|N|$
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
- A finite set $A$ with $\lvert A\rvert = n$ has exactly $n!$ bijections onto itself, and $n!$ bijections onto any set of the same cardinality
- Classification of groups of order $pq$ for primes $p<q$
- A normal Sylow subgroup of a normal subgroup is normal in the whole group
- Simple groups
- $\operatorname{Core}_G(H)$ is the largest normal subgroup of $G$ contained in $H$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 153 results over 23 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)