pith. sign in

arxiv: 0901.4640 · v2 · submitted 2009-01-29 · 🧮 math.DS · math.PR

Weak KAM methods and ergodic optimal problems for countable Markov shifts

classification 🧮 math.DS math.PR
keywords sigmaboldsymbolmarkovalphabetcountablemaximizingprobabilitiessub-actions
0
0 comments X
read the original 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 : \boldsymbol{\Sigma} \to \mathbb R $. Under certain conditions, we are able to show not only that $A$-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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.