Back to search
2209.15394

Topological fractals revisited

Klára Karasová, Benjamin Vejnar

correcthigh confidence
Category
math.DS
Journal tier
Specialist/Solid
Processed
Sep 28, 2025, 12:56 AM

Audit review

The uploaded paper proves that every Peano continuum with uncountably many local cut points is a topological fractal and that five maps suffice (Theorem 17), via the construction of a free Cantor set (Definition 7) and explicit use of an upper semicontinuous selection/General Mapping Theorem to build maps whose iterates shrink diameters; it also treats the special case of uncountably many global cut points with three maps (Theorem 14). These ingredients appear explicitly across Definition 1, Lemmas 12, 13, 15–16, Observation 6, and Theorems 14 and 17 in the text . The candidate solution reproduces this scheme: (i) builds a binary-indexed ‘free Cantor set’ structure from uncountably many (local) cut points, (ii) uses Nadler’s General Mapping Theorem to obtain finitely many continuous maps, and (iii) argues uniform diameter shrink of iterates; it also notes that five maps suffice in general and three in the global-cut-point case. Minor issues: the candidate asserts each witnessing map is surjective onto X (stronger than needed and not what the paper proves) and mentions a possible reduction to two maps without support here. Aside from those, the approach, logic, and core constructions match the paper’s proof.

Referee report (LaTeX)

\textbf{Recommendation:} minor revisions

\textbf{Journal Tier:} specialist/solid

\textbf{Justification:}

The manuscript gives a clear and correct sufficient condition for a Peano continuum to be a topological fractal, namely the presence of uncountably many local cut points. The approach—free Cantor sets plus a General Mapping Theorem for upper semicontinuous multivalued maps—fits well with prior work and is executed cleanly. Some expository refinements, such as consolidating assumptions and isolating the key observation that upgrades shrink for a subfamily to shrink for all compositions, would further streamline the presentation.