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.

Shifted character observables pρ# and profile moments p~k

Definition

(a) Shifted character observables. For a partition ρ⊢r (Partitions, English diagrams, and conjugation) and λ⊢n set pρ#(λ):={n↓rχρ∪1n−rλdim⁡CSλ,n≥r,0,n<r, where n↓r=n(n−1)⋯(n−r+1) is the falling factorial of The factorial n! and the falling factorial nk‾, defined by recursion in N, ρ∪1n−r=(ρ,1,…,1)⊢n is the padded partition, χλ is the complex irreducible character of Sn indexed by λ, and dim⁡CSλ=χ(1n)λ=fλ>0 by Standard polytabloids form a basis of a complex Specht module. Character values are the power-sum coefficients, χλ(μ)=⟨sλ,pμ⟩ for μ⊢n (Irreducible symmetric-group character values are power-sum coefficients). For n≥r the quotient is a finite real number: a permutation and its inverse have the same cycle type and are conjugate (reverse the order within each cycle), while a complex character satisfies χ(g−1)=χ(g)‾ and is constant on conjugacy classes (For a complex character, χ(1)=dim⁡V, χ is a class function, and ∣χ(g)∣≤χ(1) with equality exactly at scalars). Therefore χ(g)=χ(g)‾. The definition for n<r is consistent with n↓r=0: in particular p1#(λ)=n↓1χ(1n)λdim⁡CSλ=nfλfλ=n(λ⊢n, n≥1).

(b) Profile moments. For ω∈D0 with profile σω=12(ω−∣x∣) (Continual diagrams, Russian profiles, and the n-scaling of a Young diagram) and k≥2 define the profile moment p~k[ω]:=k(k−1)∫Rxk−2σω(x) dx,p~1[ω]:=0. The integrand is continuous, since σω is Lipschitz, and compactly supported. Its integral is the Riemann integral over any compact interval containing its support, so it exists and is finite by A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion. If in addition ω is piecewise linear with finitely many corners, σω is continuous, compactly supported and piecewise C1, and applying integration by parts on each linear piece and summing (the boundary terms cancel, since σω vanishes at the ends and its values at the interior corners enter twice with opposite signs) gives p~k[ω]=−k∫Rxk−1σω′(x) dx(k≥2), in agreement with the source's formula (2.2), where σω′ exists except at the finitely many corners; this is the form used for the Young-diagram profiles of this page. The convention p~1=0 is the source's.

(c) Scaling. For every s>0 and k≥2, the substitution y=sx (Monotone change of variable for Riemann-integrable functions, applied on a compact interval containing the support) in the definition of the s-scaling ωs(x)=s−1ω(sx) gives p~k[ωs]=k(k−1)∫Rxk−212(s−1ω(sx)−∣x∣)dx=k(k−1)s−k∫Ryk−2σω(y) dy=s−kp~k[ω], because 12(s−1∣sx∣−∣x∣)=0; hence for λ⊢n, n≥1, the n-scaled profile λˉ of Continual diagrams, Russian profiles, and the n-scaling of a Young diagram satisfies p~k[λˉ]=n−k/2p~k[λ(⋅)]. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

87 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