Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 Kronecker reduction lemma of Pak and Panova

Statement

Let n≥0 and ℓ≥0, and let λ,μ,ν⊢n have lengths at most ℓ. Read missing parts as zero and put s:=n−ν1, with ν1=0 for the empty partition.

(i) If ∣λi−μi∣>s for some i≤ℓ, then g(λ,μ,ν)=0.

(ii) Otherwise put ρ:=λ∩μ, ω:=λ∪μ, ωℓ+1:=0, and define δi:=max⁡{0,ρi−ωi+1−2s},Dj:=∑i=jℓδi,φ(θ)j:=θj−Dj(1≤j≤ℓ). For every partition θ with at most ℓ parts satisfying ρj−s≤θj≤ωj for each j, the image φ(θ) is a partition after deletion of zero parts. In particular φ(λ) and φ(μ) have a common size r, and φ(ν):=(r−s,ν2,ν3,…) is a partition of r after deletion of zero parts; in particular, φ(ν)=∅ when r=s=0. Then g(λ,μ,ν)=g(φ(λ),φ(μ),φ(ν)),r≤2sℓ2.

This is a corrected reduction map for the bounded-reduction conclusion of Pak–Panova. It retains their Littlewood–Richardson/Jacobi–Trudi proof route and the same size bound; the map is not the block formula printed in their papers.

Facts & Assumptions

Given: The partitions and length bound in the Statement; for part (ii), ∣λi−μi∣≤s, the vectors ρ,ω,δ,D and the map φ above; g0:=n−∣ρ∣.

[F1]

The internal product is bilinear, hm=s(m) for m>0 and h0=s∅=1 are its degreewise units, sλ∗sμ=∑ξg(λ,μ,ξ)sξ, and g is symmetric in its arguments (The internal (Kronecker) product on symmetric functions, Power sums diagonalize the internal product, Kronecker coefficients and the internal tensor product, Kronecker coefficients are nonnegative integers with full S_3 and conjugation symmetries).

[F2]

Littlewood's identity is sλ∗(sτsθ)=∑α,βcαβλ(sα∗sτ)(sβ∗sθ), with ∣α∣=∣τ∣ and ∣β∣=∣θ∣ (Littlewood's identity - the internal product against an outer product).

[F3]

The Schur-product coefficient cαβλ counts semistandard tableaux of shape λ/α and content β with lattice reading word, read right to left in each row and top to bottom. It vanishes unless α⊆λ and ∣λ∣=∣α∣+∣β∣ (The Littlewood–Richardson rule for products of Schur functions, Littlewood--Richardson tableaux and coefficients).

[F4]

Jacobi–Trudi gives sξ=det⁡(hξi−i+j)1≤i,j≤ℓ for a partition ξ of length at most ℓ, with h0=1 and ha=0 for a<0. The Schur functions form an integral basis in each homogeneous degree of the stable graded ring (Jacobi–Trudi and dual Jacobi–Trudi identities, Schur functions form an orthonormal integral basis, The stable graded ring of symmetric functions).

[F5]

Intersection and union are componentwise minimum and maximum and are partitions; in case (ii), 0≤ωi−ρi≤s and g0=∑i(λi−ρi) (Partitions, English diagrams, and conjugation).

Proof

technique · preserve the small skew tableaux by an explicit row shear and apply the first-row Jacobi–Trudi expansion
1.1F1F2F3F5algebra

For 0≤q≤n and η⊢q, apply [F2] to hn−qsη and use the unit in [F1], then extract [sμ] using [F3]. This gives the finite coefficient identity Kn(q,η):=[sμ](sλ∗(hn−qsη))=∑α⊢n−q, β,γ⊢qcαβλcαγμg(β,η,γ). Every nonzero summand has α⊆ρ; writing ei:=ρi−αi gives ∑iei=q−g0, so 0≤ei≤q−g0≤q. If ℓ=0, then n=s=r=0, all three partitions are empty, and the degree-zero unit gives g(∅,∅,∅)=1, proving the claim; hence assume ℓ≥1 for the rest of the proof.

1.2F5algebra

For part (ii) only, and put Dℓ+1=0, ρℓ+1=0. One has δi≤ρi−ρi+1. If Dj>0, let b≥j be the last index with δb>0; telescoping gives Dj≤ρj−ρb+δb≤ρj−2s. Hence φ(θ)j≥s when Dj>0, and when Dj=0 its value is θj≥0. If δj=0, consecutive parts of φ(θ) have the same difference as those of θ. If δj>0 and j<ℓ, then φ(θ)j−φ(ω)j+1=θj−ωj+1−δj=θj−ρj+2s≥s≥0. Since θ⊆ω, this proves weak decrease at every remaining boundary. Thus φ maps the stated domain to partitions, is injective, and satisfies ∣φ(θ)∣=∣θ∣−∑jDj.

2.1F1F4F5step 1.1algebra

