Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 m1(ρ)=0 and every n≥max⁡{1,∣ρ∣}, the normalized observables satisfy ∏k≥2Hmk(ρ)(ηk(n))=ηρ(n)+Rρ(n)on Yn, where the remainder admits a finite expansion Rρ(n)=∑σ,jcσ,j n−j/2ησ(n) with real constants cσ,j and j≥1 such that the total degree ∣σ∣1−j is strictly smaller than ∣ρ∣1, and σ runs over partitions with m1(σ)=0. Consequently ∣EPn[∏k≥2Hmk(ρ)(ηk(n))]−EPn[ηρ(n)]∣=O(n−1/2). In particular, if ρ≠∅ then the expectation of the Hermite product is O(n−1/2), and if ρ=∅ it is 1.

Facts & Assumptions

Given: a partition ρ with m1(ρ)=0; the observables ησ(n)=pσ#/(n∣σ∣1/2∏k≥2kmk(σ)/2) of Normalized shifted character observables ηρ and the Hermite polynomials Hm of The monic probabilists' Hermite polynomials.

[F1]

The degrees deg⁡1(pτ#)=∣τ∣+m1(τ) 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 A, with the Kerov weight filtration). The exact identities and the single-cycle top-degree expansion are Shifted character products: exact for p1# and leading terms for pk#. Its equality-case argument also gives the distinct-size rule: if σ,τ have no common part, then pσ#pτ#=pσ∪τ#+(lower deg⁡1), 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 deg⁡1.

[F2]

Hermite recurrence: xHm(x)=Hm+1(x)+mHm−1(x) with H0=1, H1=x (The monic probabilists' Hermite polynomials).

[F3]

Expectations: EPn[ησ(n)]=0 whenever m1(σ)=0, σ≠∅, and EPn[ησ(n)]=O(1) uniformly in n in every case (Normalized shifted character observables ηρ, Plancherel expectations of the shifted character observables).

Proof

technique · direct
1.1F1givenalgebra

Exact removal of ones. For any partition τ with no ones and q≥0, repeated use of the exact p1# identity in [F1], together with p1#=n, gives pτ∪1q#=pτ#∏h=0q−1(n−∣τ∣−h) on every Yn with n≥1. Dividing by the normalization gives ητ∪1q(n)=ητ(n)∏h=0q−1(1−(∣τ∣+h)/n). Thus every normalized term with ones is a finite polynomial in 1/n times the corresponding observable without ones; its constant coefficient is one. These identities also hold below the partition size, because either pτ#=0 or the product contains a zero factor.

2.1F1step 1.1algebra

Negative-degree remainders. Write a term as c na/2pν# and assign it degree a+∣ν∣1. The algebra-filtration inequality in [F1] makes degrees subadditive under multiplication, and n=p1# has degree two. Each ην has degree zero. If a term has negative degree, dividing by the normalization rewrites it as c′n−j/2ην with an integer j≥1. Removing its ones by step 1.1 produces finitely many terms c′′n−j′/2ητ with j′≥j≥1 and no ones in τ. This rule is algebraic and exact, rather than a pointwise bound on the observables.

3.1F1F2step 1.1step 2.1algebra

A single cycle size. Fix k≥2 and put fm=η(km), with f0=1 and f1=ηk. Divide the single-cycle multiplication formula of [F1] by k m+1nk(m+1)/2. It gives fmηk=fm+1+mη(km−1,1k)+rm, where rm has negative degree. Step 1.1 replaces the middle observable by fm−1 plus negative-degree terms, so fmηk=fm+1+mfm−1+rm′ with rm′ of negative degree. Comparing with the recurrence [F2] proves by induction fm=Hm(ηk)+Em, where E0=E1=0 and Em+1=ηkEm−mEm−1−rm′ has negative degree by step 2.1. In particular the contraction coefficient is m; no extra power of n remains.

4.1F1step 1.1step 2.1step 3.1algebra

Combining distinct sizes. Group the parts of ρ into the blocks (kmk(ρ)) with distinct k. Successive applications of the distinct-size rule in [F1], with normalization denominators multiplying exactly, give ∏kη(kmk)=ηρ+(negative-degree terms). Substituting step 3.1 and expanding the finite product, every correction includes a negative-degree Em and other factors of degree at most zero. Therefore ∏kHmk(ηk)=ηρ+Rρ with Rρ of negative degree. Step 2.1 writes it exactly as a finite sum ∑σ,jcσ,jn−j/2ησ with j≥1 and m1(σ)=0. 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 ∣σ∣1−j<∣ρ∣1. All constants are independent of n.

5.1F3step 4.1algebra∎

Expectations. The finite remainder expansion in step 4.1 and [F3] give ∣E[Rρ(n)]∣=O(n−1/2): each term has j≥1 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 O(n−1/2). For ρ=∅ both empty products equal one and the remainder vanishes. This proves the exact expansion and all stated consequences.

Depends on

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.

Sources