Back to search
2106.09808

ON THE IMAGE SET AND REVERSIBILITY OF SHIFT MORPHISMS OVER DISCRETE ALPHABETS

Jorge Campos, Neptalí Romero, Ramón Vivas

correctmedium confidence
Category
Not specified
Journal tier
Specialist/Solid
Processed
Sep 28, 2025, 12:56 AM

Audit review

The paper proves: (i) closed-image (hence shift-space) property for finite-degree ESBCs when every distinguished sequence admits an associated h∞ in C1 ∪ C2 (Theorem 3.1), (ii) closed-image under finiteness assumptions on X combined with h∞ in the appropriate classes (Theorem 3.2), and (iii) reversibility of bijective, finite-degree ESBCs under the same hypotheses (Theorem 3.3). The statements and proofs rely on the crucial diagonal-cylinder lemma (Lemma 2.1) and the classification C1–C5, together with tailored finiteness arguments to guarantee niceness (subsequence convergence) of distinguished sequences, which then implies closure and, in the bijective case, continuity of the inverse, hence reversibility via the extended CHL theorem. These parts of the paper are consistent and correct . The model’s solution correctly mirrors the paper’s closure arguments for C1/C2 and for the finiteness cases (it even supplies an alternative König’s-lemma extension-tree proof for existence), but its reversibility proof is flawed: it tries to deduce continuity of Ψ−1 by a diagonal/subsequence argument that only guarantees convergent subsequences of xk = Ψ−1(yk), not convergence of the full sequence. In a non-compact product of discretes, uniqueness of a subsequential limit is not enough to conclude continuity. The paper instead proves reversibility by contradiction: under the given hypotheses, any failure of local constancy of the inverse’s 0-coordinate yields a nice distinguished sequence, contradicting injectivity (and thus forcing continuity of Ψ−1) . Therefore, the paper is correct, while the model’s solution has a material gap in the reversibility step.

Referee report (LaTeX)

\textbf{Recommendation:} reject

\textbf{Journal Tier:} specialist/solid

\textbf{Justification:}

The candidate captures the diagonal-cylinder and finiteness mechanisms correctly for closed-image results and offers an alternative extension-tree proof. However, the reversibility proof hinges on an inadequate subsequence argument that fails to establish continuity of the inverse on a non-compact product of discrete alphabets. The paper's method avoids this by forcing niceness and using injectivity to obtain a contradiction, thereby rigorously establishing continuity of the inverse under the stated hypotheses.