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.

Shifted character products: exact for p1# and leading terms for pk#

Statement

For every partition σ:

(i) (exact, all orders) pσ#p1#=pσ∪1#+∣σ∣ pσ#;

(ii) for every k≥2, pσ#pk#=pσ∪k#+{k mk(σ) p(σ∖k)∪1k#,mk(σ)≥1,0,mk(σ)=0,+⟨terms of strictly smaller deg⁡1⟩, where σ∖k removes one part equal to k.

In particular, for m≥1, k≥2, p(km)#pk#=p(km+1)#+km p(km−1,1k)#+⟨lower deg⁡1 terms⟩, which is the recurrence behind the Hermite leading-term lemma. All exponents σ∪k, (σ∖k)∪1k are partitions in the sense of Partitions, English diagrams, and conjugation.

Facts & Assumptions

Given: partitions σ,τ and k≥2; the observables pρ# (Shifted character observables pρ# and profile moments p~k); the algebra A with the basis {pρ#}, the structure constants fστρ, the filtration deg⁡1(pρ#)=∣ρ∣+m1(ρ), and the top-term rule (The shifted character observables form a basis of A, with the Kerov weight filtration); zρ=∏kkmk(ρ)mk(ρ)! and the partial-permutation structure constants gστρ.

[F1]

(i) For ∣σ∣=r and n≥r+1 one has pσ#(λ)=n↓rχσ∪1n−rλ/dim⁡λ and pσ∪1#(λ)=n↓(r+1)χσ∪1n−rλ/dim⁡λ (Shifted character observables pρ# and profile moments p~k); the falling factorial satisfies n↓r⋅n=n↓(r+1)+n↓rr (The factorial n! and the falling factorial nk‾, defined by recursion in N).

[F2]

(ii) Structure constants: fστρ=zσzτzρgστρ and fστσ∪τ=1 (The shifted character observables form a basis of A, with the Kerov weight filtration). For the degree-one equality case, IvOl Corollary 4.8 (of the proof of Proposition 4.7), with J={1}, says no fixed point of s1 or s2 lies in X1∩X2, while every point of X1∩X2 is fixed by s=s1s2. Combined with the partial-permutation count in IK Proposition 6.2, this forces the overlap description used in step 1.2: it is a union of common nontrivial cycles of s1 and s2−1. The structure constants and the exact Corollary 4.8 locator are recorded in the source references above.

Proof

technique · direct
1.1givenF1algebra

Exact product with p1#: fix λ⊢n with n≥∣σ∣+1 (for n<∣σ∣ both sides vanish; at n=∣σ∣ one has pσ∪1#=0 and p1#=∣σ∣, so the identity holds directly). By [F1], pσ#(λ)p1#(λ)=n↓rχσ∪1n−rλ/dim⁡λ⋅n and pσ∪1#(λ)=n↓(r+1)χσ∪1n−rλ/dim⁡λ, so the claim reduces to n↓r⋅n=n↓(r+1)+n↓rr, which is the defining recursion n↓(r+1)=n↓r(n−r) rewritten; hence pσ#p1#=pσ∪1#+∣σ∣pσ#.

1.2givenF2algebra

Equality-case analysis: let ρ be such that fσ(k)ρ≠0 and deg⁡1(pρ#)=deg⁡1(pσ#)+k, where τ=(k) and deg⁡1(pk#)=k because m1((k))=0 for k≥2. By [F2] the equality case forces the overlap X1∩X2 to consist of common nontrivial cycles of s1 and s2−1; since s2 is a single k-cycle, either X1∩X2=∅, giving ρ=σ∪k with coefficient fσ(k)σ∪k=1, or X1∩X2 is one common k-cycle, which requires mk(σ)≥1, gives ρ=(σ∖k)∪1k, and forces X2⊆X1.

1.3givenF2algebra

Coefficient in the second case: in the case ρ=(σ∖k)∪1k abbreviate m:=mk(σ)≥1 and ℓ:=m1(σ); a direct computation from zμ=∏iimi(μ)mi(μ)! gives zρzσz(k)=(k+ℓ)!ℓ! k2m, so by [F2] the identity fσ(k)ρ=km is equivalent to gσ(k)ρ=(k+ℓ)!ℓ! k. The partial-permutation count recorded in [F2] in this case is the number of ways to choose a k-cycle inside the (k+ℓ)-point fixed-point set of wρ: all other cycles of wρ must remain unchanged: choose the k-point support, (k+ℓk)=(k+ℓ)!k! ℓ! ways, and a k-cycle on it, (k−1)! ways, giving gσ(k)ρ=(k+ℓ)!ℓ! k as required; hence fσ(k)ρ=k mk(σ), the factor m=mk(σ) counting the choice of which k-part of σ is the common cycle.

2.1givenstep 1.1step 1.2step 1.3∎

Conclusion: every other contributing ρ has deg⁡1(pρ#)<deg⁡1(pσ#)+k by the definition of the equality case in step 1.2, so the expansion takes the displayed form; specialising σ=(km) gives mk(σ)=m and (σ∖k)∪1k=(km−1,1k), which is the stated recurrence. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

28 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