Concept

Markov odometer

In mathematics, a Markov odometer is a certain type of topological dynamical system. It plays a fundamental role in ergodic theory and especially in orbit theory of dynamical systems, since a theorem of H. Dye asserts that every ergodic nonsingular transformation is orbit-equivalent to a Markov odometer. The basic example of such system is the "nonsingular odometer", which is an additive topological group defined on the product space of discrete spaces, induced by addition defined as , where . This group can be endowed with the structure of a dynamical system; the result is a conservative dynamical system. The general form, which is called "Markov odometer", can be constructed through Bratteli–Vershik diagram to define Bratteli–Vershik compactum space together with a corresponding transformation. Several kinds of non-singular odometers may be defined. These are sometimes referred to as adding machines. The simplest is illustrated with the Bernoulli process. This is the set of all infinite strings in two symbols, here denoted by endowed with the product topology. This definition extends naturally to a more general odometer defined on the product space for some sequence of integers with each The odometer for for all is termed the dyadic odometer, the von Neumann–Kakutani adding machine or the dyadic adding machine. The topological entropy of every adding machine is zero. Any continuous map of an interval with a topological entropy of zero is topologically conjugate to an adding machine, when restricted to its action on the topologically invariant transitive set, with periodic orbits removed. The set of all infinite strings in strings in two symbols has a natural topology, the product topology, generated by the cylinder sets. The product topology extends to a Borel sigma-algebra; let denote that algebra. Individual points are denoted as The Bernoulli process is conventionally endowed with a collection of measures, the Bernnoulli measures, given by and , for some independent of .

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.