Chaos on the Multi-Dimensional Cube

Ejaily Milad Alejaily; Marat Akhmet

REVIEW 3 major objections 5 minor 27 references

Chaos on the Multi-Dimensional Cube

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read The paper states that a generator defined by a recursive 4^n-adic partition makes the entire n-dimensional cube chaotic.

desk verdict A sound but under-specified idea: the shift chaos on the cube is real, but the paper never gives a well-defined generator for n>1 and skips the coding argument. read the letter →

arxiv 1908.11194 v1 pith:N3RD5XMT submitted 2019-08-22 math.DS

Marat Akhmet , Ejaily Milad Alejaily This is my paper · ORCID

classification math.DS MSC 37D4537B10

keywords PoincarechaosDevaneyLi-Yorkequasi-minimalsetn-dimensionalcubedomain-structuredshiftmaprecursivepartition

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

The paper tries to establish that an n-dimensional unit cube, in its entirety, can serve as the domain of chaotic dynamics rather than hosting chaos only on a thin fractal subset. The construction partitions the cube recursively into $4^n$ congruent subcubes, labels every point by an infinite address, and defines a generator map $\phi$ that shifts the address left by one symbol. The main theorem asserts that $\phi$ has Poincare chaos and that the cube is a quasi-minimal set; the paper adds that the dynamics is Devaney chaotic and Li-Yorke chaotic. If the construction is valid, chaotic points are not sparse in the state space, and the domain, the map, and the image all have the same finite dimension.

What carries the argument

The generator is the shift map on the addresses produced by the recursive partition of the cube: $\phi(F_{i_1i_2\ldots})=F_{i_2i_3\ldots}$. The partition is the real engine. At level $k$ the cube is split into $4^{kn}$ congruent subcubes with diameters $\sqrt{n}/4^k$, giving the diagonal property; in addition, the grid of subcubes guarantees a separation constant $\sqrt{n}/4$, so any subcube has a distant counterpart. The paper calls the resulting phenomenon 'domain-structured chaos' because the domain's shape, not a prescribed formula for the map, carries the argument.

What would settle it

Take a point on a face shared by two first-level subcubes of the $n$-cube, for instance $(1/4,1/2,\ldots,1/2)$, and compute $\phi$ through the two addresses that a closed-cube reading of the partition assigns to it. If the two images differ, $\phi$ is not a well-defined map at that point, contradicting the statement that every point of the cube is chaotic. If the partition is instead understood as half-open, the ambiguity disappears, so this one point settles which interpretation the theorem requires.

Watch

Extended reading notes

Core claim

On its own terms, the discovery is that the combinatorial structure of the cube is sufficient to generate chaos, without relying on continuity or injectivity of the map. The unit $n$-cube $F$ is divided at every level into $4^n$ equal subcubes, so each point is represented as $F_{i_1i_2\ldots}$ with symbols from a $4^n$-letter alphabet; the generator $\phi$ sends $F_{i_1i_2\ldots}$ to $F_{i_2i_3\ldots}$. Theorem 1 states that $\phi$ possesses Poincare chaos and that the cube is a quasi-minimal set, and the paper further claims Devaney chaos (transitivity, sensitive dependence, dense periodic points) and Li-Yorke chaos (proximal and frequently separated pairs). The two geometric ingredients are the diagonal property, that subcube diameters tend to zero, and the separation property, that every first-level subcube has a counterpart at distance at least $\sqrt{n}/4$, which together enforce transitivity and sensitivity for the shift.

Load-bearing premise

The load-bearing premise is that every point of the cube has one uniquely defined infinite address in the recursive partition, so that the generator $\phi$ is single-valued on all of $F$; the paper does not specify how face and edge points of closed subcubes are assigned, and for $n>1$ it gives no coordinate formula for $\phi$.

Editorial extensions

If this is right

If Theorem 1 is correct, the whole $n$-dimensional cubic domain is a chaotic invariant set, so chaotic behavior need not be confined to a fractal of lower dimension.
In this construction the dimension of the domain equals the dimension of the image and the dimension of the map, unlike classical continuous examples such as the Cantor set of the logistic map.
Because the separation constant grows as $\sqrt{n}/4$, the proof suggests that higher-dimensional cubes satisfy the separating condition with larger constants, so the separating mechanism becomes stronger as $n$ grows.
The same recursive-partition argument is claimed to extend to any infinite set sharing the cube's topological properties, making full-domain chaos a structural feature of the state space rather than a property of a specially chosen map.
The generator is a symbolic shift, so the result also covers any process whose states are encoded by infinite sequences over a $4^n$-letter alphabet.

