REVIEW 4 major objections 6 minor 17 references
Cauchy identities for Grothendieck polynomials and a dual RSK correspondence through pipe dreams
T0 review · 4 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read The paper constructs a weight-preserving bijection from super pipe dreams to pairs of pipe dreams, proving the Grothendieck and Schubert Cauchy identities combinatorially.
desk verdict The flow operators and rectification give a genuinely new bijective proof of the Grothendieck Cauchy identities; the core is sound, with compressed application proofs and an openly conjectural dual-RSK link. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the super pipe dream: a placement of finitely many black and red checkers in the half-plane, with the black/red positions recording $x$- and $y$-monomial factors and the union determining a permutation $w$. On this object the paper defines column-flow operators $Y^+_j$, which move red checkers in column $j$ to column $j+1$, and row-flow operators $X^+_i$, which move black checkers in row $i$ to row $i+1$; both are implemented by ladder moves, local rearrangements inside a $k \times 2$ rectangle that are known to preserve the permutation. Iterating the column flow gives $Y^+$, and iterating the row flow gives $X^+$. Rectification applies $Y^+$ repeatedly until every red checker lies northeast of every black checker, then reads off the black pipe dream as $V$ and the shifted red pipe dream as $U$. The identity that makes the whole construction coherent is $\sigma(Y^+) = X^+$, where $\sigma$ shifts positions by $(i,j) \mapsto (i+1,j-1)$; the proof tracks how ladders in the $Y$-flow become chutes (transpose ladders) in the $X$-flow.
What would settle it
Take the running-example super pipe dream from Figures 4 and 7 of the paper, compute $\sigma(Y^+\mathcal{P})$ and $X^+\mathcal{P}$ by the local ladder rules, and compare the two checker configurations; Proposition 5.1 asserts they are identical, so a difference in any single checker is a counterexample. A second check: enumerate all super pipe dreams in $\operatorname{SPD}^+(w)$ for a small permutation such as $w = 2143$, enumerate the right-hand side of the Cauchy identity, and verify that $\operatorname{Rect}$ gives a bijection with the stated $\beta$-weight factor.
Extended reading notes
Core claim
Proposition 6.1 is the central claim: for each permutation $w$, there is a weight-preserving bijection $\operatorname{Rect}$ from the set $\operatorname{SPD}(w)$ of super pipe dreams for $w$ to the disjoint union, over decompositions $w = u^{-1} * v$, of products $\operatorname{PD}(v) \times \operatorname{PD}(u)$, with $\operatorname{wt}(\mathcal{W}) = \beta^{\ell(u)+\ell(v)-\ell(w)} \operatorname{wt}(V) \operatorname{wt}(U^\dagger)$. This is precisely the combinatorial content of the Cauchy identity for Grothendieck polynomials, and specializing $\beta=0$ while restricting to reduced ordinary super pipe dreams gives the classical Cauchy identity for Schubert polynomials. The proof passes through Proposition 5.1, the symmetry $\sigma(Y^+) = X^+$ between column-flow and row-flow operators on arbitrary super pipe dreams. The paper further claims that rectification preserves ordinariness and reducedness, that it satisfies $\operatorname{Rect}(\mathcal{W}^\dagger) = (U, V)$ whenever $\operatorname{Rect}(\mathcal{W}) = (V, U)$, and that specialized to biGrassmannian pipe dreams it yields an insertion algorithm with $dRSK'(A) = (\operatorname{ins}(A), \operatorname{ins}(A^\dagger))$, a variant of dual RSK whose equality with the classical correspondence is left as a conjecture.
Load-bearing premise
The construction stands on the claim that each local flow operation $Y^+_j$ is a bijection on super pipe dreams with a fixed permutation $w$; if the ladder rearrangements failed to preserve the permutation, or if the individual ladders could not be performed independently, rectification would not be well-defined and the Cauchy bijection would collapse.
Editorial extensions
If this is right
- The Cauchy identity for Grothendieck polynomials is proved by an explicit weight-preserving bijection on pipe dreams, so each monomial on either side is paired with a canonical combinatorial witness.
- Restricting rectification to reduced ordinary super pipe dreams gives a bijective proof of the Schubert Cauchy identity, with the length condition $\ell(w)=\ell(u)+\ell(v)$ encoded by the reducedness of the two output pipe dreams.
- Rectification satisfies $\operatorname{Rect}(\mathcal{W}^\dagger)=(U,V)$ when $\operatorname{Rect}(\mathcal{W})=(V,U)$, and this adjoint symmetry is what produces the dual-RSK variant $dRSK'(A)=(\operatorname{ins}(A),\operatorname{ins}(A^\dagger))$.
- The $m$-insertion algorithm on Grassmannian pipe dreams obeys $\operatorname{tab}(I \, m\!\to\! P)=I * \operatorname{tab}(P)$, connecting pipe-dream insertion to the usual multiplication in the tableaux monoid.
- Restricting the same construction to super pipe dreams with one red checker or with all red checkers in the first column gives bijective proofs of the Grothendieck derivative formula and the restricted descent Pieri rule.
Reading between the lines
- If the paper's Conjecture 8.9 is resolved, the pipe-dream map $dRSK'$ will coincide with the classical dual RSK correspondence, upgrading the construction here from a variant to a full bijective proof of dual RSK.
- Rectification as defined always flows red checkers until they are northeast of the black checkers; the symmetric choice of flowing black checkers first, or of stopping after a fixed buffer width, would give intermediate bijections that refine the Cauchy identity by descent sets or inversion data, which the paper does not pursue.
- The flow-operator symmetry $\sigma(Y^+)=X^+$ is strong enough to suggest a local Yang–Baxter-type move on super pipe dream tiles; if such a move exists, the proof should port directly to other pipe-dream models such as factorial or equivariant variants, giving the same Cauchy-type bijections in those settings.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces 'super pipe dreams' (black/red checker diagrams) and local 'flow operators' that move red checkers between columns and black checkers between rows. It states a symmetry theorem X^+ = σY^+ between the two flows, then defines a 'pipe dream rectification' algorithm Rect that separates a super pipe dream into two ordinary pipe dreams. This is used to give a bijective proof of the Cauchy identities for Schubert and Grothendieck polynomials (Theorems 1.1 and 1.2). The final sections apply rectification to obtain derivative formulas, a restricted Pieri rule, an identity for Stanley symmetric functions, a Bergeron–Sottile recurrence, and a pipe-dream incarnation of a dual RSK correspondence.
Significance. If the main construction is correct, this is a valuable contribution: it gives the first bijective proof of the Cauchy identity for Grothendieck polynomials, together with a surprising symmetry between the row-flow and column-flow operators. The paper is genuinely combinatorial and contains many explicit, checkable algorithms and examples. The applications to derivative formulas and to a dual-RSK-type insertion are interesting and attest to the fertility of the framework. However, the entire edifice rests on Proposition 4.1, whose proof is currently a sketch; several later proofs are also compressed. The paper is not yet at the level of rigor required for publication, though the central ideas are promising and the missing details appear to be supplyable.
major comments (4)
- [Section 4.1, proof of Proposition 4.1] This proposition is the foundation for the whole paper, but its proof is not complete. The sentence 'each successive ladder is strictly higher than the previous, so the modifications done to P in each ladder to obtain Q can be performed in any order independent from one another' is asserted without proof. Likewise, the claim that each big-ladder modification 'can be factored as a series of ladder moves' is justified only by 'see Figure 6'. The case analysis also does not exclude the possibility that the NE corner (i', j+1) already contains a black checker; in that situation the red checker is moved onto an occupied tile, and it is not demonstrated that the resulting transformation of the underlying pipe dream is a composition of the ladder moves of Figure 2. Finally, the inverse operator Y^-_{j+1} is not described explicitly. A complete proof of well-definedness, permutation preservation, and bijectivity of Y_j^+ must be supplied.
- [Section 5, proof of Proposition 5.1] The symmetry theorem X^+ = σY^+ is a central and striking claim, and it is used later in Proposition 6.3 and in the dual-RSK section. The proof is long but not fully rigorous. For instance, in Lemma 5.2(i) the text says a checker 'must appear in big ladder during step j + 1 of Y^+P', but the context seems to require 'during step j′', and similar notation slips occur later. More importantly, several implications in Lemmas 5.2 and 5.3 are asserted without detailed justification; for example, in the proof of Lemma 5.2(ii) the contradiction at (i+1,j1) is used to conclude j1 = j without explicitly reviewing all cases that lead to that contradiction. The proof should be expanded, or the symmetry should be split into clearly verified lemmas.
- [Section 6.1, proof of Proposition 6.1] The weight-preservation statement is load-bearing for Theorems 1.1 and 1.2, but the proof only says 'By construction ... so Rect preserves weights in the prescribed way.' This needs an explicit computation showing how the row distribution of black checkers and the column distribution of red checkers transform under (Y^+)^m followed by σ^m, and why the β exponent matches. In addition, the region description 'the red checkers in (Y^+)^mW get flowed into the region {(i,j) | 1 ≤ i + j − 1 < n, i ≥ i0 + m}' appears inconsistent with Proposition 4.3(i), where Y^+ acts as σ^{-1} on a purely red pipe dream and therefore moves red checkers to smaller row indices; please correct the inequality or explain the intended meaning.
- [Section 8.2, Lemma 8.5 and Proposition 8.7] The claim that the insertion algorithm recovers the usual dual RSK insertion tableau rests on the assertion that a long product of Y' operators acts as a series of jeu de taquin slides. The proof of Lemma 8.5 is compressed and contains a typo ('Y'_k' in the proof of part (i) should presumably be 'Y'_1'). In Proposition 8.7, the step saying that the cell moves 'by performing a series of jeu de taquin slides' is stated without demonstration. This section is not needed for the Cauchy identity, but it is one of the paper's advertised applications, so the argument should be made complete or the claim should be weakened to a conjecture.
minor comments (6)
- [Section 4.1] If column j contains no red checker, the definition of Y_j^+P is implicit; please state explicitly that Y_j^+ acts as the identity in that case.
- [Section 5, Lemma 5.2(i)] In the last sentence of the proof of part (i), 'step j + 1 of Y^+P' should be 'step j′ of Y^+P'.
- [Section 6.1, Lemma 6.4] The first sentence of the proof says 'if P = Y^+Q', but the notation introduced just before is 'Q := Y^+P'; the intended statement is 'if Q = Y^+P'.
- [Section 8.2, Proposition 8.7] In the definition of W_i, the expression 'Y'_M Y'_{m-1} ··· Y'_{1-m}' appears to contain a typo; it should presumably read 'Y'_M Y'_{M-1} ··· Y'_{1-m}'.
- [Section 8.2, Proposition 8.6] The word 'preforming' should be 'performing'.
- [Section 8.3] Please clearly separate the proved statement Proposition 8.8 from Conjecture 8.9; as written, the discussion could be read as asserting that dRSK' equals the usual dual RSK correspondence, which is only conditional on the conjecture.
Circularity Check
No significant circularity: the rectification bijection is constructed directly from flow operators and the Cauchy identities are derived by summing weights, not assumed.
full rationale
The paper's central claim is a bijective proof of the Cauchy identities via pipe dream rectification. The construction is self-contained in the relevant sense: Proposition 4.1 defines the local flow operators Y^+_j on the set SPD(w) by explicit ladder modifications and verifies preservation of the permutation by factoring each big-ladder modification into ladder moves, a known external lemma with stated content. Proposition 6.1 then defines Rect by iterating Y^+, and the weight preservation is checked directly by counting black and red checkers; the identity wt(W) = beta^{ell(u)+ell(v)-ell(w)} wt(V) wt(U^dagger) is a consequence of the construction, not an input. Proposition 6.5 and Proposition 6.6 restrict Rect to ordinary and reduced pipe dreams, and the polynomial identities of Theorems 1.1 and 1.2 follow by summing the resulting weights. The cited Cauchy identity for Grothendieck polynomials [4] is used only as motivation and as a naming of the target; it is not used in the proof. The known results invoked (ladder moves, jeu de taquin, the Grassmannian pipe-dream-to-tableau bijection) are external lemmas with explicit statements, not the target identities. The weakest point noted by the skeptic, namely the asserted independence of successive ladder modifications in the proof of Proposition 4.1, is a possible gap in a local verification, but it is not circularity: nothing in that step assumes the Cauchy identity or the rectification bijection. No fitted parameters are renamed as predictions, and no load-bearing self-citation chain is present.
Assumptions & free parameters
assumptions (5)
- standard math Ladder moves and chute moves preserve the permutation of a pipe dream (and reducedness for reduced ladder moves).
- standard math The Demazure algebra relations and the identification of permutations with reduced words in the 0-Hecke algebra.
- standard math Weight-preserving bijection between reduced pipe dreams of Grassmannian permutations and reverse semi-standard Young tableaux (Proposition 8.3, citing [6]).
- standard math Standard properties of jeu de taquin and the Young tableaux monoid, including that the product of column tableaux corresponds to insertion and rectification.
- standard math Stanley symmetric functions are generating functions of stable pipe dreams (Definition 7.7, citing [16]).
Cite this review
Pith. "Pith review of Cauchy identities for Grothendieck polynomials and a dual RSK correspondence through pipe dreams." pith.science (2026). https://pith.science/paper/TACQIIRS
@misc{pith2026250621052,
author = {Pith},
title = {Pith review of: Cauchy identities for Grothendieck polynomials and a dual RSK correspondence through pipe dreams},
year = {2026},
howpublished = {\url{https://pith.science/paper/TACQIIRS}},
note = {Machine review of arXiv:2506.21052}
}
abstract
The Cauchy identity gives a recipe for decomposing a double Grothendieck polynomial $\mathfrak{G}^{(\beta)}_w(x;y)$ as a sum of products $\mathfrak{G}^{(\beta)}_v(x)\mathfrak{G}^{(\beta)}_u(y)$ of single Grothendieck polynomials. Combinatorially, this identity suggests the existence of a weight-preserving bijection between certain families of diagrams called pipe dreams. In this paper, we provide such a bijection using an algorithm called pipe dream rectification. In turn, rectification is built from a new class of flow operators which themselves exhibit a surprising symmetry. Finally, we examine other applications of rectification including an insertion algorithm on pipe dreams which recovers a variant of the dual RSK correspondence.
Figures
Figures from the paper (16 more)
Reference graph
Works this paper leans on
-
[1]
RC-graphs and Schubert polynomials
Nantel Bergeron and Sara C Billey. RC-graphs and Schubert polynomials. Experi- mental Mathematics , 2(4):257–269, 1993
work page 1993
-
[2]
Schubert polynomials, the Bruhat order, and the geometry of flag manifolds
Nantel Bergeron and Frank Sottile. Schubert polynomials, the Bruhat order, and the geometry of flag manifolds. 1998
work page 1998
-
[3]
The Yang–Baxter equation, symmetric func- tions, and Schubert polynomials
Sergey Fomin and Anatol N Kirillov. The Yang–Baxter equation, symmetric func- tions, and Schubert polynomials. Discrete Mathematics, 153(1-3):123–143, 1996
work page 1996
- [4]
-
[5]
Young tableaux: with applications to representation theory and ge- ometry
William Fulton. Young tableaux: with applications to representation theory and ge- ometry. Number 35. Cambridge University Press, 1997
work page 1997
-
[6]
Principal specializations of Schubert polynomials and pattern containment
Yibo Gao. Principal specializations of Schubert polynomials and pattern containment. European Journal of Combinatorics , 94:103291, 2021
work page 2021
-
[7]
Derivatives of Schubert polynomials and proof of a determinant conjecture of Stanley
Zachary Hamaker, Oliver Pechenik, David E Speyer, and Anna Weigandt. Derivatives of Schubert polynomials and proof of a determinant conjecture of Stanley. Algebraic Combinatorics, 3(2):301–307, 2020
work page 2020
-
[8]
Gr¨ obner geometry of Schubert polynomials
Allen Knutson and Ezra Miller. Gr¨ obner geometry of Schubert polynomials. Annals of Mathematics , pages 1245–1318, 2005
work page 2005
Show all 17 references
-
[9]
Classes de Chern des vari´ et´ es de drapeaux
Alain Lascoux. Classes de Chern des vari´ et´ es de drapeaux. C. R. Acad. Sci. Paris S´ er. I Math., 295(5):393–398, 1982
1982
-
[10]
Polynˆ omes de Schubert
Alain Lascoux and Marcel-Paul Sch¨ utzenberger. Polynˆ omes de Schubert. Comptes Rendus de l’Acad´ emie des Sciences. S´ erie I, 294:447–450, 1982
1982
-
[11]
Structure de Hopf de l’anneau de cohomologie et de l’anneau de Grothendieck d’une vari´ et´ e de drapeaux
Alain Lascoux and Marcel-Paul Sch¨ utzenberger. Structure de Hopf de l’anneau de cohomologie et de l’anneau de Grothendieck d’une vari´ et´ e de drapeaux. CR Acad. Sci. Paris S´ er. I Math., 295(11):629, 1982
1982
-
[12]
Symmetry and flag manifolds
Alain Lascoux and Marcel-Paul Sch¨ utzenberger. Symmetry and flag manifolds. In Invariant theory (Montecatini, 1982) , volume 996 of Lecture Notes in Math. , pages 118–144. Springer, Berlin, 1983
1982
-
[13]
Notes on Schubert polynomials
Ian G Macdonald. Notes on Schubert polynomials . Laboratorie de combinatoire et d’informatique math´ ematique (LACIM), Universit´ e du Qu´ ebec ` a Montr´ eal, 1991. 35
1991
-
[14]
Schubert polynomial expansions revisited
Philippe Nadeau, Hunter Spink, and Vasu Tewari. Schubert polynomial expansions revisited. arXiv preprint arXiv:2407.02375 , 2024
2024 arXiv
-
[15]
Castelnuovo–Mumford regu- larity of matrix Schubert varieties
Oliver Pechenik, David E Speyer, and Anna Weigandt. Castelnuovo–Mumford regu- larity of matrix Schubert varieties. Selecta Mathematica, 30(4):66, 2024
2024
-
[16]
On the number of reduced decompositions of elements of Coxeter groups
Richard P Stanley. On the number of reduced decompositions of elements of Coxeter groups. European Journal of Combinatorics , 5(4):359–372, 1984
1984
-
[17]
Mitosis algorithm for Grothendieck polynomials
DN Tyurin. Mitosis algorithm for Grothendieck polynomials. Journal of Combinato- rial Theory, Series A , 154:32–48, 2018. 36
2018
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.