Finite Cores Exhaustion and the Failure of Strict Sequential-Pressure Approximation in Coded Shifts
Abstract
Let X=X(𝒢) be a coded shift whose generating set uniquely represents its concatenation set. We prove that, for every continuous potential φ, the pressures of the finite-generator subshifts (the finite cores) converge to the sequential pressure Pseq(φ,𝒢), the supremum of free energy over invariant measures giving full mass to the concatenation set. Thus full sequential pressure is the exact condition for the finite cores to recover global pressure. The proof is a refinement of the inducing argument of Burr, Das, Wolf, and Yang. Given an arbitrary enumeration of the generators and a length-ordered enumeration of the language, we obtain an algorithm which computes the global pressure of every computable potential with full sequential pressure. The set of equilibrium states is recursively compact, and a unique equilibrium state is computable from the same data. For the zero potential, hcon≥ hres therefore implies computability of topological entropy and of any unique measure of maximal entropy. We also construct a uniquely represented presentation of the full binary shift for which the zero potential has full sequential pressure but is not a uniform limit of potentials satisfying Pseq>Pres, disproving a conjecture of Burr, Das, Wolf, and Yang.
Related
- Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection
- A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems
- Complete non-orientable minimal surfaces of finite total curvature: Approximation and interpolation
- Optimal error estimates of sequential finite element method for nonlinear thermo-poroelasticity problems
- Asymptotic approximation of sensitivities in finite dimensional continuous data assimilation with application to parameter estimation
BibTeX
@misc{hedges2026finite,
title = {{Finite Cores Exhaustion and the Failure of Strict Sequential-Pressure Approximation in Coded Shifts}},
author = {C. Evans Hedges},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.09406},
eprint = {2609.09406},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.09406},
note = {CC0},
}
RIS
TY - UNPB
TI - Finite Cores Exhaustion and the Failure of Strict Sequential-Pressure Approximation in Coded Shifts
AU - C. Evans Hedges
PY - 2026
DA - 2026/09/08
PB - arXiv
DO - 10.48550/arxiv.2609.09406
UR - https://arxiv.org/abs/2609.09406
AB - Let X=X(𝒢) be a coded shift whose generating set uniquely represents its concatenation set. We prove that, for every continuous potential φ, the pressures of the finite-generator subshifts (the finite cores) converge to the sequential pressure P_seq(φ,𝒢), the supremum of free energy over invariant measures giving full mass to the concatenation set. Thus full sequential pressure is the exact condition for the finite cores to recover global pressure. The proof is a refinement of the inducing argument of Burr, Das, Wolf, and Yang. Given an arbitrary enumeration of the generators and a length-ordered enumeration of the language, we obtain an algorithm which computes the global pressure of every computable potential with full sequential pressure. The set of equilibrium states is recursively compact, and a unique equilibrium state is computable from the same data. For the zero potential, h_con≥ h_res therefore implies computability of topological entropy and of any unique measure of maximal entropy. We also construct a uniquely represented presentation of the full binary shift for which the zero potential has full sequential pressure but is not a uniform limit of potentials satisfying P_seq>P_res, disproving a conjecture of Burr, Das, Wolf, and Yang.
ER -