Reading between the lines

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

The paper does not state it, but if the partition is made precise with half-open subcubes, $\phi$ is essentially conjugate to the one-sided full shift on $4^n$ symbols, so its topological entropy and periodic-point structure follow from standard symbolic dynamics.
The paper does not test it, but the same diagonal-and-separation recipe should produce full-domain Devaney and Li-Yorke chaos on other self-similar product sets, for instance a Cantor set crossed with an interval.
The paper's Brownian-motion remark leaves the encoding open: a concrete coding of Brownian trajectories into cube addresses would be required before the deterministic shift could serve as a model of random-looking motion.
A coordinate realization of $\phi$ as a base-$4^n$ digit shift is a natural next construction; it would settle which boundary points need an assignment convention.

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.

Desk Editor's Note

read the letter

Dear colleague,

The paper has a real idea: use a recursive partition of the n-dimensional unit cube and define a map that shifts the address. For n=1 this is just the full shift on 4 symbols, and the tent-map realization is a nice concrete example. The claim that the entire cube can be a domain for chaos, rather than a fractal invariant set, is worth a moment's thought. The figures are helpful.

What is actually new: the presentation of 'domain-structured' chaos on the whole cube, where the map comes from the partition structure. That is a modest conceptual extension of the classical shift embedding. The Devaney and Li–Yorke parts are standard shift properties, not new results. The Poincaré part relies on the authors' prior definitions, which is acceptable if those definitions are sound.

The soft spots are substantial. For n>1, the generator φ is never explicitly defined. The text says 'similarly' and points to the Appendix, but there is no boundary convention for the recursive partition. With closed sub-cubes, a point on a shared face has multiple addresses, and equation (2) does not determine a unique image. The 1D construction uses a specific half-open partition, but that convention is not generalized or even stated for the square and cube. So as written, φ is not well-defined on the stated domain.

The Appendix proof works at the level of the symbolic shift and silently identifies the cube with the full shift space. That identification is the load-bearing step: it requires a boundary convention that makes the address coding a bijection, or at least a well-defined factor map. The paper does not supply that. Even in 1D, the half-open intervals avoid double addresses but the authors do not check that every sequence corresponds to a point. The result is likely salvageable by choosing a half-open rectangular partition, but the submitted text does not do the work.

On citations: the paper leans on the authors' own prior work for the Poincaré definition, but that is not a flaw here because the core theorem is about the shift, which is standard. I do not see a circular argument.

Who is this for: someone curious about high-dimensional chaos could read the 1D example and get the flavor. As a refereed paper, though, it is a sketch. My recommendation: send it to peer review, not desk reject. The construction is sound in spirit and the gap is repairable. A referee should ask for an explicit definition of φ in all dimensions, a boundary convention, and a proper coding argument. With that revision it could be a short but acceptable note.

Referee Report

3 major / 5 minor

Summary. The paper proposes to show that the n-dimensional unit cube can serve as the domain of a chaotic dynamical system. The construction recursively partitions the cube into 4^n sub-cubes, represents each point by an infinite sequence of addresses, defines a generator map ϕ by shifting the address (equation (2)), and claims that ϕ is Devaney, Li-Yorke, and Poincaré chaotic on the whole cube, which is said to be a quasi-minimal set. The proof is deferred to an appendix that argues at the level of symbolic sequences and relies on the authors' prior definitions of Poincaré chaos and on a standard theorem for shift maps.

Significance. If the construction were made fully rigorous, the result would be a notable extension of one-dimensional results, showing that an entire finite-dimensional cube, rather than a Cantor-type fractal subset, can carry a chaotic map. The underlying idea — deriving the map from a recursive domain partition — is simple and potentially fertile, and the paper correctly identifies the key diagonal and separation properties that make the shift-like map chaotic. The paper also provides an explicit one-dimensional example via a double-humped tent map. However, the manuscript in its current form does not establish the claimed high-dimensional theorem because the map is not well-defined on boundary points and the appendix proof is only a sketch that does not pass from symbolic sequences to points of the Euclidean cube.

major comments (3)

