Alphabeta Math
Pipeline-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.

✓ 2 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Murnaghan Stability via FI-Modules — Examples

1 · Prerequisites

2 · Summary

Objective. This companion works a Kronecker product whose stable behaviour is visible at small ranks: the pair α=β=(2) on murnaghan-stability-via-fi-modules. The first item records the source's displayed products at ranks 4 to 9 and the stable row, re-derives the rank-four product from the S4 character table as an independent check, reads off the ten reduced coefficients gˉ(2),(2)γ=1,1,2,1,1,2,1,1,1,1, and verifies directly that the whole product is V-stable at rank 8—the exact threshold ∣(2)∣+∣(2)∣+2+2 of the A page—and fails at rank 7, where applying V misses the term s4,4 (Murnaghan stability for α=β=(2), ranks 4 to 9).

The second item is the boundary warning the first makes possible: the individual coefficient gˉ(2),(2)(2)=2 already equals its stable value at rank 6, two ranks before the whole product stabilizes, so the exact global product threshold is not a per-coefficient sharpness statement (A global product threshold is not a per-coefficient sharpness claim). Both items are finite computations from the displayed data together with the proved threshold theorem; neither claims a general positivity or stabilization rule for individual coefficients.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passOpen item page →

Murnaghan stability for α=β=(2), ranks 4 to 9

Example

For α=β=(2) the source's introduction displays the following internal products sn−2,2∗sn−2,2 at ranks n=4,…,9 (notation sa,b,c for Schur functions of the padded partitions, and s∙ on the stable row):

s2,2∗s2,2=s4+s1,1,1,1+s2,2,

s3,2∗s3,2=s5+s2,1,1,1+s3,2+s4,1+s3,1,1+s2,2,1,

s4,2∗s4,2=s6+s3,1,1,1+2s4,2+s5,1+s4,1,1+2s3,2,1+s2,2,2,

s5,2∗s5,2=s7+s4,1,1,1+2s5,2+s6,1+s5,1,1+2s4,2,1+s3,2,2+s4,3+s3,3,1,

s6,2∗s6,2=s8+s5,1,1,1+2s6,2+s7,1+s6,1,1+2s5,2,1+s4,2,2+s5,3+s4,3,1+s4,4,

s7,2∗s7,2=s9+s6,1,1,1+2s7,2+s8,1+s7,1,1+2s6,2,1+s5,2,2+s6,3+s5,3,1+s5,4,

s∙,2∗s∙,2=s∙+s∙,1,1,1+2s∙,2+s∙,1+s∙,1,1+2s∙,2,1+s∙,2,2+s∙,3+s∙,3,1+s∙,4.

Consequently the reduced coefficients (The reduced (stable) Kronecker coefficient gˉα,βγ) for the pair ((2),(2)) are gˉ(2),(2)γ=1,1,2,1,1,2,1,1,1,1 for γ=∅,(1,1,1),(2),(1),(1,1),(2,1),(2,2),(3),(3,1),(4) respectively, and gˉ(2),(2)γ=0 for all other γ; in particular gˉ(2),(2)(2)=2 and gˉ(2),(2)(4)=1. The displayed data also verify directly, for this pair, that the whole product is V-stable at rank 8 and not at rank 7: applying V (adding a box to the first row of every Schur function) to the rank-8 expansion reproduces the rank-9 expansion term by term, whereas applying V to the rank-7 expansion misses the single term s4,4 of the rank-8 expansion, the other nine terms matching term by term. The proved threshold theorem (The exact global stabilization threshold for a fixed Kronecker product) establishes V-stability for every rank from 8 onward, with exact least global index 8=∣(2)∣+∣(2)∣+2+2; the displayed finite data independently verify the six listed products and the failure of the preceding step.

Facts & Assumptions

Given: α=β=(2), so α[n]=β[n]=(n−2,2) for n≥4. The displayed source products are to be verified, rather than assumed.

[F1]

Jacobi–Trudi expresses sδ as a determinant in hj, and hj=∑ρ⊢jpρ/zρ, with χδ(ρ)=zρ[pρ]sδ (Jacobi–Trudi and dual Jacobi–Trudi identities, Complete homogeneous functions expand in power sums with cycle-distribution coefficients, The characteristic of a Specht character is a Schur function). A cycle class has n!/zρ elements: arrange the n distinct letters in cycle blocks, then divide by the rotations of each block and permutations of equal-length blocks. Thus the triple-character average is gμ,νδ=∑ρ⊢nχδ(ρ)χμ(ρ)χν(ρ)/zρ (The Kronecker coefficient is a three-character inner product).

