Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 109 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write and let denote Lebesgue measure. Necessity follows from measure additivity and monotonicity: the pairwise disjoint Lebesgue measurable sets give
For sufficiency, form the finite measurable partition into membership cellsThese Lebesgue measurable sets are pairwise disjoint, and . Empty cells may be retained. Construct a flow network with a source, one vertex for each index , one vertex for each cell , and a sink. Give the source-to- edge capacity , the -to- edge capacity whenever , and the -to-sink edge capacity .
Consider any cut of a flow network, and let be its index vertices on the source side. If an index-to-cell edge crosses the cut of a flow network, its capacity alone is . Otherwise every cell with lies on the source side, so the cut of a flow network has capacity at leastThe cut immediately after the source has capacity . The max-flow min-cut theorem, valid for finite flow networks with real capacities, therefore supplies a flow of value . Its cell allocations satisfy
It remains to convert these numbers into Lebesgue measurable sets; this uses divisibility of Lebesgue measure. Indeed, for any Lebesgue measurable set , the function satisfies , and . Thus it has Lipschitz continuity, and the intermediate value theorem supplies a measurable subset of of any prescribed measure between and . Successively apply this to the remaining portion of each , choosing disjoint pieces of measure ; choose the empty set when . ThenThis proves the measurable Hall theorem. The splitting step is essential: an arbitrary measure with an atom of a measure would not support the same conclusion. Here inclusion allows equality; even if strict inclusion is required, deleting one point of each nonempty from every preserves all measures and ensures .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 108 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a probability measure-preserving system, the hypothesis is completely positive entropy: every finite measurable partition with positive static entropy of a finite measurable partition has positive entropy rate of a measurable partition. Fix a finite partition and putAll sigma-algebras are interpreted modulo null sets. We will prove that every finite partition measurable with respect to this tail sigma-algebra of a measurable partition has . Applying this to a binary partition will force the required triviality. This proves the needed direction of the Tail characterization of the Pinsker sigma-algebra directly, including noninvertible transformations.
Write . The infinite-future entropy formula and the backwards chain rule for information entropy give, for every , the block conditional entropy given the infinite future identityEach term equals by invariance of the joint probabilities under a common pullback and continuity of conditional entropy under increasing finite future blocks. Invertibility is not needed for this identity.
Fix . Since is -measurable and finite, the martingale convergence theorem and continuity of finite-partition conditional entropy allow an withTo see the continuity explicitly, for each partition atom of the conditional probabilities tend to almost everywhere; apply dominated convergence theorem to the bounded continuous function on and sum over the finitely many partition atoms.
For set , , and . The conditional entropy of finite measurable partitions satisfiesThe second inequality uses conditioning reduces entropy, since refines each block ; the final equality uses measure preservation.
Moreover is -measurable. For each , tail measurability gives measurable with respect to , hence measurable with respect to . Thus conditioning reduces entropy and the displayed block identity implyUse the symmetric entropy identity to obtainThe fraction on the right tends to zero: is fixed and by the definition of entropy rate of a measurable partition. Taking and then gives
Now let and take . If , its binary entropy is , while its entropy rate is zero, contradicting completely positive entropy. ThereforeSince was arbitrary, every finite-partition tail is trivial. The argument needs only that is finite and the measure is a probability; it does not assume a finite generator, finite total system entropy, or invertibility.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 108 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
On a probability measure-preserving system, for a finite measurable partition , the entropy of a finite measurable partition isUse natural logarithms, so information entropy is measured in nats; another fixed logarithm base rescales all answers. The join of measurable partitions is their common refinement, and write , with an empty join the trivial partition. The entropy rate of a measurable partition and Kolmogorov-Sinai entropy are respectivelyThe block entropies form a subadditive sequence, so the first limit exists by the Fekete lemma. For finite partitions the conditional entropy of finite measurable partitions is .
Put and for . The chain rule for information entropy, applied from the last coordinate backwards, and measure preservation giveThe second equality uses invariance of the joint partition atom probabilities under the common pullback ; invertibility is unnecessary. Since conditioning reduces entropy, decreases to a nonnegative limit . The Cesaro convergence of a sequence of this convergent sequence has the same limit. ThereforeEquivalently , where . Here conditional entropy of a countable measurable partition conditioned on a sigma-algebra is computed using conditional partition atom probabilities; the martingale convergence theorem gives continuity under increasing conditioning sigma-algebras. This is the infinite-future formula for partition entropy rate.
The Kolmogorov-Sinai generator theorem states that if a finite or countable measurable partition has finite entropy of a countable measurable partition and its iterates generate the whole completed sigma-algebra modulo null sets, then . For an invertible system, generating means modulo null sets. For a noninvertible system a one-sided generator, using , suffices. The two-sided and one-sided versions must not be confused.
For a Bernoulli shift with discrete symbol probabilities , the coordinate-zero measurable partition has independent coordinate iterates. ThusFor a finite alphabet the coordinate partition is a generator of finite entropy of a finite measurable partition; on the two-sided sequence space use all integer coordinate iterates, and on the one-sided space use the nonnegative ones. The Kolmogorov-Sinai generator theorem proves the displayed answer in both cases. The same calculation applies to countably many symbols when their Shannon entropy is finite, using the countable finite-entropy version of the theorem. If the Shannon entropy is infinite, merge all but the first symbols into one cell. These finite coordinate partitions have entropy rate , so the system entropy is infinite. Zero-probability symbols contribute zero. In particular a fair -symbol shift has entropy .
For the final assertion, let and complete it modulo null sets. The approximation property forces modulo null sets. Indeed for each , choose approximating sets from finite blocks with error tending to zero. Their indicators approach in , and is a closed vector subspace, so is -measurable modulo a null set.
Invertibility now gives modulo null sets. In particular the present partition is measurable with respect to its entire future, so . The infinite-future formula gives . Since the given one-sided generator is also a two-sided generator, the Kolmogorov-Sinai generator theorem finishes the proof:This is finite one-sided generator of an invertible system forces zero entropy. Invertibility is essential: a fair binary one-sided Bernoulli shift has a finite one-sided generator and Kolmogorov-Sinai entropy .
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 108 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a probability measure-preserving system, strong mixing means that for every pair of measurable sets ,A sequence has convergence in density of a sequence to when for each the exceptional set has natural density zero. A weakly mixing measure-preserving transformation has convergence in density of to for every . Equivalently, because these correlations are bounded,Indeed the mean of the absolute discrepancy is at least times the exceptional frequency, while it is at most plus a uniform bound times that frequency. A signed Cesaro convergence of a sequence without absolute values is insufficient to define weak mixing.
The standard three-cut Chacon map is obtained by cutting and stacking. Start on with normalized Lebesgue measure, an initial tower consisting of , and a reservoir for spacers. At stage , cut every level of the current tower into three equal subintervals, producing three subcolumns. Add one new interval of the same width above the middle subcolumn. Stack the first subcolumn at the bottom, then the middle subcolumn with its spacer, then the third at the top. Define the partial transformation by translation from each level to the next, leaving the current top unmapped. These assignments extend the earlier partial transformation. Repeat indefinitely.
If is the number of levels and their width, thenHence , , and the stage- tower has measure . The spacers consume total measure , precisely the reservoir. The increasing partial maps give the Chacon map modulo null sets. The tower tops and unused reservoir have measures tending to zero, and the construction yields an invertible measure-preserving transformation. With marking an original level and a spacer, the tower words satisfy and , so the first new word is . This describes the spacer placement without needing a proof of well-definedness. The three-cut convention agrees with the classical constant spacer vector described in Ryzhikov's construction.
For the correlation assertion, take the L2 inner product to be , linear in its first argument, and put . The Koopman operator is an isometry on , even when is not invertible. For the hint givesTo extend rigorously to all test functions, centre the observable: . Invariance of the integral gives . LetFor each fixed , by the same isometry identity. Therefore the limit is zero for every finite linear combination of these orbit vectors. By the Cauchy-Schwarz inequality and , approximation extends this conclusion to every : the approximation error in the correlation is bounded by uniformly in . For , the correlation is identically zero because . The orthogonal decomposition by a closed subspace now gives the result for all . ThusThis is decay of autocorrelation implies weak convergence of an observable; no assumption that is an ergodic transformation, and no invertibility hypothesis was used, and is included.
Finally, strong mixing immediately implies the stated diagonal limit by taking . Conversely, suppose that limit holds for every . Apply the correlation result with and . Its hypothesis is exactly , and its conclusion isHence strong mixing is equivalent to diagonal set-correlation criterion for mixing. Using the orbit-span proof avoids an invalid polarization argument that would recover only the sum of the two directed cross-correlations from diagonal correlations.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 108 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
A continuous transformation of a compact metric space is uniquely ergodic when there is exactly one -invariant Borel probability measure on . We use the usual compact-space convention for unique ergodicity; the compactness and continuity hypotheses matter in the assertion about all starting points.
Let on the circle group, with irrational. Normalized Lebesgue measure is invariant under this irrational rotation of the circle. If is any invariant Borel probability measure, define its Fourier coefficients by . Invariance givesFor , irrationality makes , so ; also . These are the Fourier coefficients of . Hence and have the same integrals against every trigonometric polynomial. Such polynomials are uniformly dense in the continuous functions by the Stone-Weierstrass theorem, so the measures agree on every continuous test function and therefore agree as Borel measures. Thus
For the general uniquely ergodic system, fix and form the empirical measuresOn a compact metric space, the Borel probability measures are compact for weak convergence of probability measures. Any subsequential limit is invariant: for every continuous ,Here is bounded and is continuous, so the identity passes to the limit. Uniqueness of the invariant Borel probability measure gives . Every subsequential limit is therefore , and compactness implies convergence of the entire sequence. Testing against provesIn fact this proves uniform ergodic convergence for uniquely ergodic systems: if convergence were not uniform in , choose and where the discrepancy stays above a fixed positive number. The same compactness and telescoping argument applied to forces a subsequence to converge to , a contradiction. This also makes clear why an almost-everywhere Birkhoff ergodic theorem alone would not establish the requested everywhere assertion. Without the compact-space hypothesis the assertion need not hold: on the discrete space , set and . The only invariant probability is , but the continuous bounded function which is zero at and one on the integer orbit has orbit average one there.
For the decimal application put . This is irrational: if with positive integers , then , contradicting unique prime factorization. Writing with and gives . Its leading decimal digit is seven exactly whenThe half-open upper endpoint correctly excludes powers whose leading digit is eight, including .
The indicator of is not continuous, so an extra step is needed. For any , choose continuous functions on the circle with and , by tapering in small neighbourhoods of the two endpoints. Applying the everywhere averaging result to these functions traps the lower and upper limits of the interval frequency between their integrals. Letting proves everywhere interval frequency under an irrational rotation. ConsequentlyThis is the leading-seven case of Benford frequencies for powers of an integer.
Past exam of the mathematics course of the University of Cambridge 2017 iii Paper 107 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the paper's classical norm convention: is the derivative supremum norm through order two, not an norm. Write and , where the latter is the full Hölder norm of the forcing.
Fix . If the asserted estimate failed, rescaling the functions by their global Hessian matrix Hölder seminorm would produce withIn particular . Choose for whichThe supremum norm of tends to zero, so . Let be the quadratic Taylor polynomial of at , and defineThe domains contain , and vanish at zero. MoreoverThe right side is bounded by and tends to zero locally uniformly. The normalized Hessian matrix bound controls ; integration along line segments then bounds on every compact Euclidean ball. Arzelà-Ascoli theorem and a diagonal subsequence argument give convergence in on compact subsets to an entire harmonic function , with and .
After a further subsequence with . The normalization ensures . But each second derivative of is harmonic and has finite global Hölder seminorm with exponent below one. The supplied Liouville theorem makes each derivative constant; it is the globally Hölder case of the polynomial-growth Liouville theorem for harmonic functions. Its value at zero makes it zero, a contradiction. This blow-up compactness proof of an interior Schauder estimate establishes
To absorb the term on the larger Euclidean ball, rescale this estimate to Euclidean balls contained in . For , pairs separated by less than are controlled in a Euclidean ball centred at their first point; farther pairs are controlled directly by . ThusThis is the covering step in the Simon absorption lemma. Take and fix . Iterating makes the remainder tend to zero, since the global seminorm is finite; the error terms form a convergent geometric series. Consequently
For the requested failure of the weaker estimate, take and . The derivative supremum norm and remain bounded, but comparison at and , both in for large , givesThis proves the necessity of Hölder forcing for Schauder estimates. Every member of the sequence is smooth; failure comes from the increasing frequency, not from any lack of individual regularity.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