[Section 2 (general n construction) and equation (3)] The coding of points of the cube by infinite address sequences is not unique for points on the boundaries of sub-cubes. For n>1 the paper says only that one divides the cube into 4^n equal sub-cubes, with no boundary convention; for example, in the square with closed sub-cubes, a point such as (1/4, 1/2) lies on the boundary of several first-level sub-cubes and hence has multiple infinite addresses. Consequently equation (2) does not define a single-valued map ϕ on F. This is a load-bearing gap because Theorem 1 and all subsequent chaos conclusions concern this map on the Euclidean cube. The gap is repairable by specifying half-open rectangular sub-cubes (e.g., products of intervals [a,b) with the final interval including the right endpoint) and proving that the coding is a bijection, but the manuscript does not do this.
[Appendix, proof of Theorem 1] The proof of Theorem 1 is a sketch rather than a proof. Transitivity and sensitivity are argued informally in terms of the symbolic sequences, but the paper never proves that the coding map from F to the shift space is well-defined, injective, or that the chaotic properties of the shift transfer to the Euclidean map. The claim of existence of an unpredictable point is delegated to Lemma 3.1 of [12] without stating the lemma or verifying its hypotheses for the present construction, and the Li-Yorke chaos conclusion is asserted by analogy with Theorem 6.35 of [24] without details. This falls short of the standard required for the main theorem.
[Section 2 (n=1 construction) and Appendix (separation property)] The verification of the separation property for n>1 is incomplete. The text asserts that for any sub-cube A there exists a sub-cube B 'distanced from A in all projections not less than 1/4', but gives no construction or proof. This property is used in the sensitivity argument in the Appendix, so it is not a cosmetic detail. Additionally, the distance statement (ii) for the one-dimensional partition is incorrect: d(F1, F4) = 1/2, not 1/4 as printed.

minor comments (5)

[Introduction, first paragraph] The sentence containing 'KolmogorovMartin-Lfwhich' is garbled and should be corrected to refer to Kolmogorov–Martin-Löf randomness.
[Section 2 (one-dimensional case)] The phrase 'unit section' is unusual; the intended term is 'unit interval'.
[Throughout] There are multiple typographical issues, such as 'ﬁst step' for 'first step', inconsistent spacing in 'Poincar` e', and the notation 'ip = 1, 2, ..., m' should be written as 'i_p ∈ {1,...,m}' to avoid confusion with a product.
[References] Reference [15] is listed as 'Accepted' without further bibliographic data; if it has appeared, the full citation should be provided.
[Figures] The figures are referenced but not fully described in the text; the captions should be self-contained and the final version should include the figures.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation: the chaos result is an immediate consequence of the shift structure built into the generator, with only minor self-citation for unpredictability definitions.

full rationale

The paper defines the generator phi (equation (2)) as the one-sided shift on the addressing of nested sub-cubes, and the cube is identified with the full shift space over 4^n symbols (equation (3)). The chaotic properties (transitivity, sensitivity, dense periodic points, Li-Yorke chaos, and the existence of a dense orbit) are proved directly from the diagonal and separation properties of the nested partition, i.e., from the standard structure of the shift map. No parameter is fitted to data, no empirically predicted quantity is reused as an input, and no uniqueness theorem from the authors' prior work is invoked to rule out alternatives. The paper does cite [11,12] for the definitions of unpredictable points and Poincare chaos, and Lemma 3.1 of [12] for the unpredictability criterion; it also cites the authors' prior works [14,15] for the general domain-partition method. These self-citations are used as definitions and as a published lemma, not as a substitute for the present construction. Because the central claim is that the shift on this symbolic model is chaotic, and the proof supplies the standard block-coding and separation arguments, the derivation does not reduce by construction to its inputs. A separate mathematical gap exists: for n>1 the recursive partition of closed sub-cubes is not given with a boundary convention, so phi is not obviously single-valued on boundaries; this is a well-posedness and correctness concern, not a circularity, and it is not counted in the score.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The construction introduces no fitted parameters. It relies on the geometric partition properties, the known chaotic properties of the shift map, and the unstated assumption that the shift on addresses defines a well-defined map on every point of the cube.

assumptions (3)

