Pith. sign in

REVIEW 4 major objections 6 minor 12 references

On a bi-lateral Adding Machine and its characterization

T0 review · 4 major / 6 minor · reviewed 2026-08-16 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A two-sided adding machine on a mixed-alphabet zip space is characterized by nested clopen covers; if correct, the map is minimal and not a zip shift.

desk verdict The bilateral odometer construction is new and worth knowing, but Theorem 2.20 is false as stated because it never fixes the transition map tau, and for a valid tau the covering dynamics fail. read the letter →

arxiv 2505.02149 v1 pith:YQEQ6TDU submitted 2025-05-04 math.DS

Pouya Mehdipour , Rebeca M. S. dos Santos This is my paper · ORCID
classification math.DS MSC 37B0537B10
keywords bilateraladdingmachineodometerzipspaceminimalhomeomorphismclopencovertopologicalconjugacyS-expansivitysymbolicdynamics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper constructs a bilateral version of the classical adding machine, or odometer, on a zip space in which the nonnegative positions use the alphabet $\{0,\dots,j-1\}$ and the negative positions use a two-letter alphabet $\{a_0,b_1\}$, linked by a fixed transition map. It proves that the resulting map $f_\alpha$ is a homeomorphism, that the space is minimal for it, and that the map is not expansive. The main result is an if-and-only-if description: a continuous map on a compact metric space is topologically conjugate to $f_\alpha$ exactly when it cyclically permutes a compatible family of clopen covers with $2^i j^{k+1}$ pieces, the covers refine in both directions, and nested chains of cover elements shrink to single points. If this characterization stands, it gives a two-sided analogue of the classical adding-machine classification and shows that bilateral odometers lie outside the class of zip shift maps.

What carries the argument

The machinery has two parts. The first is the zip space itself: a two-sided symbolic space whose right-hand coordinates come from $S=\{0,\dots,j-1\}$ and whose left-hand coordinates are images of those symbols under a fixed surjective transition map $\tau:S\to\{a_0,b_1\}$; this is the state space $\Delta_\alpha$. The second is the adding operation: ordinary base-$j$ addition on the right, and on the left addition modulo 2 whose incoming carry is $s_1=\tau(x_0+y_0\bmod j)$. The characterization theorem isolates the covering structure this operation creates: for each pair $(-i,k)$ a partition into $2^i j^{k+1}$ clopen sets, each moved one step by $f$, with refinement occurring on both the negative and positive sides. The single-point intersection condition turns this purely combinatorial cover data into a coding of unique points, which is what makes the covers a complete invariant for conjugacy.

What would settle it

Fix $j=3$ and choose $\tau(0)=a_0$, $\tau(1)=\tau(2)=b_1$. Start with any point in the cylinder $C^{-1,0}_{a_0,0}$. After three applications of $f_\alpha$, the positive coordinate has cycled $0\to1\to2\to0$ and the two $b_1$ carries into the negative coordinate cancel modulo 2, so the point lies again in $C^{-1,0}_{a_0,0}$. Thus the six-member cover $\mathcal{P}_{-1,0}$ is not permuted as a six-cycle, contradicting condition (1) of Theorem 2.20 for the very map the theorem claims to characterize.

Watch

Extended reading notes

Core claim

The central object is the bilateral adding machine $f_\alpha$, defined on the zip space $\Delta_\alpha$ by adding the constant sequence $(\dots,a_0,a_0;1,0,0,\dots)$: positive coordinates carry in base $j$, and the first carry into the negative side is $s_1=\tau(x_0+y_0 \bmod j)$, where $\tau$ is a fixed surjection from $\{0,\dots,j-1\}$ onto $\{a_0,b_1\}$. The paper shows $f_\alpha$ is a homeomorphism and $\Delta_\alpha$ is $f_\alpha$-minimal. Its principal claim, Theorem 2.20, is that for $\alpha=(\dots,2,2;j,j,\dots)$ a continuous map $f$ on a compact metric space $X$ is conjugate to $f_\alpha$ exactly when, for every $i\in\mathbb{N}$ and $k\in\mathbb{Z}^+$, $X$ carries a partition $\mathcal{P}_{-i,k}$ into $m(-i,k)=2^i j^{k+1}$ nonempty clopen sets cyclically permuted by $f$, with $\mathcal{P}_{-i+n,k+m}$ refining $\mathcal{P}_{-i+n-1,k+m-1}$, and with every nested sequence of members intersecting in exactly one point. The paper applies this characterization to show that no bilateral adding machine is topologically conjugate to the restriction of a full zip shift to a closed invariant subset, because zip shifts are $S$-expansive while $f_\alpha$ is not.

Load-bearing premise

The characterization quietly assumes the carry rule at the junction, governed by the transition map $\tau$, produces the full tower of cycles counted by $2^i j^{k+1}$; the paper never states which choices of $\tau$ have this property, and the theorem fails for choices where the carries do not accumulate.

Editorial extensions

If this is right

  • Any map conjugate to $f_\alpha$ can be recognized by checking finite clopen partitions level by level, rather than by constructing an explicit conjugacy.
  • The bilateral adding machine is minimal but not expansive, so it occupies a part of zero-dimensional dynamics outside the expansive and zip-shift classes.
  • No restriction of a full zip shift to a closed invariant set is topologically conjugate to $f_\alpha$; the bilateral odometer is therefore a genuine non-zip-shift homeomorphism.
  • Infinite minimal systems with a regularly recurrent point admit a continuous surjection onto a bilateral adding machine whose fiber over the image of that point is a singleton.
  • The cover sizes $2^i j^{k+1}$ give a concrete counting test: a candidate map must permute exactly that many clopen pieces at every level to qualify.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The theorem does not fix the transition map $\tau$, and not every choice of $\tau$ produces the tower structure the characterization requires; for $j=3$ with $\tau(0)=a_0$ and $\tau(1)=\tau(2)=b_1$, three applications of $f_\alpha$ return a two-coordinate cylinder to itself, so the six-member cover splits into three-cycles rather than one six-cycle.
  • A corrected statement would either impose a parity condition on $\tau$ (an odd number of $b_1$-values among $\{0,\dots,j-1\}$) or replace the cyclic-permutation condition by the actual permutation type induced by the chosen $\tau$.
  • The same cover-based method could be extended to odometers whose left alphabet is any finite abelian group, provided the transition map and carry rule are chosen so that the induced partitions really are cyclic towers.
  • One could test whether the symbolic-model theorem for regularly recurrent systems factorizes through all choices of $\tau$ or only through those that satisfy the cyclic-cover condition.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper introduces a bilateral adding machine f_alpha on a "zip space" Delta_alpha, with nonnegative coordinates in {0,...,j-1} and negative coordinates in {a0,b1}, where carries from the positive side enter the negative side through a transition map tau. It claims that f_alpha is a homeomorphism (Proposition 2.11), that Delta_alpha is minimal (Proposition 2.13), that f_alpha is not expansive (Proposition 2.16), and that it admits a Block-Keesling style characterization by refining clopen partitions (Theorem 2.20). It further states a general symbolic model theorem for minimal systems with regularly recurrent points (Theorem 2.25) and concludes that f_alpha is not conjugate to any zip shift map (Proposition 2.26).

Significance. The intended construction is a natural two-sided analogue of the odometer, and the partition characterization in Theorem 2.20 is a reasonable extension of the classical Block-Keesling theorem. The paper also contains a useful formulation of two-sided refinement in Remark 2.21. However, the main claims are not supported as written: f_alpha depends on an unspecified transition map tau, and for a legitimate choice of tau the asserted minimality and cyclic partition property fail. Since the central characterization theorem is false as stated and the supporting proofs contain substantial gaps, the paper does not currently establish its advertised results. The paper provides no machine-checked proofs or code; its positive contributions are the explicit examples and the conceptual framing of the bilateral refinement condition.

major comments (4)
  1. [Definition 2.7 / Theorem 2.20] The map f_alpha is not well defined until the transition map tau is chosen, because the carry into coordinate -1 is s1=tau(x0+y0 mod j). Theorem 2.20 never fixes or restricts tau. For j=3, take tau(0)=tau(1)=b1 and tau(2)=a0 (writing a0=0, b1=1). On the first three coordinates (x0,x_-1,x_-2), f_alpha decomposes into two invariant 6-cycles, e.g. (0,0,0)->(1,1,0)->(2,1,0)->(0,0,1)->(1,1,1)->(2,1,1)->(0,0,0) and its complement. Consequently the cover Q(-1,0) is permuted in two 3-cycles, not one 2j=6-cycle, so condition (1) of Theorem 2.20 fails for the very map the theorem claims to characterize. The forward implication is therefore false even with X=Delta_alpha and h=id.
  2. [Proposition 2.13] The minimality proof is not valid and the statement is false for arbitrary tau. The induction assumes that carrying 1 into the negative coordinates occurs after a uniform number of iterations (j, 2^kj, etc.), but the carry into coordinate -1 is governed by tau(x0+1), which can create carries at other positive digits. With the tau of the previous comment, the clopen set consisting of the six 3-coordinate cylinders from one of the two cycles is a nonempty proper closed f_alpha-invariant subset of Delta_alpha; hence Delta_alpha is not minimal for that choice of tau. Thus Proposition 2.13 is false as stated.
  3. [Proposition 2.11] The surjectivity proof does not establish a preimage. Given y, the proof sets x_-1=a0 or b1 regardless of y0 and then claims f_alpha(x)=y, which requires a0+tau(y0)=y_-1 in the first case and b1+tau(y0)=y_-1 in the second. This condition is equivalent to tau(y0)=a0 and is not true for arbitrary tau. The correct preimage condition is x_-1 = y_-1 - tau(y0) mod 2. Thus the proof that f_alpha is a homeomorphism is incomplete, and any use of a conjugacy in Theorem 2.20 is not supported by the presented argument.
  4. [Theorem 2.25 and Lemma 2.18] Several load-bearing steps in the proof of the symbolic model theorem are unsound. Lemma 2.18 is stated for a continuous map f, but in Claim 2 the proof cancels f^i in the equality f^i(x)=f^j(z) to conclude x=f^{j-i}(z); this requires injectivity of f, which is not assumed. In Theorem 2.25, statement 4 chooses x in M1∩M2 without proving the intersection is nonempty, and the assertion that f^t(Y)∩Y is nonempty exactly when t is a multiple of n (and likewise for k) is not a consequence of minimality alone. Since these claims are used to construct the coverings Q_{m_i} and the factor map pi, the proof of Theorem 2.25 is incomplete.
minor comments (6)
  1. [Definition 2.9] Equation (5.4) in Definition 2.9 should be numbered within Section 2, probably (2.4); the reference to Section 5 is a typo.
  2. [Theorem 2.20, condition (2)] The notation 'P_{-i+n,k+m} with n in N partitions P_{-i+n-1,k+m-1}' is unclear and does not match the refinement used in the proof, which is Q(-i-1,k+1) refines Q(-i,k). The statement and proof should be aligned.
  3. [Proposition 2.16] The proof that f_alpha is not expansive says the iterates differ only in digits beyond the N-th place for all n, but this is not self-evident and should be justified, since carries in an adding machine can propagate to arbitrarily high coordinates.
  4. [Proposition 2.26] The text contains the typo 'machins' for 'machines'.
  5. [Proposition 2.15] The proof relies on the unpublished preprint [11] for S-expansivity; if this result is essential, it should be either proved in the paper or cited with a precise and verifiable reference.
  6. [Various] There are several indexing and notation errors, including 'y0 <= j0-1' in Proposition 2.11, 'for j = 1,...,i-1' in Definition 2.22, and the garbled sentence 'there exists fi(M) with 1 <= i <= t1 1 <= i <= t' in the proof of Lemma 2.18.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity found; the main characterization is a self-contained coding/covering argument.

full rationale

The central claim, Theorem 2.20, is a covering characterization in the style of Block–Keesling [2]. The forward direction constructs cylinder partitions in the model space and transfers them via the conjugacy; the reverse direction reconstructs the conjugacy by matching nested partition elements. Conditions (1)–(3) are assumptions on an arbitrary system (X,f), not consequences of the conclusion that f is conjugate to f_alpha, so the proof does not presuppose the theorem it is proving. No fitted parameter is later relabeled as a prediction, and no equation in the proof reduces to its own input by construction. The self-citations [10] and [11] provide background definitions and the S-expansivity concept, but Proposition 2.15 is restated with a proof in the text and, for homeomorphisms, S-expansivity reduces to standard expansivity; hence Proposition 2.26 does not rest on an unverified self-citation chain. There are genuine mathematical concerns about the role of the transition map tau in Definition 2.9 and about unproven S(f) claims in Theorem 2.25, but these are correctness gaps or omitted arguments, not cases where a claimed result is identical to its input by definition. On the circularity axis, the paper is substantially self-contained.

Assumptions & free parameters 1 free parameters · 4 assumptions · 1 invented entities

The construction depends on an unspecified transition map tau and on several unproven assertions about minimal sets and S(f); these are load-bearing for Theorem 2.20 and Theorem 2.25. There are no fitted constants.

free parameters (1)
  • Transition map tau: S -> Z = unspecified (surjective required by Definition 2.1, but not chosen)
    The bilateral adding machine f_alpha in Definition 2.9 is defined using tau in the carry rule s1=tau(x0+y0 mod j). The dynamics, and hence the characterization in Theorem 2.20, depend on tau; the paper never fixes a canonical tau. Different surjective tau give non-conjugate maps.
