Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Lowering operators on $K$-$k$-Schur functions and a lowering operator formula for closed $K$-$k$-Schur functions

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

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

Pith's one-line read The paper proves that a sum of lowering operators acting on a K-k-Schur function reproduces the closed K-k-Schur function, and uses this to give a combinatorial proof of the closed k-Schur Katalan conjecture.

desk verdict New lowering-operator formula for closed K-k-Schur functions, but the proof of Claim 4.6 assumes without proof that the reachable set equals the full Bruhat interval. read the letter →

arxiv 2502.05618 v1 pith:LSYUBXWJ submitted 2025-02-08 math.CO math.AG

Yaozhou Fang , Xing Gao , Li Guo This is my paper · ORCID
classification math.COmath.AG MSC 05E0505E1014N15
keywords symmetricfunctionsK-k-SchurclosedloweringoperatorsKatalanBruhatorderaffineSchubertcalculusK-theory
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

The paper establishes a lowering-operator formula for closed K-$k$-Schur functions: for every $k$-bounded partition $\lambda$, summing all lowering-operator products supported on a certain subset $[\ell]_\lambda$ applied to the K-$k$-Schur function $g^{(k)}_\lambda$ reproduces the closed K-$k$-Schur function $\sum_{\mu \in P^k_\ell,\, w_\mu \le w_\lambda} g^{(k)}_\mu$, where $\le$ is Bruhat order. The formula turns a Bruhat-interval sum of many symmetric functions into a single operator expression, so closed functions inherit the same lowering-operator calculus that defines Katalan functions. A direct consequence is a combinatorial proof of the closed $k$-Schur Katalan conjecture, previously established by a different method. A reader should care because the paper locates the closed functions inside the operator mechanics of Katalan functions, making the K-theoretic Schubert representatives computable from root-ideal data alone.

What carries the argument

The machinery is the Katalan-function calculus introduced in [2]. A Katalan function $K(\Psi;M;\gamma)$ is built from a root ideal $\Psi$, a multiset $M$ of lowering operators, and an integer vector $\gamma$ by applying $\prod_{z\in M}(1-L_z)\prod_{(i,j)\in\Psi}(1-R_{ij})^{-1}$ to $g_\gamma$, and the K-$k$-Schur function $g^{(k)}_\lambda$ is the special case $K(\Delta_k(\lambda);\Delta_{k+1}(\lambda);\lambda)$. The paper's workhorse is a structural analysis, Theorem 3.18 and Corollary 3.21, of $L_z^n g^{(k)}_\lambda$: after straightening via the Mirror Lemma and the Mirror Straightening Lemma, each power reduces to a positive sum of K-$k$-Schur functions indexed by the sets $\Omega_{\lambda,z}$, with a remainder term that telescopes once one sums over $n$. The closed-function formula then follows from a recursive bookkeeping device, the sets $\Gamma^i_{\nu^i}$, which repeatedly removes the forbidden ``down'' columns and re-expresses sums over multisets supported there; Bruhat order enters through Proposition 4.4, which shows every partition produced by the lowering recursion lies in the interval below $\lambda$.

What would settle it

In a small explicit case, expand both sides of Theorem 4.5 in the Schur basis and compare coefficients; a mismatch falsifies the theorem. To target the weak point directly, enumerate the $\Gamma$-recursion for a small $\lambda$ and check that every $\mu$ with $w_\mu \le w_\lambda$ appears in the union of the recursively generated sets; any missing $\mu$ refutes the reverse inclusion used at equations (96) and (98).

Watch

Extended reading notes

Core claim

The central claim is Theorem 4.5: for $\lambda \in P^k_\ell$, $$\sum_{\operatorname{supp}(S) \subseteq [\ell]_\$\lambda$} L_S $g^{{(k)}}$_\$\lambda$ = \sum_{\mu \in P^k_\ell,\, w_\mu \le w_\$\lambda$} $g^{{(k)}}$_\mu.$$ Here $L_S$ is a product of lowering operators $L_z$, each of which acts on the determinant representative $g_\gamma$ by sending $\gamma$ to $\gamma-\varepsilon_z$, and the support restriction $[\ell]_\lambda$ excludes the columns $\operatorname{down}_{\Delta_k(\lambda)}(z)$ singled out by the root ideal $\Delta_k(\lambda)$. The right-hand side is the closed K-$k$-Schur function. The paper then derives Theorem 1.2, $\widetilde{g}^{(k)}_\lambda = (1 - G_1^\perp)\left(\sum_{\mu: w_\mu \le w_\lambda} g^{(k)}_\mu\right)$, from this identity and the elementary identity $1 - G_1^\perp = \sum_{d \ge 0} e_d^\perp$, giving a purely combinatorial proof of the closed $k$-Schur Katalan conjecture that had recently been proved by another route.