[F2]

Tensor-product multiplicities are the Schur structure constants of the internal product (The characteristic of a Specht character is a Schur function, Kronecker coefficients and the internal tensor product).

[F3]

At every admissible rank the product is UnR(2),(2). Proof step 1.2 of The Murnaghan expansion at every admissible rank computes locally R(2),(2)=1+s(1)+2s(2)+s(1,1)+s(1,1,1)+2s(2,1)+s(2,2)+s(3)+s(3,1)+s(4), with these Schur coefficients equal to the reduced coefficients. All support labels are ordinary partitions for n≥8, and the least global stabilization index is 8 (The exact global stabilization threshold for a fixed Kronecker product).

[F4]

Un(sγ)=sγ[n] is computed by sorting the integers qj=γ[n]j+ℓ(γ[n])−j: repetitions or a negative minimum give zero, and otherwise the sorting sign and the resulting partition give its Schur value. For any ordinary partition δ, V(sδ)=sδ+(1); thus Vk(sγ[n])=sγ[n+k] whenever n≥∣γ∣+γ1 (The Jacobi–Trudi completion sμ, the operators Un and V, and stab⁡(α,β), First-row padding of a partition).

Verification

technique · direct
1.1F1F2

Rank four from characters. By [F1], the five S4 Schur functions are s(4)=h4, s(3,1)=h3h1−h4, s(2,2)=h22−h3h1, s(2,1,1)=h2h12−h22−h3h1+h4, and s(1,1,1,1)=h14−3h2h12+h22+2h3h1−h4. Substituting the complete-function expansions and multiplying each pρ coefficient by zρ gives the character rows (1,1,1,1,1), (3,1,−1,0,−1), (2,0,2,−1,0), (3,−1,−1,0,1), (1,−1,1,1,−1) on the cycle types (14),(2,1,1),(2,2),(3,1),(4) respectively; here zρ=(24,4,8,3,4). The squared (2,2) character row is (4,0,4,1,0). The triple-character sums are g(4)=4/24+4/8+1/3=1, g(1,1,1,1)=4/24+4/8+1/3=1, g(2,2)=8/24+8/8−1/3=1, and g(3,1)=g(2,1,1)=12/24−4/8=0. Hence [F2] gives s(2,2)∗s(2,2)=s(4)+s(1,1,1,1)+s(2,2). The dimension check is 1+1+2=4=22.

1.2F3F4

All six products from local straightening. Apply Un to the ten-term polynomial of [F3]. The five tails ∅,(1),(2),(1,1),(1,1,1) are already admissible for every n≥4. For the remaining five tails, sorting the qj of [F4] gives the following values at ranks 4,5,6,7; each becomes its ordinary padded Schur function once its threshold ∣γ∣+γ1 is reached: γ4567(2,1)0s(2,2,1)s(3,2,1)s(4,2,1)(2,2)00s(2,2,2)s(3,2,2)(3)−s(2,2)0s(3,3)s(4,3)(3,1)−s(2,1,1)−s(2,2,1)0s(3,3,1)(4)−s(3,1)−s(3,2)−s(3,3)0. Multiplying by the coefficients in [F3] and collecting terms yields precisely the four displayed products at ranks 4 through 7. At ranks 8,9 every tail is admissible, and padding the same polynomial yields precisely the two displayed products, including zeros for every unlisted Schur label. This verifies the six products without assuming the source table.

2.1F3F4step 1.2

The reduced coefficients and stable ranks. By [F3], the ten coefficients of R(2),(2) are exactly the listed reduced coefficients, and all others vanish. For n≥8, [F4] sends each padded label to its rank-(n+1) padding without changing its coefficient. Thus the rank-eight product maps to the rank-nine product term by term, and [F3] proves stability for all later ranks, with exact index 8=2+2+2+2.

2.2F4step 1.2

Failure at rank seven. The rank-seven expansion has the nine labels (7),(4,1,1,1),(5,2),(6,1),(5,1,1),(4,2,1),(3,2,2),(4,3),(3,3,1), with coefficients 1,1,2,1,1,2,1,1,1. Increasing their first parts by one gives exactly the rank-eight expansion minus s(4,4). That last term has coefficient one and is outside the image of V, since every V(sδ) has strictly larger first part than second part. Hence the rank-eight product is not V of the rank-seven product.

