Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 exact global stabilization threshold for a fixed Kronecker product

Statement

For all partitions α,β with missing parts read as zero, stab⁡(α,β)=N:=∣α∣+∣β∣+α1+β1, with stab⁡ as in The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β).

More precisely. At every n≥N all support labels γ[n] of the finite support of gˉα,β∙ are ordinary partitions, the full product has the fixed nonnegative Schur expansion sα[n]∗sβ[n]=∑γgˉα,βγsγ[n], and the family is V-stable from N onward. If both α and β are nonempty, N−1 is admissible and the product at N is not V of the product at N−1: the coefficient of s(α+β)[N] is 1, its first two parts are equal, and no such Schur basis vector lies in the image of V. If exactly one input is empty, N is already the least ordinary input rank, and the same image obstruction at N excludes any earlier stabilization index in the Jacobi–Trudi convention of the Definition. If both inputs are empty, N=0, s(n)∗s(n)=s(n) (including s(0)=1) and Vn(1)=s(n), so stabilization begins at zero and no negative-rank product is invoked. No sharpness for an individual coefficient is claimed.

Facts & Assumptions

Given: Partitions α,β,γ with gˉα,βγ≠0; a nonzero summand (μ,λ,η,ρ,θ,π) of the nonnegative expansion.

[F1]

gˉα,βγ=∑cμ,θ,πγcρ,λ,θαcρ,η,πβgλ,ημ with the size equations ∣α∣=∣ρ∣+∣λ∣+∣θ∣, ∣β∣=∣ρ∣+∣η∣+∣π∣, ∣γ∣=∣μ∣+∣θ∣+∣π∣, ∣μ∣=∣λ∣=∣η∣ for every nonzero summand (The nonnegative expansion of a reduced Kronecker coefficient).

[F2]

Two-factor coefficients count LR tableaux and vanish outside containment and size compatibility; commutativity makes them symmetric in the two inputs. A positive threefold coefficient has a positive iterated two-factor summand (The Littlewood–Richardson rule for products of Schur functions, Threefold Schur coefficients ca,b,cδ, Littlewood--Richardson tableaux and coefficients).

[F3]

sα[n]∗sβ[n]=∑γgˉα,βγsγ[n] for every admissible n≥max⁡{∣α∣+α1,∣β∣+β1} (The Murnaghan expansion at every admissible rank).

[F4]

For n≥∣γ∣+γ1, increasing n by k≥0 adds k to the first part, so sγ[n+k]=Vk(sγ[n]); the support of gˉα,β∙ is finite; and for ∣γ∣=∣α∣+∣β∣, gˉα,βγ=cα,βγ with gˉα,βα+β=1 (The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β), Murnaghan–Littlewood: top-degree reduced coefficients are Littlewood–Richardson coefficients, The reduced (stable) Kronecker coefficient gˉα,βγ).

[F5]

If gˉα,βγ>0 then ∣α∣≤∣β∣+∣γ∣, ∣β∣≤∣α∣+∣γ∣, ∣γ∣≤∣α∣+∣β∣ (The support of the reduced Kronecker coefficients satisfies the size triangle inequalities).

[F6]

The image of V is contained in the span of the Schur functions sν with ν1>ν2, and these are linearly independent; the Schur functions of each degree form a Z-basis (The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β), Schur functions form an orthonormal integral basis).

[F7]

On Λn the internal product has unit hn=s(n), and s(n)∗s(n)=s(n) (The internal (Kronecker) product on symmetric functions, Kronecker coefficients and the internal tensor product).

Proof

technique · direct
1.1F1F2

Upper bound on the support. Let γ have gˉα,βγ≠0 and choose a nonzero summand of [F1]. First derive the needed row bounds from [F2]: if ca,bζ>0 and its first skew row is nonempty, the rightmost entry is the first reading-word letter and must be 1; weak row increase forces all added first-row entries to be 1. Thus ζ1−a1≤b1; an empty first skew row gives the same inequality. Iterating gives γ1≤μ1+θ1+π1. Containment, applied with θ (respectively π) first by symmetry, gives θ1≤α1, π1≤β1; the degree equations give ∣λ∣+∣θ∣≤∣α∣ and ∣η∣+∣π∣≤∣β∣. Therefore γ1≤μ1+θ1+π1≤∣μ∣+θ1+π1, so ∣γ∣+γ1≤(∣μ∣+∣θ∣+∣π∣)+(∣μ∣+θ1+π1)=2∣μ∣+∣θ∣+θ1+∣π∣+π1; using ∣μ∣=∣λ∣=∣η∣ this is (∣λ∣+∣θ∣+θ1)+(∣η∣+∣π∣+π1)≤(∣α∣+α1)+(∣β∣+β1) by [F2]. Hence every nonzero reduced coefficient has ∣γ∣+γ1≤N.

