TheoremStatement: Literature-sourcedProof: Literature-sourcedSession-authored (Fable 5 assisted)audited 2026-08-28

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 cycle index of the dihedral group D_{2n}

Statement

Let $D_{2 n}$ act on the vertices of a labelled $n$ -gon, with $n \geq 1$ .

If $n$ is odd, then

$Z (D_{2 n}) = \frac{1}{2} Z (C_{n}) + \frac{1}{2} s_{1} s_{2}^{(n - 1) / 2} .$

If $n$ is even, then

$Z (D_{2 n}) = \frac{1}{2} Z (C_{n}) + \frac{1}{4} (s_{1}^{2} s_{2}^{(n - 2) / 2} + s_{2}^{n / 2}) .$

Facts & Assumptions

Given: an integer $n \geq 1$ and the full symmetry action of $D_{2 n}$ on a labelled $n$ -gon.

[L1]

The rotations contribute the cyclic-group cycle index $Z (C_{n})$ (The cycle index of the cyclic group C_n).

Proof

technique · cases

1.1

The subgroup of rotations has $n$ elements. Since $D_{2 n}$ has $2 n$ elements, the total rotational contribution to $Z (D_{2 n})$ is $(1 / 2) Z (C_{n})$ by [L1].

2.1

Suppose $n$ is odd. Every reflection fixes exactly one vertex and swaps the remaining $n - 1$ vertices in $(n - 1) / 2$ transpositions. Thus each reflection contributes the monomial $s_{1} s_{2}^{(n - 1) / 2}$ . There are $n$ reflections, so after division by $2 n$ their total contribution is $(1 / 2) s_{1} s_{2}^{(n - 1) / 2}$ .

step 1.1algebra

2.2

Suppose $n$ is even. Then there are two reflection types. The $n / 2$ reflections through opposite vertices fix two vertices and swap the remaining $n - 2$ vertices in $(n - 2) / 2$ transpositions, so they contribute $s_{1}^{2} s_{2}^{(n - 2) / 2}$ . The $n / 2$ reflections through opposite edges fix no vertex and consist of $n / 2$ transpositions, so they contribute $s_{2}^{n / 2}$ . Dividing the sum of these $n$ reflection monomials by $2 n$ gives the contribution $\frac{1}{4} (s_{1}^{2} s_{2}^{(n - 2) / 2} + s_{2}^{n / 2})$ .

step 1.1algebra

3.1

Combine step 1.1 with step 2.1 in the odd case and with step 2.2 in the even case. This yields the two displayed formulas.

step 1.1step 2.1step 2.2∎

Depends on

Used by

Bracelet count from the dihedral-group cycle index Corollary
The cycle index of D₈ Example
Two-colour bracelets of length 6 Example

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Ben Lynn, Polya Theory: The Cycle Index Polynomial (standard reference, not scraped)
Applied Combinatorics, Section 15.5: Applications of Pólya's Enumeration Formula (standard reference, not scraped)