Load-bearing premise

The proof assumes that every partition whose associated affine permutation lies weakly below $\lambda$'s is actually reached by the recursive lowering process; only the reverse direction—that everything reached lies below—is proved, and the unproved direction is the one that identifies the generated set with the full Bruhat interval.

Editorial extensions

If this is right

  • The closed K-k-Schur function can be computed by iterating lowering operators on a single function, without summing over a Bruhat interval, making the K-homology representatives algorithmically accessible from root-ideal data.
  • Theorem 1.2 follows as an immediate corollary, so the formerly conjectural closed k-Schur Katalan formula now has a proof inside the same lowering-operator calculus that defines the functions.
  • The identity is manifestly positive as a sum over multisets, indicating that closed K-k-Schur functions carry a positive combinatorial model in terms of lowering paths.
  • The support condition $\operatorname{supp}(S) \subseteq [\ell]_\lambda$ gives a root-ideal characterization of which lowering columns generate the Bruhat interval, connecting affine Bruhat order to data attached to $\Delta_k(\lambda)$.

Reading between the lines

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

  • The reverse-inclusion gap suggests the $\Gamma$-recursion may be more generous than necessary; a smaller generating set of multiset supports might already saturate the Bruhat interval, which would simplify the algorithm.
  • Since the straightening propositions in Section 3 already operate on the generalized set $\widetilde{P}^k_\ell$, the same lowering-operator formula may hold for generalized K-k-Schur functions indexed by $\widetilde{P}^k_\ell$, not only by $k$-bounded partitions.
  • Interpreting the multiset sum as a path count would define a statistic on Bruhat intervals of $k$-bounded partitions, with the multiplicity of each $g^{(k)}_\mu$ counting lowering-path ways to reach $\mu$ from $\lambda$.
  • The telescoping step in Corollary 3.21 relies only on the vanishing of high powers of lowering operators, so the argument may adapt to inhomogeneous variants where $(1-G_1^\perp)$ is replaced by other alternating sums of $e_d^\perp$.
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 / 5 minor

Summary. The paper develops a systematic study of lowering operators L_z acting on K-k-Schur functions g^{(k)}_λ, for λ in P^k_ℓ. The main technical result is Theorem 3.18, a recursive formula expressing L_z^n g^{(k)}_λ as a sum of K-k-Schur functions indexed by sets Ω_{λ,z}, together with a telescoping refinement in Corollary 3.21. These tools are then used to prove Theorem 4.5 (Theorem 1.1): the sum of lowering operators ∏_{z∈S} L_z applied to g^{(k)}_λ over all multisets S with support in [ℓ]_λ equals the closed K-k-Schur function, i.e., the sum of g^{(k)}_μ over μ in the Bruhat interval w_μ ≤ w_λ. As an application, the paper gives a new proof of Theorem 1.2, originally due to Ikeda, Iwao and Naito, expressing the closed k-Schur Katalan function as (1 - G_1^⊥) applied to that Bruhat-interval sum. The proof of Theorem 4.5 is long and is mostly built from the cited Mirror Lemmas of Blasiak–Morse–Seelinger, but the key step Claim 4.6 contains a load-bearing surjectivity assertion that is not proved.

Significance. If the proof can be completed, the result would be valuable: it gives an explicit lowering-operator formula for closed K-k-Schur functions and a combinatorial route to a theorem previously proved by different methods in [8]. The paper contains no fitted parameters and relies on established Katalan-function machinery; the main claimed identity is a genuine new statement. The proof strategy is plausible and the combinatorial structures (Ω_{λ,z}, Γ sets, Bruhat intervals) are natural. However, the gap identified in Claim 4.6 affects the central theorem, so the significance is conditional on repairing that argument.

