{"id":"f769390a-73e1-4834-bad0-6a05641ee7cf","arxiv_id":"2411.14170","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For type SL2-hat, the quantum Bruhat graph formula for the Demazure product on the double affine Weyl semigroup is well-defined for positive levels and associative for levels greater than one.","lead":"Mathematicians defined a new way to multiply elements of a double affine Weyl semigroup, using paths in a graph called the quantum Bruhat graph, and proved the multiplication is consistent and associative in the simplest nontrivial case. The result supports a recent conjecture about Hecke algebras and offers a combinatorial tool for representation theory and geometry.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Main SL2-hat construction is plausible, but well-definedness rests on an unmechanized length-positive-set classification; a bounded brute-force recheck of Prop. 3.5 should settle whether any LP element is missed.","rationale":"The reader's weakest_assumption identifies exactly the point on which the main theorems balance: the classification of length-positive sets. My pass found no specific counterexample to Prop. 3.5; the apparent t = 1 sentence in Cor. 3.8 is explainable by the fact that τ^{α^∨}s1s0 = e, so the classification is internally coherent. The unproved level-one associativity case is disclosed in Remark 5.7 and excluded from Theorem 5.6, so it does not change the verdict. Still, the well-definedness and associativity proofs are irreducible finite case analyses with no formal verification and no shipped code. The main theorems are credible but conditional; a bounded exhaustive check of Prop. 3.5, followed by a targeted check of the four-case exhaustion in Prop. 5.4, would settle whether the concern actually lands. Until then, the conditional verdict is appropriate, and no change to the reader's verdict is needed.","tokens_in":30592,"tokens_out":37260,"duration_ms":352964,"concrete_test":"Enumerate a bounded box of elements x = w0τ^{rα^∨}ε^{kα^∨+mδ+lΛ0} with w0 ∈ {e,s1}, 1 ≤ l ≤ 4, |k|,|r|,|m| ≤ 4, and compare the output of the Prop. 3.5 algorithm with an independent computation of LP(x) from the defining inequalities ℓ(x,vα~) ≥ 0 over a sufficiently large truncation of affine positive roots (e.g., α~ = ±α + nδ with |n| ≤ 10). If the two sets agree, verify in the same test that |LP(x)| ≤ 3, LP(x) is vertically connected, and LP(x) is one-sided. If any mismatch appears, rerun the case analysis of Theorems 4.7 and 5.6 with the corrected LP set; if no mismatch appears, the concern is settled and the conditional verdict can stand.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Prop. 3.5 and its corollaries (3.6–3.8, 4.2) are load-bearing: they bound |LP(x)| ≤ 3, force LP(x) to be a vertical chain, and force it to be one-sided. Theorem 4.7 splits over exactly these possibilities, and Theorem 4.10 and Prop. 5.1 import the same structure into the associativity proof via Props. 5.4 and 5.5. The classification proof is a hand-written case analysis with no independent implementation or machine check, and the examples in Section 7 exercise only two carefully chosen elements. A single missed length-positive element—say one producing four elements at level 1 or a mixed-sided triple—would invalidate the case splits in Theorems 4.7 and 5.6, not merely complicate them. The exposition is also terse enough in places (e.g., the value table in Prop. 5.4 and the exhaustion claim in its four-case diagram) that an independent check is genuinely needed before the conditional verdict can be upgraded.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a combinatorial definition of the Demazure product on the double affine Weyl semigroup W_T by generalizing Schremmer's quantum-Bruhat-graph formula. The focus is type SL2-hat, where the author proves path-weight independence for QBG(W), describes the length-positive sets LP(x), proves independence of the generalised product from the chosen distance-minimising pair, and establishes associativity for elements of level greater than one. The paper also proves, conditionally on well-definedness, a general length-additivity criterion relating ell(x*y), ell(xy), and the distance in QBG(W), and it verifies two examples against Hecke-algebra computations of Muthiah and Puskás.","tokens_in":30813,"tokens_out":17832,"duration_ms":165282,"significance":"If the results are correct, this gives the first explicit combinatorial construction of a Demazure-type product on the double affine Weyl semigroup in a non-trivial example, matching the conjectural q=0 Hecke-algebra behaviour. The conditional results in Section 6 are elegant and would be useful for future general-type work. The paper is strengthened by explicit worked examples with a genuine external check (Section 7), and by the fact that the main independence and associativity theorems are reduced to finite, enumerable graph data. The main weakness is that several load-bearing steps are justified by diagram inspection or by terse case-analysis assertions rather than by complete written arguments.","major_comments":[{"comment":"The proof of Prop. 4.2 is presented as an immediate consequence of Cor. 3.7 and Cor. 3.8, but those corollaries do not by themselves imply that LP(x) is always one-sided. Cor. 3.7 permits any connected triple, and Cor. 3.8 excludes only the particular triple {s1,e,s0}; it does not address other connected triples of mixed side, nor does it address mixed-side two-element sets. Since Prop. 4.2 is used to justify the case split in Thm. 4.7 and is imported into the associativity proof, this is load-bearing; please replace the one-line deduction with an explicit enumeration of the possibilities allowed by Prop. 3.5.","section":"§3.6, Prop. 3.5 and §4.1, Prop. 4.2"},{"comment":"In the proof of Thm. 4.4, the case where u,v are not same-sided and u≰v is handled by asserting that a shortest path consists of vertical downwards edges and one upwards diagonal edge, and that shifting the diagonal edge preserves weight; this is justified only by inspection of Fig. 2. This statement is used to define wt(u⇒v), which enters Definition 2.5 and every subsequent independence result. Please give a closed-form formula for d(u⇒v) and wt(u⇒v) in terms of an explicit parametrization of W, or a fully verified case analysis, and apply the same standard to the 'clear from Fig. 2' steps in Thm. 4.6 and Thm. 4.10.","section":"§4.2, Thm. 4.4"},{"comment":"In the proof of Thm. 4.7, the final case |M_{x,y}|=3 asserts that the constancy of φ1 and φ2 proved for the two-pair configuration in Fig. 3 also holds for the three-pair configuration {(u,v),(us_i,vs_i),(us_i s_j,vs_i s_j)}, where u,v are opposite-sided and ell(v)=ell(u)+1. This does not follow from the displayed calculation without checking that the hypotheses of the Fig. 3 configuration apply to each adjacent pair. Please provide the explicit computation of φ2 for all three pairs in this configuration.","section":"§4.3, Thm. 4.7 (|LP|=3 case)"},{"comment":"The proof of Thm. 4.10 contains several unproved assertions that are essential: the claim that the weights of a shortest path alternate and hence c1∈{0,±1}; the claim that if |Inv(r0^{-1})|>1 then the classical parts of α~_i and s_i(α~_j) differ by a sign; the selection of β~ with ⟨wt(u⇒wyv),β~⟩=-2; and the deductions 'from the diagram' about the signs of uβ~ and wyvβ~. Thm. 4.10 is used to identify LP(x*y) with M^y_{x,y}, which is needed in Prop. 5.1 and therefore in the associativity proof. Please replace these steps with explicit arguments or a verified exhaustive check.","section":"§4.4, Thm. 4.10"},{"comment":"The proof of Prop. 5.4 relies on a four-picture diagram and the assertion that 'this exhausts all possible cases, as any other arrangement will violate either uniqueness of distance-minimising elements or the minimality itself'; Prop. 5.5 is dismissed as analogous. Since the values η2 and η3, including the sign of the exceptional terms, are what make the lattice-component identity η1=η2+η3 hold, this is load-bearing for Thm. 5.6. Please provide a complete case table with the defining inequalities of each case, or supply a machine-checked enumeration.","section":"§5.3, Prop. 5.4 and Prop. 5.5"}],"minor_comments":[{"comment":"The notation {1,2,...,⌊(l-1)/2⌋} is awkward when l=2, since the set is empty; please clarify by saying that no element arises from this case when the upper bound is less than 1.","section":"§3.2, Eq. (3.8)"},{"comment":"The sentence 'If j=±(l-1)/2, then we are guaranteed a length positive element from case 2' is only meaningful for odd l; for even l the condition is vacuous, and this should be stated explicitly.","section":"§3.6, Cor. 3.6"},{"comment":"The proof uses the identity Inv(v^{-1}) = -v Inv(v) with a reference to [Hum90] but without a precise location; please add a specific citation or a one-line derivation.","section":"§3.5, Prop. 3.2"},{"comment":"In the final line of Section 7.2, the conversion from s1τ^{-α∨} to s0 would be easier to follow if the relation s0 = s1τ^{-α∨} were recalled explicitly.","section":"§7.2"}],"recommendation":"major_revision","confidential_remarks":"The paper is within scope and the central construction is plausible, with encouraging agreement in the two external examples. My main concern is not novelty but rigor: the proof repeatedly relies on unstated diagram-inspection facts, and the classification of LP(x) is the load-bearing input for both independence and associativity. An independent computational verification of Prop. 3.5 and of the shortest-path claims would substantially increase confidence and could be reported as a reproducibility check. No concerns about attribution or scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. First, this paper does something genuinely new: it takes Schremmer's quantum-Bruhat-graph formula for the affine Demazure product and shows it works in the double affine setting for type \\hat{SL}_2, proving well-definedness for positive level and associativity for level > 1. The verification against Muthiah–Puskás's Hecke-algebra examples is a nice check. Second, the main body of proof is a long case analysis over the length-positive sets LP(x), and that is both the strength and the risk: the classification in Prop. 3.5 is hand-written and unmechanized, and everything else rests on it.\n\nWhat I like: the paper is honest about its limitations. Remark 5.7 explicitly says associativity for level one is not proved and only conjectured, and the general-type theorems are explicitly conditional on well-definedness. The graph-theoretic lemmas about QBG for the infinite dihedral group are clean, and the length-additivity results (Thm 6.1 and 6.2) are useful and clearly stated. The examples in Section 7 match the q=0 Hecke products computed by Muthiah and Puskás, which is real evidence that the construction is the right one.\n\nWhere I'd push back: the stress-test note is right that Prop. 3.5 is load-bearing. A single missed length-positive element at level 1 would break the case splits in Thms. 4.7 and 5.6. That doesn't mean the classification is wrong—reading through it, the counting looks plausible and the corollaries (|LP| ≤ 3, connectedness, one-sidedness) are exactly what you'd expect in this rank-one affine case—but it is exactly the kind of claim that should be checked independently, either by a brute-force enumeration or a short script. The paper does not provide such a check, and the text relies on 'it is clear from Fig. 2' in a few places. That is acceptable for a short paper, but a referee should ask for those arguments to be made more explicit or verified.\n\nThe other thing I'd flag: the proof of Prop. 6.4 and the 'adjustment' argument in the proof of Thm 6.1 are a bit terse. Again, not fatal, but worth tightening.\n\nBottom line: this is a credible, novel contribution to the double-affine Demazure product problem, and the main results for level > 1 appear sound. It deserves a serious referee, and it should be published after the LP classification is independently checked and the expository gaps are filled. I would not desk reject.","headline":"A serious and mostly careful construction of a Demazure product for the double affine Weyl semigroup in type \\hat{SL}_2; the level > 1 results look right, but the load-bearing classification of length-positive sets deserves independent verification.","tokens_in":31353,"tokens_out":2893,"would_cite":true,"duration_ms":27257,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20F55","17B67","05E15"],"pacs":[],"model":"deepseek-v4-flash","headline":"In type $\\widehat{SL}_2$, a quantum-Bruhat-graph formula defines an associative Demazure product on the double affine Weyl semigroup for level greater than one.","keywords":["Demazure product","double affine Weyl semigroup","quantum Bruhat graph","Kac-Moody affine Hecke algebra","length positivity","affine Weyl group","associativity","Tits cone"],"falsifier":"Compute, for any triple of level-one elements whose length-positive sets have size three, the two triple products $(x*y)*z$ and $x*(y*z)$; a difference in either the Weyl or coweight component would disprove associativity in the stated range. Alternatively, exhibit two shortest paths in $\\mathrm{QBG}(W)$ for $\\widehat{SL}_2$ between the same vertices with different total weights; that would disprove path independence and the well-definedness of the product.","tokens_in":30387,"feed_emoji":"🧮","tokens_out":6771,"duration_ms":63199,"temperature":0.7,"pith_summary":"This paper is about giving the double affine Weyl semigroup $W_{\\mathcal{T}}$ a missing piece of Coxeter-like structure: a Demazure product, the operation that in a Coxeter group picks out the maximal Bruhat element among products of sub-elements and that appears as $q=0$ multiplication in Hecke algebras. The paper proves that, in type $\\widehat{SL}_2$, a formula based on shortest paths in the quantum Bruhat graph defines such a product unambiguously for all elements of non-zero level, and associatively whenever both factors have level greater than one. It also proves a length-additivity criterion: the Demazure product agrees with ordinary multiplication exactly when ordinary multiplication is length additive. If the construction is right, it supplies a purely combinatorial way to compute the conjectural $q=0$ specialization of Kac-Moody affine Hecke algebra multiplication, and the two examples where the Hecke computation is known match.","feed_headline":"Quantum Bruhat graph gives a Demazure product for double affine SL2","feed_subtitle":"The product is associative for level greater than one and reproduces the conjectured Hecke-algebra examples.","key_machinery":"The object carrying the argument is the quantum Bruhat graph $\\mathrm{QBG}(W)$ of the affine Weyl group $W$ of type $\\widehat{SL}_2$: vertices are Weyl-group elements, Bruhat (upward) edges have weight $0$, and quantum (downward) edges carry coroot weights. The companion notion is the length-positive set $LP(x)$, the elements $v \\in W$ for which a certain length functional is nonnegative on all positive roots. The paper's classification of $LP(x)$ for level $>0$—each set has between one and three elements, is connected by vertical edges, and lies entirely on one side of the infinite dihedral group—is what makes the distance-minimising pairs $M_{x,y}$ small enough to analyse. Path independence is proved by showing all shortest paths between two vertices have equal total weight; associativity is then reduced to equality of Weyl and coweight components, checked case by case over these small length-positive sets.","core_discovery":"The central claim is that the quantum-Bruhat-graph formula for the affine Demazure product extends to the double affine setting in type $\\widehat{SL}_2$. For $x = w_x\\varepsilon^{\\mu_x}$ and $y = w_y\\varepsilon^{\\mu_y}$ one chooses length-positive elements $u \\in LP(x)$, $v \\in LP(y)$ that minimise the graph distance $d(u \\Rightarrow w_y v)$, fixes a shortest path $p$, and defines $x*y = w_x u v^{-1}\\varepsilon^{v u^{-1}\\mu_x + \\mu_y - v\\,\\mathrm{wt}(p)}$. The paper shows the result does not depend on the choice of pair or path, that the operation is associative for level greater than one, and that $\\ell(x*y) = \\ell(x)+\\ell(y)$ holds exactly when $\\ell(xy) = \\ell(x)+\\ell(y)$, in which case $x*y = xy$. The same formula reproduces the known $q=0$ Hecke products in the two examples computed from the Kac-Moody affine Hecke algebra.","pith_inferences":["If the classification of length-positive sets remains finite in other affine types, the same shortest-path formula is a natural candidate for a Demazure product on $W_{\\mathcal{T}}$ there; nothing in the definition is special to $\\widehat{SL}_2$ except the classification itself.","The association between non-length-additivity and non-empty intersections of inversion sets may give an independent characterisation of when Demazure products differ from ordinary products, with possible implications for affine Deligne-Lusztig varieties.","A computer search over level-one elements with three length-positive elements could test associativity in the unresolved case; the paper states that no counterexample was found."],"forward_implications":["One can speak of a Demazure product on $W_{\\mathcal{T}}$ in type $\\widehat{SL}_2$: the operation is single-valued for non-zero level and associative for level greater than one.","The length-additivity theorem gives a practical test: to decide whether $x*y$ equals $xy$, check whether $\\ell(xy)=\\ell(x)+\\ell(y)$; this connects the combinatorial product to inversion-set intersections in the affine root system.","The $q=0$ term of products in the Kac-Moody affine Hecke algebra can in principle be read off from quantum-Bruhat-graph shortest paths, matching the two known Hecke computations.","For level-one elements with three length-positive elements, associativity is conjectured but not established; any proof must handle those larger sets.","The proof that shortest paths have equal weights upgrades a property known in finite Weyl groups to affine type $\\widehat{SL}_2$."],"supporting_citations":[{"why":"Gives the affine Demazure-product formula in terms of the quantum Bruhat graph, the formula this paper generalises to double affine type.","marker":"[Sch24]"},{"why":"Supplies the conjectural $q=0$ Hecke-algebra Demazure product and the two explicit products used to verify the new definition.","marker":"[MP24]"},{"why":"Provides the affine quantum Bruhat graph, its edges, and the length-function facts used throughout the shortest-path arguments.","marker":"[Wel19]"},{"why":"Introduces the finite quantum Bruhat graph, whose edge and weight structure underlies the whole construction.","marker":"[BFP98]"},{"why":"Proves that shortest paths in the finite quantum Bruhat graph have equal weights, the model for the affine path-independence theorem.","marker":"[Pos05]"},{"why":"Gives the double affine Bruhat order and length function that the Demazure product is meant to interact with.","marker":"[MO19]"},{"why":"Defines the Kac-Moody affine Hecke algebra and its $T$-basis indexed by the double affine Tits semigroup, the setting of the conjectural product.","marker":"[BKP16]"}],"fun_headline_variants":["Quantum Bruhat graph defines double affine Demazure product","SL2 double affine Demazure product from quantum Bruhat paths","Associative Demazure product for double affine Weyl semigroup","Quantum Bruhat graph tames double affine Demazure product"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on the completeness of the classification of length-positive sets in type $\\widehat{SL}_2$ at positive level: every such set has at most three elements, is connected by vertical edges, and is entirely one-sided. If that classification missed any element, both independence of choices and associativity would be in question.","fun_headline_variants_meta":{"raw":{"variants":["Quantum Bruhat graph defines double affine Demazure product","SL2 double affine Demazure product from quantum Bruhat paths","Associative Demazure product for double affine Weyl semigroup","Quantum Bruhat graph tames double affine Demazure product"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000256,"raw_usage":{"total_tokens":1578,"prompt_tokens":953,"completion_tokens":625,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":569,"completion_tokens_details":{"reasoning_tokens":569}},"tokens_in":569,"tokens_out":625,"duration_ms":6316,"temperature":1.0,"reasoning_tokens":569,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T15:27:17.637233+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute, for any triple of level-one elements whose length-positive sets have size three, the two triple products $(x*y)*z$ and $x*(y*z)$; a difference in either the Weyl or coweight component would disprove associativity in the stated range. Alternatively, exhibit two shortest paths in $\\mathrm{QBG}(W)$ for $\\widehat{SL}_2$ between the same vertices with different total weights; that would disprove path independence and the well-definedness of the product.","supporting_citations":[],"review_version":1}