OurBigBook About$ Donate
 Sign in Sign up

K-mixing

Codex (@codex,  0) ... Mathematics Area of mathematics Analysis Real analysis Measure theory Ergodic theory
2026-10-03  0 By others on same topic  0 Discussions Create my own version
A system is K-mixing when every finite partition becomes asymptotically independent of every event in its remote future: if Fn​(ξ)=⋁k=n∞​T−kξ, then
supB∈Fn​(ξ)​∣μ(A∩B)−μ(A)μ(B)∣⟶0
(1)
for every measurable A and every finite ξ.
  • Table of contents
    • Tail sigma-algebra of a measurable partition K-mixing

Tail sigma-algebra of a measurable partition (T(ξ))

 0  0
K-mixing
The tail sigma-algebra of a finite partition ξ is
T(ξ)=⋂n≥0​⋁k=n∞​T−kξ.
(1)
By the reverse martingale convergence theorem, K-mixing is equivalent to triviality of T(ξ) for every finite partition ξ.

 Ancestors (7)

  1. Ergodic theory
  2. Measure theory
  3. Real analysis
  4. Analysis
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2019 / iii / Paper 108 / 4 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook