{"id":"28ab7a20-5bf6-49f5-8a17-210166231b98","arxiv_id":"2505.14247","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Every effective dynamical system on a recursively presented finitely generated group has a computable zero-dimensional Cantor extension, which extends simulation results to non-symbolic systems and yields new Medvedev degree classifications.","lead":"Using computable analysis, this thesis proves that every effective dynamical system of a finitely generated recursively presented group, including many systems on tori, spheres, and other non-symbolic spaces, is a topological factor of a computable zero-dimensional system on Cantor space.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.17's search for effective covers requires semi-deciding containment in interiors of closed-ball covers, which the text asserts but does not establish; since Theorem 4.2's inverse-limit extension depends on that uniform sequence, this is the load-bearing gap.","rationale":"The reader's weakest assumption correctly identifies Lemma 4.17 as the algorithmic heart of Theorem 4.2. My stress-test sharpens the concern: the issue is not merely that the proof is deferred or sketched, but that one of the two semi-decidability claims used in the exhaustive search is not a consequence of the definitions as written. The interiors of finite unions of closures of basic balls are not shown to be effectively open, and the paper itself flags (Example 2.36) that closure operations on effectively open sets can fail to be effective. Since the inverse-limit construction in Theorem 4.21 explicitly uses the sequence (P_n) from Lemma 4.17 and the decidable refinement inclusions to define the effectively closed sets Z_n, a failure of Lemma 4.17 would invalidate the central theorem. I do not claim the theorem is false; a knowledgeable author may supply the missing uniform algorithms or adjust the construction. But the concern is load-bearing and worth a concrete check. Because the reader already returned CONDITIONAL and this analysis does not change that judgment, the verdict remains UNCHANGED.","tokens_in":57857,"tokens_out":24335,"duration_ms":244859,"concrete_test":"Re-derive Lemma 4.17 for the class of covers actually generated (finite unions of closures of rational basic balls) and write explicit uniform semi-decision procedures for (a) closure(V) ∩ X ⊂ int(closure(W) ∩ X) and (b) closure(V) ∩ X ∩ closure(W) ∩ X = ∅, using only the definitions of Section 2.6. If (a) cannot be derived from those definitions, run the lemma's search algorithm on X = [0,1] with P_0 = {[0,1/2], [1/2,1]}: an implementation should still find a P_1 with diameter less than 1/2 using only decidable or semi-decidable conditions on rational endpoints. Failure would show the asserted uniform computation is not justified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Theorem 4.2 rests on Lemma 4.17, which must produce, uniformly in n, effective covers P_n of X with diameter at most 2^{-n}, decidable refinement inclusions, and the partition property in the zero-dimensional case. In the proof of Lemma 4.17, the exhaustive search for P_{n+1} must semi-decide whether a candidate finite union of closures of basic balls satisfies item 2: that its closure is contained in the interior of some element of P_n. The text says this follows because the candidate is recursively compact and 'the interior of the elements in the partition are effectively open.' But P_n elements are finite unions of closures of basic balls, and the paper does not prove that their interiors are effectively open; the paper's own Example 2.36 shows that closure of an effectively open set need not be effectively closed, so the analogous claim for interiors is not automatic. Similarly, the semi-decidability of the zero-dimensional disjointness condition is asserted from recursive compactness, but testing disjointness of closures requires representing the complement as an effectively open cover, which is not immediate for arbitrary finite unions of closed balls. Thus the uniform computability of the P_n—the exact step on which the inverse limit Z and the zero-dimensional extension rest—is not established by the text. This is a proof gap, not a demonstrated counterexample, but it is load-bearing: if the semi-decidability claims cannot be justified, Theorem 4.2 lacks a complete proof.","agreement_with_reader":"agree"},"referee_report":null,"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This is a substantial thesis, and the main result is a real idea: the effective zero-dimensional extension theorem for effective dynamical systems on recursively presented groups, and the corollary that many non-symbolic systems (torus actions, circle rotations, braid group actions) become factors of SFTs. The novelty is genuine, and the framing through computable analysis is useful. The Medvedev degree material is also serious work: the transference results via commensurability, quotients, translation-like actions, and quasi-isometries are well motivated, and the classification results for virtually polycyclic groups and direct products are meaningful.\n\nBut the proof of Theorem 4.2 has a load-bearing gap. Lemma 4.17 must produce effective covers P_n uniformly, with decidable refinement inclusions. The proof asserts that it is semi-decidable whether a finite union of closures of basic balls is contained in the interior of a previous P_n element, because the interior of the elements in the partition are effectively open. That is not established. The elements of P_n are finite unions of closures of basic balls; their interiors are not shown to be effectively open, and Example 2.36 shows the analogous closure/interior assertions are not automatic in this framework. The zero-dimensional disjointness condition has the same problem. Since the inverse-limit extension in Theorem 4.2 rests on this uniform sequence, the main theorem is not fully proved as written. This is a proof gap, not a counterexample, and it might be fixable with a more careful construction, but it needs to be addressed.\n\nThere are also several deferred proofs: Theorem 4.4 is sent to [BCR24], Cohen's quasi-isometry construction in Section 5.3.4 is only summarized, and the text truncates before Chapters 7-9, so parts of the thesis cannot be verified from this submission. That is a lot of weight on external and prior papers, especially given the volume of self-citations. The self-citations are not a flaw in themselves, but the reliance on them is heavy.\n\nOverall: this is a serious thesis that deserves a serious referee. I would send it to peer review, and ask the author to either fill the gap in Lemma 4.17 or state it as a hypothesis, and to provide stable references for the deferred results. The ideas are worth engaging with.","headline":"A serious thesis with a genuinely new main theorem, but the proof of Theorem 4.2 rests on an unproven algorithmic uniformity claim in Lemma 4.17.","tokens_in":58671,"tokens_out":2615,"would_cite":true,"duration_ms":28399,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":null,"created_at":"2026-08-07T15:38:02.709055+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":null,"supporting_citations":[],"review_version":1}