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.

Plancherel expectations of the shifted character observables

Statement

For every partition ρ with r=∣ρ∣ and every n≥0, EPn[pρ#]={n↓r,ρ=(1r),0,ρ≠(1r), where the case n<r is included: then pρ#≡0 on Yn and n↓r=0. In particular EPn[pρ#]=O(n∣ρ∣) uniformly in n, and if m1(ρ)=0 and ρ≠∅ then EPn[pρ#]=0 for every n.

Facts & Assumptions

Given: a partition ρ with r=∣ρ∣; the shifted observables pρ#(λ)=n↓rχρ∪1n−rλ/dim⁡CSλ for λ⊢n, n≥r, and pρ#(λ)=0 for n<r (Shifted character observables pρ# and profile moments p~k); the Plancherel weights Pn(λ)=(fλ)2/n! with fλ=dim⁡CSλ=χ(1n)λ (The Plancherel measure on the partitions of n).

[F1]

For every λ⊢n, dim⁡CSλ=χ(1n)λ=fλ>0 (Shifted character observables pρ# and profile moments p~k).

[F3]

The character of the regular representation is χreg(g)=n! for g=e and χreg(g)=0 for g≠e (The regular character is ∣G∣ at 1 and 0 away from 1).

[F4]

The sum of the Plancherel weights is one; equivalently ∑λ⊢n(fλ)2=n! (The Plancherel weights sum to one, The factorial n! and the falling factorial nk‾, defined by recursion in N).

Proof

technique · direct
1.1givenF1F4algebra

Expectation by characters: for n≥r, expanding the expectation against the Plancherel weights and inserting the definition of pρ# gives EPn[pρ#]=∑λ⊢nn↓rχρ∪1n−rλfλ⋅(fλ)2n!=n↓rn!∑λ⊢nχρ∪1n−rλ fλ; for n<r both pρ# and n↓r vanish, so the formula also gives 0 there. All quantities are finite, and n!>0.

1.2givenF2F3algebra

The class sum: by [F2] the character of C[Sn] is the class function χreg=∑λ⊢nfλχλ; evaluated at a permutation of cycle type μ⊢n and compared with [F3] this gives ∑λ⊢nfλχμλ=χreg(μ)={n!,μ=(1n),0,μ≠(1n), the class (1n) being exactly the identity class.

2.1givenstep 1.1step 1.2algebra

Case evaluation: applying step 1.2 with μ=ρ∪1n−r⊢n in step 1.1, the sum is n! precisely when ρ∪1n−r=(1n), i.e. when ρ=(1r), and is 0 otherwise; dividing by n! and multiplying by n↓r gives EPn[pρ#]=n↓r for ρ=(1r) and 0 otherwise, including n<r by step 1.1.

3.1givenstep 2.1algebra∎

Consequences: n↓r=n(n−1)⋯(n−r+1) is 0 for n<r and of modulus at most nr for n≥r, so EPn[pρ#]=O(n∣ρ∣) uniformly in n; and if m1(ρ)=0 with ρ≠∅ then ρ≠(1r), so the expectation vanishes for every n, as asserted.

Depends on

Used by

Dependency tree · two levels

62 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