Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weak Schur sampling weights of 1r/r1^r/r1r/r sum to one (RSK count)

Open
MixedCloning.Optimal.wss_normalization

by dmitry · Nov 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsrepresentation-theory

Let n≥0n\ge0n≥0 and r≥0r\ge0r≥0 be integers. For a partition λ⊢n\lambda\vdash nλ⊢n let fλ=dim⁡(Pλ)f^\lambda=\dim(P_\lambda)fλ=dim(Pλ​) be the number of standard Young tableaux of shape λ\lambdaλ. Let sλ(1r)s_\lambda(1^r)sλ​(1r) be the number of semistandard Young tableaux of shape λ\lambdaλ with entries in {1,…,r}\{1,\dots,r\}{1,…,r}, that is, the Schur polynomial evaluated at x1=⋯=xr=1x_1=\dots=x_r=1x1​=⋯=xr​=1. Then

∑λ⊢nℓ(λ)≤rfλ sλ(1r)  =  rn.\sum_{\substack{\lambda\vdash n\\ \ell(\lambda)\le r}} f^\lambda\, s_\lambda(1^r)\;=\;r^n .λ⊢nℓ(λ)≤r​∑​fλsλ​(1r)=rn.

Equivalently, for r≥1r\ge1r≥1 the weak Schur sampling weights Pr⁡[λ]=dim⁡(Pλ) sλ(1r)/rn\Pr[\lambda]=\dim(P_\lambda)\,s_\lambda(1^r)/r^nPr[λ]=dim(Pλ​)sλ​(1r)/rn of WSSn(1r/r)\mathrm{WSS}_n(1^r/r)WSSn​(1r/r) sum to 111. Bijectively, this is the RSK correspondence for words. A word w∈[r]nw\in[r]^nw∈[r]n corresponds to a pair (P,Q)(P,Q)(P,Q) of tableaux of the same shape λ⊢n\lambda\vdash nλ⊢n, where PPP is semistandard with entries in [r][r][r] and QQQ is standard.

Differences from the source:

  • encoding: partitions and tableaux with symbols starting at 1 → YoungDiagram cells and Fin alphabets starting at 0; reason: shifting indices preserves all shapes, orders and counts
  • specialization: the symmetric-function identity h1n=∑λ⊢nfλsλh_1^n=\sum_{\lambda\vdash n}f^\lambda s_\lambdah1n​=∑λ⊢n​fλsλ​ → its evaluation at x=(1r,0,0,… )x=(1^r,0,0,\dots)x=(1r,0,0,…), with the sum restricted to ℓ(λ)≤r\ell(\lambda)\le rℓ(λ)≤r; reason: h1n(1r)=rnh_1^n(1^r)=r^nh1n​(1r)=rn, sλ(1r)s_\lambda(1^r)sλ​(1r) counts SSYT with entries in [r][r][r], and sλ(1r)=0s_\lambda(1^r)=0sλ​(1r)=0 when ℓ(λ)>r\ell(\lambda)>rℓ(λ)>r
  • form: normalization of probabilities → identity multiplied by rnr^nrn; reason: avoids division, and it also holds at r=0r=0r=0 (both sides are 111 for n=0n=0n=0 and 000 for n≥1n\ge1n≥1)
Preamble
import Definitions.Def_MixedCloning_Optimal_Schur

noncomputable section
open Matrix MeasureTheory
open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
Formal statement
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq

theorem wss_normalization (n r : ℕ) :
    ∑ L ∈ partitions n r, (spechtDim L : ℝ) * schurCount L r = (r : ℝ)^n := by sorry

end MixedCloning.Optimal
Source
R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge Univ. Press, 1999 (doi:10.1017/CBO9780511609589), Ch. 7: Corollary 7.12.5, eq. (7.47) h_1^n = sum_{lambda |- n} f^lambda s_lambda, p. 324 (its bijective proof is RSK, Theorem 7.11.5, p. 319, applied to N-matrices with col(A) = (1^n), i.e. words); s_lambda as the SSYT generating function: Definition 7.10.1, p. 310. Used in Grinko–Fanizza–Scharnhorst–Spilecki, Optimal cloning of mixed states: PDF p. 15 (weak Schur sampling outputs lambda with probability dim(P_lambda) s_lambda(rho)) and PDF p. 18 (lambda ~ WSS_n(1^r/r) has probability dim(P_lambda) dim(Q^r_lambda)/r^n for l(lambda) <= r).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me