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 2007 iii Paper 9 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a -dimensional normed vector space, with unit ball and John ellipsoid , its volume ratio isIt is at least and invariant under invertible linear coordinate changes.
For , the unit ball has volume : its intersection with each orthant is the standard simplex of volume . Its John ellipsoid is . To verify maximum volume, let be any centered inscribed ellipsoid. For each sign vector , containment gives . Averaging over independent Rademacher random variables yields . The arithmetic-geometric mean inequality for its squared singular values gives . The scalar matrix attains this bound because . Centered ellipsoids suffice: if is contained in the symmetric convex unit ball, averaging it with gives the centered copy with the same volume.
The subsequent assertion for an arbitrary -dimensional space is false as printed. Here is a counterexample independent of any asymptotic section theorem. Take . Its John ellipsoid is : an inscribed has every row of of Euclidean length at most , so the Hadamard inequality gives , attained by . Let be any -dimensional subspace and an orthonormal basis of it. The random unit vectorhas . Since for each coordinate , the moment-generating function bound for independent Rademacher random variables givesChoose ; the latter probability is at most , so some unit vector in has . The proposed section inequality would therefore forceThus even one half-dimensional section cannot have the printed universal constant.
The valid orthogonal splitting with bounded volume ratio is that may depend on , and suffices. This supplies a dimension-independent constant for the preceding case, or whenever is bounded uniformly. We prove the complete qualified assertion, including its epsilon-net ingredient.
In John position, . Polar integration of the radial function giveswhere is normalized spherical measure.
A maximal -separated subset of is an epsilon-net. Balls of radius about its points have disjoint interiors and lie in the ball of radius . Comparing volumes bounds its cardinality by . Finite existence follows from this packing bound, and maximality proves the net property without assuming a separate covering theorem.
Choose two orthogonal -dimensional subspaces and one such net on each unit sphere. Rotate both by a common uniformly distributed orthogonal matrix . This distribution can be obtained from Question 1 applied to the compact orthogonal group with its Frobenius metric; left and right multiplication are transitive isometries. Consequently is uniformly distributed on for every fixed unit vector . The union bound shows that the probability that some rotated net point has norm less than is at mostSet . Because , the bracket is at most , and twice its th power is less than for every . Some rotation therefore makes every point of both nets have norm at least .
The triangle inequality and imply that is -Lipschitz for the Euclidean metric. Every unit vector of or is within of a good net point and thus has norm at least . By homogeneity, on both orthogonal subspaces,For the first computation gives the absolute choice . The missing bounded-volume ratio restriction is essential; the literal unrestricted assertion cannot be proved.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 9 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and change coordinates so that its John ellipsoid is , the Euclidean unit ball. Then the standard symmetric-body inequalities areWe give the contact argument underlying the construction. The John contact decomposition provides unit contact vectors and positive numbers such thatThe last inequality follows because the supporting hyperplane of at must also support the contained Euclidean unit ball, hence has normal . For completeness, the decomposition follows from maximal volume as follows. If were not in the convex cone generated by at contact points, finite-dimensional separation would give a symmetric matrix with and at every contact. Subtract for small , retaining positive trace and obtaining strict negative values. For small , the support function is less than near all contact directions. On the compact complement of those neighbourhoods, has a positive minimum, so the perturbed ellipsoid remains inside there too. But its determinant is , contradicting maximum volume. The cone is closed: its generating contact matrices form a compact set of trace , so bounded traces bound their nonnegative coefficient sums. Finite-dimensional convexity then supplies finitely many contacts in the decomposition. Finally, for the identity gives , proving the second containment above.
Construct an orthonormal basis recursively. After have been chosen, let be their orthogonal complement. The orthogonal projection satisfiesAs , some contact satisfies . Choose . This works through and givesIn particular, for .
Keep the contact vectors used for this basis. They lie in . Therefore, if , then andFor a standard Gaussian random vector in these coordinates, put . These centered Gaussian random variables have , and .
Here is a proof of the Sudakov-Fernique inequality needed for this finite family. Let with independent standard Gaussian random variables , so that for . Take independently and useThe Hessian is . Along , Gaussian integration by parts givesIndeed, the one-dimensional identity follows by integrating the standard Gaussian density by parts, and applying it to a linear representation of these Gaussian vectors gives the covariance formula used here. Since , letting yields .
To estimate that last maximum, integrating the Gaussian density on gives for an absolute . With , independence showsIts negative part has expectation at most . Hence for all sufficiently large , and adjusting covers every ; for these finitely many cases the expectation is strictly positive. For , . For use one contact vector and ; for the requested right side is zero. Thusfor an absolute , independent of both dimension and the norm.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 9 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A real random variable is a sub-Gaussian random variable with exponent when its moment-generating function satisfiesDifferentiating at from both sides gives . Exponential integrability near zero justifies this differentiation. Conversely, if and , convexity givesThe last inequality follows by comparing power series using . The case is immediate. Thus a bounded random variable is sub-Gaussian exactly when it is centered; the bound is one possible exponent.
For , the Markov inequality applied to gives . Choose and repeat with . The union bound yieldsIf , the same exponential estimate with arbitrarily large shows almost surely, so all subsequent inequalities are trivial.
Integrating this tail probability estimate gives, for every real ,We need . For integer this follows inductively from and . To cover real as well, set . Differentiating the Gamma function integral gives for a Gamma distribution with shape and rate . The Jensen inequality bounds this by . Hence and . Taking the th root now provesHere is the Lp norm.
For the final assertion we prove the required Littlewood interpolation inequality, rather than assuming it. Apply Holder inequality with conjugate exponents and :Raising to the power gives . The preceding Lp norm estimate with says . Therefore
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 9 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Assume is nonempty, as is necessary for a probability measure to exist. Give its isometry group the uniform metricEvery distance-preserving self-map of a compact metric space is onto. Indeed, if , then , and for the iterates satisfy . This infinite separated set contradicts compactness. Consequently is a group under composition, with the identity and inverses again isometries.
The metric is invariant under both left and right multiplication: left invariance uses preservation of distances, and right invariance uses surjectivity. Inversion is an isometry for , and proves continuity of multiplication. Moreover, is compact. A sequence of isometries has a subsequence converging at every point of a countable dense subset of , by a diagonal argument. Their common Lipschitz constant and finite epsilon-nets of make this subsequence uniformly Cauchy. Its uniform limit preserves distances and is onto by the preceding argument. Thus is a compact metrizable topological group. A transitive group action means that for every some has .
We construct the invariant Borel probability measure directly. The Hall marriage theorem says that a finite bipartite graph with equal-sized vertex classes has a perfect matching precisely when every subset has at least neighbours in . Its following consequence is useful. If are -separated subsets of maximum cardinality in a compact metric space, join points whose distance is less than . If some had fewer than neighbours, replacing those neighbours in by would produce a larger -separated set. This contradicts maximal cardinality. Hence there is a bijection between and moving each point by less than .
Choose and maximum-cardinality -separated sets . Such sets exist: a finite covering by balls of radius less than bounds every separated set's cardinality. Fix and define the empirical probability measuresFor let , which tends to zero with by uniform continuity. For every , left invariance of makes another maximum-cardinality separated set. Match it to as above. ThenThe allowed compactness of probability measures on a compact metric space supplies a subsequence converging to in the weak-star topology. Passing to that limit for each fixed gives . The same subsequence works for every , since the displayed estimate held for all of them before taking the limit.
For uniqueness, put . For , right invariance of lets us match with . Transitivity therefore gives the uniform estimate for every . If is any invariant Borel probability measure, thenTwo invariant probability measures consequently differ on the integral of by at most , hence agree on every continuous function. Continuous functions determine Borel probability measures on a compact metric space, so the invariant probability measure exists and is unique.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 89 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose an ordered affine open cover of the separated scheme. For a quasi-coherent sheaf , the Čech cochain groups and differential areTerms corresponding to empty intersections are zero. Restriction commutes with restriction, so the terms in cancel in pairs. DefineHere an affine cover computes the Čech groups independently of the chosen affine cover. The reason is that finite intersections of affine opens in a separated scheme are affine: the intersection of two is the inverse image of the closed diagonal inside their affine product. Repeating gives the finite-intersection assertion. Quasi-coherent sheaves have no higher cohomology on these intersections. Apply an injective resolution of the sheaf and form the double complex of its Čech cochains. In one direction the higher cohomology vanishes on every affine intersection, leaving precisely the displayed Čech complex. In the other direction the augmented Čech complex of the flasque resolution terms is exact, leaving the global-section resolution computing sheaf cohomology. Thus the two cohomologies agree, and refinement maps between affine-cover complexes induce the same groups. No such affine-intersection claim is being made for arbitrary nonseparated schemes.
For an exact sequence of quasi-coherent sheaves, sections on an affine intersection give an exact sequence of modules, including surjectivity: this follows from the equivalence between quasi-coherent sheaves and modules on an affine scheme. Taking products yields a short exact sequence of Čech cochain complexes. To describe the connecting map, lift a degree- cocycle in to a cochain in . Its differential maps to zero in and therefore is a cocycle in . Changing the lift adds a coboundary there; changing the original representative does the same. This defines the connecting homomorphism. The same lift-and-differentiate argument shows that a class is in its kernel exactly when it lifts to a cocycle in the middle complex, and verifies exactness at the other terms. Thus the resulting sequence isThe sequence must be in quasi-coherent sheaves for this affine-sections argument; that is the intended category here.
For the punctured affine plane, use and . Their rings are and , and the intersection ring is . The two-open Čech complex isConsequentlyThe denominator contains precisely the span of Laurent monomials for which at least one exponent is nonnegative. Every Laurent polynomial has a unique monomial expansion, so the remaining monomials are linearly independent in the quotient and span it. Thereforea countably infinite-dimensional vector space. The brackets here denote cohomology classes. This calculates the Čech cohomology of the punctured affine plane, rather than merely observing that some nonzero cohomology exists.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 89 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A morphism of schemes is a flat morphism when each local ring is a flat module over : tensoring with it preserves exact sequences. An open immersion induces isomorphisms on the local rings at its points, so it is flat.
For a closed immersion, the printed equivalence is valid with the additional hypothesis of finite presentation, for example over a locally Noetherian target, and with nonempty source. Here is the proof with that hypothesis. On an affine chart the map is , with finitely generated. If , the flat cyclic module is free over the local ring , and its residue-field dimension is one. Therefore its quotient map from is an isomorphism and . Finite generation gives a neighbourhood of on which vanishes. The closed image is consequently open. A nonempty clopen image in a connected target is the whole target; then vanishes at every prime and is zero. The immersion is an isomorphism. The converse is immediate. This proves the flat closed immersion of finite presentation assertion.
Without finite presentation, connectedness alone does not suffice. Take and let . Let consist of functions vanishing on some neighbourhood of zero. The map has kernel : multiplying such a function by a continuous cutoff equal to one at zero kills it, whereas with forces to vanish near zero. This map is surjective, because the reciprocal of any denominator nonzero at zero can be extended continuously from a small neighbourhood of zero to the whole interval. ThusThe map is both a closed immersion and a flat localization. Its source is connected because its ring is local. Its target is connected because continuous idempotent functions on the connected interval can only be the constants zero and one. It is not an isomorphism: contains nonzero functions supported away from zero. This supplies a concrete counterexample to the unrestricted assertion. The kernel is a pure ideal; this is the general mechanism behind such examples, as explained in the Stacks Project's treatment of pure ideals.
For the finite-flat fibre assertion, first note the local algebra fact that a finitely generated flat module over a local ring is free. Choose generators whose residues form a basis of , using Nakayama's lemma. If a row gives a relation , the equational criterion for flatness supplies elements and a matrix such that and . Write each as a linear combination of the , with coefficient matrix . Then . Independence modulo makes congruent to the identity. This square matrix is invertible over the local ring, and implies . Thus the chosen generators are a basis. This also justifies the cyclic-module step above; see the finite-flat local lemma.
Now let for the finite flat morphism. On each affine chart this is the finite flat algebra defining its inverse image. Hence is free over , of some finite rank . Let be the generic point of the irreducible target. Localizing that free module at givesEvery point specializes from the same , so every equals the fixed rank at . This remains valid if the irreducible target is nonreduced: one compares free ranks over its nonzero generic local ring, not necessarily over a field. The fibre is affine, andConsequentlyThis is finite flat rank over an irreducible scheme. No unjustified replacement of finite flat by finite locally free on an arbitrary base is needed.
For an algebraic curve of finite type over a field, its normalization of an integral scheme is finite and birational. If flat, the preceding rank is one, since the generic fibre has the same function field. Locally its normalization algebra is therefore a free -module of rank one. The element generates: its image cannot vanish in the one-dimensional fibre algebra, and Nakayama's lemma applies. Thus is an isomorphism. Conversely the identity normalization is flat.
The parenthetical definition in the PDF does not explicitly impose finite type. One can prove the conclusion even in that broader setting without assuming a finite normalization. For any affine chart, let describe its normalization of an integral scheme. Integrality makes the map on spectra surjective; if is flat it is faithfully flat. Faithful flatness gives contraction of ideals, . For , with and , one has . Thus for some , so . Therefore on every chart. We have proved the flat normalization is an isomorphism result and, in particular,
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 89 2 i by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 89 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An integral scheme is nonempty, reduced and irreducible. For an affine scheme , reducedness is equivalent to : nilpotent elements vanish in every stalk, and conversely a nonzero element has nonzero localization somewhere. Irreducibility is equivalent to the nilradical being prime. Indeed, if lies in every prime, then ; irreducibility makes one of these closed subsets all of , so or lies in the nilradical. Conversely, if the nilradical is prime, its point is a generic point of the whole spectrum. Thus reducedness and irreducibility together say that zero is a prime ideal, with . Therefore
For a global idempotent , its germ in any local ring is either zero or one. To see this, , and at least one of is a unit. Multiplication by that unit forces the other to vanish. On each affine chart,These equalities also hold globally. Hence is a clopen set. Conversely, on a clopen subset and its complement, glue the sections one and zero. They define a global idempotent , and the two constructions are inverse. This proves the idempotent–clopen correspondence.
Assume each connected component is open. Every clopen subset is a union of connected components, since its intersection with a connected component is clopen in that component. Each individual component is also closed, so it defines a nonzero idempotent. A decomposition into two nonempty disjoint clopen subsets corresponds exactly to a sum of two nonzero orthogonal idempotents. A union containing at least two components admits such a decomposition by separating one component from the rest. A single component admits none. Consequently the precise conclusion is
The printed definition needs both nonzero and orthogonal. Literally forbidding every sum of two nonzero idempotents gives a false statement in characteristic two. For , the component idempotent decomposes as ; both summands are nonzero idempotents but are not orthogonal. In fact each of the three nonzero idempotents in this ring decomposes into the other two, although has two open connected components. Excluding zero is also necessary: zero corresponds to the empty subset, not to a component. With the standard primitive idempotent definition the preceding proof establishes the intended bijection in every characteristic.
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





