Pith. sign in

REVIEW 3 major objections 3 minor 1 cited by

The support of Kostant's weight multiplicity formula is an order ideal in the weak Bruhat order

T0 review · 3 major / 3 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every Weyl alternation set is an order ideal in the weak Bruhat order of its Weyl group.

desk verdict The order ideal theorem is true and clean, but the BAS independence framework has a false step that undermines the type-A characterization and enumerations. read the letter →

arxiv 2412.16820 v2 pith:FIDIXK53 submitted 2024-12-22 math.RT math.CO

Portia X. Anderson , Esther Banaian , Melanie J. Ferreri , Owen C. Goff , Kimberly P. Hadaway , Pamela E. Harris , Kimberly J. Harry , Nicholas Mayers
show 2 more authors
Shiyun Wang Alexander N. Wilson
This is my paper · ORCID
classification math.RTmath.CO MSC 17B1005E1517B2020F55
keywords WeylalternationsetKostantweightmultiplicityformulaweakBruhatorderidealbasicallowablesubwordsFibonaccinumberstypeALiealgebravectorpartitionfunction
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves a structural constraint on Kostant's weight multiplicity formula: for any integral dominant weight λ and any weight μ, the set of Weyl group elements that contribute nonzero terms to the multiplicity—the Weyl alternation set—is an order ideal in both the left and right weak Bruhat orders. That means if a Weyl group element contributes, every element below it in the weak order contributes as well, so the support of the formula is always downward-closed. The paper then specializes to sl_{r+1}(C), fully characterizing the alternation sets when λ is the highest root and μ is a negative root, and provides generating functions for their sizes. The motivation is computational: knowing the support and its structure lets one evaluate Kostant's alternating sum over a fraction of the Weyl group.

What carries the argument

The load-bearing objects are the weak Bruhat order on the Weyl group, defined by covering relations σ ⋖ σ s_i when length increases (right order) and σ ⋖ s_i σ (left order), and the order ideal property: with any contributor τ, all prefixes and suffixes in reduced expressions contribute too. The type-A analysis is organized around 'influence' I(σ), the set of simple-reflection indices appearing in a reduced word for σ, and its connected extension I(σ), together with the decomposition of A(λ, μ) into basic allowable subwords BAS(λ, μ), elements with connected influence that cannot be split into independent factors. Proposition 3.15 gives sufficient conditions for a candidate set S to equal BAS(λ, μ); Lemma 4.6 verifies those conditions case by case for μ = −α̃, and Corollaries 4.9–4.11 obtain other negative roots by intersecting with A(α̃, −α̃).

What would settle it

Compute A(α̃, μ) for a concrete unlisted case in type A, say r = 6 and μ = −α_{2,4}, by direct evaluation of the Kostant partition function on every Weyl-group element; if any element not of the forms in Corollary 4.11 contributes, or any listed element fails to contribute, the characterization is wrong. More broadly, for any simple Lie algebra, find a dominant integral λ and a weight μ for which some element below an element of A(λ, μ) in the weak Bruhat order has ℘(σ(λ+ρ)−μ−ρ) = 0; that would refute Theorem 3.1.

Watch

Extended reading notes

Core claim

On its own terms, the paper's central result is Theorem 3.1: for a simple Lie algebra g with Weyl group W, if λ is dominant integral and μ is any weight, then A(λ, μ) is an order ideal in the left and right weak Bruhat orders. The proof shows that when τ covers σ, the difference σ(λ+ρ) − τ(λ+ρ) is a nonnegative integer combination of simple roots; hence any vector partition of τ(λ+ρ)−μ−ρ can be extended to one for σ(λ+ρ)−μ−ρ. Theorem 3.10 sharpens this: every nonempty alternation set is the set of products of pairwise independent subsets of a unique collection BAS(λ, μ) of 'basic allowable subwords' with connected influence. In type A, for λ = α̃ and μ = −α_{i,j}, the paper lists BAS(α̃, μ) explicitly in Corollaries 4.9–4.11 and shows that |A_r(α̃, μ)| satisfies the Fibonacci recurrence in the rank, with a closed generating function over all negative roots.

Load-bearing premise

The load-bearing premise is that the case-by-case verification in Lemma 4.6 covers every possible pair of nonindependent basic allowable subwords and that the intersections used to derive Corollaries 4.9–4.11 were computed correctly; if any case or intersection is wrong, the type-A characterization and its enumerations fail.