major comments (3)
  1. [§4.2, Claim 4.6, equations (96) and (98)] The proof of Claim 4.6 replaces sums over the sets Ω_{ν(0),{z}^n} by sums over the full Bruhat interval {μ ∈ P^k_ℓ : w_μ ≤ w_{ν(0)}} with the citation "by Proposition 4.4". Proposition 4.4 proves only the forward inclusion: if ν ∈ Ω_{λ,z}, then w_ν < w_λ. It does not prove the reverse inclusion that every μ with w_μ ≤ w_λ lies in the union over n of Ω_{λ,{z}^n}, nor that the iterative Γ process reaches every element of the Bruhat interval. This surjectivity is exactly what is needed to justify equation (96) and the base case of (98), and without it equation (84) may assert equality only with a proper sub-sum of the Bruhat interval. The gap is load-bearing for Theorem 4.5 and, through it, Theorem 1.2. A proof of the reverse inclusion, perhaps from strong-cover properties such as Lemma 4.2, is required.
  2. [§4.1, proof of Proposition 4.4] The final containment step of Proposition 4.4 reads "c(ν)[1,z-1] ⊊ c(λ)[1,z-1] ⇒ c(ν) ⊊ c(λ) (by c(ν)[z,ℓ] ⊊ c(λ)[z,ℓ])". The second containment c(ν)[z,ℓ] ⊊ c(λ)[z,ℓ] is asserted without proof; the preceding sentence says it follows from w_{ν'} < w_λ, (74), and the effect of -ǫ[z,z_a-1], but the argument is not written out and is not transparent. Since Proposition 4.4 is the only bridge between the combinatorially defined sets Ω and the Bruhat order, this step needs a rigorous justification.
  3. [§4.2, equations (79) and (83)] The definition of the sets Γ^i_{ν^i_{(j)}} depends on choices of z ∈ Z_{i,j} and of ν^i_{(j)} ∈ Ω_{ν^i_{(j-1)}, z}; it is not proved that the choices can be made so that the process runs for all i ∈ [0,r] and yields nonempty Γ^i at each step. The proof of (83) only examines the initial Γ^i_{ν^i_{(0)}}; for the updated sets after applying (79), the cardinality statement is argued in Case 2 via (91), but the case analysis is not fully exhaustive because the proof of (87) assumes the specific identity (91) without treating possible coincidences or empty intersections in the interval [1, down_{Δ_k(ν(0))}(z)-1]. These details need to be supplied for Claim 4.6 to be complete.
minor comments (5)
  1. [Throughout] There are numerous OCR-type typographical errors, e.g., "nelement" for "∉" in Definition 2.7(d) and elsewhere, "gk" for "g^{(k)}" in several displayed equations, and "fomula" in the title of reference [21]. The paper should be carefully proofread.
  2. [§1.3 and §2] The notation [ℓ]_λ is introduced only in (75), but it is used implicitly in the introduction and in Theorem 1.1; the paper would be easier to read if the definition were moved earlier or if the introduction included a pointer to (75).
  3. [§3.3, Example 3.20] The example is helpful but the subscript notation for partitions of length 10 is unwieldy; a Young-diagram or abbreviated notation, as used in the displayed grid, would improve readability.
  4. [§4.3, equation (102)] The line "(1 - e_1^⊥ + e_2^⊥ + ⋯ + (-1)^ℓ e_ℓ^⊥)" is correct but could be written as ∑_{d=0}^ℓ (-1)^d e_d^⊥ to avoid ambiguity about the signs in the displayed sum.
  5. [References] The reference [3] is to the authors' own previous preprint arXiv:2501.04200; since results from [3] (e.g., Proposition 2.10 used in Corollary 3.21) are load-bearing, the paper should state explicitly which facts are quoted from that preprint and whether they are available in a peer-reviewed form.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the main lowering-operator formula is a new identity built from the Katalan-function calculus; the unproved reverse inclusion in Claim 4.6 is a proof gap, not a circular reduction.

full rationale

The central theorem (Theorem 4.5 / 1.1) is a new identity comparing a sum of lowering-operator products applied to a K-k-Schur function with a Bruhat-interval sum of K-k-Schur functions. Its proof is built from the Katalan-function calculus of Blasiak–Morse–Seelinger [2] (Mirror Lemmas, K-k-Schur realizations) and from the paper's own Theorems 3.8, 3.15 and 3.18, which express powers of lowering operators as explicit sums over the sets Omega_{lambda,z}. No fitted parameter is introduced, no known result is renamed, and the target closed K-k-Schur formula is not used as an input. The only self-citation is to the authors' prior preprint [3] for a vanishing lemma used to truncate infinite sums in Corollary 3.21; this is auxiliary and does not make the central formula equivalent to its input. A separate correctness concern, not circularity, is that in the proof of Claim 4.6, equations (96) and (98) replace the unions of the Omega-sets by the full Bruhat interval while citing Proposition 4.4, which only establishes the forward inclusion (nu in Omega_{lambda,z} implies w_nu < w_lambda); the required reverse surjectivity is not proved. This is a potential gap in the derivation chain, but it is not a definitional equivalence, a fitted-input-as-prediction, or a self-citation that forces the result. Hence the circularity score is low.

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

No free parameters or invented entities are introduced. The proof leans on prior foundational results, mostly from [2], and one self-cited fact from [3]. The main novelty is the new operator identity, not a new object.

assumptions (4)
  • domain assumption The Katalan function framework and the two Mirror Lemmas (Lemmas 2.8 and 2.9) from [2] are correct.
    The proofs of Propositions 3.3, 3.9, 3.10 and later results repeatedly invoke Lemmas 2.8 and 2.9 as black boxes.
  • domain assumption The Bruhat order to core bijection and strong cover characterization from [1, Proposition 8.10] and [15] hold.
    Lemma 4.2 is cited to prove Proposition 4.4, which underpins the main theorem.
  • domain assumption Lowering operators commute and annihilate for sufficiently large powers, as stated in [3, Proposition 2.10].
    Corollary 3.21 and the proof of Theorem 4.5 use these facts to telescope sums and to justify that sums over infinitely many multisets are finite. [3] is the authors' own earlier preprint.
  • standard math The identity 1 - G_1^perp = sum_{d>=0} e_d^perp from [20] and the commutation of e_d^perp with L_z hold.
    These are used in the proof of Theorem 1.2, around equations (4) and (102).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Lowering operators on $K$-$k$-Schur functions and a lowering operator formula for closed $K$-$k$-Schur functions." pith.science (2026). https://pith.science/paper/LSYUBXWJ

@misc{pith2026250205618,
  author       = {Pith},
  title        = {Pith review of: Lowering operators on $K$-$k$-Schur functions and a lowering operator formula for closed $K$-$k$-Schur functions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LSYUBXWJ}},
  note         = {Machine review of arXiv:2502.05618}
}
abstract

