{"id":"8b4cd1e5-416e-477d-a606-96dc02dfa457","arxiv_id":"1908.01485","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A non-degenerate exchange move on a closed n-braid always yields infinitely many non-conjugate n-braid representatives of the same link.","lead":"Braids that close up to the same knot can be studied by a move that swaps two overlapping groups of strands. This paper proves that when such a move genuinely changes the braid, infinitely many different braids for the same knot exist.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof's central product identity for ex^k(β)^N is shifted by one Dehn twist: direct derivation yields T^k_{A(c)}T^{-k}_{β(c)}β^N, not T^k_c T^{-k}_{A(c)}β^N, so Fathi's theorem is applied to a different braid.","rationale":"The single most load-bearing problem is not the geometric assertion about consecutive intersections, but the algebraic identity on which the whole Fathi application is built. The paper claims ex^k(β)^N equals a product of Dehn twists along c1,c2,...,c_{2N}; direct calculation shows the sequence should start at c2 and end at c_{2N+1}. The error is easy to demonstrate even in a degenerate case, where ex^k(β)=β but the displayed RHS is nontrivial. Because Fathi's theorem is then applied to the wrong braid, the unbounded-entropy conclusion does not follow from the written proof. The theorem may well be true and the proof repairable by shifting indices and proving a closing-intersection statement for the corrected sequence, but as written the central computation is false. The reader's CONDITIONAL verdict remains appropriate; this stress test identifies a more concrete and specific flaw than the reader's stated weakest assumption, so the agreement is only partial.","tokens_in":3358,"tokens_out":26529,"duration_ms":269805,"concrete_test":"Verify the N=1 identity in B_4 with A=σ1, B=σ2, and τ=σ2^2. Since Bτ=τB, ex^k(β)=σ1σ2 for all k. Compute the paper's RHS T_c^k T_{A(c)}^{-k} β, which equals σ2^{2k} σ1 σ2^{-2k} σ2. For k=1, check whether σ2^2 σ1 σ2^{-1} equals σ1σ2; using the braid relation σ1σ2σ1=σ2σ1σ2, this would imply σ1 commutes with σ2^2, which is false. This settles that the displayed product identity is false and that the Fathi application in Theorem 2 is built on an incorrect algebraic claim.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 2 rests on the claimed identity ex^k(β)^N = T^k_{c1} T^{-k}_{c2} ... T^k_{c_{2N-1}} T^{-k}_{c_{2N}} β^N. Direct derivation gives a different expression. Since ex^k(β) = A τ^k B τ^{-k}, writing A τ^k = T_{A(c)}^k A and β τ^{-k} = T_{β(c)}^{-k} β yields ex^k(β) = T_{A(c)}^k T_{β(c)}^{-k} β = T^k_{c2} T^{-k}_{c3} β, not T^k_{c1} T^{-k}_{c2} β. The displayed product is shifted by one twist. This is not a harmless convention change: the shifted product is generally not ex^k(β)^N. For example, in B_4 take A=σ1, B=σ2, and τ=σ2^2. Since B commutes with τ, ex^k(β)=σ1σ2 for every k. The paper's N=1 RHS is σ2^{2k} σ1 σ2^{-2k} σ2, which for k=1 is not σ1σ2 because σ1 does not commute with σ2^2. Thus the identity is false even in this degenerate case. Consequently, the Fathi theorem in the written proof is applied to a braid that is not the iterated exchange braid, and the entropy conclusion does not follow as written. A repaired proof would need to use the c2,c3,... sequence and prove the corresponding cyclic intersection condition.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims to prove that if a link has a closed n-braid representative admitting a non-degenerate exchange move, then iterating the exchange move produces infinitely many non-conjugate closed n-braid representatives. The proof identifies the braid group with the mapping class group of the punctured disk, expresses the iterated exchange braid ex^k(β) as a product of powers of Dehn twists, and invokes Fathi's theorem to show that the topological entropy of ex^k(β) is unbounded. The argument is short and uses entropy as a conjugacy invariant to deduce the infinitude of conjugacy classes.","tokens_in":3728,"tokens_out":14693,"duration_ms":130647,"significance":"If correct, the theorem would give the weakest known condition under which the Birman-Menasco finiteness statement fails, and it would unify earlier partial results in [SS, Sh, St1, St2]. The entropy-based strategy is elegant and, in principle, a good match for the problem because topological entropy is a conjugacy invariant. However, the proof as written contains a false algebraic identity and several unsupported geometric assertions; these are not presentation issues but invalidate the derivation of the theorem.","major_comments":[{"comment":"The identity ex^k(β)^N = T^k_{c1} T^{-k}_{c2} ... T^k_{c_{2N-1}} T^{-k}_{c_{2N}} β^N is incorrect. Directly from ex^k(β)=A τ^k B τ^{-k} and the conjugation rule f T_γ f^{-1}=T_{f(γ)}, one obtains ex^k(β)=T^k_{A(c)} T^{-k}_{β(c)} β = T^k_{c2} T^{-k}_{c3} β. Iterating gives ex^k(β)^N = T^k_{c2} T^{-k}_{c3} T^k_{c4} T^{-k}_{c5} ... T^k_{c_{2N}} T^{-k}_{c_{2N+1}} β^N, not the displayed product. For N=1 the paper's product is T^k_c T^{-k}_{A(c)} β, which generally differs from the actual braid and is not generally conjugate to it. Thus Fathi's theorem is applied to a mapping class that is not the iterated exchange braid, so the entropy conclusion does not follow.","section":"Proof of Theorem 2, displayed identity"},{"comment":"The statement 'By non-degeneracy assumption i(c_i, c_{i+1}) ≠ 0 for every i > 0' is not justified and is false in general. The alternating adjacent intersections reduce to i(c,A(c)) and i(c,B(c)), whereas non-degeneracy only asserts A(c)≠c and B(c)≠c. It is possible for a mapping class to move c while keeping the image disjoint from c; for example, in B5 with c surrounding punctures 2 and 3, the element A=σ1σ3 satisfies A(c)≠c but i(c,A(c))=0. Since Fathi's theorem requires nonzero adjacent intersections, this is a load-bearing gap.","section":"Proof of Theorem 2, adjacent intersection claim"},{"comment":"The assertion that for sufficiently large M the finite set {c1,...,cM} fills the subsurface S is made without proof. S is defined as the minimal complete geodesic subsurface containing the infinite collection {c, A(c), β(c), β(A(c)), ...}; it does not automatically follow that a finite initial segment fills S. This filling property is one of the hypotheses of Theorem 3, so the step is load-bearing and needs a rigorous argument (e.g., a compactness or convergence argument).","section":"Proof of Theorem 2, finite filling step"},{"comment":"The equality β^{-2(M-1)}(c_{2M}) = A(c) is inconsistent with the definition c_{2M}=β^{M-1}(A(c)). Applying β^{-(M-1)} would give A(c), not β^{-2(M-1)}. Since this equality is used to derive the contradiction with non-degeneracy, Claim 2 as written does not follow. In addition, the argument that β preserves the subsurface S' and that i(c,c')=0 for every c'⊂S' is only sketched as 'the same argument as Claim 1' and needs to be spelled out.","section":"Proof of Theorem 2, Claim 2"}],"minor_comments":[{"comment":"The definition of c_{2i-1} contains a typo: it should read β^{i-1}(c) = (AB)^{i-1}(c), not (AB)^i(c).","section":"Definition of c_{2i-1}"},{"comment":"There are several typographical errors, including 'NON-DEGENERA TE' in the title, 'represenattives' in reference [SS], and 'We need to be bit careful' in the introduction.","section":"Throughout"},{"comment":"The phrase 'by the same argument as Claim 1' in Claim 2 is too terse, especially because Claim 1 itself relies on the filling property that is not proved; the argument should be written out explicitly.","section":"Claims 1 and 2"}],"recommendation":"reject","confidential_remarks":"The elegant entropy strategy is undercut by a false central identity and unsupported geometric hypotheses. The shifted product identity changes the mapping class to which Fathi's theorem is applied; the adjacent-intersection claim is not a consequence of non-degeneracy and fails for explicit braids. A repair would require substantial new arguments and possibly additional hypotheses, and the theorem itself should be re-examined in light of the counterexample to the adjacent-intersection claim. I therefore recommend rejection rather than major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper has a good idea and a likely true theorem, but the written proof is not valid. The main identity in the proof of Theorem 2 is off by one twist, and the geometric assertions are left unproved.\n\nThe new thing: Ito attacks the converse of Birman–Menasco using topological entropy. Instead of the technical hypotheses of Shinjo and Stoimenow, he only assumes non-degeneracy and gets infinite non-conjugate braids from unbounded entropy via Fathi's theorem. That is a genuinely new strategy and a clean conceptual target.\n\nThe soft spots are serious. The key formula (top of page 2) is wrong. For β=AB and ex^k(β)=A τ^k B τ^{-k}, moving twists past A and B gives ex^k(β)=T_{A(c)}^k T_{β(c)}^{-k} β, so iterating gives a product in T_{A(c)}, T_{β(c)}, T_{β(A(c))}, T_{β^2(c)}, ... . The paper instead writes T_c, T_{A(c)}, T_{β(c)}, ... . This is not a harmless reindexing: the claimed equality is false, e.g., for B_4 with A=σ1, B=σ2, τ=σ2^2. Fathi's theorem is therefore applied to a braid that is not ex^k(β)^N. A fix likely involves shifting the sequence and proving a corresponding intersection statement, but that is real work.\n\nAlso, \"non-degeneracy implies i(c_i,c_{i+1})≠0\" is not a consequence of A(c)≠c and B(c)≠c; distinct essential curves can be disjoint. The filling of a β-invariant subsurface by finitely many c_i is asserted, not shown. Claim 2 has an exponent error: β^{-2(M-1)} should be β^{-(M-1)}.\n\nThe theorem may well be true and the strategy salvageable; a knowledgeable topologist could probably repair all of this. But as written, the proof's central step is false, so the paper cannot be accepted without major revision.\n\nWho it's for: people working on closed-braid representatives and Birman–Menasco's theorem. It deserves peer review, because the question is natural and the entropy approach is worth testing. I would not cite the proof in its current form; I'd cite the corrected version.\n\nRecommendation: send to a serious referee, but expect the referee to require a rewritten proof of the central identity and of the geometric claims.","headline":"A natural theorem and a novel entropy strategy, but the central product identity is off by one twist and the geometric assertions are unproved, so the written proof is not valid.","tokens_in":4187,"tokens_out":12951,"would_cite":false,"duration_ms":115887,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["57M25","57M27"],"pacs":[],"model":"deepseek-v4-flash","headline":"A non-degenerate exchange move on a closed n-braid forces infinitely many non-conjugate n-braid representatives of the same link.","keywords":["exchange move","closed braid","conjugacy class","braid group","topological entropy","pseudo-Anosov","mapping class group"],"falsifier":"Compute the topological entropy of $\\operatorname{ex}^k(\\beta)$ for a small explicit non-degenerate exchange move, say in $B_4$ or $B_5$ using a train-track algorithm; the theorem predicts the values are unbounded, so a bounded sequence would settle the claim false.","tokens_in":1610,"feed_emoji":"🪢","tokens_out":4855,"duration_ms":100649,"temperature":0.7,"pith_summary":"The paper proves that a single non-degenerate exchange move on a closed n-braid is enough to guarantee that the same link has infinitely many mutually non-conjugate n-braid representatives. It does so by showing that iterating the exchange move drives the topological entropy of the braid to infinity, which forces infinitely many distinct conjugacy classes. The argument upgrades earlier results that required extra technical assumptions to the weakest possible condition, and the proof is short because it reduces the statement to a known theorem about Dehn twists and pseudo-Anosov maps.","feed_headline":"Non-degenerate exchange move yields infinite non-conjugate braids","feed_subtitle":"The proof shows iterating the move makes braid entropy unbounded, so the same link has infinitely many distinct representatives.","key_machinery":"The paper identifies the braid group with the mapping class group of the $n$-punctured disk. The central object is the simple closed curve $c$ surrounding punctures $2,\\dots,n-2$, along which $\\tau$ acts as a Dehn twist. For $\\beta = AB$, the iterated exchange move is $\\operatorname{ex}^k(\\beta) = A\\tau^k B \\tau^{-k}$, and the proof tracks the orbit curves $c_{2i-1} = \\beta^{i-1}(c)$ and $c_{2i} = \\beta^{i-1}(A(c))$. The key machinery is a theorem stating that if finitely many essential curves fill a surface and consecutive ones intersect, then products of very large Dehn twists along them, composed with a fixed map, are pseudo-Anosov with arbitrarily large dilation. Applying this to $\\operatorname{ex}^k(\\beta)^N$ restricted to a $\\beta$-invariant subsurface $S$ gives $\\operatorname{ent}(\\operatorname{ex}^k(\\beta)) \\geq (\\log R)/N$, hence unbounded entropy.","core_discovery":"The central claim is Theorem 2: if a braid $\\beta \\in \\operatorname{Br}_n(L)$ admits a non-degenerate exchange move, then the set of topological entropies $\\{\\operatorname{ent}(\\operatorname{ex}^k(\\beta)) \\mid k \\in \\mathbb{Z}\\}$ is unbounded. Since conjugate braids have equal entropy, the set of braids $\\{\\operatorname{ex}^k(\\beta)\\}$ contains infinitely many pairwise non-conjugate closed n-braid representatives of the same link $L$. The exchange move is written $\\beta = AB$ with $A$ supported on the first $n-2$ strands and $B$ on the last $n-2$ strands, and non-degeneracy means $A\\tau \\neq \\tau A$ or $B\\tau \\neq \\tau B$, where $\\tau = (\\sigma_2 \\cdots \\sigma_{n-2})^{n-2}$; this is exactly the condition that the obvious conjugacy-preserving obstruction is absent.","pith_inferences":["The proof suggests a quantitative refinement the author does not state: the growth of $\\operatorname{ent}(\\operatorname{ex}^k(\\beta))$ is likely controlled by the subsurface filled by the orbit of $c$, so one could try to estimate the asymptotic growth rate in $k$ for specific braids.","Because conjugate braids have the same entropy, the argument also gives a way to certify non-conjugacy of braid representatives by computing entropy, which may be easier than foliation-based arguments in practice.","Question 1 in the paper, asking whether exchange moves that reduce braid-foliation complexity decrease entropy, could be tested by computing both quantities on the explicit examples constructed in the proof."],"forward_implications":["If a link has any closed $n$-braid representative admitting a non-degenerate exchange move, then $\\operatorname{Br}_n(L)$ contains infinitely many pairwise non-conjugate braids.","The topological entropy of $\\operatorname{ex}^k(\\beta)$ is unbounded as $k$ varies, so the link has braid representatives of arbitrarily high dynamical complexity.","For any prescribed dilation bound $R$, sufficiently large $k$ makes $\\operatorname{ex}^k(\\beta)^N$ pseudo-Anosov with dilation $> R$, giving a quantitative sense in which exchange moves create complexity.","Together with the known finiteness theorem modulo exchange moves, the result shows that non-degeneracy of an exchange move is precisely the phenomenon forcing infinitely many conjugacy classes in this setting."],"supporting_citations":[{"why":"Establishes the finiteness theorem modulo exchange moves that motivates the converse question addressed here.","marker":"[BM]"},{"why":"Supplies the Dehn-twist/pseudo-Anosov theorem used to extract the entropy lower bound.","marker":"[Fa]"},{"why":"Shows under additional technical assumptions that exchange moves produce non-conjugate braids; the present proof removes those assumptions.","marker":"[SS]"},{"why":"Earlier result producing non-conjugate braids with the same closure, generalized by the main theorem.","marker":"[Sh]"},{"why":"Earlier result on non-conjugate braids with the same closure link, one of the technical predecessors extended here.","marker":"[St1]"},{"why":"Earlier density-based construction of non-conjugate braids with the same closure, extended here.","marker":"[St2]"}],"fun_headline_variants":["Iterating a non-degenerate exchange move yields infinite non-conjugate braids","Unbounded braid entropy forces infinite non-conjugate representatives","Exchange move unbounds entropy, giving infinite non-conjugate braids","Non-degenerate exchange move blows up entropy, yielding infinite non-conjugate braids"],"cache_read_input_tokens":6272,"weakest_assumption_plain":"The proof takes as given that non-degeneracy ($A(c) \\neq c$ and $B(c) \\neq c$) forces the successive orbit curves to intersect and to fill a $\\beta$-invariant subsurface, and if that geometric fact fails the entropy argument collapses.","fun_headline_variants_meta":{"raw":{"variants":["Iterating a non-degenerate exchange move yields infinite non-conjugate braids","Unbounded braid entropy forces infinite non-conjugate representatives","Exchange move unbounds entropy, giving infinite non-conjugate braids","Non-degenerate exchange move blows up entropy, yielding infinite non-conjugate braids"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001913,"raw_usage":{"total_tokens":7410,"prompt_tokens":782,"completion_tokens":6628,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":398,"completion_tokens_details":{"reasoning_tokens":6549}},"tokens_in":398,"tokens_out":6628,"duration_ms":43841,"temperature":1.0,"reasoning_tokens":6549,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:11:37.934770+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the topological entropy of $\\operatorname{ex}^k(\\beta)$ for a small explicit non-degenerate exchange move, say in $B_4$ or $B_5$ using a train-track algorithm; the theorem predicts the values are unbounded, so a bounded sequence would settle the claim false.","supporting_citations":[],"review_version":1}