Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Normalized shifted character observables ηρ

Definition

Fix n≥1. For a partition ρ of Shifted character observables pρ# and profile moments p~k write ∣ρ∣1:=∣ρ∣+m1(ρ), where m1(ρ) is the multiplicity of the part 1. For λ⊢n with n≥∣ρ∣ define the normalized observable ηρ(n)(λ):=pρ#(λ)n∣ρ∣1/2∏k≥2kmk(ρ)/2. For n<∣ρ∣ declare ηρ(n)(λ):=0, consistently with pρ#(λ)=0 there. Since p1#(λ)=n, the definition can be written in the equivalent localized form ηρ(n)=pρ#(p1#)m1(ρ)∏k≥2(k(p1#)k)mk(ρ)/2on Yn, which is the concrete evaluation of the source's localization Aext=A[(p1#)1/2,(p1#)−1/2] on each Yn; the equality uses p1#(λ)=n, a positive number for n≥1, so the square roots are ordinary positive real roots. In particular, for a single part ρ=(k), k≥2, one has η(k)(n)=pk#/(k nk/2)=ηk(n), the observable of Joint convergence in distribution and the normalized cycle-character observables.

Each ηρ(n) is a real function on the finite set Yn, hence a random variable on (Yn,Pn) (The Plancherel measure on the partitions of n), and for every n≥∣ρ∣ the expectation of Plancherel expectations of the shifted character observables gives EPn[ηρ(n)]={n↓∣ρ∣n∣ρ∣1/2∏k≥2kmk(ρ)/2,ρ=(1∣ρ∣),0,ρ≠(1∣ρ∣), so the expectation vanishes whenever m1(ρ)=0 and ρ≠∅, and equals ∏j=0∣ρ∣−1(1−j/n)≤1 for ρ=(1∣ρ∣); in every case it is O(1) uniformly in n. Moreover ∣ηρ(n)(λ)∣≤n(∣ρ∣−m1(ρ))/2∏k≥2k−mk(ρ)/2 for every λ⊢n, n≥∣ρ∣: by For a complex character, χ(1)=dim⁡V, χ is a class function, and ∣χ(g)∣≤χ(1) with equality exactly at scalars every irreducible character satisfies ∣χμλ∣≤χ(1n)λ=dim⁡CSλ, so ∣pρ#(λ)∣≤n↓∣ρ∣≤n∣ρ∣, and dividing by n∣ρ∣1/2∏k≥2kmk(ρ)/2=n(∣ρ∣+m1(ρ))/2∏k≥2kmk(ρ)/2 gives the displayed bound. This normalization is the one used in Hermite leading terms for normalized shifted characters and Kerov's central limit theorem for normalized cycle characters. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

31 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