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.
Shifted character products: exact for and leading terms for
Statement
For every partition :
(i) (exact, all orders) ;
(ii) for every , where removes one part equal to .
In particular, for , , which is the recurrence behind the Hermite leading-term lemma. All exponents , are partitions in the sense of Partitions, English diagrams, and conjugation.
Facts & Assumptions
Given: partitions and ; the observables (Shifted character observables and profile moments ); the algebra with the basis , the structure constants , the filtration , and the top-term rule (The shifted character observables form a basis of , with the Kerov weight filtration); and the partial-permutation structure constants .
(i) For and one has and (Shifted character observables and profile moments ); the falling factorial satisfies (The factorial and the falling factorial , defined by recursion in ).
(ii) Structure constants: and (The shifted character observables form a basis of , with the Kerov weight filtration). For the degree-one equality case, IvOl Corollary 4.8 (of the proof of Proposition 4.7), with , says no fixed point of or lies in , while every point of is fixed by . Combined with the partial-permutation count in IK Proposition 6.2, this forces the overlap description used in step 1.2: it is a union of common nontrivial cycles of and . The structure constants and the exact Corollary 4.8 locator are recorded in the source references above.
Proof
Exact product with : fix with (for both sides vanish; at one has and , so the identity holds directly). By [F1], and , so the claim reduces to , which is the defining recursion rewritten; hence .
Equality-case analysis: let be such that and , where and because for . By [F2] the equality case forces the overlap to consist of common nontrivial cycles of and ; since is a single -cycle, either , giving with coefficient , or is one common -cycle, which requires , gives , and forces .
Coefficient in the second case: in the case abbreviate and ; a direct computation from gives , so by [F2] the identity is equivalent to . The partial-permutation count recorded in [F2] in this case is the number of ways to choose a -cycle inside the -point fixed-point set of : all other cycles of must remain unchanged: choose the -point support, ways, and a -cycle on it, ways, giving as required; hence , the factor counting the choice of which -part of is the common cycle.
Conclusion: every other contributing has by the definition of the equality case in step 1.2, so the expansion takes the displayed form; specialising gives and , which is the stated recurrence. No choice principle is used.
Depends on
- The shifted character observables form a basis of $A$, with the Kerov weight filtration
- Shifted character observables $p_\rho^\#$ and profile moments $\tilde p_k$
- Partitions, English diagrams, and conjugation
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
Used by
Dependency tree · two levels
28 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
- Vladimir Ivanov and Grigori Olshanski, Kerov's central limit theorem for the Plancherel measure on Young diagrams, arXiv:math/0304010; survey-paper version in Symmetric Functions 2001, NATO Science Series II 74 (2002), 93-151 (standard reference, not scraped)
- Vladimir Ivanov and Sergei Kerov, The algebra of conjugacy classes in symmetric groups and partial permutations, arXiv:math/0302203; J. Math. Sci. 107 (2001), 3871-3900 (standard reference, not scraped)