English

Weak KAM methods and ergodic optimal problems for countable Markov shifts

Dynamical Systems 2010-03-30 v2 Probability

Abstract

Let σ:ΣΣ\sigma:\boldsymbol{\Sigma}\to\boldsymbol{\Sigma} be the left shift acting on Σ \boldsymbol{\Sigma} , a one-sided Markov subshift on a countable alphabet. Our intention is to guarantee the existence of σ\sigma-invariant Borel probabilities that maximize the integral of a given locally H\"older continuous potential A:ΣR A : \boldsymbol{\Sigma} \to \mathbb R . Under certain conditions, we are able to show not only that AA-maximizing probabilities do exist, but also that they are characterized by the fact their support lies actually in a particular Markov subshift on a finite alphabet. To that end, we make use of objects dual to maximizing measures, the so-called sub-actions (concept analogous to subsolutions of the Hamilton-Jacobi equation), and specially the calibrated sub-actions (notion similar to weak KAM solutions).

Keywords

Cite

@article{arxiv.0901.4640,
  title  = {Weak KAM methods and ergodic optimal problems for countable Markov shifts},
  author = {Rodrigo Bissacot and Eduardo Garibaldi},
  journal= {arXiv preprint arXiv:0901.4640},
  year   = {2010}
}

Comments

15 pages. To appear in Bulletin of the Brazilian Mathematical Society.

R2 v1 2026-06-21T12:05:51.652Z