Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

The profile-moment generators in the shifted-character basis

Statement

Let B(u):=1+∑j≥2pj−1#uj be the formal power series with coefficients in A. Then for every k≥2 p~k=[uk](B(u)k)+⟨terms of weight ≤k−1⟩, the top weight component of p~k being exactly the weight-k component of the coefficient of uk in B(u)k, on which pk−1# occurs with coefficient k. Consequently the linear functionals Lk(pρ#):={1,k even and ρ=(1k/2),0,otherwise, defined by linear extension on the full basis of A (with L0(1)=1), then restricted to weight-homogeneous elements of weight k, are multiplicative: if f and g are weight-homogeneous of weights k′ and k−k′, then Lk(fg)=Lk′(f)Lk−k′(g); and L2m(p~2m)=(2mm),Lk(p~k)=0 (k odd).

Facts & Assumptions

Given: the algebra A=R[p~2,p~3,… ] with the observables pρ# and the profile moments p~k=k(k−1)∫xk−2σω dx of Shifted character observables pρ# and profile moments p~k, and the formal series B(u)=1+∑j≥2pj−1#uj.

[F1]

(IvOl Prop. 3.7, imported with the locator above.) For every k≥2, p~k=[uk]{B(u)k} plus a polynomial in p1#,…,pk−2# of total weight at most k−1; this is the inversion of the top-weight relation of IvOl Prop. 3.5, obtained there by Lagrange inversion.

[F2]

The weight filtration and top-term rule: the weights wt⁡(pρ#)=∣ρ∣+ℓ(ρ) define an algebra filtration coinciding with wt⁡(p~k)=k, and pσ#pτ#=pσ∪τ#+(lower weight) (The shifted character observables form a basis of A, with the Kerov weight filtration).

[F3]

deg⁡1(pρ#)=∣ρ∣+m1(ρ)≤wt⁡(pρ#), and deg⁡1 is compatible with multiplication (The shifted character observables form a basis of A, with the Kerov weight filtration). The top-term rule applied repeatedly also gives (p1#)m=p(1m)#+(lower weight).

Proof

technique · direct
1.1givenF1F2F3

Expansion: by [F1], p~k=[uk]{B(u)k}+(terms of weight ≤k−1). Every product appearing in [uk]{B(u)k} has the form pj1−1#⋯pji−1# with j1+⋯+ji=k and total weight j1+⋯+ji=k, and by the top-term rule of [F2] its weight-k component is p(j1−1)∪⋯∪(ji−1)# with coefficient 1; in particular the term with a single factor (i=1, j1=k) contributes k pk−1#, so pk−1# occurs in the top weight component of p~k with coefficient k. Hence the top weight component of p~k is exactly the weight-k component of [uk]{B(u)k}.

2.1givenF2F3step 1.1algebra

Multiplicativity of Lk: if k is odd, Lk=0 and at least one of Lk′, Lk−k′ is zero, proving the identity. Suppose k is even; let f,g be weight-homogeneous of weights k′ and k−k′ and expand them in the basis {pσ#}, which is possible by The shifted character observables form a basis of A, with the Kerov weight filtration(i). Since the weight filtration has level r spanned by the pσ# with wt⁡(pσ#)≤r ([F2]), only σ with wt⁡(pσ#)≤k′ and τ with wt⁡(pτ#)≤k−k′ occur. The coefficient of p(1k/2)# in fg is ∑σ,τfσgτfστ(1k/2); by [F3] and [F2], fστρ≠0 forces deg⁡1(pρ#)≤deg⁡1(pσ#)+deg⁡1(pτ#)≤wt⁡(pσ#)+wt⁡(pτ#)≤k, so a nonzero contribution to ρ=(1k/2), where deg⁡1(pρ#)=k, forces equalities deg⁡1(pσ#)=wt⁡(pσ#)=k′ and deg⁡1(pτ#)=wt⁡(pτ#)=k−k′; as deg⁡1≤wt⁡ with equality only for columns, this forces σ=(1k′/2) and τ=(1(k−k′)/2), so k and k′ are even and the coefficient is fσgτ⋅1 (the top coefficient being 1 by [F2]). Summing gives Lk(fg)=Lk′(f)Lk−k′(g); when k or k′ is odd, no such pair exists and both sides are 0.

2.2givenF2step 1.1algebra

Values on the generators: expand [u2m]B(u)2m as a finite sum of products pj1−1#⋯pji−1# with jl≥2 and ∑ljl=2m. By [F2], the only weight-2m partition in such a product is (j1−1)∪⋯∪(ji−1), with coefficient one; lower-weight terms cannot contribute to L2m. This partition is (1m) precisely when i=m and all jl=2. There are (2mm) ways to select the m factors supplying p1#u2 among the 2m factors of B(u)2m. Consequently L2m(p~2m)=(2mm) by step 1.1. For odd k, Lk is zero by definition.

3.1givenstep 1.1step 2.1step 2.2∎

Conclusion: step 1.1 gives the stated expansion with its equivalent form and the description of the top weight component; step 2.1 gives multiplicativity of Lk; step 2.2 evaluates L on the generators p~k as the central binomial coefficients for even k and 0 for odd k. No choice principle is used: the imported IvOl statements are algebraic.

Depends on

Used by

Dependency tree · two levels

17 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