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.
Murnaghan Stability via FI-Modules — Examples
1 · Prerequisites
- Abelian Categories
- Adjunctions Units and Counits
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Cardinal Arithmetic, Cofinality and the Alephs
- Categories, Functors and Natural Transformations
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Character Polynomials, FI-Modules, and Representation Stability
- Characters and the Orthogonality Relations
- Clifford Theory over Normal Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Frobenius Characteristic and the Symmetric-Group Character Dictionary
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Cohomology as a Derived Functor
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Induced Representations, Frobenius Reciprocity and Applications
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Kronecker Coefficients and Internal Products
- Limits and Colimits
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Murnaghan Stability via FI-Modules
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Outer Products, Skew Specht Modules, and Littlewood–Richardson Coefficients
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Functions, the Hall Inner Product, and Schur Bases
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Product Multiplicities and Littlewood Richardson
- Tensor Products of Modules
- The Branching Rule and the Young Graph
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Universal Properties, Representables and the Yoneda Lemma
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
Objective. This companion works a Kronecker product whose stable behaviour is visible at small ranks: the pair on murnaghan-stability-via-fi-modules. The first item records the source's displayed products at ranks to and the stable row, re-derives the rank-four product from the character table as an independent check, reads off the ten reduced coefficients , and verifies directly that the whole product is -stable at rank —the exact threshold of the A page—and fails at rank , where applying misses the term (Murnaghan stability for , ranks 4 to 9).
The second item is the boundary warning the first makes possible: the individual coefficient already equals its stable value at rank , 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
Murnaghan stability for , ranks 4 to 9
Example
For the source's introduction displays the following internal products at ranks (notation for Schur functions of the padded partitions, and on the stable row):
Consequently the reduced coefficients (The reduced (stable) Kronecker coefficient ) for the pair are for respectively, and for all other ; in particular and . The displayed data also verify directly, for this pair, that the whole product is -stable at rank and not at rank : applying (adding a box to the first row of every Schur function) to the rank- expansion reproduces the rank- expansion term by term, whereas applying to the rank- expansion misses the single term of the rank- expansion, the other nine terms matching term by term. The proved threshold theorem (The exact global stabilization threshold for a fixed Kronecker product) establishes -stability for every rank from onward, with exact least global index ; the displayed finite data independently verify the six listed products and the failure of the preceding step.
Facts & Assumptions
Given: , so for . The displayed source products are to be verified, rather than assumed.
Jacobi–Trudi expresses as a determinant in , and , with (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 elements: arrange the 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 (The Kronecker coefficient is a three-character inner product).
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).
At every admissible rank the product is . Proof step 1.2 of The Murnaghan expansion at every admissible rank computes locally , with these Schur coefficients equal to the reduced coefficients. All support labels are ordinary partitions for , and the least global stabilization index is (The exact global stabilization threshold for a fixed Kronecker product).
is computed by sorting the integers : repetitions or a negative minimum give zero, and otherwise the sorting sign and the resulting partition give its Schur value. For any ordinary partition , ; thus whenever (The Jacobi–Trudi completion , the operators and , and , First-row padding of a partition).
Verification
Rank four from characters. By [F1], the five Schur functions are , , , , and . Substituting the complete-function expansions and multiplying each coefficient by gives the character rows , , , , on the cycle types respectively; here . The squared character row is . The triple-character sums are , , , and . Hence [F2] gives . The dimension check is .
All six products from local straightening. Apply to the ten-term polynomial of [F3]. The five tails are already admissible for every . For the remaining five tails, sorting the of [F4] gives the following values at ranks ; each becomes its ordinary padded Schur function once its threshold is reached: . Multiplying by the coefficients in [F3] and collecting terms yields precisely the four displayed products at ranks through . At ranks 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.
The reduced coefficients and stable ranks. By [F3], the ten coefficients of are exactly the listed reduced coefficients, and all others vanish. For , [F4] sends each padded label to its rank- 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 .
Failure at rank seven. The rank-seven expansion has the nine labels , with coefficients . Increasing their first parts by one gives exactly the rank-eight expansion minus . That last term has coefficient one and is outside the image of , since every has strictly larger first part than second part. Hence the rank-eight product is not of the rank-seven product.
The individual coefficient. The computed rank-four and rank-five products have coefficient one at their labels; ranks six and seven have coefficient two, and every has the reduced coefficient two by step 2.1. Thus this coefficient first becomes constant at rank six, while the whole product first becomes -stable at rank eight. All computations and comparisons are finite, and no choice principle is used.
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 is -stable) is at the same time the least rank from which each individual coefficient is constant.
The witness is : for this pair the individual coefficient is already attained and constant from rank onward, while the whole product is not even -stable at rank and only stabilizes at rank (Murnaghan stability for , 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 ).
Facts & Assumptions
Given: , so for and ; the displayed products of Murnaghan stability for , ranks 4 to 9 at ranks ; the reduced coefficient of that example.
, and for every the rank- product equals , so the coefficient of equals (Murnaghan stability for , ranks 4 to 9, The Murnaghan expansion at every admissible rank).
For the product is -stable with least global index ; at rank it is not -stable, since applying to the rank- product misses the term (The exact global stabilization threshold for a fixed Kronecker product, Murnaghan stability for , ranks 4 to 9).
The coefficient of in is , and for with this is the coefficient of the padded label (First-row padding of a partition, Murnaghan stability for , ranks 4 to 9).
Counterexample
Ranks six, seven and eight. In the displayed products of [F3]: contains (rank ), contains (rank ), and contains (rank ). Hence the coefficient equals the reduced value at ranks .
Rank five is different. The rank-five product contains with coefficient , not , so the coefficient ; together with step 1.1 this shows that the least rank from which the coefficient equals the stable value for all later ranks is . For this is indeed stable: ranks are displayed in step 1.1 and ranks follow from [F1] with the padded label .
Comparison with the global threshold. By [F2] the whole product is -stable exactly from rank onward, and it is not -stable at rank ; the single coefficient of steps 1.1 and 2.1 has already reached its stable value at rank and stays there. Since , 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 , all established above.
Sources
- Emmanuel Briand, Rosa Orellana and Mercedes Rosas, The stability of the Kronecker product of Schur functions, arXiv:0907.4652v2 (2009); Introduction p. 2 (the displayed product table for alpha=beta=(2) at ranks 4 to 9 and the stable row)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford University Press 1995; Chapter I §7 (Frobenius characteristic and character values)
- Emmanuel Briand, Rosa Orellana and Mercedes Rosas, The stability of the Kronecker product of Schur functions, arXiv:0907.4652v2 (2009); Introduction p. 2 (displayed products for alpha=beta=(2)) and section 3 pp. 8-9 (the sharp product threshold)