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.
The three subgroups of order in are conjugate and each is self-normalizing
Example
The subgroups
are the three subgroups of order in . They form one conjugacy orbit, and each equals its own normalizer.
Facts & Assumptions
Given: The symmetric group and .
The conjugates of are counted by (The conjugates of are in bijection with and, for finite , number ).
The normalizer consists of the elements preserving under conjugation (The normalizer of a subgroup).
The symmetric group consists of all permutations (The symmetric group : the bijections of a set under composition).
The symmetric group is a group under composition ( is a group under composition, and it is non-abelian whenever has at least three distinct elements).
The identity, the three transpositions, and the two -cycles exhaust the six elements of (The class equation of is ).
Verification
Each transposition generates a two-element subgroup, and these are distinct. Every element of order in is a transposition, so these are all the subgroups of order .
Conjugation relabels the two moved points, so the three subgroups in step 1.1 are conjugate.
By [L1], . Since by [L5], the normalizer has order ; it contains , so it equals . The same holds for each conjugate subgroup.
Depends on
- The conjugates of $H$ are in bijection with $G/N_G(H)$ and, for finite $G$, number $[G:N_G(H)]$
- The normalizer $N_G(H)=\{g\in G:gHg^{-1}=H\}$ of a subgroup
- The symmetric group $\operatorname{Sym}(X)$: the bijections of a set $X$ under composition
- $\operatorname{Sym}(X)$ is a group under composition, and it is non-abelian whenever $X$ has at least three distinct elements
- The class equation of $S_3$ is $6=1+2+3$
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: 45 results over 17 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
- P. Brosnan, Undergraduate Algebra Notes, 3.14: G-Sets, Example 3.111 (standard reference, not scraped)