Independently of case (ii), expand the Jacobi–Trudi determinant for ν=(n−s,ν2,…) along the first row. Its jth cofactor Bj, indexed by 0≤j≤ℓ−1, depends only on (ν2,…,νℓ) and is homogeneous of degree s−j, since every product in that minor has that degree. Thus sν=∑j=0ℓ−1(−1)jhn−s+jBj, with Bj=0 when j>s; for j≤s, expand Bj in the Schur basis of degree q=s−j. By symmetry [F1], g(λ,μ,ν)=[sμ](sλ∗sν) is therefore a signed sum of Kn(q,η) with 0≤q≤s. If ∣λi−μi∣>s for some i, then g0≥∣λi−μi∣>s: the sums of the positive row differences in either direction agree because ∣λ∣=∣μ∣. Step 1.1 then has no contributing α for any q≤s. Every term vanishes, proving part (i).

2.2F5step 1.2algebra

Return to case (ii) and put r:=∣φ(λ)∣=∣φ(μ)∣. If any δi>0, step 1.2 gives ρ1−D1≥2s and therefore r≥2s, so r−s≥s≥ν2. If every δi=0, then r=n and r−s=ν1≥ν2. Thus φ(ν) is a partition after deletion of zero parts, including ∅ when r=s=0. To bound r, use δi≥ρi−ωi+1−2s and telescope to obtain λj−Dj≤2s(ℓ−j+1)+∑i=jℓ(λi−ρi)+∑i=j+1ℓ(ωi−λi)≤3s(ℓ−j+1); the last two sums together equal (λj−ρj)+∑i=j+1ℓ(ωi−ρi)≤s(ℓ−j+1). Therefore r≤3sℓ(ℓ+1)/2≤2sℓ2 for ℓ≥3. If ℓ=2, equal total sizes imply ω2=ρ2+a and n=ρ1+ρ2+a, where a=∣λ1−μ1∣=∣λ2−μ2∣≤s; then r=n−δ1−2δ2≤(ρ1+ρ2+a)−(ρ1−ρ2−a−2s)−2(ρ2−2s)=6s+2a≤8s. If ℓ=1, then s=0, λ=μ=ν=(n) and δ1=n, giving r=0.

2.3step 1.1step 1.2algebra

Fix q≤s. The map α↦φ(α) is a bijection from partitions α⊆ρ of size n−q to partitions θ⊆φ(ρ) of size r−q. If either set is nonempty, its total deficit from ρ or φ(ρ) is q−g0≤s. For the forward direction this proves αj≥ρj−s, so step 1.2 applies. Conversely, given θ in the second set, set αj:=θj+Dj. These parts are nonnegative and have consecutive differences (θj−θj+1)+δj≥0. They satisfy α⊆ρ, ∣α∣=n−q, and ρj−αj=φ(ρ)j−θj≤q−g0≤s. This is the inverse. Empty index sets, including q<g0, correspond as well.

3.1F3step 1.1step 1.2step 2.3construct

For such an α, shift every cell (j,c) of λ/α to (j,c−Dj). Its image is φ(λ)/φ(α), with each row order and the whole reading word preserved. Within runs of rows with δj=0, consecutive rows share columns in exactly the same way. At a cut δj>0, the original rows have no common skew column across the cut, since αj≥ρj−s>ωj+1≥λj+1. The shifted rows likewise have no common skew column across it, because φ(α)j−φ(ω)j+1=αj−ρj+2s≥s≥0. The partition inequalities imply the same separation for every row above and below the cut. Thus all column comparisons, weak row inequalities, content and lattice-word conditions are preserved in both directions. Consequently cαβλ=cφ(α),βφ(λ) for every β⊢q, and the identical argument gives cαγμ=cφ(α),γφ(μ).

4.1step 1.1step 2.2step 2.3step 3.1algebra

Apply step 1.1 to the reduced outer partitions of size r. Because intersection commutes with subtracting the same row vector, their intersection is φ(ρ). Steps 2.3 and 3.1 identify the two finite sums term by term, with the same β,γ,η and unchanged g(β,η,γ), so Kn(q,η)=[sφ(μ)](sφ(λ)∗(hr−qsη)) for every q≤s. All degrees are nonnegative: if a reduction occurs then r≥2s by step 2.2, and otherwise r=n≥s.

5.1F1F4step 2.1step 2.2step 4.1∎

The first-row Jacobi–Trudi expansion for φ(ν)=(r−s,ν2,…) has exactly the cofactors Bj of step 2.1, since its tail is unchanged. Replacing each Kn(q,η) by its equal reduced coefficient from step 4.1 in that finite signed expansion gives g(λ,μ,ν)=g(φ(λ),φ(μ),φ(ν)). Step 2.2 gives the asserted size bound, completing part (ii).

Remarks

The block map printed in Pak–Panova is not used here. For λ=(13,10,2), μ=(13,7,5), ν=(22,3), ℓ=3, their complexity-paper formula gives (9,10,2) for the first image, which is not a partition. The corrected map above retains a 2s separation at every shortened cut and proves the claimed bounded reduction without weak-decrease assumptions on its outputs.

The sharp s-gap stability result uses the coefficient identity and first-row expansion of steps 1.1 and 2.1 directly on a single row shift; it need not equate the two compacted images of this corrected map. All constructions and sums here are finite and use no choice principle.

Depends on

Used by

Dependency tree · two levels

56 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