Alphabeta Math
PropositionStatement: 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.

Scaled Plancherel profile moments converge in probability

Statement

For n≥1, let λ range over Yn under the Plancherel measures Pn, let λˉ be the n-scaled Russian profile of Continual diagrams, Russian profiles, and the n-scaling of a Young diagram, and let Ω be the limit profile of The Logan-Shepp-Vershik-Kerov limit profile Ω. Under the Plancherel measures Pn, for every integer k≥0, ∫R(λˉ(x)−Ω(x))xk dx⟶0in probability as n→∞. Equivalently, p~j[λˉ]→p~j[Ω] in probability for every j≥2. Moreover, for every f in the algebra A=R[p~2,p~3,… ], EPn[f(λˉ)]⟶f[Ω].

Facts & Assumptions

Given: n≥1; the probability space (Yn,Pn) of The Plancherel measure on the partitions of n and The Plancherel weights sum to one; the observables pρ# and the profile moments p~k[ω]=k(k−1)∫Rxk−2σω(x) dx with σω=12(ω−∣x∣), together with the scaling identity p~k[λˉ]=n−k/2p~k[λ(⋅)] (Shifted character observables pρ# and profile moments p~k, Continual diagrams, Russian profiles, and the n-scaling of a Young diagram); the algebra A=R[p~2,p~3,… ]; and Ω∈D0 (The Logan-Shepp-Vershik-Kerov limit profile Ω).

[F1]

For every partition ρ with r=∣ρ∣ and every n≥0, EPn[pρ#]=n↓r for ρ=(1r) and EPn[pρ#]=0 for ρ≠(1r) (Plancherel expectations of the shifted character observables).

[F2]

The scaling of profile moments is p~k[λˉ]=n−k/2p~k[λ(⋅)] for λ⊢n with n≥1, and σω=12(ω−∣x∣) for ω∈D0 (Shifted character observables pρ# and profile moments p~k, Continual diagrams, Russian profiles, and the n-scaling of a Young diagram).

[F3]

The family {pρ#} is a linear basis of A, the weights wt⁡(pρ#)=∣ρ∣+ℓ(ρ) define an algebra filtration of A coinciding with the weight filtration generated by wt⁡(p~k)=k, and this filtration dominates the degree filtration deg⁡1(pρ#)=∣ρ∣+m1(ρ)≤wt⁡(pρ#) (The shifted character observables form a basis of A, with the Kerov weight filtration).

[F4]

The functionals Lk(pρ#)=1 for k even and ρ=(1k/2), and Lk(pρ#)=0 otherwise, are multiplicative on weight-homogeneous elements, and L2m(p~2m)=(2mm) and Lk(p~k)=0 for odd k (The profile-moment generators in the shifted-character basis).

[F5]

For the limit profile, p~2m[Ω]=(2mm) for m≥1 and p~k[Ω]=0 for odd k (The profile moments of Ω are central binomial coefficients).

[F6]

Ω∈D0 with σΩ=12(Ω−∣x∣) supported in [−2,2] (The Logan-Shepp-Vershik-Kerov limit profile Ω).

[F7]

Convergence in probability means for every ε>0, P(∣Xn−X∣>ε)→0 (Convergence in probability), and for a random variable Y with finite variance and mean μ, P(∣Y−μ∣≥ε)≤Var⁡(Y)/ε2 (Chebyshev's inequality for random variables).

Proof

technique · direct
1.1givenF2F3algebra

Monomial expansion: let m=p~j1⋯p~ji be a monomial in the generators of A of total weight k=j1+⋯+ji, and fix n≥1; then m lies in the weight filtration level k of [F3], so its expansion m=∑ρmρ pρ# in the basis of [F3] has mρ=0 whenever wt⁡(pρ#)>k; and by [F2] the scaling identity applied to the i factors gives m(λˉ)=n−k/2m(λ(⋅))=n−k/2∑wt⁡(ρ)≤kmρ pρ#(λ).

1.2givenF2F6algebra

Pointwise integral identity: for every k≥0, every λ⊢n and ω∈D0 the definition of the profile moments in [F2] gives p~k+2[ω]=(k+1)(k+2)2∫Rxk(ω(x)−∣x∣) dx; subtracting the same identity for ω=Ω, which lies in D0 by [F6], yields the pointwise identity ∫R(λˉ(x)−Ω(x))xk dx=2(k+1)(k+2)(p~k+2[λˉ]−p~k+2[Ω]) on Yn.

2.1givenF1step 1.1algebra

Limit of expectations: by step 1.1 and [F1], EPn[m(λˉ)]=n−k/2∑2r≤km(1r) n↓r, and n−k/2n↓r=nr−k/2∏s=0r−1(1−s/n) tends to 1 when 2r=k and to 0 when 2r<k; hence EPn[m(λˉ)] tends to m(1k/2) if k is even and to 0 if k is odd. Define the linear functional L on A by L(m):=m(1k/2) for a monomial of even weight k and L(m):=0 for k odd, extended linearly over the finitely many monomials of an element of A; then EPn[f(λˉ)]→L(f) for every f∈A.

3.1givenF3F4step 2.1algebra

Multiplicativity: the functional L of step 2.1 is the linear extension of the functionals Lk of [F4], since for a monomial of weight k the coefficient of p(1k/2)# is exactly the value of Lk on its weight-k component and lower-weight components contribute nothing; hence by the multiplicativity clause of [F4], applied to the weight-homogeneous components of two monomials, L(mm′)=L(m)L(m′) for all monomials, and by linearity L is multiplicative on A.

4.1givenF4F5step 2.1step 3.1algebra

Evaluation at the limit profile: by [F4] one has L(p~2m)=(2mm) and L(p~k)=0 for odd k, while by [F5] the evaluation functional f↦f[Ω] has exactly the same values on the generators p~k and is multiplicative with 1[Ω]=1; since A is generated by the p~k, L(f)=f[Ω] for every f∈A, and step 2.1 gives EPn[f(λˉ)]→f[Ω] for every f∈A.

5.1givenF7step 4.1algebra

Convergence of the moments in probability: applying step 4.1 to f=p~j and to f=p~j2, and using that evaluation at Ω is multiplicative, gives EPn[p~j[λˉ]]→p~j[Ω] and EPn[p~j[λˉ]2]→p~j[Ω]2, so the variances of the random variables p~j[λˉ] on the finite probability space (Yn,Pn) tend to 0; for every ε>0, the mean differs from p~j[Ω] by less than ε/2 for all sufficiently large n. The event ∣p~j[λˉ]−p~j[Ω]∣≥ε is then contained in the event of deviation at least ε/2 from the current mean, so Chebyshev [F7] gives P(∣p~j[λˉ]−p~j[Ω]∣≥ε)≤4Var⁡(p~j[λˉ])/ε2→0, that is, p~j[λˉ]→p~j[Ω] in probability for every j≥2.

6.1givenstep 1.2step 4.1step 5.1∎

Conclusion: for each fixed integer k≥0, put j=k+2; step 5.1 gives p~j[λˉ]→p~j[Ω] in probability, and the identity of step 1.2 exhibits ∫R(λˉ−Ω)xk dx as a fixed nonzero multiple of the difference, so ∫R(λˉ−Ω)xk dx→0 in probability as well; conversely the same identity transfers the latter convergence to the former. This proves the integral display and its equivalent moment form, and step 4.1 proves the assertion about every f∈A. No choice principle is used: all steps are finite computations on the finite probability spaces (Yn,Pn).

Depends on

Used by

Dependency tree · two levels

45 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