{"id":"56049102-daae-45d7-a373-5e57e924ebd9","arxiv_id":"2506.21052","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new algorithm, pipe dream rectification, bijectively realizes the Cauchy identities for Grothendieck polynomials and leads to a pipe-dream version of dual RSK insertion.","lead":"This paper constructs a bijection, called pipe dream rectification, that splits a super pipe dream into two ordinary pipe dreams, giving a new combinatorial proof of the Cauchy identities for Schubert and Grothendieck polynomials. The same machinery yields a pipe-dream insertion algorithm that recovers a variant of the dual RSK correspondence.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The local flow operator Prop. 4.1 is the load-bearing foundation: its proof assumes without proof that successive ladder modifications are independent and delegates the local permutation-preservation check to Figure 6, so Prop. 6.1 and the Cauchy bijections inherit this risk.","rationale":"I read the paper in good faith. The intended construction is original and the overall architecture is coherent: flow operators separate red and black checkers, rectification then reads off two single pipe dreams, and the weight computation in Prop. 6.1 is natural. The known Cauchy identities are external, so the paper's new claim is the bijection itself, and that claim rests on the local flow operators of Prop. 4.1. The reader's weakest_assumption identifies exactly this point, and I agree that it is the most load-bearing step. I did not find an internal inconsistency, and the construction is plausible, but the proof of Prop. 4.1 is not fully formal: the independence of successive ladders and the factorization of a big-ladder modification into ladder moves are asserted rather than demonstrated. Since no formal verification is provided, a targeted computational check of Prop. 4.1 on small examples is the right way to settle whether the central bijection is sound. If such a check passes, the conditional verdict can be upgraded; if it fails, the main theorem collapses. Thus the reader's CONDITIONAL verdict remains appropriate and no change is needed.","tokens_in":25157,"tokens_out":36164,"duration_ms":427625,"concrete_test":"Implement the Y^+_j algorithm exactly as specified in Prop. 4.1 and exhaustively enumerate all super pipe dreams with up to 4 black and 4 red checkers in a 6-by-6 window inside H, for all w in S_4. For every input in the stated domain, verify: (1) the algorithm terminates; (2) the resulting Q satisfies ∂(Q) = ∂(P) in the Demazure algebra; (3) the map is a bijection onto the stated codomain by applying the reverse ladder process and checking that Y^-_{j+1} is the inverse; and (4) the 'successive ladders independent' assertion by recomputing the final Q after permuting the order of the ladder modifications. Additionally, independently factor the big-ladder move of Figure 6 into explicit 2-ladder moves and check Demazure-product preservation at each step. A counterexample to any one of these checks would invalidate Prop. 6.1.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central construction is pipe dream rectification (Prop. 6.1), which is built entirely from the flow operators Y^+_j. In the proof of Prop. 4.1, the decisive step is 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.' This independence is asserted rather than proved, and the claim that a single big-ladder modification is a composition of ladder moves is justified only by 'see Figure 6', with no explicit verification in the text. In particular, the local rule can move a red checker from the SW corner of a ladder to a NE corner that already contains a black checker, and it is not shown that this operation, together with the intermediate-row swaps, is a genuine sequence of ladder moves preserving the Demazure product. If this fails, Y^+_j need not preserve the permutation w, and then rectification is not well-defined on SPD(w), the weight-preserving bijection of Prop. 6.1 collapses, and the bijective proof of the Cauchy identities (Theorems 1.1 and 1.2) loses its foundation. This is therefore the single most load-bearing step of the paper.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":25381,"tokens_out":28064,"duration_ms":320876,"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":[{"comment":"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":"Section 4.1, proof of Proposition 4.1"},{"comment":"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":"Section 5, proof of Proposition 5.1"},{"comment":"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":"Section 6.1, proof of Proposition 6.1"},{"comment":"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.","section":"Section 8.2, Lemma 8.5 and Proposition 8.7"}],"minor_comments":[{"comment":"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":"Section 4.1"},{"comment":"In the last sentence of the proof of part (i), 'step j + 1 of Y^+P' should be 'step j′ of Y^+P'.","section":"Section 5, Lemma 5.2(i)"},{"comment":"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":"Section 6.1, Lemma 6.4"},{"comment":"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":"Section 8.2, Proposition 8.7"},{"comment":"The word 'preforming' should be 'performing'.","section":"Section 8.2, Proposition 8.6"},{"comment":"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.","section":"Section 8.3"}],"recommendation":"major_revision","confidential_remarks":"The paper's central idea is attractive and the overall program is promising, but Proposition 4.1 is the load-bearing foundation and its proof is currently too sketchy for a rigorous journal. I do not see a fatal obstruction, and the missing details appear to be local and likely repairable, so my recommendation is major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"I just read the Dennin paper on Cauchy identities for Grothendieck polynomials. The headline: the core construction is new and, as far as I can tell, sound. The flow operators Y+_j and X+_i, the symmetry theorem X+ = sigma Y+, and the rectification algorithm are original. This is the first explicit bijective proof of the known Cauchy identities via super pipe dreams, and it earns that claim.\n\nWhat it does well: the weight-preserving bijection in Prop. 6.1 is clean, the proof of the symmetry theorem (Prop. 5.1) is substantial, and the applications—derivative formula, restricted-descent Pieri rule, Stanley symmetric function identity, Bergeron–Sottile recurrence—are natural and mostly convincing. The paper is honest about what is proven and what isn't: Conjecture 8.9 is flagged as a conjecture, so the 'dual RSK' is explicitly a variant rather than the full correspondence. Citations look appropriate; the known Cauchy identity is attributed to Fomin–Kirillov and the broader pipe-dream literature is covered.\n\nThe soft spots are real but concentrated. The proof of Prop. 4.1, the local flow operator, is compressed. The stress-test worry about independence of successive ladder modifications is understandable but I don't think it is fatal: the ladders occupy disjoint row intervals, so 'any order' follows, and the factorization of a big-ladder modification into ladder moves is shown in Figure 6. Still, the text could spell this out; as written, the reader has to trust the figure. The more genuine weaknesses are in the application sections: Prop. 7.3 says a bijective proof 'can be obtained by iterating' but doesn't carry it out, and Prop. 7.10 hand-waves with 'routine to verify'. Neither is load-bearing for the main Cauchy bijection, but they make the paper feel less finished than it should be. There are also a few cross-reference typos, e.g. 'Prop 8.5' where Lemma 8.5 is meant.\n\nWho this is for: algebraic combinatorists working on Schubert calculus, pipe dreams, or RSK correspondences. The main bijection deserves serious scrutiny; the compressed proofs are a reason for revision, not rejection. I'd send it to a good referee.","headline":"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.","tokens_in":25933,"tokens_out":5410,"would_cite":true,"duration_ms":52248,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E05","05E10","05A19"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper constructs a weight-preserving bijection from super pipe dreams to pairs of pipe dreams, proving the Grothendieck and Schubert Cauchy identities combinatorially.","keywords":["Grothendieck polynomials","Schubert polynomials","pipe dreams","super pipe dreams","Cauchy identity","rectification","dual RSK correspondence","Young tableaux"],"falsifier":"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.","tokens_in":24915,"feed_emoji":"🧩","tokens_out":12347,"duration_ms":121660,"temperature":0.7,"pith_summary":"The paper's aim is to turn the Cauchy identity for double Grothendieck polynomials—which expresses a double polynomial as a sum of products of single Grothendieck polynomials—into an explicit combinatorial bijection. It constructs an algorithm, pipe dream rectification, that takes a super pipe dream (a pipe dream whose crossings are colored black and red) for a permutation $w$ and outputs two ordinary pipe dreams for permutations $u$ and $v$ with $w = u^{-1} * v$, preserving the $\\beta$-weighted monomial weight. The engine is a new family of flow operators that move red crossings to the right and black crossings downward; the structural discovery is the symmetry $\\sigma(Y^+) = X^+$, which makes rectification compatible with the adjoint involution and forces the correct weight factor. Because rectification preserves the ordinary and reduced conditions, it yields bijective proofs of both the Grothendieck and Schubert polynomial Cauchy identities. The same machinery also produces bijections for derivative formulas, a restricted Pieri rule, and an insertion algorithm that recovers a variant of the dual RSK correspondence.","feed_headline":"Pipe dreams yield bijective proof of the Grothendieck Cauchy identity","feed_subtitle":"A weight-preserving algorithm on pipe dreams proves the identity and recovers dual RSK","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"states the Grothendieck Cauchy identity (Theorem 1.2) and gives the beta-parameter pipe dream model that rectification acts on.","marker":"[4]"},{"why":"provides the original pipe dream (RC-graph) model and the ladder moves used to show the flow operators preserve the permutation.","marker":"[1]"},{"why":"supplies the Yang–Baxter pipe dream formalism and the word/permutation conventions that define the permutation of a pipe dream.","marker":"[3]"},{"why":"introduces double Schubert polynomials, whose Cauchy identity is the object of Theorem 1.1.","marker":"[9]"},{"why":"defines Schubert polynomials, recovered from Grothendieck polynomials by specializing $\\beta=0$.","marker":"[10]"}],"fun_headline_variants":["Rectifying pipe dreams proves Grothendieck Cauchy identity","Weight-preserving pipe dream bijection for Cauchy identity","Pipe dream flow symmetry yields Cauchy identity proof","New pipe dream algorithm proves Cauchy identity","Pipe dream rectification: bijective proof of Cauchy identity"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Rectifying pipe dreams proves Grothendieck Cauchy identity","Weight-preserving pipe dream bijection for Cauchy identity","Pipe dream flow symmetry yields Cauchy identity proof","New pipe dream algorithm proves Cauchy identity","Pipe dream rectification: bijective proof of Cauchy identity"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000301,"raw_usage":{"total_tokens":1754,"prompt_tokens":979,"completion_tokens":775,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":595,"completion_tokens_details":{"reasoning_tokens":702}},"tokens_in":595,"tokens_out":775,"duration_ms":7940,"temperature":1.0,"reasoning_tokens":702,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T22:34:37.697368+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"Kirillov","cited_arxiv_id":null,"evidence_quote":"states the Grothendieck Cauchy identity (Theorem 1.2) and gives the beta-parameter pipe dream model that rectification acts on."},{"cited_title":"RC-graphs and Schubert polynomials","cited_arxiv_id":null,"evidence_quote":"provides the original pipe dream (RC-graph) model and the ladder moves used to show the flow operators preserve the permutation."},{"cited_title":"The Yang–Baxter equation, symmetric func- tions, and Schubert polynomials","cited_arxiv_id":null,"evidence_quote":"supplies the Yang–Baxter pipe dream formalism and the word/permutation conventions that define the permutation of a pipe dream."},{"cited_title":"Classes de Chern des vari´ et´ es de drapeaux","cited_arxiv_id":null,"evidence_quote":"introduces double Schubert polynomials, whose Cauchy identity is the object of Theorem 1.1."},{"cited_title":"Polynˆ omes de Schubert","cited_arxiv_id":null,"evidence_quote":"defines Schubert polynomials, recovered from Grothendieck polynomials by specializing $\\beta=0$."}],"review_version":1}