1.2F6F7

Both inputs empty. Here N=0, α[n]=β[n]=(n) for every n≥0, and s(n)∗s(n)=s(n) by [F7]; also Vn(1)=Vn(s∅)=s(n) by [F6], since V adds a box to the first row and s∅=1. Hence sα[n+k]∗sβ[n+k]=s(n+k)=Vk(sα[n]∗sβ[n]) for all n≥0,k>0, with no negative-rank product invoked, so stab⁡(∅,∅)=0, the least possible value of the defining index.

2.1F4step 1.1

Attainment and identification of the maximum. The partition γ∗:=α+β satisfies ∣γ∗∣+γ1∗=∣α∣+∣β∣+(α1+β1)=N and gˉα,βγ∗=cα,βγ∗=1 by [F4]; hence max⁡{∣γ∣+γ1:gˉα,βγ≠0}=N. In particular ∣γ∣+γ1≤n for every support label and every n≥N, so all support labels γ[n] are ordinary partitions at such n; this proves the stated support maximum.

3.1F3F4step 2.1

V-stability from N. For n≥N the identity of [F3] is available (the thresholds ∣α∣+α1,∣β∣+β1 are ≤N) and every γ[n] in the finite support is a partition by step 2.1; applying [F3] at n+k and using [F4] term by term gives sα[n+k]∗sβ[n+k]=∑γgˉα,βγsγ[n+k]=∑γgˉα,βγVk(sγ[n])=Vk(sα[n]∗sβ[n]) for all k>0, together with the fixed nonnegative Schur expansion at every rank n≥N. Hence stab⁡(α,β)≤N in the sense of the Definition.

4.1F4F6step 3.1

N is not in the image of V, when N>0. If N>0 then α or β is nonempty and the partition (α+β)[N]=(N−∣α∣−∣β∣,(α+β)1,… )=(α1+β1,α1+β1,… ) has equal first two parts, which are positive because at least one of α,β is nonempty. At rank N the coefficient of s(α+β)[N] in the product is gˉα,βα+β=1 by [F4] and step 3.1. If N>0 and the product at N lay in the image of V, then by [F6] its coefficient of s(α+β)[N] would be 0, a contradiction.

5.1F6step 3.1step 4.1

Least-ness, both inputs nonempty. Suppose α≠∅≠β. Then N−1=∣α∣+∣β∣+α1+β1−1≥∣α∣+α1 and ≥∣β∣+β1, since ∣β∣+β1≥1 and ∣α∣+α1≥1; so N−1 is an admissible rank and the product at N−1 is defined. If some n0<N satisfied the stabilization condition of the Definition, then the product at N would equal VN−n0 of the product at n0, which lies in the image of V, contradicting step 4.1; taking n0=N−1 shows in particular that the product at N is not V of the product at N−1. Hence stab⁡(α,β)=N in this case.

5.2F4F5step 3.1step 4.1

Least-ness, exactly one input empty. Say β=∅≠α, so N=∣α∣+α1 is the least rank at which α[n] (and β[n]=(n)) is an ordinary partition. By [F5], every γ with gˉα,∅γ≠0 satisfies ∣γ∣≤∣α∣≤∣∅∣+∣γ∣=∣γ∣, hence ∣γ∣=∣α∣, and then [F4] gives gˉα,∅γ=cα,∅γ=δγ,α; so the product at rank N is exactly sα[N], whose first two parts are α1,α1 with α1≥1. The obstruction of step 4.1 therefore applies at N: the product at N does not lie in the image of V, so no n0<N can satisfy the stabilization condition, while n0=N does by step 3.1. The case α=∅≠β is symmetric.

6.1F3F4step 3.1step 5.1step 5.2step 1.2∎

Conclusion. Combining steps 3.1, 5.1, 5.2 and 1.2 gives stab⁡(α,β)=N=∣α∣+∣β∣+α1+β1 in all cases, with the fixed nonnegative expansion and V-stability from N onward; the statement claims nothing about sharpness for an individual coefficient, and the proof used only finite sums, the proved all-rank expansion and the unit of the internal product. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

49 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