Back to search
2402.05638

INTERVAL MAPS WITH DENSE PERIODICITY

Jozef Bobok, Jernej Činč, Piotr Oprocha, Serge Troubetzkoy

incompletemedium confidence
Category
Not specified
Journal tier
Strong Field
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper’s main theorem (Theorem 3.1) states exactly the target equivalence: a continuous interval map is chain-recurrent iff its periodic points are dense in I (the class CP) . The (CP ⇒ chain-recurrent) direction in the paper is sound: they build an ε-chain at x by borrowing a nearby periodic orbit of a map g ∈ CP within ε/2 of f, yielding a valid ε-chain for f (the construction x0=x, xi=g^i(p), xn=x is explicit) . However, in the converse direction (chain-recurrent ⇒ CP), the write-up constructs a “connect-the-dots” map g from finitely many ε/6-loops, perturbs g to a piecewise affine leo map h with h ∈ CP, and notes that ||f−h||∞<2ε. The proof then concludes: “Since ε is arbitrary we have f ∈ CP” . This last inference is not justified: uniform closeness to a CP map does not imply membership in CP (indeed, CP is not closed, and the paper later emphasizes delicate density/closure phenomena). The missing step would need either a persistence argument for transverse periodic points ensuring Per(f) hits every open set, or a direct interval argument from the ε-loop (as in the model solution). The model solution provides a complete, classical proof: (i) CP ⇒ chain-recurrent by noting CR(f) is closed and contains Per(f), hence I; (ii) chain-recurrent ⇒ CP by using a small ε-loop inside an arbitrary open interval U to build compact intervals J_i with f(J_i)⊂int(J_{i+1}); then f^n maps J_0 into itself, so an intermediate-value fixed point of f^n lies in U. Thus periodic points are dense. This fills the gap cleanly.

Referee report (LaTeX)

\textbf{Recommendation:} major revisions

\textbf{Journal Tier:} strong field

\textbf{Justification:}

The equivalence itself is correct and valuable. The paper’s proof of CP ⇒ chain-recurrent is clean. However, the proof of chain-recurrent ⇒ CP ends with an unjustified leap from uniform approximability by leo maps to membership in CP. Since CP is not closed under uniform limits, an additional argument is required. This can be remedied by inserting a short, classical interval argument from ε-loops to fixed points of an iterate inside arbitrary open intervals, or by adding a persistence-of-transverse-periodic-points lemma. With this fix, the paper would be solid.