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.
For , sign is the unique nontrivial homomorphism
Statement
For , the sign homomorphism is the unique nontrivial group homomorphism .
Facts & Assumptions
Given: A natural and a group homomorphism .
The transpositions generate , and sign is a homomorphism sending every transposition to (Every finite permutation is a product of transpositions, so the transpositions generate , The sign is a homomorphism , surjective exactly when ).
Proof
Any two transpositions are conjugate in : for their two-point supports, the identity handles equality, a transposition handles one common point, and the product of two disjoint transpositions handles disjoint supports, producing a permutation with .
Since is abelian, ; hence takes one common value on every transposition.
By [L1], if the common value is then is trivial. If it is , a product of transpositions has image , which is also its image under sign because sign sends every transposition to . Thus , and sign is the unique nontrivial homomorphism.
Depends on
- Every finite permutation is a product of transpositions, so the transpositions generate $S_n$
- The sign is a homomorphism $S_n\to\{+1,-1\}$, surjective exactly when $n\ge 2$
- A group homomorphism automatically satisfies $f(e) = e'$ and $f(g^{-1}) = f(g)^{-1}$, and $f(g^{n}) = f(g)^{n}$ for every $n \in \mathbb{Z}$; for monoid homomorphisms preservation of the identity must be assumed
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: 58 results over 20 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
- J. S. Milne, Group Theory, Remark 4.25 (standard reference, not scraped)