This paper gives a systematic study of the lowering operators acting on the $K$-$k$-Schur functions, motivated by the pivotal role played by the operators in the definition and study of Katalan functions. A lowering operator formula for closed $K$-$k$-Schur functions is obtained. As an application, a combinatorial proof is provided to a conjecture on closed $k$-Schur Katalan functions, posed by Blasiak, Morse and Seelinger, and recently proved by Ikeda, Iwao and Naito by a different method.

Figures

Figures reproduced from arXiv: 2502.05618 by the authors.

Figure 1
Figure 1. z z + 1 y1 • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • • [PITH_FULL_IMAGE:figures/full_fig_p008_1.png] view at source ↗

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. Weighted $K$-$k$-Schur functions and their application to the $K$-$k$-Schur alternating conjecture

    math.CO 2025-07 accept novelty 7.0 of 10

    Weighted K-k-Schur functions interpolate between two known Katalan function families, and their recursive expansion proves the K-k-Schur alternating conjecture for partitions whose first b_lambda parts are strictly de...

Reference graph

Works this paper leans on

21 extracted references · 20 canonical work pages · cited by 1 Pith paper

  1. [3]

    Y . Z. Fang and X. Gao, Alternating dual Pieri rule conject ure and k-branching conjecture of closed k-Schur Katalan functions, arXiv:2501.04200. 2, 8, 28

    arXiv

  2. [8]

    Ikeda, S

    T. Ikeda, S. Iwao and S. Naito, Closed k-Schur Katalan functions as K-homology Schubert representatives of the affine Grassmannian, Trans. Amer . Math. Soc.11 (2024), 667-702. 3, 4, 40

    work page 2024

  3. [1]

    Blasiak, J

    J. Blasiak, J. Morse, A. Pun and D. Summers, Catalan funct ions and k-schur positivity, J. Amer . Math. Soc.32 (2019), 921-963. 2, 4, 6, 8, 10, 30

    work page 2019

  4. [2]

    Blasiak, J

    J. Blasiak, J. Morse and G. H. Seelinger, K-theoretic Catalan functions, Adv. Math. 404 (2022), p.108421. 2, 3, 4, 5, 6, 7, 8, 39

    work page 2022

  5. [4]

    Fomin and A

    S. Fomin and A. N. Kirillov, Grothendieck polynomials an d the Y ang-Baxter equation, Proc. F ormal Power Series and Alg. Comb. (1994), 183-190. 3

    work page 1994

  6. [5]

    Fomin and A

    S. Fomin and A. N. Kirillov, The Y ang-Baxter equation, sy mmetric functions, and Schubert polynomials, Discrete Math. 153 (1996), 123-143. 3

    work page 1996

  7. [6]

    Hilbert, Mathematical problems, Bull

    D. Hilbert, Mathematical problems, Bull. Amer . Math. Soc.8 (1902), 437-479. 2

    work page 1902

  8. [7]

    Ikeda, S

    T. Ikeda, S. Iwao and T. Maeno, Peterson isomorphism in K-theory and relativistic Toda lattice, Intern. Math. Res. Not. 2020 (2020), 6421-6462. 3

    work page 2020