3.1step 1.1step 1.2step 2.1step 2.2∎

The individual coefficient. The computed rank-four and rank-five products have coefficient one at their (n−2,2) labels; ranks six and seven have coefficient two, and every n≥8 has the reduced coefficient two by step 2.1. Thus this coefficient first becomes constant at rank six, while the whole product first becomes V-stable at rank eight. All computations and comparisons are finite, and no choice principle is used.

CounterexampleConstruction: AI-generatedVerification: AI-adaptedprecheck passOpen item page →

A global product threshold is not a per-coefficient sharpness claim

Statement refuted

Refuted claim: the exact global product threshold (the least rank from which the whole product sα[n]∗sβ[n] is V-stable) is at the same time the least rank from which each individual coefficient gα[n],β[n]γ[n] is constant.

The witness is α=β=(2): for this pair the individual coefficient gˉ(2),(2)(2)=2 is already attained and constant from rank 6 onward, while the whole product is not even V-stable at rank 7 and only stabilizes at rank 8 (Murnaghan stability for α=β=(2), ranks 4 to 9, The exact global stabilization threshold for a fixed Kronecker product). Thus a single coefficient can stabilize strictly before the global product threshold, and the exact global threshold is not a per-coefficient sharpness statement (The reduced (stable) Kronecker coefficient gˉα,βγ).

Facts & Assumptions

Given: α=β=(2), so γ[n]=(n−2,2) for γ=(2) and n≥4; the displayed products of Murnaghan stability for α=β=(2), ranks 4 to 9 at ranks 4,…,9; the reduced coefficient gˉ(2),(2)(2)=2 of that example.

[F1]

gˉ(2),(2)(2)=2, and for every n≥8 the rank-n product equals ∑γgˉ(2),(2)γsγ[n], so the coefficient of s(n−2,2) equals 2 (Murnaghan stability for α=β=(2), ranks 4 to 9, The Murnaghan expansion at every admissible rank).

[F2]

For n≥8 the product s(n−2,2)∗s(n−2,2) is V-stable with least global index 8; at rank 7 it is not V-stable, since applying V to the rank-7 product misses the term s4,4 (The exact global stabilization threshold for a fixed Kronecker product, Murnaghan stability for α=β=(2), ranks 4 to 9).

[F3]

The coefficient of sδ in sα[n]∗sβ[n] is gα[n],β[n]δ, and for δ=γ[n] with n≥∣γ∣+γ1 this is the coefficient of the padded label (First-row padding of a partition, Murnaghan stability for α=β=(2), ranks 4 to 9).

Counterexample

technique · direct
1.1F1F3given

Ranks six, seven and eight. In the displayed products of [F3]: s4,2∗s4,2 contains 2s4,2 (rank 6), s5,2∗s5,2 contains 2s5,2 (rank 7), and s6,2∗s6,2 contains 2s6,2 (rank 8). Hence the coefficient g(4,2),(4,2)(4,2)=g(5,2),(5,2)(5,2)=g(6,2),(6,2)(6,2)=2 equals the reduced value gˉ(2),(2)(2)=2 at ranks 6,7,8.

2.1F1F3step 1.1

Rank five is different. The rank-five product s3,2∗s3,2 contains s3,2 with coefficient 1, not 2, so the coefficient g(3,2),(3,2)(3,2)=1≠gˉ(2),(2)(2); together with step 1.1 this shows that the least rank from which the coefficient equals the stable value for all later ranks is 6. For n≥6 this is indeed stable: ranks 6,7,8 are displayed in step 1.1 and ranks n≥8 follow from [F1] with the padded label (n−2,2)=γ[n].

3.1F1F2step 2.1∎

Comparison with the global threshold. By [F2] the whole product is V-stable exactly from rank 8 onward, and it is not V-stable at rank 7; the single coefficient of steps 1.1 and 2.1 has already reached its stable value 2 at rank 6 and stays there. Since 6<8, the global product threshold is strictly larger than the stabilization rank of this coefficient, so no statement of the form "each coefficient first becomes constant at the global threshold" can be true. This is a finite boundary witness; it uses the displayed products, the exact threshold theorem and the reduced value 2, all established above.

Sources