Measure-preserving transformations and invariance
Specify the measure as part of a dynamical system and distinguish invariance, invertibility, and long-time averaging.
On this page
The question for today
What you’ll understand
- Check measure preservation through preimages or pushforwards.
- Separate noninvertible preserving maps from invertible automorphisms.
- Compute invariant weights on finite permutation cycles.
Ergodic theory studies repeated transformations together with a measure describing which states matter statistically. A map alone does not specify the system: the same transformation can preserve several different probability laws, each giving different long-time statistics. Most results in this module concern probability-preserving transformations. Finite measures can be normalized to probabilities when their total mass is positive, but infinite invariant measures require different conclusions. We begin with the preservation identity before asking about recurrence, averages, or mixing.
Preservation is a preimage identity
A measurable transformation T preserves a measure when the preimage of every measurable event has the same measure as the event itself. In probabilistic language, applying T to a state distributed according to that measure leaves its distribution unchanged. This is an equality of marginal laws, not a statement that the state remains fixed. Equivalently the pushforward measure under T equals the original measure. Testing only a few selected events may suggest invariance but is a proof only when those events generate the sigma-algebra and an appropriate uniqueness argument applies.
The preimage definition works whether or not T is one-to-one. On the unit circle, doubling modulo one preserves Lebesgue probability even though two distinct points usually have the same image. Its preimage of an interval consists of two half-length pieces, whose lengths add to the original length. By extending this calculation from interval generators to measurable sets one obtains full preservation. An invariant probability measures the distribution of states, rather than assigning a unique predecessor to every state.
Invertibility is additional structure
An invertible measure-preserving system has an inverse map that is measurable, at least after restricting to appropriate full-measure sets when working modulo null sets. Such a map is a probability-space automorphism. Only then can negative iterates be used as transformations without choosing among possible predecessors. Forward recurrence and the pointwise ergodic theorem do not need this stronger assumption, whereas the unitary formulation of the Koopman operator and a two-sided Lyapunov splitting will explicitly use it.
For a preserving map, composing observables with T defines an isometry on each finite Lp space. The function's values are rearranged without changing their distribution, so its norm is preserved. In L2 this operator preserves inner products as well. It is unitary only if it is also onto; invertible bimeasurable preservation supplies that property. A noninvertible doubling map gives an isometry whose range contains only observables that cannot distinguish the two points merged by doubling, so surjectivity should not be assumed.
Finite cycles reveal how invariant weights behave
For a permutation of finitely many states, an invariant probability must assign equal mass to every state within a given cycle. The total masses of different cycles can be chosen independently and then normalized to sum to one. Uniform probability on the whole state space is one possibility, but need not be the only one. These separate cycle masses are invariant information: the orbit never moves from one cycle to another. Later ergodic decomposition replaces this elementary picture by a measurable family of invariant component measures.
Measure preservation says nothing yet about whether a typical trajectory explores all statistically relevant states. A permutation with several cycles preserves its invariant probability but cannot move between the cycles. Even a single finite cycle has periodic correlations rather than the decay required for mixing. On an infinite counting-measure space, translation preserves measure while individual states can drift away forever. Thus recurrence, ergodicity, and mixing are additional conclusions with their own hypotheses, not alternate names for the defining preservation identity.
Work it through
Repair weights on two three-cycles
On residues , let . Test proposed atom weights , then construct an invariant law with total even-state mass and odd-state mass .
The cycles are and . For the event , its preimage is ; the proposed masses are and , so preservation fails.
An invariant repair assigns each even state mass and each odd state mass . Each cycle now has constant atom weights, and the total is .
For observable , the even-cycle average is two and the odd-cycle average is three, giving expectation . Applying T permutes each cycle, so the expectation of is also .
Invariance forces equal weights along each orbit cycle but leaves freedom in how total probability is distributed between cycles.
The living notebook
Explore the model
Interactive lab · modular
A preserving permutation can have several orbits
Pause and Reset, then set both modulus and step . Predict orbit and period three; one Step adds once. Reset and set both , predicting period six. The instrument follows the orbit from zero, so enumerate the missing odd cycle separately in the first run. It does not assign invariant probability weights. Control changes retain elapsed time; Reset clears both parameters and time.
- Residue r0
- 0
- Orbit period · m/gcd(m,a)
- 12
- Distinct residues visited
- 1 of 12
Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forOrbit structure constrains invariant weights, while preservation by itself does not make all starting states communicate.
Pause & reason
Check your understanding
Your turn
Try it yourself
For doubling modulo one on with Lebesgue probability, find the preimage of and verify its measure. Explain why this check does not assert that doubling is invertible.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Solve the interval condition separately before and after subtracting one from twice the coordinate.
Compare with the solution
The preimage is , two disjoint intervals of length one quarter. Its measure is one half, matching the target interval. More generally the two inverse branches scale measurable sets by one half, proving preservation. Doubling still identifies x with x plus one half modulo one, so the preimage calculation supplies two branches rather than a measurable inverse transformation.
Keep the idea
Take it with you
- A dynamical system includes both a transformation and a measure.
- Measure preservation is a preimage identity and permits noninvertible maps.
- Invariant probability on a finite permutation is constant within each cycle.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.