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.
Hermite leading terms for normalized shifted characters
Statement
For every partition with and every , the normalized observables satisfy where the remainder admits a finite expansion with real constants and such that the total degree is strictly smaller than , and runs over partitions with . Consequently In particular, if then the expectation of the Hermite product is , and if it is .
Facts & Assumptions
Given: a partition with ; the observables of Normalized shifted character observables and the Hermite polynomials of The monic probabilists' Hermite polynomials.
The degrees form an algebra filtration, and the partial-permutation structure constants count pairs on supports whose union has size (The shifted character observables form a basis of , with the Kerov weight filtration). The exact identities and the single-cycle top-degree expansion are Shifted character products: exact for and leading terms for . Its equality-case argument also gives the distinct-size rule: if have no common part, then , because an overlap of equal degree must consist of common nontrivial cycles, impossible here. This is Ivanov--Olshanski Corollary 4.13, printed p. 25, whose full proof is the same support-count argument. No arbitrary unique-top-term rule is asserted for .
Hermite recurrence: with , (The monic probabilists' Hermite polynomials).
Expectations: whenever , , and uniformly in in every case (Normalized shifted character observables , Plancherel expectations of the shifted character observables).
Proof
Exact removal of ones. For any partition with no ones and , repeated use of the exact identity in [F1], together with , gives on every with . Dividing by the normalization gives . Thus every normalized term with ones is a finite polynomial in times the corresponding observable without ones; its constant coefficient is one. These identities also hold below the partition size, because either or the product contains a zero factor.
Negative-degree remainders. Write a term as and assign it degree . The algebra-filtration inequality in [F1] makes degrees subadditive under multiplication, and has degree two. Each has degree zero. If a term has negative degree, dividing by the normalization rewrites it as with an integer . Removing its ones by step 1.1 produces finitely many terms with and no ones in . This rule is algebraic and exact, rather than a pointwise bound on the observables.
A single cycle size. Fix and put , with and . Divide the single-cycle multiplication formula of [F1] by . It gives , where has negative degree. Step 1.1 replaces the middle observable by plus negative-degree terms, so with of negative degree. Comparing with the recurrence [F2] proves by induction , where and has negative degree by step 2.1. In particular the contraction coefficient is ; no extra power of remains.
Combining distinct sizes. Group the parts of into the blocks with distinct . Successive applications of the distinct-size rule in [F1], with normalization denominators multiplying exactly, give . Substituting step 3.1 and expanding the finite product, every correction includes a negative-degree and other factors of degree at most zero. Therefore with of negative degree. Step 2.1 writes it exactly as a finite sum with and . The support-union bound in [F1] shows that every partition in a product of cycle observables has size at most the sum of the cycle sizes; every Hermite monomial has that sum at most . Removing ones only decreases size, so , and hence . All constants are independent of .
Expectations. The finite remainder expansion in step 4.1 and [F3] give : each term has and uniformly bounded expectation, indeed zero for nonempty without ones. For nonempty its own expectation is zero by [F3], so the Hermite-product expectation is . For both empty products equal one and the remainder vanishes. This proves the exact expansion and all stated consequences.
Depends on
- Normalized shifted character observables $\eta_\rho$
- Shifted character products: exact for $p_1^\#$ and leading terms for $p_k^\#$
- Plancherel expectations of the shifted character observables
- The monic probabilists' Hermite polynomials
- 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$
Used by
Dependency tree · two levels
24 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.