How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Measure-Preserving Systems and Mixing Criteria
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Measure preservation is defined by inverse images and then characterized by invariant integrals. Pullback gives an isometry on real and complex Lp spaces. Strict and modulo-null invariance lead to equivalent probability-space criteria for ergodicity. Strong mixing implies weak mixing, which implies ergodicity; generating-family approximation and complex L2 correlations give two ways to check mixing. Completeness of the measure space is unnecessary. The completion clause alone states its countable-choice assumption.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Measure-preserving transformations and systems
Definition
Let be a measure space. A measurable self-map is measure preserving if for every . The quadruple is a measure-preserving system; it is a probability system if . Here denotes an inverse image, whether or not is invertible. Neither completeness nor finiteness is implicit. The measure-space and measurable-map conventions are Measure spaces and A measurable function between measurable spaces.
Invertible measure-preserving systems
Definition
A system in Measure-preserving transformations and systems is invertible if is a bijection and is measurable. It is invertible modulo null sets if there is a measurable with and , such that is a bijection with measurable inverse for the trace sigma-algebra. This is an actual invariant conull restriction, not a choice of arbitrary pointwise inverses on exceptional sets.
Measure preservation can be checked on a generating pi-system
Statement
Let be measurable on . Let be a pi-system generating , with an increasing sequence covering and satisfying . If for every , then preserves . For finite , a generating pi-system can be enlarged by to meet the exhaustion condition.
Facts & Assumptions
Two measures agreeing on a generating pi-system and an increasing finite-mass exhaustion agree everywhere Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system.
Proof
Given: The objects and hypotheses in the statement.
Set . Inverse images take the empty set to the empty set and disjoint countable unions to disjoint countable unions. Thus and for disjoint measurable , so is a measure.
The measures agree on , and on the stated increasing exhaustion. Uniqueness therefore gives for all , which is measure preservation.
If , adjoining keeps the family a generating pi-system; its preservation identity holds since . The constant exhaustion then satisfies every required hypothesis.
Compositions, iterates and completions preserve invariance
Statement
Compositions and nonnegative iterates of measure-preserving self-maps of preserve measure. Assuming countable choice, also defines a measurable measure-preserving self-map of the completion . Countable choice is needed here only for the cited construction of the completion measure.
Facts & Assumptions
Under countable choice the completion construction is a complete measure extending the original measure Assuming countable choice, every measure space has a unique complete extension to its completion.
Countable choice is assumed for this completion construction The Axiom of Countable Choice ().
Every completion-measurable set is an original measurable set modified within an original measurable null set The completion domain and proposed completed set function of a measure space.
Proof
Given: The objects and hypotheses in the statement.
For preserving and measurable , is measurable and has measure . The identity preserves measure; applying this composition calculation successively gives preservation for every , .
Assume countable choice. The completion theorem supplies the complete measure extending . For choose with and . Then , where is measurable and null. Thus is completion measurable and .
Integral invariance under measure-preserving maps
Statement
If preserves and is measurable, then , allowing infinity. If is integrable real or complex valued, is integrable and the same equality holds. Conversely, for a measurable self-map, equality for every measurable indicator implies measure preservation.
Facts & Assumptions
Nonnegative measurable functions admit increasing simple approximations Every nonnegative measurable function is the increasing limit of simple measurable functions.
Increasing nonnegative measurable functions have increasing integrals with the expected limit Monotone convergence for the integral.
The integral is complex-linear on integrable functions The Lebesgue integral is linear on .
Proof
Given: The objects and hypotheses in the statement.
For , , hence its integral is . A nonnegative simple function written over disjoint fibers has integral equal to the sum of coefficient times fiber measure, so the identity holds for every such function, also when the sum is infinite in value.
For nonnegative measurable , take as supplied by simple approximation. Then measurably. Integral monotone convergence on both sides gives .
For integrable , applying step 2.1 to proves . Apply that step to the positive and negative parts of each real component. Subtract their finite integrals and combine the real and imaginary parts by linearity to obtain the asserted equality.
Conversely the indicator identity is exactly for each measurable . Thus it is measure preservation.
The Koopman operator
Definition
For a system in Measure-preserving transformations and systems and , the Koopman operator is , . Scalars can be real or complex, using The space as the quotient by null functions and Complex Lp classes and Euclidean test-function conventions. Membership and representative independence, and hence well-definedness, are proved in Koopman operators are linear isometries ↗.
Koopman operators are linear isometries
Statement
For a measure-preserving system and , is a well-defined linear isometry on real or complex . It is surjective for an invertible system, and also for a system invertible modulo null sets in the invariant-restriction convention.
Facts & Assumptions
Koopman is pullback on a.e. classes The Koopman operator.
Pullback preserves nonnegative integrals Integral invariance under measure-preserving maps.
The norm is the least essential bound The essential supremum is attained as the least essential bound.
The real Lp norm and quotient operations are well-defined The norm descends to the quotient and makes a normed space for .
Complex Lp has the stated quotient operations and norm Complex Holder, Minkowski, and the quotient norm.
An invertible system has a measurable inverse, either everywhere or on the specified conull restriction Invertible measure-preserving systems.
Proof
Given: The objects and hypotheses in the statement.
Composition with measurable is measurable. If outside a measurable null set , then outside , which is measurable and null. Thus pullback respects the a.e. equivalence relation used to define .
For , integral invariance applied to the nonnegative function gives . Thus the pullback belongs to and preserves the norm, including at .
For every , has the same measure as . The sets of finite essential bounds therefore coincide, so their infima coincide. The least-essential-bound result applies to the real modulus, proving membership and equality of the infinity norms.
Pointwise, . The real and complex quotient norm theorems make these the quotient vector operations. Together with steps 1.1, 2.1 and 2.2 this proves linear isometry.
For an actual measurable inverse , is measurable and . Thus preserves measure. Both compositions and are the identity, so is onto.
In the modulo-null case restrict to the measurable conull invariant of the definition. For measurable , differs from its restricted inverse image only within , so the restricted map preserves restricted measure. Step 4.1 applies there. For any measurable on , compose with the restricted inverse and extend by zero on . This extension is measurable, has the same Lp norm as , and pulls back to on . It supplies a preimage class.
Strict and mod-null invariant sigma-algebras
Definition
For a system in Measure-preserving transformations and systems, set These are respectively the strictly invariant and invariant modulo null sets families. All their members are measurable in the original sigma-algebra; the terminology uses Sigma-algebras and Measure-null sets and almost-everywhere statements relative to a measure. Their sigma-algebra property is proved in Both invariant families are sigma-algebras ↗.
Both invariant families are sigma-algebras
Statement
For any measure-preserving system, and are sigma-algebras on , and .
Facts & Assumptions
The two families use exact equality and null symmetric difference, respectively Strict and mod-null invariant sigma-algebras.
A countable union of measurable null sets is null Finite and countable subadditivity of measures.
Proof
Given: The objects and hypotheses in the statement.
and . Also and . Thus exact invariance is preserved under complements and countable unions, proving that is a sigma-algebra.
The symmetric difference of the two complements is . Further, . If all component differences are null, countable subadditivity makes the union null. Therefore is a sigma-algebra as well. Exact invariance gives empty symmetric difference, proving .
Mod-null invariant sets have strict representatives
Statement
If in a measure-preserving system, then belongs to and satisfies . This does not require completeness or a choice axiom.
Facts & Assumptions
The invariant families consist of the stated measurable sets Both invariant families are sigma-algebras.
Nonnegative iterates preserve measure; only the choice-free iteration clause is used Compositions, iterates and completions preserve invariance.
Finite and countable unions of measurable null sets are null Finite and countable subadditivity of measures.
Proof
Given: The objects and hypotheses in the statement.
Write , which is measurable and null. For , : whenever membership at times zero and n differs, it differs at a consecutive pair. Iterates preserve measure, so every set on the right is null; finite subadditivity makes the left null. For n=0 the difference is empty.
The displayed countable intersection and unions make F measurable. Outside the measurable null set all these indicators equal , so membership in their limsup equals membership in E. Thus and its measure is zero.
Pulling back the displayed formula gives : removing the initial term does not change membership infinitely often. Hence F is strictly invariant and is the required representative.
Ergodicity relative to an invariant measure
Definition
A measure-preserving system is ergodic for if each has or , with as in Strict and mod-null invariant sigma-algebras. For a probability system this means . The definition is relative to the invariant measure; no probability assumption is implicit in the general null/conull formulation.
Equivalent invariant-set and invariant-function criteria for ergodicity
Statement
For a measure-preserving probability system the following are equivalent: (i) ergodicity; (ii) every is null or conull; (iii) every measurable real-valued function satisfying everywhere is constant a.e.; (iv) every measurable real-valued function satisfying a.e. is constant a.e. Replacing real-valued by complex-valued in either (iii) or (iv) gives equivalent conditions. All functions take finite values.
Facts & Assumptions
Ergodicity means every strictly invariant measurable set is null or conull Ergodicity relative to an invariant measure.
A modulo-null invariant measurable set has a strict invariant representative modulo a measurable null set Mod-null invariant sets have strict representatives.
Inverse images of Borel sets under measurable real functions are measurable A measurable function between measurable spaces.
Countable unions of null sets are null Finite and countable subadditivity of measures.
A complex function is measurable when its real and imaginary components are measurable Complex Lp classes and Euclidean test-function conventions.
Every real number lies in a unique interval [k,k+1) with integer k; applying this to n times the value gives the partition used below Integer part: for every real there is exactly one integer with .
For every positive real epsilon some positive integer n satisfies 1/n<epsilon For every in a complete ordered field there is a natural with .
Proof
Given: The objects and hypotheses in the statement.
If the system is ergodic, a set in has by F2 a strict invariant representative differing by a null set, hence has measure zero or one. Conversely (ii) applies to strictly invariant sets. Thus (i) and (ii) are equivalent.
Assume (ii) and let be measurable and a.e. invariant. For , , let . Measurability follows from F3. Its pullback differs from it only where , so it is in . For each n these fibers partition X. Their measures are zero or one; countable subadditivity excludes all zero, and disjointness and total mass one exclude two fibers of measure one. There is therefore a unique k(n) with .
The set is conull by countable subadditivity. It is nonempty since . Fix one . For any , for every n, so by the Archimedean property of the real numbers. Thus (ii) implies (iv). The uniquely determined k(n) require no countable choice.
For a complex a.e. invariant f, its real and imaginary parts are measurable and a.e. invariant by F5. Apply the preceding argument to both, and intersect the two conull sets; f is constant there. This proves both real and complex versions of (iv), and each implies the corresponding version of (iii).
If either version of (iii) holds and E is strictly invariant, then is an everywhere invariant measurable function. A constant indicator on a conull nonempty set must have constant value zero or one, so E is null or conull. Thus (iii) implies (i). Also (iv) directly implies (ii) by the same argument applied to an indicator invariant a.e. All listed implications are now closed.
Positive sets sweep out ergodic probability systems
Statement
In a measure-preserving probability system the following are equivalent: ergodicity; for every measurable with , ; and for every measurable of positive measure there is with .
Facts & Assumptions
On probability systems ergodicity is equivalent to null/conull modulo-null invariant sets Equivalent invariant-set and invariant-function criteria for ergodicity.
Every nonnegative iterate preserves measure Compositions, iterates and completions preserve invariance.
Nested measurable sets of equal finite measure have null difference Measure of a set difference when the smaller set has finite measure.
A countable union of measurable null sets is null Finite and countable subadditivity of measures.
Proof
Given: The objects and hypotheses in the statement.
Assume ergodicity and put . Then and . The finite-measure difference formula gives . Since , the modulo-null invariant-set criterion yields .
If the sweep-out property holds and , then . Were every null, their countable union would be null. Thus at least one intersection has positive measure.
If the positive-intersection property holds and , then for all n. Taking gives for every n. The property excludes both A and its complement having positive measure, proving ergodicity.
Strong and weak mixing on a probability space
Definition
For a measure-preserving probability system as in Measure-preserving transformations and systems, put for measurable and . The system is strongly mixing if for every such pair. It is weakly mixing if for every such pair. The absolute value is inside the average. In all cases and is the identity.
Mixing implies weak mixing, which implies ergodicity
Statement
Every strongly mixing probability system is weakly mixing, and every weakly mixing probability system is ergodic.
Facts & Assumptions
Strong mixing is convergence of set correlations; weak mixing is convergence of their absolute Cesaro averages Strong and weak mixing on a probability space.
In a probability system ergodicity means invariant sets have mass zero or one Ergodicity relative to an invariant measure.
Proof
Given: The objects and hypotheses in the statement.
For a fixed measurable pair let . Strong mixing says . Given , choose m so that for . For , . The first term tends to zero because it is a fixed finite sum divided by N. As is arbitrary, weak mixing follows.
For a strictly invariant E, for every n. Thus its weak-mixing average against itself is exactly . A constant sequence tends to zero only if that constant is zero. Since , this gives or , which is ergodicity.
Approximation in symmetric difference by a generating algebra
Statement
If and an algebra of subsets of X generates , then for every and there is with .
Facts & Assumptions
An algebra contains X and is closed under complements and finite unions Algebras of subsets.
The measure of an increasing union is the supremum of the measures Continuity from below for measures.
Union errors are bounded by the sum of their measures Finite and countable subadditivity of measures.
The generated sigma-algebra is the smallest sigma-algebra containing its generators Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal.
Proof
Given: The objects and hypotheses in the statement.
Let . Every lies in by using itself. For complements, , and . Thus contains X and is closed under complements.
Let and . For , continuity from below gives . By additivity on , some satisfies . Choose finitely many with . Then and .
Thus is a sigma-algebra containing . By the minimality of , , and the reverse inclusion is built into its definition. This proves the approximation assertion.
Mixing is checkable on a generating pi-system
Statement
Let be a measure-preserving probability system and a generating pi-system containing X. Strong mixing is equivalent to for . Weak mixing is equivalent to for , where .
Facts & Assumptions
The two properties quantify convergence of correlations or their absolute averages over all measurable pairs Strong and weak mixing on a probability space.
On a finite measure space every measurable set has arbitrarily accurate algebra approximants Approximation in symmetric difference by a generating algebra.
The measure of a finite union is at most the sum of its measures Finite and countable subadditivity of measures.
Integration of finite linear combinations of integrable functions is linear The Lebesgue integral is linear on .
Proof
Given: The objects and hypotheses in the statement.
Let consist of finite Boolean combinations of members of . Each indicator of an atom of a finite Boolean partition is a product of factors and . Expanding the product expresses it as a finite integer linear combination of indicators of intersections of members of . Empty intersections are X, which lies in , and all other intersections lie in by the pi-system property. Finite sums of these atom indicators express every , , in this way.
Integration and multiplication of finite sums now express as a finite linear combination . In the strong case each summand tends to zero. In the weak case the average of the absolute value is at most , which tends to zero. The respective test therefore holds on .
The family is an algebra generating . For measurable A,B and , choose C,D in it with . Measure preservation gives by repeated pullback. Thus the difference of the intersection measures is bounded by the sum of these two errors. Also , since all masses are at most one. Consequently uniformly in n.
In the strong case the limsup of is at most . In the weak case the same bound holds for the limsup of its absolute Cesaro averages. Letting decrease to zero proves the full respective property. Conversely either full property restricts to the pairs in by its definition.
Mixing correlations extend to L2 functions
Statement
On a measure-preserving probability system, for complex put Strong mixing is equivalent to for all such f,g. Weak mixing is equivalent to for all such f,g. The pairing is linear in its first variable.
Facts & Assumptions
Complex integration is componentwise and the pairing is linear in its first variable Complex Lp classes and Euclidean test-function conventions.
Koopman is an isometry on complex Koopman operators are linear isometries.
Real-modulus products have integral bounded by the product of their norms Cauchy-Schwarz inequality for .
The complex pairing is well-defined, sesquilinear and satisfies Cauchy–Schwarz The complex pairing is well-defined and satisfies Cauchy–Schwarz.
Set mixing uses ordinary convergence or absolute Cesaro convergence Strong and weak mixing on a probability space.
Finite simple functions of finite-measure support are dense in complex on every measure space Complex finite-simple and smooth compact-support density for finite p.
The complex L2 quotient norm satisfies the triangle inequality Complex Holder, Minkowski, and the quotient norm.
Proof
Given: The objects and hypotheses in the statement.
The constant one has norm one. Complex Cauchy–Schwarz gives and . Koopman isometry, iterated n times, gives . Applying the real-modulus Cauchy–Schwarz inequality to and proves absolute integrability of the product. Thus every term defining exists and is independent of representatives, with the indicated complex pairing.
For indicators . For finite complex simple and , sesquilinearity gives . Therefore the set version of strong mixing gives convergence for simple pairs, and the weak version gives it for absolute Cesaro averages by the finite triangle inequality.
For any h,k, the two Cauchy–Schwarz estimates in step 1.1 give . Choose finite simple a,b with and using only the finite-simple clause of density. Then sesquilinearity gives The bound is independent of n.
Taking limsups of absolute values, or of their Cesaro averages, uses step 2.1 to remove the simple-pair term. Sending to zero proves the respective property. Conversely the property applies to indicators, which lie in because , and their identity in step 2.1 is precisely the set property.
5 · Examples, counterexamples and false statements
None yet.
Sources
- E–W Definition 2.1, pp.13–14
- Einsiedler–Ward Definition 2.1 p.13 and conull restriction convention in Definition 2.7 p.16
- E–W §2.1 p.13; local sigma-finite uniqueness theorem
- Einsiedler–Ward Exercise 2.1.3, p.19; Sarig Proposition 1.4 preservation proof, p.8
- E–W Lemma 2.6, pp.15–16
- E–W §2.4 pp.28–29; Sarig Proposition 1.3
- Einsiedler–Ward §2.4 opening, pp.28–29 (isometry paragraph, not Lemma 2.18)
- E–W Proposition 2.14; Sarig Proposition 1.1
- Sarig Proposition 1.1 proof; E–W Proposition 2.14
- E–W Proposition 2.14 pp.23–24; Sarig Proposition 1.1 pp.5–6
- Sarig Definition 1.4 p.5
- E–W Proposition 2.14 pp.23–25; Sarig Proposition 1.1
- E–W Proposition 2.14 pp.24–25
- E–W Definitions 2.32 and 2.35, pp.49–50
- E–W §2.7 pp.49–50; Sarig Proposition 1.2
- E–W Proposition 2.15 proof and Exercise 2.7.3
- Einsiedler–Ward Exercise 2.7.3(1)–(2), pp.52–53; local Boolean-algebra extension from a pi-system
- Sarig Proposition 1.3 p.7; E–W Exercise 2.7.7