{"id":"a5d7b605-8cbb-49b5-8e5e-ee1124c8e475","arxiv_id":"2504.17504","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A topological system is disjoint from every minimal system exactly when it has countably many dense minimal subsets each disjoint from it, with analogous residual-pair and distal characterizations.","lead":"A new set of theorems characterizes which dynamical systems are disjoint from all minimal systems, using countably many minimal subsets, residual pairs, and quasifactors. It is the topological counterpart of a recent ergodic-theory result and answers a Furstenberg problem for general systems.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem A as stated is false: it asserts a countable union of minimal subsets equals X, but the proof (and the abstract) only establishes a dense union; the identity on [0,1] is a counterexample to the equality version.","rationale":"I agree with the reader's overall conditional assessment, but the load-bearing concern I identify is the equality-versus-density overclaim in Theorem A, not the reader's named weakest assumption of metrizability. Metrizability is built into the paper's definition of a topological dynamical system and is therefore not a flaw within the stated framework. By contrast, the equality version of Theorem A is false already inside that framework: the identity on [0,1] is a compact metric system disjoint from all minimal systems whose minimal subsystems are exactly the uncountably many fixed points. The proof in Section 6.1 establishes only a dense union, and the abstract correctly says dense. This is an internal inconsistency between the formal theorem and its proof, and it propagates to Theorem B. It is repairable by changing the statement to ``dense union,'' and it does not appear to damage the abstract's advertised characterization or the main proof architecture. Hence the verdict should remain conditional rather than rejection. The reader's rationale also flags the same discrepancy, so there is partial agreement, but the reader's stated weakest assumption points elsewhere.","tokens_in":33989,"tokens_out":15311,"duration_ms":161613,"concrete_test":"Use the one-line counterexample to settle the concern: let X=[0,1] and T=\\mathrm{id}. Verify (a) X\\perp M, because for any minimal (Y,S) and any joining J, each fiber J[x] is nonempty, closed, S-invariant, hence J[x]=Y, so J=X\\times Y; and (b) the only minimal subsystems of X are singleton fixed points, so no countable family has union equal to [0,1]. This refutes Theorem A with equality. Then check that replacing ``\\cup M_i = X'' by ``\\cup M_i dense in X'' in Theorem A and re-reading Section 6.1 gives a consistent statement, exactly matching the abstract and the actual proof.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most load-bearing concern is the equality-versus-density overclaim in Theorem A (Section 1.2). The forward direction of the proof uses Theorem 3.3 to obtain minimal subsets whose union is dense, not equal to X, and the converse in Section 6.1 uses density at every point where the union is invoked. Thus the theorem's formal statement with \\cup_{i\\in\\mathbb{N}} M_i = X is never proved. It is not merely unproved but false: take (X,T)=([0,1], \\mathrm{id}). Every point is a fixed point, so the only minimal subsystems are singletons; any countable union of singletons is countable and cannot equal [0,1]. Yet X is disjoint from every minimal system: for any minimal (Y,S) and joining J, each vertical section J[x] is nonempty, closed, S-invariant, and hence equals all of Y, forcing J=X\\times Y. Therefore the ``if and only if'' in Theorem A, as printed, is wrong. The abstract's dense version is the correct statement and is what the proof actually supports. The same equality-versus-density overclaim appears in Theorem B and its forward proof. This is a repairable but genuine correctness defect in the paper's central formal claim.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper characterizes topological dynamical systems that are disjoint from all minimal systems. Its main results are: Theorem A, an intrinsic characterization via a countable family of minimal subsystems that are each disjoint from the whole system and whose union is dense; Theorem B, a characterization through almost one-to-one extensions with a topological decomposition; Theorem C, a residual-pair characterization for semi-simple systems; Theorem D, a characterization for distal systems in terms of the regionally proximal relation; and Theorem E, the countability of pairwise disjoint quasifactors of a minimal system. The paper also gives a measure-theoretic analogue and several examples and open questions.","tokens_in":1386,"tokens_out":1466,"duration_ms":106817,"significance":"If the defects noted below are repaired, the paper gives a substantial and largely self-contained set of intrinsic characterizations for a class that has been studied since Furstenberg's work. The countability result for pairwise disjoint quasifactors (Theorem E) is elegant and likely to be useful independently. The paper is also careful in pointing out where metrizability is essential (Remark 5.6) and where the almost one-to-one assumption is needed (Example 1.3). The detailed proofs, explicit examples, and open questions make the contribution valuable for the topological dynamics community.","major_comments":[{"comment":"Theorem A states that X perp M if and only if there are minimal subsets (M_i) with union over i in N of M_i equals X and M_i perp X. The proof, however, establishes only that the union is dense in X, exactly as the abstract states. The equality version is false: for (X,T)=([0,1], id), every minimal subsystem is a singleton and X perp M, but no countable union of singletons can equal [0,1]. The statement should be corrected to dense in X throughout, and all later uses of this equality (e.g., in the proof of Theorem B) should be adjusted accordingly.","section":"Section 1.2, Theorem A"},{"comment":"The set J defined in the proof is asserted to be a joining. A joining must be closed and must project onto both coordinates. The set as defined is not shown to be closed, and its projection onto Y need not be all of Y. If one takes the closure to obtain a closed invariant set, it is not automatic that the closure remains disjoint from the open set W times V, which is the property used to contradict X perp Y. This step is load-bearing for Corollary 4.4 and for the converse of Theorem A. Please provide a correct proof or an explicit citation of the corresponding lemma from reference [22].","section":"Section 4, Claim in the proof of Theorem 4.3"},{"comment":"Conditions (2) and (3) of Theorem 6.3 assert that union of M_i equals X. The implication (1) implies (2) cites Theorem 3.3, which only gives a dense set of minimal points and hence a dense union of minimal subsystems, not equality. The equality statement is false even for the full shift, which is transitive, belongs to M-perp, and has only countably many minimal subsystems. The theorem should be restated with dense in X in conditions (2) and (3).","section":"Section 6.2, Theorem 6.3"},{"comment":"In the forward direction of Theorem B, the proof says that because X* perp M, Theorem A gives minimal sets (M_i) with union equal to X*. Since Theorem A itself only supports a dense union, the equality here is not justified. The later argument only needs the union to be dense in X*, so the statement and proof should be changed accordingly.","section":"Section 7.2, proof of Theorem B"}],"minor_comments":[{"comment":"The abstract states correctly that the union is dense in X, but Theorem A in the body states equality. Please make the two formulations consistent.","section":"Abstract and Section 1.2"},{"comment":"The hypothesis in Proposition 5.10 uses equality to X_beta, but only density is used in the proof (Claim 3 needs a sequence converging to the transitive point). The statement should say dense in X_beta.","section":"Proposition 5.10 and its proof"},{"comment":"The proof writes union of Y_j equals X after invoking Theorem 3.4, which provides only a dense union. Density is sufficient for the argument, but the equality should be corrected.","section":"Section 7.2, proof of Theorem 7.2"},{"comment":"The phrase 'Oprocha proposed an sufﬁcient condition' contains a typo; it should be 'a sufﬁcient condition'.","section":"Section 1.1"}],"recommendation":"major_revision","confidential_remarks":"The mathematical core of the paper is substantial, and the defects I found appear repairable: the equality-versus-density mismatch is a systematic but local error, and the joining in Theorem 4.3's Claim needs a correct closure argument or an explicit reference. I recommend major revision rather than rejection, and I suggest that the authors do a systematic pass to replace every occurrence of a full union of minimal sets by the dense version that the proofs actually establish."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper has a real result inside, but the main theorem as printed is false. Theorem A states that X is disjoint from all minimal systems iff there are minimal subsets Mi with ⋃ Mi = X, each disjoint from X. The proof only establishes the union is dense, and the abstract says dense. The equality version is false: take X=[0,1] with T=id. Every point is fixed, the only minimal subsystems are singletons, any countable union is countable and can't be [0,1], yet X is disjoint from every minimal system since any joining's vertical sections are closed invariant subsets of the minimal factor, hence all of it. So the theorem needs \"dense\" not \"=\". The same overclaim appears in Theorem B and Theorem 6.3(2).\n\nThat said, the dense-union characterization is correct and genuinely new. It answers Furstenberg's problem for general systems, not just transitive ones, and the proof is substantive. Theorem E, the countability of pairwise disjoint quasifactors of a minimal system, is a nice and reusable tool; it uses separability of C(X) and explains why metrizability matters. Theorems C and D for semi-simple and distal systems are plausible and well-motivated by the Górksa-Lemańczyk-de la Rue work. The measure-theoretic appendix is fine.\n\nThe soft spots are real but minor compared to the equality issue. In the proof of the Claim in Theorem 4.3, the joining J is defined as a union of orbits without taking a closure, so closedness is not immediate; add a closure. The assertion that the recurrent points form a dense Gδ in Theorem B is true in the context (dense minimal points imply dense recurrent points, and the recurrent set is always Gδ) but should be stated with a proof. Also check Theorem 6.3(2) and Proposition 5.10 for the same equality/density confusion.\n\nIf the authors fix the statements to the dense version, this is a solid contribution to topological dynamics. I'd send it to peer review; the referee should focus on the equality/density issue and the minor gaps. The central machinery holds up.\n\nFor you: if you work on disjointness, cite the dense version. It's worth a reading-group slot.","headline":"The paper's real theorem is the dense-union version; the printed equality version is false, but the repair is straightforward.","tokens_in":34775,"tokens_out":4491,"would_cite":true,"duration_ms":45702,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["37B05","37A05","54H20"],"pacs":[],"model":"deepseek-v4-flash","headline":"A topological system is disjoint from every minimal system exactly when countably many minimal subsystems, each disjoint from the whole, fill it densely.","keywords":["topological dynamical systems","disjointness","minimal systems","quasifactors","hyperspace systems","topological ergodic decomposition","semi-simple systems","distal systems"],"falsifier":"Find a compact metric minimal system with uncountably many pairwise disjoint nontrivial quasifactors; Theorem E would be false and the proof of Theorem A's converse would collapse. Alternatively, exhibit a compact metric system that is disjoint from all minimal systems but has no countable dense family of minimal subsystems each disjoint from the whole, directly contradicting Theorem A.","tokens_in":33751,"feed_emoji":"🧩","tokens_out":5761,"duration_ms":50773,"temperature":0.7,"pith_summary":"This paper aims to characterize, inside compact metric topological dynamics, exactly which systems are disjoint from every minimal system—meaning the only joining with any minimal system is the trivial product. Its central theorem states that a system has this property precisely when it contains countably many minimal subsystems, each itself disjoint from the whole system, whose union is dense. This turns a property defined by quantifying over all minimal systems into an intrinsic, countable condition on the system itself. The result is a topological analogue of a recently proved ergodic-theoretic characterization, and it comes with parallel characterizations for semi-simple and distal systems.","feed_headline":"Countable minimal pieces decide disjointness from all minimal systems","feed_subtitle":"X avoids every minimal system exactly when countably many minimal subsystems cover it densely.","key_machinery":"The central objects are quasifactors—minimal subsystems of the hyperspace $(2^X, T)$—together with the order of a closed set $A$, defined as the largest $n$ for which $A \\cap TA \\cap \\cdots \\cap T^{n-1}A$ is nonempty. The paper proves that any collection of pairwise disjoint nontrivial quasifactors of a minimal system is at most countable, using Urysohn separation to build continuous functions with $\\|f_X - f_Y\\| \\geq 1$ and then the separability of $C(X)$. This countability is the engine: it forces a countable dense family of minimal subsystems in Theorem A and yields the residual-pair characterization for semi-simple systems via Mycielski's theorem, and it ultimately rests on metrizability of $X$.","core_discovery":"In the paper's own terms, for a topological dynamical system $(X,T)$ on a compact metric space, $X \\perp \\mathcal{M}$—disjointness from every minimal system—holds if and only if there are minimal subsets $M_i \\subseteq X$ whose union is dense in $X$ and each $M_i$ is disjoint from $X$. The forward direction upgrades the previously known fact that such systems have dense minimal points to a countable dense family of minimal subsystems each individually disjoint from the whole. The converse shows that this countable 'dense disjoint minimal subsets' structure is sufficient: if such a family exists, no minimal system can form a nontrivial joining with $X$. The paper also proves that for semi-simple systems, $X \\perp \\mathcal{M}$ is equivalent to the residual set $\\Delta^\\perp(X)$ of pairs $(x_1,x_2)$ whose orbit closures are disjoint, and for distal systems it is equivalent to $W\\times W \\subset Q(X)$ for every minimal subsystem $W$.","pith_inferences":["The countable-DDMS characterization suggests a constructive route to test membership in $\\mathcal{M}^\\perp$: one only needs to exhibit countably many minimal subsystems satisfying disjointness with the ambient system, rather than checking all minimal systems at once.","The heavy dependence on separability of $C(X)$ indicates the general-group or non-metrizable setting will look different; the universal minimal flow mentioned in the paper is a signpost that uncountable collections of quasifactors can appear once metrizability is dropped.","If the open product question (Question 1) is answered affirmatively, the DDMS structure would likely be preserved under products, giving a topological counterpart to the ergodic product property proved in the appendix.","One testable extension would be to formulate an algorithmic or pointwise version: for a computable system, decide membership in $\\mathcal{M}^\\perp$ by checking whether orbit closures of points in a countable dense sequence are pairwise disjoint minimal sets."],"forward_implications":["Every system disjoint from all minimal systems has a countable dense family of minimal subsystems each disjoint from the whole (DDMS), and conversely; membership in $\\mathcal{M}^\\perp$ is therefore readable from an intrinsic countable witness.","For transitive systems, disjointness from all minimal systems is equivalent to each transitive point being proximal to each minimal point of the system (Theorem 6.3).","For semi-simple systems, typical pairs of points have disjoint orbit closures: $\\Delta^\\perp(X)$ is residual exactly when $X \\perp \\mathcal{M}$.","For distal systems, $X \\perp \\mathcal{M}$ holds iff every minimal subsystem $W$ satisfies $W\\times W \\subset Q(X)$, and iff the maximal equicontinuous factor of every almost one-to-one distal extension consists of fixed points.","From any uncountable family of pairwise disjoint minimal systems, every minimal system is disjoint from at least one member (Corollary 5.7)."],"supporting_citations":[{"why":"Introduces disjointness and joinings, proves totally transitive systems with dense periodic points are disjoint from all minimal systems, and supplies the basic properties used throughout.","marker":"[12]"},{"why":"Provides the ergodic characterization (disjoint from all ergodic automorphisms iff typical ergodic components are disjoint) that the paper's topological results are modelled on and used in the appendix.","marker":"[19]"},{"why":"Gives the alternative proof of the ergodic characterization that the paper adapts to the topological setting.","marker":"[18]"},{"why":"Establishes that a system disjoint from all minimal systems has dense minimal points and supplies the maximal-transitive-subsystem characterization used to build the DDMS family.","marker":"[22]"},{"why":"Provides the necessary and sufficient Oprocha-type condition for transitive systems and the product property for powers, background for the general problem.","marker":"[21]"},{"why":"Introduces quasifactors and the joining-quasifactor construction (Corollary 3.11) that produces nontrivial quasifactors from nontrivial joinings.","marker":"[13]"},{"why":"Supplies the topological ergodic decomposition theorem (almost one-to-one extension with open factor map) used in the proof of Theorem B.","marker":"[2]"},{"why":"Provides Mycielski's theorem used in the proof of Theorem C to obtain a Cantor set of points with pairwise disjoint orbit closures.","marker":"[25]"}],"fun_headline_variants":["Countable dense minimal subsystems decide disjointness","Disjointness iff countable dense minimal subsystems","Minimal subsystems dense: disjointness criterion","Countable minimal subsets characterize disjointness","Dense minimal pieces: key to disjointness"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The argument relies on the phase space being compact and metrizable: separability of $C(X)$ is what makes the collection of pairwise disjoint quasifactors countable, and without metrizability the main characterizations can fail.","fun_headline_variants_meta":{"raw":{"variants":["Countable dense minimal subsystems decide disjointness","Disjointness iff countable dense minimal subsystems","Minimal subsystems dense: disjointness criterion","Countable minimal subsets characterize disjointness","Dense minimal pieces: key to disjointness"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000245,"raw_usage":{"total_tokens":1534,"prompt_tokens":942,"completion_tokens":592,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":558,"completion_tokens_details":{"reasoning_tokens":526}},"tokens_in":558,"tokens_out":592,"duration_ms":5567,"temperature":1.0,"reasoning_tokens":526,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-16T10:39:16.960890+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Find a compact metric minimal system with uncountably many pairwise disjoint nontrivial quasifactors; Theorem E would be false and the proof of Theorem A's converse would collapse. Alternatively, exhibit a compact metric system that is disjoint from all minimal systems but has no countable dense family of minimal subsystems each disjoint from the whole, directly contradicting Theorem A.","supporting_citations":[{"cited_title":"Furstenberg, Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation, Math","cited_arxiv_id":null,"evidence_quote":"Introduces disjointness and joinings, proves totally transitive systems with dense periodic points are disjoint from all minimal systems, and supplies the basic properties used throughout."},{"cited_title":"Huang and X","cited_arxiv_id":null,"evidence_quote":"Establishes that a system disjoint from all minimal systems has dense minimal points and supplies the maximal-transitive-subsystem characterization used to build the DDMS family."},{"cited_title":"Huang, S","cited_arxiv_id":null,"evidence_quote":"Provides the necessary and sufficient Oprocha-type condition for transitive systems and the product property for powers, background for the general problem."},{"cited_title":"Glasner, Compressibility properties in topological dynamics , Amer","cited_arxiv_id":null,"evidence_quote":"Introduces quasifactors and the joining-quasifactor construction (Corollary 3.11) that produces nontrivial quasifactors from nontrivial joinings."},{"cited_title":"Akin and E","cited_arxiv_id":null,"evidence_quote":"Supplies the topological ergodic decomposition theorem (almost one-to-one extension with open factor map) used in the proof of Theorem B."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides Mycielski's theorem used in the proof of Theorem C to obtain a Cantor set of points with pairwise disjoint orbit closures."}],"review_version":1}