For an invertible probability measure-preserving system, an almost periodic observable is an whose Koopman operator orbit is totally bounded:
Equivalently, for every it has a finite -net in . For a noninvertible system use the forward orbit .
A factor map satisfies and almost everywhere. Disintegrate over this map and write
for the conditional L2 norm. A relatively almost periodic observable is an such that, for every , there are finitely many with
The center may depend on both and ; the finite list itself does not. Since is countable, the exceptional null sets can be combined. A compact extension of a measure-preserving system is a factor map for which these relatively almost periodic observables are dense in . This density definition should not be replaced by a claim that every observable already satisfies the uniform fiberwise finite-net condition.
For a proper factor map example, let carry independent fair coordinates and the two-sided Bernoulli shift , with . Set
using the product of the Bernoulli measure and the equal two-point measure. These are invertible measure-preserving systems, and the projection preserves measure and intertwines the transformations, so it is a two-to-one factor map.
Take . Then . Distinct coordinates are independent and have mean zero and variance one, hence
Its orbit has no finite sufficiently small net. Thus the Bernoulli coordinate observable is not almost periodic in global . In contrast, the conditional measure over is the equal measure on , and is constant on that fiber with value . The two centers give zero error on every fiber for every . Therefore is a relatively almost periodic observable for this map.
The example is also a finite-fiber compact extension. For a bounded observable on , each orbit value on a fiber is a pair in a fixed bounded subset of , which has a finite net. Its centers can be chosen as functions constant in , with prescribed values on the two labels. Bounded observables are dense in , so the extension is compact. The Bernoulli shift is mixing: cylinder events involving disjoint coordinate sets are independent for all sufficiently large shifts, and approximation by cylinder events extends this to arbitrary events. Thus and are ergodic. If an invariant function on is written , invariance gives and . The first function is constant; the second is -invariant and hence constant, and then its sign equation forces zero. This proves that the example's source is also ergodic.
For the positive-subset assertion, interpret the printed as , or as an invariant full-measure domain of the factor map; the prime is otherwise undefined and does not change the measure-theoretic argument.
First establish conditional norm covariance under a factor map. Invariance of the measures and uniqueness in the disintegration theorem for a probability measure give
on common full-measure sets. For the first equality, is another disintegration over the same fibers: it is supported on and integrates to . Uniqueness identifies it with , and iteration gives the norm formula.
Two elementary facts explain localization of relative almost periodicity to base sets. If is a relatively almost periodic observable and is measurable, then is also relatively almost periodic. Indeed, on a fiber,
When that indicator is one, use a center for ; when it is zero, use the additional center . Secondly, relative almost periodicity is closed under convergence in the uniform conditional L2 norm
If this norm of tends to zero, covariance bounds the corresponding error between every pair of orbit values by the same number. A finite -net for one sufficiently close is consequently an -net for .
Now take . The compact extension supplies relatively almost periodic observables with
Put . The Tonelli theorem gives
Hence for -almost every . Since , choose for which
has positive measure. The Egorov theorem gives a measurable of positive measure on which uniformly. Define
Then
For , the localization fact makes every relatively almost periodic, while
The conditional-norm closure fact therefore proves is a relatively almost periodic observable, with and positive measure. This is the positive-measure almost periodic indicator in a compact extension. No ergodic component or uncountable intersection of exceptional sets is needed in this construction; it in fact works under the same disintegration and compactness hypotheses without using the assumed ergodicity.
Use a standard Borel probability space so that conditional measures can be realized by measures. The disintegration theorem for a probability measure states the following. For a measurable map between standard Borel spaces and , there is a measurable probability kernel , unique for -almost every , such that
Measurability means is measurable for every Borel set . More generally
for integrable , with equality of the last expression almost everywhere. The are the conditional measures of a factor. This also defines conditional measures for a countably generated sub-sigma-algebra, or a measurable partition represented by such a map. Sigma-algebras are considered modulo null sets where necessary.
For an invariant probability measure, disintegrate over the invariant sigma-algebra . On a standard probability space it can be represented, modulo null sets, by a countably generated measurable factor . One justification for this countability is the separability of : a countable dense family of -measurable functions generates modulo null sets. The resulting conditional measures are the ergodic components:
Their invariance is one of the permitted facts. It remains to prove that almost every component is ergodic, rather than simply invariant.
Choose a countable generating algebra generating the Borel sigma-algebra of . Apply the Birkhoff ergodic theorem simultaneously to its indicators. For -almost every and all ,
Disintegration transfers this common full-measure set to -almost every , for -almost every . On that fiber the conditional expectation is constant and equals . Thus, simultaneously for every ,
Fix such a , for which is also invariant. Applying the Birkhoff ergodic theorem to the system with measure identifies these limits with
Finite linear combinations of the algebra's indicators are dense in , by the Monotone class theorem. Since conditional expectation is an contraction, its projection onto invariant functions consequently sends every function to its constant integral. In particular, for any -invariant set ,
and so . This proves almost every component is ergodic. The countable-test proof of ergodicity of conditional components avoids taking an invalid intersection of uncountably many full-measure sets.
For rotation by , take the quotient map . Its fibers are exactly the five-point orbits. The ergodic components of a rational circle rotation are therefore
Equivalently the component through is . To check the disintegration, for bounded measurable use the change of variables on the five consecutive fifth-intervals:
The rotation cyclically permutes the five atoms, preserving their equal masses. A set invariant modulo must contain all or none of this finite orbit, since every atom has positive mass. Thus each is ergodic. Finally, the invariant sigma-algebra is the pullback under : a function invariant under translation by is constant on each orbit and is a measurable function of . This confirms that these are the conditional measures over , not merely some decomposition into invariant measures.
For a probability measure-preserving system, weak mixing is the vanishing of averaged absolute correlation discrepancies:
By approximation with simple functions and the Cauchy-Schwarz inequality, this is equivalent to
Here , and . Absolute values are part of the definition: signed Cesaro convergence of a sequence of these correlations alone expresses ergodicity, not weak mixing.
Suppose the product system is ergodic. Fix a mean-zero and any . On the product take
These belong to , and . The mean ergodic theorem on the product, followed by pairing with , gives
The Cauchy-Schwarz inequality in bounds the averaged absolute correlation by the square root of this quantity. Subtract the mean from a general to obtain the definition above. This proves product ergodicity implies weak mixing, through the square-correlation proof of weak mixing from product ergodicity.
For the multiple averages, write and use the following Van der Corput lemma. If is bounded in a Hilbert space, every correlation average
exists, and , then in norm. One way to see the estimate is to replace by ; for fixed the change in its long average tends to zero. The Cauchy-Schwarz inequality and expansion of the squared block norm give
Let . This proves the auxiliary implication needed here.
A weak mixing system is ergodic: a mean-zero invariant would have the nonvanishing correlation . Every positive power is also weak mixing, since for nonnegative correlation discrepancies ,
This part of the stability of weak mixing under powers and products will control the induction.
In fact the stronger arithmetic-progression multiple averages under weak mixing holds:
For this is the mean ergodic theorem and ergodicity. Suppose it is known for and first assume . Put . For fixed , set
Using invariance of the integral to remove the common gives
This identity does not require an inverse of . Apply the induction hypothesis to the factors and pair their limit with . It follows that
The average in of the right side tends to zero because is weak mixing and . The Van der Corput lemma proves the zero limit. For general , split it into and its constant mean; the first term has the zero limit just proved, and the other term is times the induction average for . This completes the induction.
Pair this result with the real bounded . For
the requested Cesaro limit is
To obtain convergence in density of a sequence, we also need the product system to be weak mixing. For simple tensors, its correlations are products of single-system correlations. If and in averaged absolute discrepancy and both sequences are bounded, then
so the product discrepancy has zero average. Finite sums of tensors are dense in , and the Cauchy-Schwarz inequality extends the conclusion to arbitrary functions. Hence is weak mixing.
Apply the multiple-average result to on that product. Because the original are real,
Together with the first-moment limit this gives
The mean-square criterion for convergence in density now yields, for every ,
Therefore the density convergence of multiple weak-mixing correlations gives the same answer:
The second-moment argument is essential; the signed Cesaro limit alone would not imply this conclusion.
Use probability measure-preserving systems: is measurable and . Its invariant sigma-algebra is
Ergodicity means that every invariant measurable set has measure zero or one:
Equivalently, every invariant measurable function is constant almost everywhere. Indeed all rational sublevel sets of a real invariant function belong to , so the zero-or-one alternative forces its distribution to concentrate at one value. Apply this to real and imaginary parts for complex functions. Conversely, an invariant set has an invariant indicator, so the function criterion implies the set criterion. This is the invariant-function characterization of ergodicity.
For an irrational rotation of the circle, with , an invariant has Fourier coefficients satisfying
For the multiplier is nonzero. Completeness of the Fourier series basis therefore makes constant. Apply this to an invariant indicator to prove the irrational rotation is ergodic. A second example is the cyclic permutation of points with equal masses: a nonempty invariant set contains the whole cycle and hence has measure one.
The identity on with Lebesgue measure is not ergodic, since is invariant and has measure . Nor is rotation by on the circle: the set
is invariant and has measure . These examples also show why preservation of measure does not imply ergodicity.
Let be the Koopman operator, , and set
The Von Neumann mean ergodic theorem says that, for , these Cesàro averages converge in to the orthogonal projection onto the invariant functions:
For an invertible system, is a unitary operator. The Hilbert-space theorem states more generally that the Cesàro averages of any unitary operator converge strongly to its fixed-space projection.
Here is the requested invertible-case proof. Since ,
Thus the orthogonal decomposition for unitary ergodic averages is
On the first summand, . On a vector , telescoping gives
Because , approximation extends this convergence to the closure of the range. The orthogonal decomposition now proves the theorem for every . An invariant function is -measurable, and an -measurable function is invariant by approximation with indicators; hence the projection is the stated conditional expectation.
In an ergodic system, invariant functions are constants by the criterion already proved. Their orthogonal projection is obtained by taking the inner product with , whose norm is one. Therefore the ergodic limit is the space average:
The Birkhoff ergodic theorem states that, for ,
The limit is invariant, integrable, and has the same integral as . On a probability space convergence also holds in . In an ergodic system the limit is almost everywhere.
For the topological sharpening, take a continuous map on a compact metric space. Unique ergodicity means there is exactly one invariant Borel probability measure . The uniform ergodic convergence for uniquely ergodic systems says that every continuous real or complex satisfies
Thus convergence holds at every point and uniformly in that point. The continuity, compactness and continuous-observable hypotheses belong to this theorem; it is not a claim of uniform convergence for all measurable functions.
For each element of the product set , let count its representations as with . The ratio equality is equivalent to . Swapping the two coordinates is a bijection between the ratio-equality quadruples and the equal-product quadruples. Therefore the multiplicative energy satisfies
The Cauchy-Schwarz inequality gives the energy lower bound:
For the upper bound, place the Cartesian product in the strictly positive quadrant. For every occupied Euclidean ray from the origin let be its points and . The slope is , so
Take to be the natural logarithm and put , using the non-triviality assumption . Partition the possible occupancies into classes: for , and for the last class. This last closed endpoint ensures that the partition works even when the top endpoint is attained. Within each class the ratio of any two occupancies is at most .
Fix one class and order its occupied Euclidean rays by increasing slope, with occupancies . Write , the cardinality of . If , then , since adding any fixed element gives an injection of into its sumset , and similarly for .
If , the sums contain exactly different points, by injectivity of sums on two distinct rays. Indeed, the two direction vectors are linearly independent, so the coefficients of a sum uniquely recover its two summands. Positivity puts every sum strictly inside the open planar sector between those two Euclidean rays. The sectors between successive selected Euclidean rays are disjoint, even if there are additional unselected rays between them. All these sums belong to , and hence
For neighbouring occupancies their ratio lies between and , so
Summing covers every at least once, and gives . The same bound holds for empty or singleton classes by the preceding observations. Adding over the classes proves the multiplicative energy sumset bound . Combining both bounds yields the sum-product conclusion:
If instead is interpreted as base two, use the same occupancy classes with in place of ; proves that convention as well. Positivity is essential to the sector argument.
Use the part-preserving bipartite four-cycle density convention
Here is the indicator function of adjacency, and repeated labels are allowed. This is the homomorphism density convention appropriate to the four-cycle norm. We derive the needed counting and operator norm facts directly.
Let be the -by- biadjacency matrix, let be the all-ones vector, let , and put . The degree hypothesis says
so the centered matrix annihilates on both sides. In particular, , and
The two terms have zero products in either order. Expanding the matrix trace directly counts four adjacency factors:
Since and , we obtain
The given upper bound therefore implies
This computation proves the centered four-cycle identity for a biregular graph, rather than assuming a four-cycle norm identity.
The matrix is a positive semidefinite matrix. By the spectral theorem for real symmetric matrices it has nonnegative eigenvalues , and
Moreover, for the Euclidean norm,
Indeed , whose maximum on unit vectors is ; the Cauchy-Schwarz inequality characterization also shows that and have the same operator norm. Taking fourth roots thus gives
where the error parameter is nonnegative, as in the claimed bound.
Finally use the indicator vectors , . Their Euclidean norms are and , so the Cauchy-Schwarz inequality and the operator norm estimate yield
This is the required discrepancy bound. It also holds when either subset is empty or . In fact, because annihilates constants, replacing by gives the stronger bound . This is the spectral discrepancy bound for a biregular graph.
Apply the polynomial method in combinatorics to the finite-field Kakeya set . We will actually obtain the stronger estimate
Let be the vector space over the prime field of multivariate polynomials in variables of total degree of a polynomial at most . By the dimension of a bounded-total-degree polynomial space, its monomial basis consists of with and . Adding a slack exponent gives nonnegative exponents summing to ; the stars and bars count shows that
If , the evaluation linear map has a nonzero element in its kernel of a linear map. Thus there is a nonzero polynomial of total degree of a polynomial vanishing at every point of . Its degree cannot be zero, since contains a line and is nonempty. Write for its nonzero top homogeneous polynomial part.
For every nonzero , the directional hypothesis supplies an affine line in a vector space
Directions are one-dimensional vector subspaces; rescaling a representative does not change this line. The univariate polynomial has degree at most and vanishes for all values of . The root bound for a polynomial makes it the zero polynomial. Its coefficient of is exactly , so for every nonzero . Because , too.
To finish, we prove the relevant polynomial nonvanishing below the field size. A polynomial over of degree at most in each variable cannot vanish on all of unless it is zero. Induct on . The one-variable case is the root bound for a polynomial. For more variables, write
Fixing the first coordinates gives a univariate polynomial with roots of a polynomial, so all its coefficients are zero. Hence every vanishes on , and the induction hypothesis makes every zero. Applying this to , whose total degree of a polynomial is less than , contradicts its choice as nonzero.
Therefore . Finally,
which proves the requested lower bound. The crucial observation in the finite-field Kakeya polynomial bound is that complete lines force the highest homogeneous polynomial part to vanish in every direction.
The triangle removal lemma says that for every there are and such that a graph on vertices with fewer than triangles in a graph can be made triangle-free by deleting at most edges. Here triangles in a graph are unordered triples of distinct vertices. We prove this consequence with the necessary quantitative dependence.
We may assume . Put , choose an integer , and choose
Apply the Szemerédi regularity lemma to obtain an exceptional class of size at most and equal-sized classes of size , where , and at most pairs are not regular pairs of vertex sets. The constant depends only on these chosen parameters. Delete all edges incident with , all edges within a class, all edges between irregular pairs, and all edges between pairs whose edge density of a bipartite graph is less than . The respective costs are at most
Their sum is at most , hence certainly at most .
If a triangle in a graph survives, it lies in three distinct classes whose three pairs are -regular pairs of vertex sets of edge density of a bipartite graph at least in the original graph. We now check the needed regular triangle counting lemma. In the first class all but at most vertices have at least neighbours in each of the other two classes; otherwise the definition of a regular pair of vertex sets would be violated. For each such vertex , its two neighbour sets each have size at least , so their mutual edge density of a bipartite graph is at least . It follows that the original three classes contain at least
triangles in a graph. The elementary lower bound holds because and . Also . Thus a surviving triangle in a graph implies at least original triangles in a graph. Set and take large enough for the Szemerédi regularity lemma. Fewer than original triangles in a graph force the cleaned graph to be triangle-free, proving the triangle removal lemma.
Now suppose and . Use the tripartite graph encoding of a grid to construct a tripartite graph with disjoint labelled classes
For each , put in the three edges joining , , and . These yield canonical triangles in a graph. They are pairwise edge-disjoint triangles: an edge determines directly, an edge determines , and a edge determines . Any deletion making the graph triangle-free must therefore remove at least edges.
On the other hand, an arbitrary triangle in a graph with labels gives three points of :
Writing , these are . If , they form the required corner in an integer grid. If there is no such corner in an integer grid, every triangle in a graph is canonical, and the total number is precisely .
Apply the triangle removal lemma with . The constructed graph has vertices. For sufficiently large , and
In the absence of a corner in an integer grid, the triangle removal lemma would destroy all triangles in a graph by deleting at most
edges, contradicting the pairwise edge-disjoint triangles. Every sufficiently large grid therefore has the asserted corner in an integer grid in every subset of positive fixed density of a finite subset. For there is no eligible subset, so the assertion is vacuous. This proves the corners theorem, including the stipulated nonzero displacement; no positivity of was required.
An additive form of the Plünnecke inequality is the following. If are nonempty finite subsets of an abelian group and , then there is one nonempty such that, simultaneously for every integer ,
Here is an iterated sumset and . In particular, its Plünnecke-Ruzsa inequality consequence is
We prove both statements, so that the sumset and difference set formulations are covered.
Choose a nonempty minimizing the ratio , and denote this minimum by . Such a minimizer exists because is finite, and . Every satisfies , with the empty case also valid. We first prove the Petridis minimal-growth lemma
for every finite nonempty .
List . Let and . Define
The new points of are exactly , so . Since , the sumset is already contained in . It follows that the new points introduced into are contained in
As , their number is at most
Summing these increments proves the Petridis minimal-growth lemma. Taking for and iterating now gives
This proves the Plünnecke inequality with the same minimizing set for every .
To obtain the difference set bound, we also prove the required Ruzsa triangle inequality. For finite with , choose one representation of each . The map
is an injection: the sum of the output coordinates recovers , and the first coordinate then recovers because was fixed. Thus
Use , , and . The already proved Plünnecke inequality yields
This finishes the proof of the stated Plünnecke-Ruzsa inequality. The use of an abelian group is essential in commuting the translates and sumsets in the minimal-growth argument.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact