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 , let range over under the Plancherel measures , let be the -scaled Russian profile of Continual diagrams, Russian profiles, and the -scaling of a Young diagram, and let be the limit profile of The Logan-Shepp-Vershik-Kerov limit profile . Under the Plancherel measures , for every integer , Equivalently, in probability for every . Moreover, for every in the algebra ,
Facts & Assumptions
Given: ; the probability space of The Plancherel measure on the partitions of and The Plancherel weights sum to one; the observables and the profile moments with , together with the scaling identity (Shifted character observables and profile moments , Continual diagrams, Russian profiles, and the -scaling of a Young diagram); the algebra ; and (The Logan-Shepp-Vershik-Kerov limit profile ).
For every partition with and every , for and for (Plancherel expectations of the shifted character observables).
The scaling of profile moments is for with , and for (Shifted character observables and profile moments , Continual diagrams, Russian profiles, and the -scaling of a Young diagram).
The family is a linear basis of , the weights define an algebra filtration of coinciding with the weight filtration generated by , and this filtration dominates the degree filtration (The shifted character observables form a basis of , with the Kerov weight filtration).
The functionals for even and , and otherwise, are multiplicative on weight-homogeneous elements, and and for odd (The profile-moment generators in the shifted-character basis).
For the limit profile, for and for odd (The profile moments of are central binomial coefficients).
with supported in (The Logan-Shepp-Vershik-Kerov limit profile ).
Convergence in probability means for every , (Convergence in probability), and for a random variable with finite variance and mean , (Chebyshev's inequality for random variables).
Proof
Monomial expansion: let be a monomial in the generators of of total weight , and fix ; then lies in the weight filtration level of [F3], so its expansion in the basis of [F3] has whenever ; and by [F2] the scaling identity applied to the factors gives .
Pointwise integral identity: for every , every and the definition of the profile moments in [F2] gives ; subtracting the same identity for , which lies in by [F6], yields the pointwise identity on .
Limit of expectations: by step 1.1 and [F1], , and tends to when and to when ; hence tends to if is even and to if is odd. Define the linear functional on by for a monomial of even weight and for odd, extended linearly over the finitely many monomials of an element of ; then for every .
Multiplicativity: the functional of step 2.1 is the linear extension of the functionals of [F4], since for a monomial of weight the coefficient of is exactly the value of on its weight- component and lower-weight components contribute nothing; hence by the multiplicativity clause of [F4], applied to the weight-homogeneous components of two monomials, for all monomials, and by linearity is multiplicative on .
Evaluation at the limit profile: by [F4] one has and for odd , while by [F5] the evaluation functional has exactly the same values on the generators and is multiplicative with ; since is generated by the , for every , and step 2.1 gives for every .
Convergence of the moments in probability: applying step 4.1 to and to , and using that evaluation at is multiplicative, gives and , so the variances of the random variables on the finite probability space tend to ; for every , the mean differs from by less than for all sufficiently large . The event is then contained in the event of deviation at least from the current mean, so Chebyshev [F7] gives , that is, in probability for every .
Conclusion: for each fixed integer , put ; step 5.1 gives in probability, and the identity of step 1.2 exhibits as a fixed nonzero multiple of the difference, so 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 . No choice principle is used: all steps are finite computations on the finite probability spaces .
Depends on
- The shifted character observables form a basis of $A$, with the Kerov weight filtration
- The profile-moment generators in the shifted-character basis
- Plancherel expectations of the shifted character observables
- The profile moments of $\Omega$ are central binomial coefficients
- Shifted character observables $p_\rho^\#$ and profile moments $\tilde p_k$
- Convergence in probability
- Chebyshev's inequality for random variables
- The Plancherel measure on the partitions of $n$
- The Plancherel weights sum to one
- Continual diagrams, Russian profiles, and the $\sqrt n$-scaling of a Young diagram
- The Logan-Shepp-Vershik-Kerov limit profile $\Omega$
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.