Show all 21 references
  1. [9]

    T. Lam, L. Lapointe, J. Morse, A. Schilling, M. Shimozono and M. Zabrocki, k-Schur functions and a ffine Schubert calculus, Fields Institute Monographs 33 Springer/Fields Institute for Research in Mathematical Sciences, (2014). 2, 29

    2014

  2. [10]

    T. Lam, A. Schilling and M. Shimozono, K-theory Schubert calculus of the a ffine Grassmannian, Compos. Math. 146 (2010), 811-852. 2

    2010

  3. [11]

    Lam and M

    T. Lam and M. Shimozono, From quantum Schubert polynomi als to k-Schur functions via the Toda lattice, Math. Res. Lett. 19 (2012), 81-93. 3

    2012

  4. [12]

    Lapointe and J

    L. Lapointe and J. Morse, Schur function analogs for a fil tration of the symmetric function space, J. Combinat. Theo. A 101 (2003), 191-224. 4

    2003

  5. [13]

    Lapointe and J

    L. Lapointe and J. Morse, Tableaux on k + 1-cores, reduced words for a ffine permutations, and k-Schur expan- sions, J. Combinat. Theo. A 112 (2005), 44-81. 3, 29

    2005

  6. [14]

    Lascoux, Anneau de Grothendieck de la vari´ et´ e de dr apeaux, in: The Grothendieck Festschrift, V ol

    A. Lascoux, Anneau de Grothendieck de la vari´ et´ e de dr apeaux, in: The Grothendieck Festschrift, V ol. III, Progr . Math., V ol. 88, Birkh¨auser (1990), 1-34. 3

    1990

  7. [15]

    A. Lascoux, Ordering the a ffine symmetric group, in: Algebraic Combinatorics and Applications: Proceedings of the Euroconference, Algebraic Combinatorics and Applic ations (ALCOMA), Springer (2001), 219-231. 3, 4, 29, 30

    2001

  8. [16]

    Lenart, Combinatorial aspects of the K-theory of Grassmannians, Ann

    C. Lenart, Combinatorial aspects of the K-theory of Grassmannians, Ann. Comb. 4 (2000), 67-82. 4

    2000

  9. [17]

    K. C. Misra and T. Miwa, Crystal base for the basic repres entation of Uq(ˆsl(n)), Comm. Math. Phys. 134 (1990), 79-88. 30

    1990

  10. [18]

    Morse, Combinatorics of the k-theory of a ffine grassmannians, Adv

    J. Morse, Combinatorics of the k-theory of a ffine grassmannians, Adv. Math. 229 (2012), 2950-2984. 2

    2012

  11. [19]

    Schubert, Kalk¨ ul der abz¨ ahlenden Geometrie (German) (Calculus of enumerative geometry)

    H. Schubert, Kalk¨ ul der abz¨ ahlenden Geometrie (German) (Calculus of enumerative geometry). Reprint of the 1879 original. With an introduction by Steven L. Kleiman (Sp ringer, Berlin/New Y ork, 1979), p. 349. 2

    1979

  12. [20]

    Takigiku, Automorphisms on the ring of symmetric fun ctions and stable and dual stable Grothendieck polynomials, arXiv:1808.02251

    M. Takigiku, Automorphisms on the ring of symmetric fun ctions and stable and dual stable Grothendieck polynomials, arXiv:1808.02251. 3

    arXiv

  13. [21]

    Takigiku, A Pieri formula and a factorization fomula for sums of K-theoretic k-Schur functions, Algebraic Combinatorics 2 (2019), 447-480

    M. Takigiku, A Pieri formula and a factorization fomula for sums of K-theoretic k-Schur functions, Algebraic Combinatorics 2 (2019), 447-480. 2 School of Mathematics and Statistics, Lanzhou University Lanzhou, 730000, China Email address: fangyzh21@lzu.edu.cn School of Mathema...

    2019

Pith tools

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