Talk:Markov partition
From Wikipedia, the free encyclopedia
| WikiProject Systems (Rated Stub-Class) | |||||
|---|---|---|---|---|---|
 |
|||||
| Systems rating: | Stub Class | Mid importance | Field: Dynamical systems | ||
| Please update this rating as the article progresses, or if the rating is inaccurate. Please also add comments to suggest improvements to the article. | |||||
[edit] This really isn't all that complicated
The idea of a Markov partition is, conceptually, quite simple. Consider an iterated linear map of the unit square into itself. (This can be represented by a 2x2 matrix, with translation of a transformed point back into the unit square – think of co-ordinates computed modulo 1.) In general, such a map will have eigenvectors, which represent two lines that get translated into themselves by the iterated mapping. Shifted back inside the unit square, these lines produce the "Markov partition" – the lines divide the square into regions which "mix" with themselves as the mapping is iterated, but points in one region cannot migrate across the boundary lines defined by the eigenvectors to "mix" with another region.
I found a fairly good description of this phenomenon at this web site.
I'll try to write a more elementary description for the article. A picture could be very helpful here. Unfortunately, I don't have much facility with drawing pictures. Can someone else help? DavidCBryant 15:49, 24 July 2007 (UTC)
