MIXING (MATHEMATICS)
(Redirected from Strong mixing)
In mathematics, 'mixing' is a concept applied in ergodic theory, that is, the study of stochastic processes and measure-preserving dynamical systems. Several different definitions for mixing can be made, including ''strong mixing'', ''weak mixing'' and ''topological mixing'', with the last not even requiring a concept of measure to be defined. Applications of mixing are often seen in the physics of mixing.
Let
:
be a sequence of random variables, and
:
the sigma-algebra generated by
:
for
:.
The process is 'strong mixing' if
:
as
:,
where
:
is the so-called 'strong mixing coefficient'. Here, ''P'' is the probability measure.
A similar definition can be given in the language of measure-preserving dynamical systems. Let be a dynamical system, with ''T'' being the time-evolution or shift operator. Then, if for all , if one has
:
then the system is called strong mixing. Note that this definition is weaker than the definition in stochastic process. For shifts parameterized by a continuous variable instead of a discrete integer ''n'', the same definition applies, with replaced by with ''g'' being the continuous-time parameter.
A dynamical system is said to be 'weak mixing' if
:
Strong mixing implies weak mixing, and every weakly-mixing system is ergodic.
For a system that is weak mixing, the shift operator ''T'' will have no (non-constant) square-integrable eigenfunctions. In general, a shift operator will have a continuous spectrum, and thus will always have eigenfunctions that are generalized functions. However, for the system to be (at least) weak mixing, none of the eigenfunctions can be square integrable.
A form of mixing may be defined without appeal to a measure, making use only of the topology of the system. A continuous map is said to be 'topologically transitive' if, for every pair of non-empty open sets , there exists an integer ''n'' such that
:
where is the ''n'' 'th iterate of ''f''. A related idea is expressed by the wandering set.
'Lemma:' If ''X'' is a compact metric space, then ''f'' is topologically transitive if and only if there exists a point with a dense orbit, that is, an orbit such that the set is dense in ''X''.
A system is said to be 'topologically mixing' if there exists an integer ''N'', such that, for all , one has
:.
For a continuous-time system, is replaced by the flow , with ''g'' the continuous parameter, with the requirement that a non-empty intersection hold for all .
A 'weak topological mixing' is one that has no non-constant continuous (with respect to the topology) eigenfunctions of the shift operator.
There are examples of systems that are weak mixing but not topologically mixing, and examples that are topologically mixing but not strong mixing.
The definition given above is sometimes called 'strong 2-mixing', to distinguish it from a generalized definition.
Thus, for example, a 'strong-3-mixing system' may be defined as a system for which
:
holds for all measurable sets ''A'', ''B'', ''C''. Strong n-mixing may be defined analogously.
It is not known if strong 2-mixing implies strong 3-mixing. It is known that strong ''m''-mixing implies ergodicity.
In mathematics, 'mixing' is a concept applied in ergodic theory, that is, the study of stochastic processes and measure-preserving dynamical systems. Several different definitions for mixing can be made, including ''strong mixing'', ''weak mixing'' and ''topological mixing'', with the last not even requiring a concept of measure to be defined. Applications of mixing are often seen in the physics of mixing.
| Contents |
| Mixing in stochastic processes |
| Mixing in dynamical systems |
| Topological mixing |
| Generalizations |
Mixing in stochastic processes
Let
:
be a sequence of random variables, and
:
the sigma-algebra generated by
:
for
:.
The process is 'strong mixing' if
:
as
:,
where
:
is the so-called 'strong mixing coefficient'. Here, ''P'' is the probability measure.
Mixing in dynamical systems
A similar definition can be given in the language of measure-preserving dynamical systems. Let be a dynamical system, with ''T'' being the time-evolution or shift operator. Then, if for all , if one has
:
then the system is called strong mixing. Note that this definition is weaker than the definition in stochastic process. For shifts parameterized by a continuous variable instead of a discrete integer ''n'', the same definition applies, with replaced by with ''g'' being the continuous-time parameter.
A dynamical system is said to be 'weak mixing' if
:
Strong mixing implies weak mixing, and every weakly-mixing system is ergodic.
For a system that is weak mixing, the shift operator ''T'' will have no (non-constant) square-integrable eigenfunctions. In general, a shift operator will have a continuous spectrum, and thus will always have eigenfunctions that are generalized functions. However, for the system to be (at least) weak mixing, none of the eigenfunctions can be square integrable.
Topological mixing
A form of mixing may be defined without appeal to a measure, making use only of the topology of the system. A continuous map is said to be 'topologically transitive' if, for every pair of non-empty open sets , there exists an integer ''n'' such that
:
where is the ''n'' 'th iterate of ''f''. A related idea is expressed by the wandering set.
'Lemma:' If ''X'' is a compact metric space, then ''f'' is topologically transitive if and only if there exists a point with a dense orbit, that is, an orbit such that the set is dense in ''X''.
A system is said to be 'topologically mixing' if there exists an integer ''N'', such that, for all , one has
:.
For a continuous-time system, is replaced by the flow , with ''g'' the continuous parameter, with the requirement that a non-empty intersection hold for all .
A 'weak topological mixing' is one that has no non-constant continuous (with respect to the topology) eigenfunctions of the shift operator.
There are examples of systems that are weak mixing but not topologically mixing, and examples that are topologically mixing but not strong mixing.
Generalizations
The definition given above is sometimes called 'strong 2-mixing', to distinguish it from a generalized definition.
Thus, for example, a 'strong-3-mixing system' may be defined as a system for which
:
holds for all measurable sets ''A'', ''B'', ''C''. Strong n-mixing may be defined analogously.
It is not known if strong 2-mixing implies strong 3-mixing. It is known that strong ''m''-mixing implies ergodicity.
This article provided by Wikipedia. To edit the contents of this article, click here for original source.
psst.. try this: add to faves

العربية
中国
Français
Deutsch
Ελληνική
हिन्दी
Italiano
日本語
Português
Русский
Español