Editorial extensions

If this is right

  • Corollary 3.2: any reduced word that appears as a consecutive subword of a reduced expression for a contributing element is itself a contributor, so membership in A(λ, μ) can be checked by downward closure.
  • Theorem 3.10: every element of A(λ, μ) corresponds uniquely to a pairwise independent subset of BAS(λ, μ), making the alternation set an abstract simplicial complex.
  • Corollaries 4.9–4.11: for sl_{r+1}(C), the sets A(α̃, −α_{i,j}) are fully enumerated, answering Harry's 2024 question for negative roots.
  • Proposition 5.5 and Theorem 5.14: the cardinalities satisfy |A_r| = |A_{r−1}| + |A_{r−2}| and are captured by an explicit bivariate generating function.
  • Section 6: these lists are the input for a planned proof of Harry's conjecture that m_q(α̃, μ) = q^{r+j−i+1} + q^{r+j−i} − q^{j−i+1}.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The order-ideal theorem is not restricted to highest-root weights; if it survives beyond the adjoint representation, it gives a general pruning rule: any algorithm that walks the weak order can terminate at the maximal contributors instead of scanning all of W.
  • The Fibonacci-type growth suggests a broader phenomenon: for fixed λ, μ in type A, |A(λ, μ)| grows like c^r rather than r!, so Kostant's formula could in principle be evaluated in subfactorial time by enumerating ideals.
  • A direct testable extension is to produce analogous forbidden-subword lists for types B, C, and D and compare the resulting cardinalities to sequences such as the Lucas numbers the paper already recovers in Corollary 5.3.
  • If the q-analog conjecture is proved with these methods, the same support structure would also predict which powers of q appear for other classical types.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. This paper studies the Weyl alternation set A(λ, μ) appearing in Kostant's weight multiplicity formula. The first main result, Theorem 3.1, proves that A(λ, μ) is an order ideal in the left and right weak Bruhat orders for any dominant integral λ, by showing that for a cover τ ⋖ σ the difference σ(λ+ρ)−τ(λ+ρ) is a nonnegative integer combination of simple roots. The paper then introduces the notion of basic allowable subwords (BAS) and claims in Theorem 3.10 that every element of A(λ, μ) corresponds bijectively to a pairwise independent subset of a unique BAS. For type A it characterizes BAS(α̃, μ) for negative roots μ (Corollaries 4.9–4.11), proves Fibonacci-type recurrences for the cardinalities |A_r(α̃, μ)|, and gives a bivariate generating function in Theorem 5.14.

Significance. The order-ideal theorem is a clean and apparently correct structural result; if it stands, it gives a useful global constraint on the support of Kostant's formula and reduces alternation-set computations to downward-closed sets. The BAS framework is a natural strengthening, and the type-A characterizations would extend earlier results of Harris and Harry. However, the central BAS theorem is not correct as stated, because the proposed independence relation is too weak; the type-A classification and all Section 5 enumerations rest on that theorem. The Appendix A case analysis is extensive and suggests that the intended combinatorial picture is plausible, but the manuscript in its current form does not establish it. No code or machine-checked artifacts are provided; the main theorem's proof is short and verifiable by hand.

major comments (3)
  1. [Definition 3.5 and Theorem 3.10(2)] Definition 3.5 defines independence by I(σ) ∩ I(τ) = ∅, and this is too weak for Theorem 3.10(2). In type A4 take λ = α̃ and μ = −α̃. Proposition 4.3 places s1 and s2s3 in A(λ, μ), and Definition 3.5 makes them independent because I(s1) = {1} and I(s2s3) = {2, 3}. A direct computation with ρ = 2α1 + 3α2 + 3α3 + 2α4 gives s1s2s3(α̃+ρ) + α̃ − ρ = 2α̃ − 4α1 − 2α2 − α3, whose α1-coefficient is negative; hence s1s2s3 ∉ A(λ, μ). The coefficient argument in the proof of part (2) is therefore invalid: a factor whose support is adjacent to I(b) can change the coefficient of α_i even when i ∉ I(b). The independence relation and the proof of part (2) must be repaired before the BAS results can be used.
  2. [Example 3.11] Example 3.11 is inconsistent with Definition 3.5. Under Definition 3.5, {s2, s3} is an independent subset of the seven listed BAS elements, because I(s2) = {2} and I(s3) = {3}; yet it is not among the 11 listed independent sets, and its product s2s3 would duplicate the BAS element s2s3. The stated 5-clique and the 11 independent sets are exactly what one obtains when independence is interpreted as the two influence sets being at Dynkin distance at least two. The definition, the proof of Theorem 3.10, and Example 3.11 therefore cannot all be correct. This is not a cosmetic issue, because a corrected independence relation is precisely what the coefficient argument in Theorem 3.10 needs.
  3. [Corollaries 4.9–4.11] Corollaries 4.9–4.11 are the type-A payoff, but each is introduced as being obtained by computing the intersection BAS(α̃, −α̃) ∩ A(α̃, μ), and no computation is supplied; Example 4.8 verifies a single excluded element. Since Proposition 3.17 inherits the current BAS theory, and since all Section 5 enumerations (Propositions 5.2, 5.4, 5.5 and Theorem 5.14) are based on these BAS lists, the reader cannot check the most load-bearing step of the type-A classification. The authors should either prove the intersection statement systematically, for each family (a)–(e) determining exactly the index ranges for which the element lies in A(α̃, μ), or provide an exhaustive table or certificate for all index ranges.
minor comments (3)
  1. [Definition 3.4] The two influence sets I(σ) and the extended influence set are easy to confuse throughout the text; Definition 3.5 and Example 3.6 are especially hard to parse. Use visually distinct symbols and always state explicitly which influence is meant when the word 'independent' is used.
  2. [Proposition 5.4] The proof of Proposition 5.4 explicitly states that the enumerative arguments are omitted. Since this is a formal proposition, the omission should be filled, or the result should be marked as a conjecture or moved to an appendix with a complete proof.
  3. [Lemma 5.7] In the proof of Lemma 5.7 the bijection φ is described only by its images; a short verification that the five images are disjoint and exhaust the cokernel would make the recurrence checkable.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the order-ideal theorem and type-A characterizations are derived from explicit proofs and case checks, not from fitted inputs or load-bearing self-citations.

full rationale

The main structural result, Theorem 3.1, is proved directly from the Weyl group action and standard root-system facts, with no dependence on the authors' earlier papers. Definition 3.9 and Theorem 3.10 set up the BAS decomposition, and the theorem supplies an existence and uniqueness argument rather than merely restating the definition as a conclusion. Proposition 3.15 gives a separately proved sufficient condition for identifying BAS, and Section 4 applies it to explicit candidate words using displayed computations and the case check in Appendix A. The recovery of |A(alpha-tilde, 0)| = F_r is presented as a consistency check derived from the paper's own BAS description, not used as an input. Citations to Harris and Harry are contextual or concern results that are subsumed and re-derived; they are not load-bearing. The skeptical concern about Definition 3.5 and Theorem 3.10(2) is a potential mathematical gap or false assertion, not a circular reduction of a result to its own inputs, so it does not affect the circularity score.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters are fit to data; the enumerative formulas are derived from the structural characterizations. The axioms are standard results in Lie theory and Coxeter combinatorics. The new combinatorial notions (influence, independence, BAS) are definitions, not postulates with independent empirical content.

assumptions (5)
  • standard math Kostant's weight multiplicity formula: m(λ, μ) = Σ_{σ∈W} (-1)^{ℓ(σ)} ℘(σ(λ+ρ)-μ-ρ)
    Defines the central object; cited from [17, Theorem on p. 589] in Eq. (1).
  • standard math If ℓ(σs_i) > ℓ(σ) then σ(α_i) is a positive root (Björner-Brenti, Eq. 4.25)
    Used in Theorem 3.1 to show the weight difference is a positive combination.
  • standard math The geometric representation of a finite Coxeter group is faithful
    Used in Lemma 3.8(2); cited to [15, Section 5.5].
  • standard math For dominant integral λ and ρ, the pairing (λ+ρ, α_i^∨) is a nonnegative integer for each simple root α_i
    Ensures coefficients in Theorem 3.1 and Theorem 3.10 are nonnegative integers.
  • standard math For any dominant weight ν and w ∈ W, ν - wν is a nonnegative integer combination of positive roots
    Implicitly used in Theorem 3.10 to justify 1 ∈ A(λ, μ) when A is nonempty; not explicitly cited.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The support of Kostant's weight multiplicity formula is an order ideal in the weak Bruhat order." pith.science (2026). https://pith.science/paper/FIDIXK53

