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.
is a proper nontrivial normal subgroup of
Example
In , set Then is a proper nontrivial normal subgroup.
Facts & Assumptions
Given: The displayed subset .
is the kernel of sign (The alternating group of even permutations), and when fixed points are included as -cycles (A -cycle has sign , and when fixed points are counted as cycles).
Conjugation relabels every cycle entry (Conjugating a cycle relabels each entry: ).
A subgroup is normal when it is invariant under conjugation (Normal subgroup: invariance under conjugation).
Verification
Every displayed double transposition has two cycles and hence sign by [F1]. The product of two distinct nonidentity displayed elements is the third, and each is its own inverse; hence is a subgroup of .
By [F2], conjugation by any permutation relabels a double transposition to another double transposition. Thus is invariant under -conjugation, and [F3] makes it normal.
Its order is , strictly between and from [F4], so it is nontrivial and proper.
Depends on
- Conjugating a cycle relabels each entry: $g(a_1\,\ldots\,a_k)g^{-1}=(g(a_1)\,\ldots\,g(a_k))$
- Normal subgroup: invariance under conjugation
- The alternating group $A_n=\ker(\operatorname{sgn})$ of even permutations
- A $k$-cycle has sign $(-1)^{k-1}$, and $\operatorname{sgn}(\sigma)=(-1)^{n-c(\sigma)}$ when fixed points are counted as cycles
- $A_n$ is normal in $S_n$; for $n\ge2$, $2\,|A_n|=n!$, while $A_n=S_n$ for $n=0,1$
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: 63 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
- T. Judson, Abstract Algebra: Theory and Applications, Simplicity of $A_n$ (standard reference, not scraped)