assumptions (4)
  • domain assumption The transition map tau: S -> Z is surjective (Definition 2.1).
    The zip space and carry rule require tau to be surjective; however, the paper does not state or use an additional condition on tau that would make f_alpha minimal and make the coverings single cycles.
  • standard math The space Delta_alpha is compact metric with cylinder topology (Definitions 2.2, 2.4, 2.5).
    Used throughout for continuity, minimality, and diameter estimates in the covering arguments.
  • domain assumption Zip shift maps are S-expansive local homeomorphisms (Proposition 2.15, cited from [11]).
    Proposition 2.26 uses this to show f_alpha is not a zip shift map; [11] is a preprint by overlapping authors and no independent verification is provided.
  • ad hoc to paper The four claims about S(f) in Theorem 2.25 (S(f) infinite, divisibility, coprime multiplication) and Lemma 2.18.
    These assertions are load-bearing for the symbolic model theorem but are proven only by sketches; claim 4 assumes an intersection point M1 intersect M2 without justification.
invented entities (1)
  • Bilateral adding machine f_alpha on the zip space Delta_alpha
    purpose: Central object: a homeomorphism of a two-sided symbolic space that generalizes the one-sided adding machine; used to demonstrate a non-zip-shift homeomorphism.
    A new mathematical construction defined in Definitions 2.5 and 2.9. It has no external falsifiable handle beyond the paper's own theorems.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On a bi-lateral Adding Machine and its characterization." pith.science (2026). https://pith.science/paper/YQEQ6TDU

@misc{pith2026250502149,
  author       = {Pith},
  title        = {Pith review of: On a bi-lateral Adding Machine and its characterization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YQEQ6TDU}},
  note         = {Machine review of arXiv:2505.02149}
}
read the original abstract

In this paper, we introduce a bilateral adding machine based on a zip space with two sets of alphabets. We demonstrate that these adding machines are homeomorphisms and provide necessary and sufficient conditions for their characterization.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 11 canonical work pages

  1. [1]

    Invariant measures for Cantor dynamical systems

    Bezuglyi, S., and Karpel, O. Invariant measures for Cantor dynamical systems. Dynamics: Topol- ogy and Numbers , Contemporary Mathematics, Volume 744, 2020

    work page 2020

  2. [2]

    A characterization of adding machine maps

    Block, L.; Keesling, J. A characterization of adding machine maps . Topology and its Applications, v. 140, n. 2–3, p. 151–161, 2004

    work page 2004

  3. [3]

    Introduction to dynamical systems

    Brin, M.; Stuck, G. Introduction to dynamical systems . Cambridge University Press, 2002

    work page 2002

  4. [4]

    Stochastic adding machines based on Bratteli dia- grams

    Caprio, Danilo A.; Messaoudi, A.; Valle, G. Stochastic adding machines based on Bratteli dia- grams. Annales de l’Institut Fourier, v. 70, n. 6, p. 2543–2581, 2020

    work page 2020

  5. [5]

    Finite-rank Bratteli–Vershik diagrams are expansive

    Downarowicz, T.; Maass, A. Finite-rank Bratteli–Vershik diagrams are expansive . Ergodic Theory and Dynamical Systems, 28(3):739–747, 2008

    work page 2008

  6. [6]

    The Morse minimal system is nearly continuously Kakutani equivalent to the binary odometer

    Dykstra, A.; S ¸ahin, A. The Morse minimal system is nearly continuously Kakutani equivalent to the binary odometer . JAMA 132, 311–353 (2017)

    work page 2017

  7. [7]

    Subshifts of finite symbolic rank

    Gao, S.; Li, R. Subshifts of finite symbolic rank . Ergodic Theory and Dynamical Systems, 2025;45(3):807–848

    work page 2025

  8. [8]

    Linear Recursive Odometers and Beta-Expansions

    Iaco, M.R.; Steiner, W.; Tichy, R.F. Linear Recursive Odometers and Beta-Expansions . Uniform Distribution Theory, 11(1):175–186, 2016

    work page 2016

Show all 12 references
  1. [9]

    An introduction to symbolic dynamics and coding

    Lind, D.; Marcus, B. An introduction to symbolic dynamics and coding . Cambridge University Press, 1995

    1995

  2. [10]

    Zip shift space , 2022

    Lamei, S.; Mehdipour, P. Zip shift space , 2022. arXiv:2502.11272v1

    2022 arXiv

  3. [11]

    S-Expansiveness and Zip Shift Maps in Symbolic Dynamics , 2024 (preprint)

    Lamei, S.; Mehdipour, P., Vargas, W. S-Expansiveness and Zip Shift Maps in Symbolic Dynamics , 2024 (preprint)

    2024

  4. [12]

    Nia, M. F. Adding machine maps and minimal sets for iterated function systems . Journal of Dynamical Systems and Geometric Theories, 15(1), 71–83, 2017. (Pouya Mehdipour) Departamento de Matem ´atica, Universidade Federal de Vic ¸osa, Brazil. Email address : pouya@ufv.br (Rebe...

    2017

Pith tools

Reviewed August 16, 2026 · model on record in the stance chip above.