{"id":"7b0f14b7-5949-458c-a848-02cbcf2bb067","arxiv_id":"2412.16600","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"In Z^4 there exists a coupling of two simple random walks under which their traces are disjoint with positive probability.","lead":"Two random walkers in four-dimensional space can be coupled so that their traces never meet, with positive probability. This is the first construction in the borderline dimension 4, where independent walkers would intersect infinitely often.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 8's Hall construction is not a demonstrated coupling: its counting uses 2^T instead of 8^T, its A_i lower bound conflicts with P(E_i) small, and the chopped measure's marginals are never verified.","rationale":"The central claim is a genuine positive-probability non-intersection coupling in Z^4, and the overall strategy - Lawler-type moment estimates plus a Hall-marriage matching at each scale - is coherent. The most load-bearing step, however, is Lemma 8, because it is the only place where a coupling measure is actually constructed. The reader identified the two key problems there: the Hall counting uses 2^T instead of (2d)^T, and the measure obtained from the matching after chopping is not verified to have the correct marginals. My reading confirms and sharpens both points. In addition, the assertion |A_i|≥2^T(1-Cµ) is impossible under the proof's own smallness assumption on P(E_i), since A_i⊂A'_i and |A'_i|=8^T P(E_i); this suggests either a typo in the event direction or a missing conditioning step. These are not mere presentational issues: if the measure in Lemma 8 is not a true coupling of the stopped walks, the induction cannot start and the theorem is unproved. The flaws are concrete and potentially fixable by rewriting the counting with 8^T and proving the marginal identities, which is why the correct verdict remains conditional rather than an outright rejection of the announced result. No evidence of circularity or fabricated results was found, and the paper deserves credit for a plausible new construction and for clearly stating the open questions around it.","tokens_in":18497,"tokens_out":13894,"duration_ms":126661,"concrete_test":"Take the minimal case of Lemma 8: T=1, m=2, E_i equal to the whole path space. Fix any matching φ between all 8 length-1 paths from s1 and all 8 from s2. Compute the first marginal of the measure defined in the lemma. With the paper's 2^{-T} weight, total mass is |A1|/2=4 and each path receives mass 1/2, whereas the SRW law gives mass 1/8; after any renormalization the marginal is uniform on A1, not the original law. This single example shows the construction is not a coupling as written. Independently, recompute |A_i|≥2^T(1-Cµ) using |A'_i|=8^T P(E_i); if P(E_i) is not close to 1, the claimed lower bound fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Lemma 8 is the only place where an actual coupling measure is produced, so its proof must define a probability measure whose marginals are the two stopped SRW laws. As written, this is not established, and the counting in the Hall step is inconsistent. After defining A'_i as the set of length-T paths satisfying E_i and A_i as a subset of A'_i, the proof asserts |A_i| ≥ 2^T(1-Cµ). But in Z^4 there are 8^T length-T paths, not 2^T, and |A'_i| = 8^T P(E_i). The proof has just said P(E_i) may be assumed small, and the theorem later uses P(E_i)≈log^2 n/n^2, so |A_i| cannot be comparable to 2^T. Thus Hall's condition is checked against the wrong cardinality. Second, the proposed measure µ(γ,δ)=2^{-T} |{(γ',δ'): δ'=φ(γ'), γ=γ'[0,τ(γ')], δ=δ'[0,τ(δ')]}| is not shown to have the stopped-walk laws as marginals: full length-T paths have measure 8^{-T} under SRW, chopping is many-to-one with uncontrolled multiplicities, and total mass and the correction on Ac1×φ(A1)c are not accounted for. Without these marginal checks, the inductive step has no verified starting measure and the theorem does not follow from the displayed estimates.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims that in Z^4 one can couple two simple random walks, started at neighboring sites, so that their traces are disjoint with positive probability. The proof uses Hall's marriage theorem: Lemma 6 shows that the set of paths that are 'hittable' by an independent walk with probability close to 1 is small, and Lemma 8 turns this into a coupling on one annulus via a Hall matching between path sets. An induction over growing scales then yields the theorem. The moment estimates in Lemmas 1-7 and Lemma 9 follow Lawler's methods and are presented in detail; the final step, however, rests on Lemma 8, whose proof as written has several load-bearing gaps and errors, and on a final induction estimate that appears arithmetically incorrect.","tokens_in":18820,"tokens_out":27050,"duration_ms":217031,"significance":"If the theorem is correct, it is a striking and non-obvious result: it exhibits a coupling of two transient random walks in the critical dimension 4 that keep apart with positive probability, complementing the known impossibility in d=2 and triviality in d≥5. The strategy of proving existence via Hall's marriage theorem and moment estimates on intersection counts is original and potentially useful. The paper is honest about having no application and about the open three-dimensional case. The detailed estimates in Lemmas 1-7 and Lemma 9 appear plausible and are a valuable contribution in themselves. However, the central coupling construction in Lemma 8 is not rigorously established as written, and the induction in the proof of the theorem contains an arithmetic error; both seem fixable but require substantial revision.","major_comments":[{"comment":"The counting normalization is inconsistent with the state space. The proof uses 2^T as the number of length-T paths in Z^4, but a nearest-neighbor path of length T on Z^4 has 8^T possibilities. Consequently, the statements |A_i| ≥ 2^T(1−Cµ), |∂{γ}| > µ2^T, and ε = |B|2^{−T} are not probabilities under the uniform measure on path space. Lemma 6 controls probabilities with respect to the uniform measure on all length-T paths, i.e., relative to 8^T. This is not a cosmetic issue: for example, if P(E_i) ≈ log^2 n/n^2, then |A'_i| ≈ 8^T log^2 n/n^2, so the claimed lower bound |A_i| ≥ 2^T(1−Cµ) is not a consequence of Lemma 6 and is in fact numerically incompatible with the smallness of P(E_i). The proof must be renormalized with 8^T wherever counts are compared with probabilities.","section":"Lemma 8, paragraph starting 'Let A\\'i be the set of paths...'"},{"comment":"The definition of A_i appears to be inverted. The text defines A_i = A'_i \\ {γ : P(R_{3−i}∩γ ≠ ∅) < 1−3µ}, which keeps the highly hittable paths, and then claims 'by definition, every γ ∈ A1 satisfies that P(R2∩γ ≠ ∅) > 3µ'. Later it also claims 'any γ ∈ A2 satisfies that P(γ∩R1 = ∅) > 3µ'; these two statements are inconsistent with the displayed definition. The intended definition must be the complement, A_i = A'_i \\ {γ : P(R_{3−i}∩γ ≠ ∅) ≥ 1−3µ}, so that every retained path has avoidance probability at least 3µ. Under the displayed definition, the derivation of the lower bound |∂{γ}| > µ2^T does not follow, because a highly hittable path has few avoiding partners, not many.","section":"Lemma 8, definition of A_i"},{"comment":"The measure µ(γ,δ) is not shown to have the correct marginals. The text asserts that a coupling is a measure and defines µ+ν, but it never verifies that the first marginal of this measure equals the law of R1 stopped at ∂B(m), nor that the second marginal equals that of R2. A verification would need to use the fact that the events E_i depend only on the path up to the first hitting time of ∂B(m), so that the sets A_i are extension-closed, and that a stopped path of length ℓ has exactly 8^{T−ℓ} extensions to length T. The role of the 'arbitrary coupling' ν on A^c_1 × φ(A1)^c is also left unspecified; to obtain correct marginals one must take ν to be the independent product of the stopped-walk laws restricted to those complementary sets. As written, the construction does not establish that the joint distribution is a coupling of the two random walks.","section":"Lemma 8, final paragraph ('The coupling is derived from φ...')"},{"comment":"The per-step success probability is miscomputed. The text states that lemma 8 gives success probability 1 − C(P(E1)+P(E2)+1/log 2n^2) = 1 − O(log^2 n/n^2). But 1/log(2n^2) ≈ 1/(2 log n), which dominates the stated P(E_i) ≈ log^2 n/n^2, so the per-step failure probability is of order 1/log n, not O(log^2 n/n^2). Since ∑_{n≥n1} 1/log n diverges, the lower bound p_{n+1} ≥ p_n(1 − C/log n) does not keep p_n bounded away from zero; the induction as written fails. The proof can likely be repaired by choosing steps at doubly exponentially growing scales, but this is not what the manuscript does and the displayed equality is false.","section":"Proof of the theorem, final induction estimate"}],"minor_comments":[{"comment":"The normalization 2^T appears in several places ('|A_i| ≥ 2^T(1−Cµ)', '|∂{γ}| > µ2^T', 'ε = |B|2^{−T}') and must be made consistent with the chosen path-counting convention; as written these expressions do not agree with each other or with the uniform measure on paths.","section":"Lemma 8"},{"comment":"The phrase 'ν is an arbitrary coupling of A^c_1 with φ(A1)^c (say i.i.d.)' is too vague; to make the marginal check work, ν must be the independent product of the relevant stopped-walk laws, and this should be stated explicitly.","section":"Lemma 8, last paragraph"},{"comment":"There are numerous OCR-style typos and duplicated words, e.g., 'In this caseIn this case', 'SinceSince', 'the effectthe effect', and 'ww' for 'x_v − x_w'. These should be cleaned up in revision.","section":"Throughout"},{"comment":"The notation 'R0[σ0, σ0 + n]' appears with σ0 undefined; presumably it should be σ_i or the time of the first intersection. Please clarify.","section":"Lemma 5"}],"recommendation":"major_revision","confidential_remarks":"The paper's main idea is attractive and the moment estimates appear sound, but the coupling lemma (Lemma 8) and the final induction contain errors that are central to the proof. The issues seem fixable—renormalizing with 8^T, correcting the definition of A_i, verifying marginals, and reindexing the induction—so I do not recommend rejection, but the revision must address these points explicitly. The paper also cites a Wikipedia article as reference [9]; this is unusual for a journal submission and should be replaced by a standard reference for Hall's theorem."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the theorem is new and the Hall-marriage strategy is genuinely different, but Lemma 8 as written does not produce a verified coupling. The counting uses 2^T where Z^4 has 8^T length-T paths, and the measure defined at the end of the lemma has no marginals check. These are fixable, but they are load-bearing: the induction starts with that lemma.\n\nWhat's good: the result is the first positive construction in d=4, and the paper says plainly that d≥5 is trivial, d=2 impossible, d=3 open. The moment estimates in Lemmas 2, 5, and 6 are detailed and mostly follow Lawler's method; they look plausible. Lemma 9's use of good times is in the same spirit. The paper is honest about having no application and asks sensible open questions. The non-explicit use of Hall's marriage theorem is a nice idea. The citation to Kozma's Lemma A.11 is a published result, so not a circularity problem.\n\nSoft spots: Lemma 8 is the one place where an actual coupling measure is constructed, and it has real issues. First, the normalization: A'_i is described as 'paths of length T' on Z^4, so the natural count is 8^T, not 2^T. The proof asserts |A_i| ≥ 2^T(1 - Cµ) from Lemma 6, but Lemma 6 is a probability bound and the conversion to this cardinality count is never explained. If 2^T is a typo for 8^T, the rest of the cardinality arguments have to be rescaled, and the measure defined at the end still isn't a probability measure as written: it puts mass |A1|/2^T on the matched pairs and then adds an arbitrary coupling on the complements, with no check that the total mass is 1 or that the marginals are the stopped SRW laws. Without that check, the inductive step has no verified starting measure. The chopped paths introduce many-to-one multiplicities that are not controlled. These are fixable in principle—define the measure on full length-T paths with 8^{-T} weights, then the marginals work out—but the current text doesn't do it. The direction of the inequality in the definition of A_i also looks off at first glance, though the later argument may be salvageable.\n\nFor whom: this is for the random-walk coupling crowd and anyone interested in intersection properties of SRW. It's a solid contribution to that niche, not a field-reshaping one.\n\nRecommendation: send it to a serious referee. The theorem deserves to be in the literature if Lemma 8 can be repaired. But the referee should be asked to check the normalization and marginals carefully; as written, the proof doesn't close.","headline":"New d=4 non-intersection coupling via Hall's theorem, but Lemma 8's coupling measure is not properly defined as written, and the 2^T normalization is wrong.","tokens_in":19347,"tokens_out":14729,"would_cite":true,"duration_ms":112879,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60G50","60J10","05D15"],"pacs":[],"model":"deepseek-v4-flash","headline":"Two simple random walks on the four-dimensional integer lattice can be coupled so that, with positive probability, their traces never meet.","keywords":["random walk","coupling","intersection of traces","Z^4","Hall's marriage theorem","hittable paths","moment method","transient graphs"],"falsifier":"Recompute the normalization in Lemma 8 explicitly: for Ai sets of nearest-neighbour paths of length T in $Z^{4}$, count |Ai|, define the measure by summing over the matching after chopping, and check whether the resulting total mass is at most 1 and whether the marginal on the first coordinate equals the original stopped random walk law. If the total mass exceeds 1, or if the marginal weights a stopped path by the number of its length-T extensions, then the Hall-matching argument as written does not yield a coupling and the proof fails at this point.","tokens_in":18303,"feed_emoji":"🎲","tokens_out":7343,"duration_ms":61926,"temperature":0.7,"pith_summary":"The paper proves that in $Z^{4}$, two simple random walks started at neighbouring sites can be coupled so that their paths never visit a common vertex, and this happens with positive probability. This settles the borderline case of a question that is trivial in dimension at least 5, impossible in dimension 2, and still open in dimension 3. The proof is non-constructive: it uses Hall's marriage theorem to show that, at every scale, enough short paths of the two walkers can be paired so that paired paths are disjoint and end far apart, and then these matchings are combined over growing balls. If the argument is correct, it shows that dimension 4 belongs to the side where such a coupling exists.","feed_headline":"In 4D, random walkers can be coupled to never collide","feed_subtitle":"A marriage-theorem construction gives positive probability of disjoint paths, settling the borderline case between 2D and 5D.","key_machinery":"The load-bearing object is a bipartite matching between two sets A1 and A2 of length-T paths, each set consisting of paths that satisfy a good event and have a small chance of being hit by the other walker. Edges join paths whose traces are disjoint and whose first hitting points on the outer sphere are more than m / log m apart. Hall's condition is verified by Lemma 6, which bounds the probability that a random walk is hittable with probability at least 1 − ε by C ε / $log^{{1/4}}$ n. The coupling measure is then obtained from the matching φ by chopping both paths at the time they first reach the outer sphere. The proof of Lemma 6 itself rests on moment estimates for the sum of intersections of one walk with many independent walks, together with 'good time' estimates that guarantee a typical walk has many periods where future intersections are abundant.","core_discovery":"On the paper's own terms, the central discovery is the theorem: in $Z^{4}$, for two simple random walks R1 and R2 started at neighbouring sites, there exists a coupling with P(R1 ∩ R2 = ∅) > 0. The construction is inductive. The walkers are coupled while running from the boundary of a ball of radius $2^{{n^2}}$ to a ball of radius $2^{{(n+1)^2}}$; at each step a Hall-marriage matching pairs paths that do not intersect and whose endpoints are separated by at least m / log m, where m is the outer radius. The probabilistic input is that a typical random walk path is 'unhittable': with high probability, a second independent walk meets it with probability not close to 1, and the event that it is hittable has probability at most about ε / $log^{{1/4}}$ n. The proof obtains this from moment bounds on the number of intersections with many independent walks, following classical intersection estimates for four-dimensional random walks.","pith_inferences":["The normalization in Lemma 8 appears to use 2^T as the number of length-T nearest-neighbour paths, while in Z^4 there are 8^T such paths; if the count is merely a typo and the true count is used, the marginals of the chopped measure still need to be checked separately.","A stronger statement may be within reach: the same quantitative hittability bounds could allow a coupling where the probability of intersection is made arbitrarily small, not merely positive.","If the marginals of the Hall-marriage measure cannot be verified, the theorem's proof would need a different construction, leaving the existence of such a coupling in Z^4 unresolved.","The proof's structure suggests a possible numerical test in Z^3: if the analogue of Lemma 6 fails there, that would explain why the three-dimensional case is hard."],"forward_implications":["If the theorem is correct, then in Z^4 two random walkers started at neighbouring sites can be coupled so that the event of disjoint traces has positive probability.","The proof yields a quantitative hittability estimate: the probability that a random walk starting on the boundary of a large ball is hittable by an independent walk with probability at least 1−ε is at most K ε / log^{1/4} n.","The cases left open by the paper are dimension 3 and the question of whether a Markovian coupling exists.","The paper states no application for the theorem."],"supporting_citations":[{"why":"Supplies the Green's function estimate G(x,y) ≈ |x−y|^{-2} and the intersection estimates that underlie the hittability bounds.","marker":"[5]"},{"why":"Hall's marriage theorem, which guarantees the existence of the matching between the two path sets.","marker":"[9]"},{"why":"Provides the Harnack inequality and exit-location bounds used in the endpoint separation estimate.","marker":"[6]"},{"why":"Provides a bound on the probability that a walk exits a small ball before leaving a larger one, used in Lemma 9.","marker":"[4]"},{"why":"Supplies the reflection principle used in Lemma A.5 to lower-bound expected exit times.","marker":"[3]"},{"why":"Frames the question of avoidance coupling and gives results for other dimensions that serve as context.","marker":"[1]"}],"fun_headline_variants":["In 4D, random walkers can be coupled to avoid each other","Coupling for 4D random walks yields disjoint paths","4D random walks can be paired so they never meet","Marriage theorem pairs 4D walkers onto disjoint paths"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The construction's validity depends on the step where the matching from Hall's theorem is converted into a true coupling; the proof asserts this without checking the marginals, and its path counting appears to use 2^T as the number of length-T walks, while in $Z^{4}$ there are 8^T such walks, so this normalization step is not yet established.","fun_headline_variants_meta":{"raw":{"variants":["In 4D, random walkers can be coupled to avoid each other","Coupling for 4D random walks yields disjoint paths","4D random walks can be paired so they never meet","Marriage theorem pairs 4D walkers onto disjoint paths"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000575,"raw_usage":{"total_tokens":2614,"prompt_tokens":743,"completion_tokens":1871,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":359,"completion_tokens_details":{"reasoning_tokens":1799}},"tokens_in":359,"tokens_out":1871,"duration_ms":13127,"temperature":1.0,"reasoning_tokens":1799,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T10:26:48.095241+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Recompute the normalization in Lemma 8 explicitly: for Ai sets of nearest-neighbour paths of length T in $Z^{4}$, count |Ai|, define the measure by summing over the matching after chopping, and check whether the resulting total mass is at most 1 and whether the marginal on the first coordinate equals the original stopped random walk law. If the total mass exceeds 1, or if the marginal weights a stopped path by the number of its length-T extensions, then the Hall-matching argument as written does not yield a coupling and the proof fails at this point.","supporting_citations":[{"cited_title":"Fifth edition","cited_arxiv_id":null,"evidence_quote":"Supplies the reflection principle used in Lemma A.5 to lower-bound expected exit times."},{"cited_title":"Lawler,Intersections of random walks","cited_arxiv_id":null,"evidence_quote":"Supplies the Green's function estimate G(x,y) ≈ |x−y|^{-2} and the intersection estimates that underlie the hittability bounds."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Hall's marriage theorem, which guarantees the existence of the matching between the two path sets."},{"cited_title":"Lawler and Vlada Limic,Random walk: a modern introduction","cited_arxiv_id":null,"evidence_quote":"Provides the Harnack inequality and exit-location bounds used in the endpoint separation estimate."},{"cited_title":"Acta Math","cited_arxiv_id":null,"evidence_quote":"Provides a bound on the probability that a walk exits a small ball before leaving a larger one, used in Lemma 9."},{"cited_title":"Holroyd, James Martin, David B","cited_arxiv_id":null,"evidence_quote":"Frames the question of avoidance coupling and gives results for other dimensions that serve as context."}],"review_version":1}