domain assumption The recursive partition of the n-cube into 4^n equal sub-cubes satisfies the diagonal and separation properties.
This is the geometric basis of the construction; it holds for equal sub-cubes but the paper states it without proof.
standard math The shift map on the space of sequences over a finite alphabet is Devaney, Li-Yorke, and Poincare chaotic.
The paper invokes Lemma 3.1 in [12] and Theorem 6.35 in [24] for these properties.
ad hoc to paper The address representation of points by infinite sequences is unique and the shift map phi is well-defined on the entire cube.
The paper does not prove uniqueness for boundary points and gives no explicit map for n>1; this is a load-bearing assumption.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Chaos on the Multi-Dimensional Cube." pith.science (2026). https://pith.science/paper/N3RD5XMT

@misc{pith2026190811194,
  author       = {Pith},
  title        = {Pith review of: Chaos on the Multi-Dimensional Cube},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N3RD5XMT}},
  note         = {Machine review of arXiv:1908.11194}
}

read the original abstract

In this article, we show that a chaotic behavior can be found on a cube with arbitrary finite dimension. That is, the cube is a quasi-minimal set with Poincare chaos. Moreover, the dynamics is shown to be Devaney and Li-Yorke chaotic. It can be characterized as a domain-structured chaos for an associated map. Previously, this was known only for unit section and for Devaney and Li-Yorke chaos.

Figures

Figures reproduced from arXiv: 1908.11194 by the authors.

**Figure 1.** The partition procedure of the line F Let us now introduce the map ϕ : F → F defined by ϕ(Fi1i2...ik...) = Fi2i3...ik..., (2) such that for fixed sequence i1i2...ik, ϕ(Fi1i2...ik ) = Fi2i3...ik and ϕ(Fi1 ) = F. We call each part Fi2i3...ik subset of order k, and the map ϕ the chaos generating map or simply the generator. Considering the results in the Appendix, one can prove that the generator is chaotic in the sens… view at source ↗

