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 Cauchy's theorem: if a prime divides , then has an element of order .
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let be a finite group and let be prime. If , then contains an element of order . (Cauchy's theorem: if a prime divides , then has an element of order ).
For , left multiplication gives a transitive action on and a homomorphism with (Left multiplication on is transitive, has stabiliser at , and has kernel ).
For every natural , the function is a group homomorphism. It is surjective exactly when ; for and its image is . (The sign is a homomorphism , surjective exactly when ).
A cycle of length has sign . If and is the number of cycles after every fixed point is included as a one-cycle, then . (A -cycle has sign , and when fixed points are counted as cycles).
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).
Proof
Choose an involution by Cauchy's theorem and use the left regular permutation representation.
Left multiplication by the involution is a product of fifteen transpositions, so composing with sign gives a surjection to whose normal kernel has order .
The published order- classification makes that kernel cyclic.
Its Sylow - and -subgroups are normal in the kernel and hence normal in .
Either is a nontrivial proper normal subgroup. This proves the stated claim.
Depends on
- Cauchy's theorem: if a prime $p$ divides $|G|$, then $G$ has an element of order $p$
- Left multiplication on $G/H$ is transitive, has stabiliser $H$ at $H$, and has kernel $\operatorname{Core}_G(H)$
- The sign is a homomorphism $S_n\to\{+1,-1\}$, surjective exactly when $n\ge 2$
- A $k$-cycle has sign $(-1)^{k-1}$, and $\operatorname{sgn}(\sigma)=(-1)^{n-c(\sigma)}$ when fixed points are counted as cycles
- 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|$
- 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
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 154 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)