{"id":"83fbfe13-d188-4337-95ef-e006f1083a4e","arxiv_id":"2507.13214","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every chute move poset of reduced pipe dreams is a lattice, it is isomorphic to a Lehmer tableaux poset, and it is semidistributive and polygonal with diamonds or pentagons as polygons.","lead":"The authors prove a 2012 conjecture by Rubey: for every permutation, the reduced pipe dreams ordered by chute moves form a lattice. They reach this by showing the chute-move order is the same as the componentwise order on Lehmer tableaux, and they prove the lattice is semidistributive with only diamond or pentagon intervals.","discovery_kind":"unification","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The lattice proof depends on unproved companion-paper results [1] and an asserted transpose anti-isomorphism; if either fails, Theorem 1.1 loses its foundation.","rationale":"The reader's weakest_assumption correctly identifies the companion-paper results [1] as the main external dependency. The stress-test pass found the same load-bearing concern, plus a secondary unproved assertion (the transpose anti-isomorphism) that is used in several places. Neither concern is an internal inconsistency in the present text; both are unverified presuppositions. Because the verdict CONDITIONAL already encodes exactly this risk, the correct outcome is to leave the reader's verdict unchanged.","tokens_in":26915,"tokens_out":13111,"duration_ms":143529,"concrete_test":"Independently verify the imported results by brute force for all w in S_n with n <= 6: enumerate PD(w), IT(w), and LT(w); check that Theta is a bijection and that every chute cover matches exactly one increment multiset as in Proposition 3.5; then compare the Hasse diagrams of PD(w) and PD(w^{-1}) under transposition to confirm the asserted anti-isomorphism.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on three imported results from the companion preprint [1]: Theorem 3.3 (Theta is a bijection PD(w)->IT(w)), Proposition 3.5 (chute moves correspond exactly to increment multisets of inversions tableaux), and Corollary 3.7 (chute order implies Lehmer order). These are not proved or independently justified in this paper, and they are foundational for the entire translation to Lehmer tableaux. Additionally, Section 5.1 asserts without proof that transposition is a poset anti-isomorphism between PD(w) and PD(w^{-1}); this assertion is used in Lemma 6.12 to convert (P')^T <= P^T into P <= P', and again in Corollary 7.6 and in the proof of semidistributivity. The internal deductions after these imports, especially Proposition 6.1 and Lemmas 7.2-7.4, are detailed and coherent, but an error in [1] would invalidate Theorems 1.1 and 1.2, and the unproved transpose anti-isomorphism is load-bearing for the transposition-based arguments.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proves Rubey's conjecture that the chute move poset PD(w) of reduced pipe dreams for a permutation w is a lattice, and establishes the stronger structural statements that PD(w) is semidistributive and polygonal with all polygons diamonds or pentagons. The main device is a bijection Φ from PD(w) to Lehmer tableaux LT(w); the core of the paper (Section 6) proves that Φ is an isomorphism between the chute order and the componentwise order on LT(w). The lattice property is then derived via the Björner–Edelman–Ziegler criterion (Section 7), and semidistributivity is proved in Section 8 with the aid of the triforce embedding.","tokens_in":27168,"tokens_out":10052,"duration_ms":103199,"significance":"If correct, the paper resolves a conjecture open since 2012 and, more importantly, supplies a global order description: comparability in PD(w) can be tested by componentwise comparison of Lehmer tableaux, making the order algorithmically accessible. The semidistributivity and polygonality results are new and connect PD(w) to the representation theory of finite semidistributive lattices, rowmotion, and canonical join complexes. The main proof is detailed, and the hard direction (increments imply chute reachability) is proved in the paper itself. However, the result currently rests on several foundational statements imported from the same-group unpublished companion paper [1] and on an unproved anti-isomorphism in Section 5.1; these dependencies are load-bearing.","major_comments":[{"comment":"Theorem 3.3, Proposition 3.5, and Corollary 3.7 are cited to the companion preprint [1] and are not proved in the present manuscript. These are load-bearing: Theorem 3.3 identifies reduced pipe dreams with inversions tableaux; Proposition 3.5 is the exact translation of chute moves into increments, used in Lemmas 6.11–6.13 and in the lattice-theoretic Lemmas 7.2–7.4; and Corollary 3.7 supplies one half of Theorem 6.14. The paper's own contribution is the converse direction, Lemma 6.13, but without [1] the proof of Theorem 1.1 is not self-contained. If [1] is not yet published, please include proofs of these results in an appendix; if it has been accepted, state this explicitly.","section":"§3 (Theorem 3.3, Proposition 3.5, Corollary 3.7)"},{"comment":"The assertion that transposition P ↦ P^T is a poset anti-isomorphism between PD(w) and PD(w^{-1}) is stated without proof. This fact is used in an essential way in Lemma 6.12 (to convert (P')^T ≤ P^T into P ≤ P'), in Corollary 7.6 (to obtain the meet-side polygon statement), and in the proof of Theorem 1.2 (to reduce join-semidistributivity to meet-semidistributivity). Because the statement concerns the global chute order, not just single moves, the proof should be supplied rather than left as immediate.","section":"§5.1"},{"comment":"The proof of Proposition 5.3 states that P1 ≤chute P2 if and only if P1^★ ≤chute P2^★ is immediate, but the equivalence is not as trivial as the forward direction. The reverse direction requires using the order-convexity of the embedded set to show that a chute-move path in PD(w^★) between embedded pipe dreams can be replaced by a path in PD(w). The current one-sentence justification is not sufficient, and Proposition 5.3 is used in Lemma 7.4 and Lemmas 8.1–8.2. Please expand this proof.","section":"§5.2, Proposition 5.3"}],"minor_comments":[{"comment":"The set of tableaux of shape D is denoted 'T D' at one point and 'TD' elsewhere; define the set of tableaux, say as T(D), once and use the notation consistently.","section":"§3"},{"comment":"In the final displayed chain of the proof, the string 'Θ^{-1}(↑B T ≤chute Θ^{-1}(T′))' appears to have a missing parenthesis; it should read 'Θ^{-1}(↑B T) ≤chute Θ^{-1}(T′)'.","section":"§6.2, proof of Lemma 6.13"},{"comment":"The formula Φ(P)(i,j) = row_P(i,j) − |A_{i,j}(P)| − 1 is asserted as immediate from the relevant definitions. Since it is used in the proof of Proposition 5.2, a one-sentence derivation from the definition of Λ would help the reader.","section":"§5.1"},{"comment":"The sentence 'The sets B1 and B2 are disjoint' should be justified; it follows from the assumptions on SW(R1) and SW(R2), but the argument is omitted.","section":"§7, proof of Lemma 7.2"},{"comment":"The note that Billey–McCausland–Minnerath have a simultaneous proof is useful, but if their preprint is publicly available, a citation with an arXiv identifier would be preferable.","section":"§1, Reference [4]"}],"recommendation":"major_revision","confidential_remarks":"The dependency on [1] is the main risk. If the companion paper is already under review or accepted, the situation improves considerably, but the current manuscript should state that status clearly. The unproved transpose anti-isomorphism is likely a straightforward combinatorial fact and should be easy to supply; I do not see it as fatal to the approach. The triforce-embedding proof also needs a few sentences rather than a new idea."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Rubey's conjecture is settled here, and I think the main theorem is right. The paper proves PD(w) is a lattice for every permutation, gives the Lehmer tableau isomorphism that makes order comparability checkable, and adds semidistributivity and polygonal structure. The triforce embedding is a genuinely useful trick, and the internal proofs—especially the induction in Section 6 and the case analysis in Section 7—are careful and coherent.\n\nThe soft spots are real but not about the core argument's plausibility. The proof leans on three results from the companion paper [1] (Theorem 3.3, Proposition 3.5, Corollary 3.7) without proof. Those are foundational: if the Theta bijection or the chute/increment correspondence fails, the whole edifice goes. [1] is by the same group, so a referee should either verify it carefully or insist that the present paper carry enough of the statements (or proofs) to be self-contained. Second, the transpose anti-isomorphism in Section 5.1 is asserted without proof. It is used in Lemma 6.12, Corollary 7.6, and the semidistributivity argument, so it is load-bearing. I suspect it is true and easy to prove, but it should be proven in the paper, not left as \"In fact.\"\n\nThere is also a simultaneous independent proof by Billey–McCausland–Minnerath, which the authors cite; that is a good sign for correctness, though it doesn't relieve the need to make this paper's dependencies clear.\n\nBottom line: this is a serious paper that deserves a serious referee. I would send it to peer review and ask the authors to either prove or fully state the imported results and add a proof of the transpose anti-isomorphism. Once that is done, acceptance is reasonable. I'd also bring it to my reading group; the Lehmer poset isomorphism is something people in Schubert calculus will want to know.","headline":"Strong paper that resolves a 2012 conjecture, but it needs to be self-contained about companion-paper imports and the transpose anti-isomorphism before I'd accept.","tokens_in":27685,"tokens_out":2597,"would_cite":true,"duration_ms":27881,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05E10","06B05","05A05","14N15"],"pacs":[],"model":"deepseek-v4-flash","headline":"For every permutation, the chute-move poset of reduced pipe dreams is a lattice.","keywords":["reduced pipe dreams","chute moves","Lehmer tableaux","inversions tableaux","semidistributive lattices","polygonal lattices","Schubert polynomials","permutations"],"falsifier":"For a specific check, compute the reduced pipe dreams for $w=361542$, translate them to Lehmer tableaux, and test every pair with a common lower cover for a join in the chute-move order; a single missing join, or a pair with $\\Phi(P)\\le\\Phi(P')$ but $P\\not\\le_{\\mathrm{chute}}P'$, would refute Theorems 1.1 and 6.14.","tokens_in":26753,"feed_emoji":"🧩","tokens_out":9625,"duration_ms":104191,"temperature":0.7,"pith_summary":"This paper proves that for every permutation $w$, the set $\\mathrm{PD}(w)$ of reduced pipe dreams for $w$, ordered so that cover relations are chute moves, is a lattice. The proof resolves a 2012 conjecture. The key step is a global description of the order: $\\mathrm{PD}(w)$ is isomorphic to the poset of Lehmer tableaux $\\mathrm{LT}(w)$ under componentwise comparison. The paper also shows that this lattice is semidistributive and polygonal, with every polygon a diamond or a pentagon. Reduced pipe dreams are the standard combinatorial models for Schubert polynomials, so a lattice structure brings lattice-theoretic tools to a central object in Schubert calculus.","feed_headline":"Chute-move posets are always lattices","feed_subtitle":"A 2012 conjecture is proved by translating pipe dreams into Lehmer tableaux.","key_machinery":"The central object is the Lehmer tableau associated to a reduced pipe dream, obtained by first recording in an inversions tableau $\\Theta(P)$ the row where each pair of pipes crosses and then applying a Lehmer-form transform $\\Lambda$ that encodes each column by counting absent smaller entries. The bijection $\\Phi=\\Lambda\\circ\\Theta$ carries the argument: chute moves between pipe dreams become, through Proposition 3.5, pure or trade increments on boxes of inversions tableaux, and Lemma 3.4 makes those increments act by adding $1$ to the corresponding Lehmer entries. Proposition 6.1 constructs chute moves from such increments, which is what allows the proof to pass from the local cover description to the global componentwise order. Two auxiliary transformations do the remaining work: the transpose, which gives an anti-isomorphism between $\\mathrm{PD}(w)$ and $\\mathrm{PD}(w^{-1})$, and the triforce embedding, which embeds $\\mathrm{PD}(w)$ as an interval in $\\mathrm{PD}(\\widetilde{w})$ for a larger permutation and is used to handle the hardest join cases and to prove semidistributivity.","core_discovery":"On the paper's own terms, the central result is that the locally defined chute-move order on reduced pipe dreams is actually a well-behaved global structure. Theorem 1.1 states that $\\mathrm{PD}(w)$ is a lattice for every $w \\in S_n$, and Theorem 1.2 adds that it is semidistributive and polygonal, all of whose polygons are diamonds or pentagons. The engine behind both theorems is the isomorphism $\\Phi:\\mathrm{PD}(w)\\to\\mathrm{LT}(w)$ of Theorem 6.14, which identifies the chute-move order with componentwise comparison of Lehmer tableaux; this makes order comparability, and therefore lattice operations, computationally transparent. The bridge from local to global is completed by showing that each chute move corresponds to a small multiset of increments in an inversions tableau, and that increments can be converted back into chute moves.","pith_inferences":["A consequence the paper leaves implicit is that lattice operations in $\\mathrm{PD}(w)$ can be approached through integer-valued Lehmer tableaux, which suggests a direct algorithmic route to meets and joins without simulating individual chute moves.","The triforce embedding makes the lattice structure of $\\mathrm{PD}(w)$ sit inside that of a larger permutation, so structural questions about joins might be studied by induction on $n$ rather than case by case.","Because the transpose map is asserted rather than proved to reverse the chute-move order, making that argument explicit would transfer every join computation to a meet computation and could simplify proofs of additional lattice properties.","The paragraph after the main theorems flags the canonical join complex as open; the structural ingredients proved here, semidistributivity, polygonal intervals, and the tableau isomorphism, are exactly the data such a description would need."],"forward_implications":["For fixed $w$, two pipe dreams $P$ and $P'$ satisfy $P\\le_{\\mathrm{chute}}P'$ exactly when $\\Phi(P)\\le\\Phi(P')$ entrywise, so comparability in the chute-move order can be read off directly from Lehmer tableaux.","Since $\\mathrm{PD}(w)$ is a semidistributive lattice, it carries a canonical join complex, a bijective rowmotion operator, and the order-complex contractibility or sphere homotopy behavior that semidistributive lattices have.","Every interval generated by two covers of the same element is a diamond or a pentagon, so the local geometry of the chute-move poset is completely described by those two shapes.","The previously known $\\nu$-Tamari lattice cases are subsumed: the theorem covers all permutations, not only the special class treated earlier.","Because $\\Phi$ is an isomorphism, every lattice-theoretic statement about $\\mathrm{PD}(w)$ has a translation into a statement about integer-filled Lehmer tableaux, giving a uniform way to reason about meets and joins."],"supporting_citations":[{"why":"Supplies the foundational bijection from reduced pipe dreams to inversions tableaux and the exact description of chute moves as tableaux increments.","marker":"[1]"},{"why":"Defines the chute-move poset, states the lattice conjecture, and proves the poset has minimum and maximum elements.","marker":"[19]"},{"why":"Provides the lattice criterion used to conclude that cover relations with common lower covers force a global lattice structure.","marker":"[7]"},{"why":"Introduces the rc-graph and pipe-dream viewpoint and the chute-move generation of reduced pipe dreams that underlies the order.","marker":"[3]"},{"why":"Proves the conjecture in a special case by identifying the poset with a $\\nu$-Tamari lattice, the partial result the paper extends.","marker":"[8]"},{"why":"Supplies the meet-semidistributivity criterion used to prove the semidistributivity part of Theorem 1.2.","marker":"[12]"}],"fun_headline_variants":["All chute-move posets proven lattices","Chute-move posets: every one is a lattice","Lattice proof: chute moves on pipe dreams","Lehmer tableaux show chute-move posets are lattices","Rubey's conjecture confirmed: chute-move posets"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument stands on the companion paper's dictionary: every reduced pipe dream corresponds to exactly one inversions tableau, and every chute move changes that tableau in one specified way; if that dictionary fails for some permutation, the lattice proof does not go through.","fun_headline_variants_meta":{"raw":{"variants":["All chute-move posets proven lattices","Chute-move posets: every one is a lattice","Lattice proof: chute moves on pipe dreams","Lehmer tableaux show chute-move posets are lattices","Rubey's conjecture confirmed: chute-move posets"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000297,"raw_usage":{"total_tokens":1670,"prompt_tokens":841,"completion_tokens":829,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":457,"completion_tokens_details":{"reasoning_tokens":758}},"tokens_in":457,"tokens_out":829,"duration_ms":8500,"temperature":1.0,"reasoning_tokens":758,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T16:27:25.867872+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For a specific check, compute the reduced pipe dreams for $w=361542$, translate them to Lehmer tableaux, and test every pair with a common lower cover for a join in the chute-move order; a single missing join, or a pair with $\\Phi(P)\\le\\Phi(P')$ but $P\\not\\le_{\\mathrm{chute}}P'$, would refute Theorems 1.1 and 6.14.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines the chute-move poset, states the lattice conjecture, and proves the poset has minimum and maximum elements."},{"cited_title":"Bj¨ orner, P","cited_arxiv_id":null,"evidence_quote":"Provides the lattice criterion used to conclude that cover relations with common lower covers force a global lattice structure."},{"cited_title":"Bergeron and S","cited_arxiv_id":null,"evidence_quote":"Introduces the rc-graph and pipe-dream viewpoint and the chute-move generation of reduced pipe dreams that underlies the order."},{"cited_title":"Ceballos, A","cited_arxiv_id":null,"evidence_quote":"Proves the conjecture in a special case by identifying the poset with a $\\nu$-Tamari lattice, the partial result the paper extends."},{"cited_title":"Freese, J","cited_arxiv_id":null,"evidence_quote":"Supplies the meet-semidistributivity criterion used to prove the semidistributivity part of Theorem 1.2."}],"review_version":1}