**Figure 2.** The partition procedure of a square and cube. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** The chaotic behavior of trajectories: (a) initiated at the point [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

[12]

and Fen, M

Akhmet, M. and Fen, M. O. 2016, Poincar chaos and unpredictable functions. Commun. Nonlinear Sci. Numer. Simulat. 48 85-94

work page 2016
[24]

and Huang, Y

Chen, G. and Huang, Y. 2011, Chaotic Maps: Dynamics, Fractals and Rapid Fluctuations, Synthesis Lectures on Mathematics and Statistics. Morgan and Claypool Publishers, Texas

work page 2011
[1]

and Yanovsky, V

Bolotin, Y., Tur, A. and Yanovsky, V. 2013, Chaos: Concept, Control and Constructive Use. Springer, Berlin

work page 2013
[2]

Skiadas, C. H. and Skiadas, C. (eds.) 2016, Handbook of Applications of Chaos Theory. Chapman and Hall/CRC Press, Boca Raton

work page 2016
[3]

2017, Dynamical Systems with Applications using Mathematica, 2nd ed

Lynch, S. 2017, Dynamical Systems with Applications using Mathematica, 2nd ed. Springer International Pub- lishing, Switzerland

work page 2017
[4]

J., Jodl, H

Korsch, H. J., Jodl, H. J. and Hartmann, T. 2008, Chaos: A Program Collection for the PC. Springer-Verlag, Berlin

work page 2008
[5]

Kellert, S. H. 1994, In the wake of chaos: Unpredictable order in dynamical systems. University of Chicago Press, Chicago. 4

work page 1994
[6]

Devaney, R. L. 1987, An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Menlo Park

work page 1987

Show all 27 references

[7]

Li, T. Y. and Yorke, J. A. 1975, Period Three Implies Chaos. Amer. Math. Monthly 82 985-992

1975
[8]

Feigenbaum, M. J. 1980, Universal behavior in nonlinear systems. Los Alamos Sci./Summer. 1 4-27

1980
[9]

and Schuster, H

Sch¨ oll, E. and Schuster, H. G. (eds) 2008, Handbook of Chaos Control. WileyVCH, Weinheim, Germany

2008
[10]

and Yorke, J

Sander, E. and Yorke, J. A. 2011, Period-doubling cascades galore. Ergod. Theory Dyn. Syst. 31 1249-1267

2011
[11]

and Fen, M

Akhmet, M. and Fen, M. O. 2016, Unpredictable points and chaos. Commun. Nonlinear Sci. Numer. Simulat. 40 1-5

2016
[13]

Ivancevic, V. G. and Ivancevic, T. T. 2007, High-Dimensional Chaotic and Attractor Systems. Springer, Dor- drecht

2007
[14]

and Alejaily E

Akhmet, M. and Alejaily E. M. 2019, Abstract Similarity, Chaos and Fractals. arXiv:1905.02198 [math.DS]

2019 arXiv
[15]

and Alejaily E

Akhmet, M. and Alejaily E. M. 2019, Domain-Structured Chaos for a Hopﬁeld Neural Network. Int. J. Bifurc. Chaos (Accepted )

2019
[16]

Hilborn, R. C. 2000, Chaos and Nonlinear Dynamics: An Introduction for Scientists and Engineers. Oxford University Press, New York

2000
[17]

Lorenz, E. N. 1984, The local structure of chaotic attractor in four dimensions. Physica, 13D, 90-104

1984
[18]

Mandelbrot, B. B. 1983, The Fractal Geometry of Nature, Freeman, New York

1983
[19]

Keener, J. P. 1980, Chaotic behavior in piecewise continuous diﬀerence equations. Trans. Am. Math. Soc. 261 589-604

1980
[20]

and Oono, Y

Osikawa, M. and Oono, Y. 1981, Chaos in C0-diﬀeomorphism of interval. Publ. RIMS, 17 165-177

1981
[21]

and Vignoli, V

Addabbo, T., Fort, A., Rocchi, S. and Vignoli, V. 2011, Digitized Chaos for Pseudo-random Number Generation in Cryptography. In: Kocarev, L. and Lian, S. (eds) Chaos-Based Cryptography. Studies in Computational Intelligence, vol 354. Springer, Berlin, Heidelberg

2011
[22]

and Ko¸ cak, ¸ s

Deˇ girmenci, N. and Ko¸ cak, ¸ s. 2010, Chaos in product maps. Turk. J. Math. 34 593-600

2010
[23]

and Zhou, X

Li, R. and Zhou, X. 2013, A note on chaos in product maps. Turk. J. Math. 37 665-675

2013
[25]

1988, Global Bifurcation and Chaos, Analytical Methods, Springer-Verlag, New York

Wiggins, S. 1988, Global Bifurcation and Chaos, Analytical Methods, Springer-Verlag, New York

1988
[26]

Brown, R. 1928, A brief account of microscopical observations made in the months of June, July and August, 1927, on the particles contained in the pollen of plants; and on the general existence of active molecules in organic and inorganic bodies. Philos. Mag. Ann. of Philos. N...

1928
[27]

Wang, M. C. and Uhlenbeck, G. E. 1945, On the theory of Brownian motion II. Rev. Mod. Phys. 17 323-342. 5 Appendix: Chaos for the map ϕ Consider the Euclidean space Rn, and let F be the unit n-dimensional cube described by (3). Deﬁne the diameter of a set A in F by diam(A) = s...

1945

Pith tools

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

[1] [12]

and Fen, M

Akhmet, M. and Fen, M. O. 2016, Poincar chaos and unpredictable functions. Commun. Nonlinear Sci. Numer. Simulat. 48 85-94

work page 2016

[2] [24]

and Huang, Y

Chen, G. and Huang, Y. 2011, Chaotic Maps: Dynamics, Fractals and Rapid Fluctuations, Synthesis Lectures on Mathematics and Statistics. Morgan and Claypool Publishers, Texas

work page 2011

[3] [1]

and Yanovsky, V

Bolotin, Y., Tur, A. and Yanovsky, V. 2013, Chaos: Concept, Control and Constructive Use. Springer, Berlin

work page 2013

[4] [2]

Skiadas, C. H. and Skiadas, C. (eds.) 2016, Handbook of Applications of Chaos Theory. Chapman and Hall/CRC Press, Boca Raton

work page 2016

[5] [3]

2017, Dynamical Systems with Applications using Mathematica, 2nd ed

Lynch, S. 2017, Dynamical Systems with Applications using Mathematica, 2nd ed. Springer International Pub- lishing, Switzerland

work page 2017

[6] [4]

J., Jodl, H

Korsch, H. J., Jodl, H. J. and Hartmann, T. 2008, Chaos: A Program Collection for the PC. Springer-Verlag, Berlin

work page 2008

[7] [5]

Kellert, S. H. 1994, In the wake of chaos: Unpredictable order in dynamical systems. University of Chicago Press, Chicago. 4

work page 1994

[8] [6]

Devaney, R. L. 1987, An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Menlo Park

work page 1987