REVIEW 2 major objections 4 minor 12 references
Strong marker sets and applications
T0 review · 2 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash
Pith's one-line read For the free part of the Z^n shift, clopen marker sets exist that are d-separated in every orbit and uniformly reachable along every coordinate direction, and these markers yield clopen tree sections and optimal continuous edge colorings.
desk verdict Genuinely useful strengthening of the marker lemma, but the main theorem's spacing argument misses lower-dimensional adjacency and needs a fix before Theorem 4.1 is established. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The carrying device is 'packaging and spacing' applied inside the marker regions supplied by an imported lemma: F($2^{{Z^n}}$) admits a clopen equivalence relation whose classes are n-dimensional rectangles of side lengths d or d+1. The proof selects, within each such rectangle, a family of pairwise separated generalized subrectangles (the packages), places a d-separated marker subset inside each package by a basic rectangle lemma, and spaces the packages so that markers from neighboring rectangles remain d apart. Iterating this in each coordinate direction produces the uniform bound D; for general generators the packages become generalized parallelepipeds anchored on faces and cores of the marker regions.
What would settle it
Check the base lemma in dimension 2 with d=1: either exhibit a clopen equivalence relation on F($2^{{Z^2}}$) whose classes are 1×1 or 2×2 rectangles, or find a configuration whose orbit admits no such clopen tiling; the latter would remove the starting point of the proof of Theorem 4.1.
Extended reading notes
Core claim
The central discovery is Theorem 4.1: for every n,d ≥ 1 there is a D ≥ d and a clopen M ⊆ F($2^{{Z^n}}$) such that (i) any two distinct points of M lying in the same orbit are at rho-distance at least d, and (ii) for each coordinate direction e_i and each configuration x, there are nonnegative integers a,b ≤ D with a e_i · x ∈ M and −b e_i · x ∈ M. In words, a single clopen marker set is simultaneously d-separated and boundedly cofinal in every coordinate direction, with a universal bound D independent of the orbit. The proof builds M locally inside a clopen partition of the space into n-dimensional rectangles of side length d or d+1, placing markers inside subrectangles that are spaced so that markers in neighboring regions remain d apart. The same technique, with generalized parallelepiped packages, proves the analogous theorem for more general generating sets, and from the strong markers the paper derives the clopen tree section and continuous proper edge colorings.
Load-bearing premise
The load-bearing premise is the imported lemma that F($2^{{Z^n}}$) can be partitioned into clopen rectangles of side length d or d+1; if such a clopen rectangular tiling does not exist, the construction has no starting point.
Editorial extensions
If this is right
- For every separation d, every orbit of F(2^{Z^n}) carries a clopen, d-separated marker set that is uniformly reachable from any point in any coordinate direction, with the same D working for all orbits.
- The Schreier graph of F(2^{Z^n}) admits a continuous proper edge (2n+1)-coloring, matching the known optimal count, via a short rule that reads the nearest marker in each direction.
- For n ≥ 2 there is a clopen tree section in F(2^{Z^n}) that is both complete and co-complete, in contrast to prior nonexistence results for clopen sections with boundedly many components.
- For any finite generating set S ⊆ Z^n whose elements have support size 1 or n, which includes every generating set in dimension 2, strong clopen markers exist along every generator, yielding continuous proper edge (2|S|+1)-colorings.
Reading between the lines
- The proof's D grows very fast, and nothing in the paper claims optimality; a natural next question is the minimal growth rate of D in terms of n and d.
- The packaging-spacing template is not tied to the specific alphabet {0,1}, so the same argument should yield strong clopen markers for free parts of Z^n shifts over other finite alphabets; the paper does not state this.
- The tree section produced is likely to have multiple components in every orbit, since earlier impossibility results rule out clopen sections with at most k components; the paper does not compute its component count.
- The strong marker set could serve as a black box for other continuous combinatorial problems on abelian Schreier graphs, such as vertex colorings or matchings, by supplying uniform local coordinates on every orbit.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that for every n,d ≥ 1 there is a clopen set M ⊆ F(2^{Z^n}) such that distinct points of M in the same orbit are at distance at least d, and every point of the space has, in each coordinate direction, a marker point within distance at most D in both the positive and negative directions. This strong marker theorem is then applied to construct a clopen tree section in F(2^{Z^n}) and a continuous proper edge (2n+1)-coloring of the Schreier graph. The last part of the paper extends the marker construction to more general generating sets of Z^n, yielding a new proof of continuous proper edge (2|S|+1)-colorings for arbitrary generating sets in dimension 2.
Significance. Theorem 4.1 is a genuine strengthening of the basic clopen marker lemma: it gives two-sided, uniformly bounded access to markers in every coordinate direction, which makes it a powerful tool for continuous combinatorics on Z^n shifts. The applications to tree sections and edge colorings are natural and relevant, and the paper's constructive method, with its explicit packaging and spacing lemmas, is a useful contribution. The proof is largely self-contained except for the imported marker-region lemma from [4], and the finite combinatorial lemmas (3.1–3.6) are detailed and appear correct. If the gap in the spacing argument identified below is repaired, the main theorem would establish a substantial result.
major comments (2)
- [Section 4, proof of Theorem 4.1] The bound on |J| in the first round (and the analogous bound in later rounds) counts only marker regions T that share an (n−1)-dimensional face with R. The text says: 'there are 2(n−1) many faces of R whose normal vector is not ±e1, and R can be adjacent to 2^{n−1} many other marker regions across each of these faces.' For n ≥ 3, two marker regions can also touch along lower-dimensional faces. For example, with R = [0,D1]^3 and T = [0,D1] × [−D1,0] × [D1,2D1], the regions share the edge [0,D1] × {0} × {D1}; their least corners have distance D1, so they lie in different X_h and are handled in different steps. Since T is not face-adjacent to R, the projections π1(P) for P ∈ P^T_1 are not placed in J. Lemma 3.3 can then assign the same e1-interval to a package in R and a package in T, producing packages with ρ(P,Q) = 0. This directly contradicts inductive hypothesis (vii) and, after applying Lemma 3.1, can place marker points in M at distance less than d0, violating Theorem 4.1(1). If the authors intend 'adjacent' to include all regions with intersecting closures, the numerical bound must be increased to cover up to 3^n−1 neighbors, but no such bound is provided. This issue is load-bearing for the main theorem and must be fixed.
- [Section 4, final paragraph of the proof of Theorem 4.1] The proof asserts 'Finally, we apply Lemma 3.1 to all packages identified by P^R_i to obtain a marker set M. This M is clopen and has the desired properties.' However, Lemma 3.1 only provides, for each point x in a package, an integer a with x + a e_i ∈ M; it does not provide non-negative integers a_i, b_i ≤ D such that both a_i e_i · x and −b_i e_i · x lie in M. The desired property (2) of Theorem 4.1 is two-sided and has a uniform bound. The bound D = 2D1 probably compensates by using markers in the same or neighboring marker regions, but this argument is not written. Please add an explicit verification that for every x and every coordinate direction i, there are markers in both directions within distance D.
minor comments (4)
- [Section 5, proof of Theorem 5.1] The properness verification is only sketched: 'Since color 2n+1 only occurs in places far apart and the other colors are only correlated to the direction of the edges, we conclude that c is proper.' A detailed check is needed, in particular for two incident edges at a vertex that are parallel to the same e_i; this requires relating a_i^x, b_i^x to the corresponding parameters of neighboring vertices.
- [Section 4, Lemma 4.2] The paper relies on [4, Theorem 3.1] for the existence of clopen marker regions with rectangular equivalence classes. This is a nontrivial external dependency and is not proved here. The manuscript should state explicitly that Theorem 4.1 and Theorem 6.7 depend on this imported result.
- [Section 1] There is a typo in the introduction: 'with alphbet {0, 1}' should be 'with alphabet {0, 1}'.
- [Section 4] The term 'adjacent' is used in different senses: for regions in the same X_h it means closures are disjoint with positive distance, while in the counting argument it seems to mean sharing an (n−1)-dimensional face. This ambiguity should be clarified, especially because the major gap above concerns lower-dimensional adjacencies.
Circularity Check
No significant circularity: the main theorem is a genuine strengthening obtained from external partition/marker lemmas, not a restatement of its inputs.
full rationale
The derivation chain of Theorem 4.1 starts from Lemma 4.2 (a clopen equivalence relation whose classes are rectangles, imported from [4, Theorem 3.1]) and Lemma 4.3 (basic clopen marker lemma, imported from [4, Lemma 2.1]), then builds the strong marker set by the in-paper packaging and spacing Lemmas 3.1–3.4. The target property — for every coordinate direction and every x, markers occur at bounded distances a,b ≤ D on both sides — is not contained in either imported lemma: rectangular partitions do not give markers, and the basic marker lemma gives only an unbounded existential marker within distance d. No parameter in the construction is fitted to the conclusion, and no equation defines the output marker set in terms of itself. The applications to edge colorings and tree sections are reductions from the strong marker theorem, not renamings of it; the fact that edge colorings were already known in [8] is an independent benchmark rather than an input. The paper's reliance on [4] is a genuine external dependency (a prior published theorem by a partially overlapping author set), not circularity, because the cited result neither states nor assumes Theorem 4.1. Any concern about whether the adjacency-counting estimate in Section 4 is correct would be a proof-gap issue, not an input-output equivalence.
Assumptions & free parameters
assumptions (4)
- standard math ZFC set theory and standard facts about Polish spaces and Borel sets
- domain assumption F(2^{Z^n}) with the Bernoulli shift is a free continuous Zn action on a Polish zero-dimensional space
- domain assumption Marker regions lemma [4, Theorem 3.1] (Lemma 4.2): for every d there is a clopen equivalence relation on F(2^{Z^n}) with rectangular classes of side lengths d or d+1
- domain assumption Basic clopen marker lemma [4, Lemma 2.1] (Lemma 4.3): for every d there is a clopen marker set with spacing at least d and every point within distance d of a marker
Cite this review
Pith. "Pith review of Strong marker sets and applications." pith.science (2026). https://pith.science/paper/CDVBPT4J
@misc{pith2026250200598,
author = {Pith},
title = {Pith review of: Strong marker sets and applications},
year = {2026},
howpublished = {\url{https://pith.science/paper/CDVBPT4J}},
note = {Machine review of arXiv:2502.00598}
}
abstract
We prove the existence of clopen marker sets with some strong regularity property. For each $n\geq 1$ and any integer $d\geq 1$, we show that there are a positive integer $D$ and a clopen marker set $M$ in $F(2^{\mathbb{Z}^n})$ such that (1) for any distinct $x,y\in M$ in the same orbit, $\rho(x,y)\geq d$; (2) for any $1\leq i\leq n$ and any $x\in F(2^{\mathbb{Z}^n})$, there are non-negative integers $a, b\leq D$ such that $a\cdot x\in M$ and $-b\cdot x\in M$. As an application, we obtain a clopen tree section for $F(2^{\mathbb{Z}^n})$. Based on the strong marker sets, we get a quick proof that there exist clopen continuous edge $(2n+1)$-colorings of $F(2^{\mathbb{Z}^n})$. We also consider a similar strong markers theorem for more general generating sets. In dimension 2, this gives another proof of the fact that for any generating set $S\subseteq \mathbb{Z}^2$, there is a continuous proper edge $(2|S|+1)$-coloring of the Schreier graph of $F(2^{\mathbb{Z}^n})$ with generating set $S$.
Figures
Reference graph
Works this paper leans on
-
[4]
S. Gao, S. Jackson, Countable abelian group actions and hyperfinite equivalenc e relations , Invent. Math. 201 (2015), no. 1, 309–383
work page 2015
- [1]
-
[2]
R. Dougherty, S. Jackson, A. S. Kechris, The structure of hyperfinite Borel equivalence rela- tions, Trans. Amer. Math. Soc. 341 (1994), no. 1, 193–225
work page 1994
-
[3]
J. Feldman, C. C. Moore, Ergodic equialence relations and von Neumann algebras, I , Trans. Amer. Math. Soc. 234 (1977), 289–324
work page 1977
-
[5]
S. Gao, S. Jackson, E. Krohne, B. Seward, Forcing constructions and countable Borel equiv- alence relations, J. Symb. Logic 87 (2022), no. 3, 873–893
work page 2022
-
[6]
S. Gao, S. Jackson, E. Krohne, B. Seward, Continuous combinatorics of abelian group actions , preprint, 2023. arXiv:1803.03872
arXiv 2023
-
[7]
S. Gao, S. Jackson, E. Krohne, B. Seward, Borel combinatorics of abelian group actions , preprint, 2024. arXiv:2401.13866
work page Pith review arXiv 2024
-
[8]
S. Gao, R. W ang, T. W ang, Continuous edge chromatic numbers of abelian group actions , Sci. China Math. (2025). https://doi.org/10.1007/s11425 -024-2336-x
doi:10.1007/s11425 2025
Show all 12 references
-
[9]
Jackson, A
S. Jackson, A. S. Kechris, A. Louveau, Countable Borel equivalence relations , J. Math. Logic 2 (2002), no. 1, 1–80
2002
-
[10]
Jackson, C
S. Jackson, C. Olsen, Tree sections for Zn actions, in preparation
-
[11]
Slaman, J
T. Slaman, J. Steel, Definable functions on degrees . In: Cabel Seminar. Lecture Notes in Mathematics, vol. 1333, 81–85, 37–55. Springer, Berlin, 19 88
-
[12]
W eiss, Measurable dynamics
B. W eiss, Measurable dynamics. In: Conference in Modern Analysis and Probability (R. Beal s et al. eds.). Contemporary Mathematics, vol. 26, 395–421. A merican Mathematical Society, RI, 1984. School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, P.R. Ch...
1984
Reviewed August 9, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.