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 symmetric-group cycle-index series is coefficientwise exponential
Statement
In the formal power-series ring ,
For each fixed , the coefficient of depends only on .
Facts & Assumptions
Given: the formal exponential and the symmetric-group cycle indices.
The coefficient of in the cycle-index series of the family with one fixed structure in each degree is (The cycle-index series of a graded family of S_n-actions, The cycle index of S_n is the sum over cycle types).
Formal exponential turns finite sums into products, so for each finite truncation one may expand as (Formal and are inverse homomorphisms and formal binomial powers obey the expected addition laws).
Proof
Fix . Factors with cannot contribute to the coefficient of , so that coefficient is already the coefficient of in the finite truncation . By [L2], this truncation equals .
Expanding the finite product in step 1.1, the coefficient of is . This depends only on .
The coefficient in step 2.1 is exactly the cycle-type formula for from [L1]. Since this holds for every , the whole series satisfies .
Depends on
- The cycle-index series of a graded family of S_n-actions
- Permutations with a fixed cycle type are counted by the standard factorial denominator
- The cycle index of S_n is the sum over cycle types
- Formal exponential, logarithm, and binomial powers over a commutative $\mathbb Q$-algebra
- Formal $\exp$ and $\log$ are inverse homomorphisms and formal binomial powers obey the expected addition laws
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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)
- Eric W. Weisstein, Cycle Index, Wolfram MathWorld (standard reference, not scraped)