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 trivial for
Statement
for . In contrast, , , and are abelian, so their centers are the whole groups.
Facts & Assumptions
Given: The symmetric groups .
The center consists of elements commuting with every group element (The center of a group).
Conjugation relabels the entries of a cycle (Conjugating a cycle relabels each entry: ).
Conjugate permutations are classified by cycle type (Two elements of are conjugate if and only if they have the same cycle type), and a centralizer has the cycle-type cardinality formula (If has cycles of length , then ).
Proof
For , the groups are trivial; has two elements and is cyclic. Hence all three are abelian, as is also consistent with the conjugacy and centralizer descriptions in [F3].
Let and suppose, for contradiction, that lies in . Choose with and choose distinct from .
For , [F2] gives . This cannot equal because its support contains .
Thus does not commute with , contradicting [F1] and the assumption that it is central. Therefore only the identity is central for , while step 1.1 gives the stated exceptional centers.
Depends on
- The center $Z(G)$ of a group
- Two elements of $S_n$ are conjugate if and only if they have the same cycle type
- If $\sigma\in S_n$ has $c_k$ cycles of length $k$, then $|C_{S_n}(\sigma)|=\prod_{k=1}^n k^{c_k}c_k!$
- Conjugating a cycle relabels each entry: $g(a_1\,\ldots\,a_k)g^{-1}=(g(a_1)\,\ldots\,g(a_k))$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 36 results over 11 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
- K. Conrad, Conjugacy Classes (standard reference, not scraped)