Metraipolis › archive › dc_25e216bc4897

Thermodynamic Realizability of Hidden Markov Processes: Attainment, Observable Certificates, and the Price of Architecture — arXiv:2609.14623

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14623
License (as archived)
CC0-1.0
Archived
2026-10-16T02:27:58.266Z
SHA-256 of the archived text
5f33ee7fb4b28dae162a269e5d46b50b3a0631806e0e9fe7bccef49988726c20
Stable URL of this page
https://metraipolis.com/documento/dc_25e216bc4897

How to cite

Thermodynamic Realizability of Hidden Markov Processes: Attainment, Observable Certificates, and the Price of Architecture — arXiv:2609.14623 — arXiv (en), https://arxiv.org/abs/2609.14623 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_25e216bc4897 (Metraipolis archive dc_25e216bc4897, sha256 5f33ee7fb4b28dae162a269e5d46b50b3a0631806e0e9fe7bccef49988726c20)
BibTeX
@misc{dc25e216bc4897,
  title = {Thermodynamic Realizability of Hidden Markov Processes: Attainment, Observable Certificates, and the Price of Architecture — arXiv:2609.14623},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14623},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_25e216bc4897; sha256 5f33ee7fb4b28dae162a269e5d46b50b3a0631806e0e9fe7bccef49988726c20},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14623. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

What is the least dissipative finite Markov machine that can reproduce a given stochastic process exactly? A basic compactness worry is that a minimizing sequence might lower its cost only by sending microscopic rates to infinity, never converging to an actual finite-rate machine. We prove that this escape is impossible at fixed hidden dimension. States of vanishing stationary occupation can be traced out, and infinitely fast conductance classes can be contracted, without increasing entropy production or losing the limiting observed path law. Hence the exact-law cost $V_n(P)$ is attained and lower semicontinuous at every fixed state count, with no cap on rates or mean activity. Adding a positive price $\kappa$ per used hidden state yields an attained optimum over all finite dimensions and an exact representation by globally calibrated lower certificates built from finitely many observable path expectations. The lower envelope $G_\kappa(P)=\min_n[V_n(P)+\kappa n]$ defines an architecture phase diagram whose slope is the selected state count; divergence of that count as $\kappa\downarrow0$ is equivalent to failure of any finite machine to attain the all-dimension infimum $V_\infty(P)$. For the two-block renewal family $P_q$, we derive complete finite-dimensional phase-type cancellation equations, give an explicit four-phase counterexample to a tempting restricted parameterization, and prove strictly positive minimal dissipation at every feasible finite dimension for all $0<q<1$. These results reduce the remaining problem to one sharp question: can growing hidden architecture drive the dissipation of $P_q$ to its all-dimension infimum without any finite optimizer, and in the strongest scenario, to zero?

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-15 in cond-mat.stat-mech).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2609.14623 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T02:16:09.938Z dalla pagina https://arxiv.org/catchup/cond-mat.stat-mech/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).