@misc{pith2026241216820,
  author       = {Pith},
  title        = {Pith review of: The support of Kostant's weight multiplicity formula is an order ideal in the weak Bruhat order},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FIDIXK53}},
  note         = {Machine review of arXiv:2412.16820}
}
abstract

For integral weights $\lambda$ and $\mu$ of a classical simple Lie algebra $\mathfrak{g}$, Kostant's weight multiplicity formula gives the multiplicity of the weight $\mu$ in the irreducible representation with highest weight $\lambda$, which we denote by $m(\lambda,\mu)$. Kostant's weight multiplicity formula is an alternating sum over the Weyl group of the Lie algebra whose terms are determined via a vector partition function. The Weyl alternation set $\mathcal{A}(\lambda,\mu)$ is the set of elements of the Weyl group that contribute nontrivially to the multiplicity $m(\lambda,\mu)$. In this article, we prove that Weyl alternation sets are order ideals in the weak Bruhat order of the corresponding Weyl group. Specializing to the Lie algebra $\mathfrak{sl}_{r+1}(\mathbb{C})$, we give a complete characterization of the Weyl alternation sets $\mathcal{A}(\tilde{\alpha},\mu)$, where $\tilde{\alpha}$ is the highest root and $\mu$ is a negative root, answering a question of Harry posed in 2024. We also provide some enumerative results that pave the way for our future work, where we aim to prove Harry's conjecture that the $q$-analog of Kostant's weight multiplicity formula is $m_q(\tilde{\alpha},\mu)=q^{r+j-i+1}+q^{r+j-i}-q^{j-i+1}$ when $\mu=-(\alpha_i+\alpha_{i+1}+\cdots+\alpha_{j})$ is a negative root of $\mathfrak{sl}_{r+1}(\mathbb{C})$.

Figures

Figures reproduced from arXiv: 2412.16820 by the authors.

Figure 1
Figure 1. Hasse diagram of the right weak order on the type A3 Weyl group with the elements of the order ideal I = {1, s1, s2, s3, s1s3} boxed and in blue text. As noted in the introduction, certain subsets of the left and right Bruhat orders, called “order ideals”, play an important role ongoing in this study. Following [19, p. 282], we define an order ideal to be a subposet I of a poset P with the property that if y ∈ I and… view at source ↗
Figure 2
Figure 2. The type A7 Dynkin diagram with some influences and extended influences highlighted. Definition 3.4. For an element σ ∈ W of the Weyl group, define the influence and extended influence of σ, denoted I(σ) and I(σ) respectively, by I(σ) = {i : si is in a reduced word for σ}, and I(σ) = {i : i ∈ I(σ) or i is adjacent to some j ∈ I(σ) in the Dynkin diagram}. We say that I(σ) is connected if the subgraph of the Dynkin di… view at source ↗
Figure 3
Figure 3. A graph on the elements of BAS( ˜α, −α˜) in rank r = 4 with edges drawn between nonindependent elements. Length Basic allowable subwords 1 s1, s2, s3, s4, s5, s6 2 s3s4, s4s3, s4s5, s5s4, s5s6 3 s3s4s3, s3s4s5, s3s5s4, s4s5s4, s4s5s6 4 s3s4s5s4 Example 3.13. In type C5, consider the dominant integral weight λ = 3α1 + 5α2 + 7α3 + 9α4 + 5α5, and the weight µ = 2α2 + 2α2 + 3α3 + 3α4 + 3α5. The set BAS(λ, µ) consists of… view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The Hasse diagram for A7(˜α, µ) in the left weak Bruhat order with µ = −α2,4. The blue subposet with thick edges is A6(˜α, µ), and the subposet of boxed values is A5(˜α, µ). Hence, A7( ˜α, µ) decomposes into two pieces: one being A6(˜α, µ) and the other being a transla…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Parking completions are $\mathbf{x}$-parking functions

    math.CO 2026-07 conditional novelty 4.0 of 10

    For any fixed set of taken parking spots, the parking completions are precisely the x-parking functions whose cumulative bounds are the unoccupied spots.

Reference graph

Works this paper leans on

19 extracted references · 19 canonical work pages · cited by 1 Pith paper

  1. [1]

    Bj¨ orner and F

    A. Bj¨ orner and F. Brenti.Combinatorics of Coxeter groups , volume 231 of Graduate Texts in Mathematics. Springer, New York, 2005

    work page 2005

  2. [2]

    Chang, P

    K. Chang, P. E. Harris, and E. Insko. Kostant’s weight multiplicity formula and the Fibonacci and Lucas numbers. J. Comb., 11(1):141–167, 2020

    work page 2020

  3. [3]

    C. Cochet. Vector partition function and representation theory. Conference Proceedings Formal Power Series and Algebraic Combinatorics. Taormina, Sicile, 2005

    work page 2005

  4. [4]

    R. E. Garcia, P. E. Harris, M. Loving, L. Martinez, D. Melendez, J. Rennie, G. Rojas Kirby, and D. Tinoco. On Kostant’s weight q-multiplicity formula for sl4(C). Appl. Algebra Engrg. Comm. Comput. , 33(4):353–418, 2022

    work page 2022

  5. [5]

    P. E. Harris. On the adjoint representation of sln and the Fibonacci numbers. C. R. Math. Acad. Sci. Paris , 349(17- 18):935–937, 2011

    work page 2011

  6. [6]

    P. E. Harris. Computing weight multiplicities. In A primer for undergraduate research , Found. Undergrad. Res. Math., pages 193–222. Birkh¨ auser/Springer, Cham, 2017

    work page 2017

  7. [7]

    P. E. Harris, P. Hollander, D. C. Qin, and M. Rodriguez-Hertz. On Kostant’s weight q-multiplicity formula for sp6(C). Appl. Algebra Engrg. Comm. Comput. , 35(2):253–289, 2024

    work page 2024

  8. [8]

    P. E. Harris, E. Insko, and M. Omar. The q-analog of Kostant’s partition function and the highest root of the simple Lie algebras. Australas. J. Combin. , 71:68–91, 2018

    work page 2018

Show all 19 references
  1. [9]

    P. E. Harris, E. Insko, and A. Simpson. Computing weight q-multiplicities for the representations of the simple Lie algebras. Appl. Algebra Engrg. Comm. Comput. , 29(4):351–362, 2018

    2018

  2. [10]

    P. E. Harris, E. Insko, and L. K. Williams. The adjoint representation of a classical Lie algebra and the support of Kostant’s weight multiplicity formula. J. Comb. , 7(1):75–116, 2016

    2016

  3. [11]

    P. E. Harris and E. L. Lauber. Weight q-multiplicities for representations ofsp4(C). Zh. Sib. Fed. Univ. Mat. Fiz., 10(4):494– 502, 2017

    2017

  4. [12]

    P. E. Harris, M. Loving, J. Ramirez, J. Rennie, G. Rojas Kirby, E. Torres Davila, and F. O. Ulysse. Visualizing the support of Kostant’s weight multiplicity formula for the rank-2 Lie algebras. Involve, 17(2):183–215, 2024

    2024

  5. [13]

    P. E. Harris, M. Rahmoeller, L. Schneider, and A. Simpson. When is the q-multiplicity of a weight a power of q? Electron. J. Combin. , 26(4):Paper No. 4.17, 55, 2019

    2019

  6. [14]

    K. J. Harry. Computing the q-multiplicity of the positive roots of slr+1(C) and products of Fibonacci numbers, 2024

    2024

  7. [15]

    J. E. Humphreys. Reflection groups and Coxeter groups , volume 29 of Cambridge Studies in Advanced Mathematics . Cambridge University Press, Cambridge, 1990

    1990

  8. [16]

    O. F. Inc. A generalization of parking functions with backward movement. The On-Line Encyclopedia of Integer Sequences, 27(1)

  9. [17]

    B. Kostant. A formula for the multiplicity of a weight. Proc. Nat. Acad. Sci. U.S.A. , 44:588–589, 1958. WEYL ALTERNATION SETS ARE ORDER IDEALS 27

    1958

  10. [18]

    G. Lusztig. Singularities, character formulas, and a q-analog of weight multiplicities , volume 101-102 of Ast´ erisque. Soc. Math. France, Paris, 1983

    1983

  11. [19]

    R. P. Stanley. Enumerative combinatorics. Volume 1 , volume 49 of Cambridge Studies in Advanced Mathematics . Cam- bridge University Press, Cambridge, second edition, 2012. (P. X. Anderson) Department of Mathematics, Cornell University, Ithaca, NY 14853 Email address : pxa2@co...

    2012

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.