Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

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