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 2016 iii Paper 113 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The degree-one generation condition for Proj ensures that the opens for cover . Put and . Multiplication by is an -linear bijection for every integer , because is an invertible degree-one element. The convention therefore identifies on this chart with the free rank-one -module , generated by . Hence every twisting sheaf is invertible, including negative twists.
For the tensor product of sheaves, consider the natural mapIt is an isomorphism by degree-one localization of a graded module. Explicitly, a homogeneous tensor of total degree zero is represented on the left by . Multiplying a tensor factor by a homogeneous element of gives the same result after using the tensor relation, since that element is a degree-zero coefficient times a power of . This defines the inverse. Since localization commutes with tensor products, the target is . These natural chart maps agree on overlaps, soThe degree-one hypothesis matters: on general Proj constructions, twisting sheaves need not be line bundles. The local trivializations are also recorded in Stacks Project, Section 27.10.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 113 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Work first over an affine neighbourhood of , with an affine chart in its inverse image. The scheme-theoretic fibre on this chart has ringwhere is the residue field. The prime ideal correspondence for localization and the correspondence for a quotient identify its points with primes containing and disjoint from . These two conditions are exactly .
Under this bijection, each principal open corresponds to . These are bases for the two topologies: every element of the fibre ring is represented by , with the image of invertible. Thus the bijection is a homeomorphism. The identifications agree on overlapping charts and glue, provingThe scheme-theoretic fibre may nevertheless carry nilpotents, so this topological statement does not identify its structure sheaf with a naive restriction of .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 113 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A fibre product of schemes has projection morphisms to and with equal composites to , and for every scheme the induced map is a bijectionThis universal property determines uniquely up to unique isomorphism. On affine charts over , takeThe tensor product of commutative algebras has the required universal property for ring maps. Localization identifies these constructions on principal-open overlaps. Cover the base and its two inverse images by affine charts and glue the resulting affine products along those overlaps; their local universal properties give the global one.
For a counterexample to preservation of irreducibility, take and with their usual structure morphisms. All three are integral schemes, but the Chinese remainder theorem givesThe product scheme is the disjoint union of two points, so it is not irreducible.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 113 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
An isomorphism of schemes over induces a bijection on rational points. A real point of this projective plane curve would be represented by a nonzero real triple with . Each summand is nonnegative, so every coordinate would vanish. Thus , whereas . The two real schemes are not isomorphic. The obstruction is the real conic without real rational points; nonsingularity alone does not make a real conic a projective line over its ground field.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 113 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put . The punctured affine plane is covered by the principal open subschemes and . Since is an integral domain, restriction identifies its global sections withThis intersection is : if , then , and unique factorization forces to divide . Therefore the inclusion induces the identity on global regular functions.
If were an affine scheme, affine scheme reconstruction from global sections would make an isomorphism of schemes, because its global-section map is an isomorphism. But its image omits the closed point . The punctured affine plane is therefore not affine. This is a useful example of global regular functions failing to distinguish a nonaffine open subscheme from its affine ambient space.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 113 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The points of the spectrum of a commutative ring are its prime ideals. Its Zariski topology has closed sets and basis . The structure sheaf of a scheme can be defined as follows: a section over assigns an element of to every , and locally that assignment is represented by one fraction , with outside every prime in the neighbourhood. Restrictions forget values. Local representability and equality can be checked on an open cover, so these assignments satisfy the sheaf gluing axiom. On the sections identify with the localization of a ring .
Evaluation at induces the ring homomorphism . It is surjective because is represented by a section on . For injectivity, represent a germ by on a neighbourhood of . If its value in vanishes, there is with . The section is then zero after restricting to inside that neighbourhood. Its germ is zero. Thus
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write . Besides Talagrand's convex distance inequality, we use the precise squared edge bound for tours in the unit square stated above and the triangle inequality, which permits shortcutting a closed walk without increasing its length. We first prove the geometric comparison that connects these results.
For each fixed , choose a cyclic tour with edge lengths satisfying . At vertex , let be the sum of the lengths of its two incident edges in . The Cauchy-Schwarz inequality givesWe claim the weighted mismatch bound for Euclidean tours:To prove it, keep the vertices whose coordinates agree. In the cyclic ordering , the deleted vertices split into consecutive runs between kept vertices. For one run, let denote its two boundary edge lengths and the sum of its internal edge lengths. Starting at the left kept endpoint, visit the run and return along the same path, at cost ; starting at the right endpoint costs . Choose the cheaper detour. Its cost is at mostwhich is exactly the sum of over that run. Attach these detours to a shortest tour through , which already visits every kept point. The resulting closed walk visits all points of ; shortcut it using the triangle inequality. Summing the detour costs proves the claimed weighted mismatch bound for Euclidean tours. If there is just one kept vertex, the same argument uses that vertex as both endpoints of the unique run. If there are no kept vertices, proves the comparison directly. Repeated point locations cause no difficulty, since their connecting edges may have length zero.
Let be any median of and set . For , the weighted mismatch bound for Euclidean tours impliesThe weights have squared sum at most one, so . Since , Talagrand's convex distance inequality yieldsFor the lower tail, put . If there is nothing to prove. For every with , apply the same weighted mismatch bound for Euclidean tours with its weights and all . It gives . The set of such has probability at least , so Talagrand's convex distance inequality instead givesCombining both tails,The bound has a constant fluctuation scale, independent of . Only independence of the point coordinates and their support in the square are needed here; their uniform distribution was needed for the earlier lower bound on the expected value.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Interpret as the length of a shortest Euclidean travelling salesman tour, and take the points to be independent random variables with the uniform distribution on the square. We assume ; a closed tour on one point has length zero, so the printed lower bound would be false for . For two points the closed tour traverses the joining segment twice.
For the deterministic upper bound, use the following precise geometric result, the squared edge bound for tours in the unit square: every finite set of points in admits a cyclic ordering such thatHere is a proof of that geometric result. First consider a right triangle with hypotenuse endpoints , hypotenuse length , and right-angle vertex . The quadratic path bound in a right triangle supplies a path from to through any finite set inside the triangle whose sum of squared edge lengths is at most . For an empty set use the edge . For a single point , use : the triangle lies in the disk with diameter , so and the law of cosines gives .
For several points, draw the altitude from to the hypotenuse. It splits the triangle into two smaller right triangles with hypotenuses and . Their squared hypotenuse lengths sum to by the Pythagorean theorem. Repeated altitude subdivision eventually makes every cell small enough to contain at most one of the given distinct points: each child is similar to the original triangle and its diameter contracts by at most the fixed factor . Construct the base-case paths and combine them from the bottom of this finite subdivision tree. The two child paths concatenate at . If is an auxiliary point, delete it by joining its two neighbours directly. Both neighbours lie in the right-angle sector of the parent triangle at , so their angle at is at most . The law of cosines now shows that this shortcut does not increase the sum of squared edge lengths. The combined path still has endpoints and squared cost at most .
One can first put the given points in generic positions, avoiding subdivision boundaries, and then pass to a limit. There are only finitely many possible visiting orders, so a subsequence keeps the same order and its squared cost converges; this also handles coincident locations. No assumption about a minimum separation remains in the result.
Split the square along a diagonal . Apply the triangle result in each half, following one path from to and the other back to . Each half contributes at most . Remove either diagonal endpoint if it was auxiliary. At a square corner all neighbours lie in a sector of angle , so the same squared-cost shortcut applies. This gives the asserted cyclic ordering with total squared cost at most four. It does not assert that the tour minimizing ordinary length itself has this squared-edge property. The Cauchy-Schwarz inequality applied to the tour supplied by the theorem provesThus the upper bound is deterministic, independently of the sampling law.
For the lower bound, put , the nearest neighbour distance at . Both edges incident to in any closed tour have length at least . Summing over vertices and then dividing by two gives . Conditional on , the union bound and the uniform distribution giveBoundary clipping only makes the ball smaller. Apply the layer cake representation of the expected value, restricting the integral to :Linearity of the expected value now yieldsThe unspecified sampling phrase in the paper must therefore be understood as independent uniform sampling: an arbitrary distribution concentrated in a tiny region cannot satisfy this lower bound.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The useful form is Talagrand's convex distance inequality. Let be standard probability spaces, let carry the product measure , and let be a measurable event with . For , form the mismatch vectorsThe Talagrand convex distance is the distance from zero to their closed convex hull:Equivalently, by the Hahn-Banach separation theorem for two convex sets,Nonnegative weights suffice because every mismatch vector has nonnegative coordinates. Talagrand's convex distance inequality statesIn particular, Markov's inequality gives the product-space concentration inequalityThe same conclusion is interpreted with outer probabilities if a distance set is not measurable; the continuous geometric function used below has measurable level sets. A median of a real random variable means that and . Applying the displayed concentration inequality to suitable level sets will control deviations around a median.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 2 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Choose a maximal subset whose distinct points have Euclidean distance greater than one. The volumetric bound for Euclidean metric nets makes the construction finite: the open Euclidean balls of radius about the points of are disjoint and all lie in , soMaximality means that is a metric net of radius one on the unit sphere. Thus every has some with . Since both are unit vectors,Now intersect the corresponding closed half-spaces:The Cauchy-Schwarz inequality shows that . Conversely, write any nonzero as and choose as above. Then , so . Hence , which also proves boundedness. This convex polytope has at most facets, since redundant inequalities can only reduce their number. It meets the required inclusions with .
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let be the number of facets of the convex polytope . Its facet description can be writtenBecause , each supporting closed half-space has . For any , follow the ray to its last point in . Its radius is at most one because . At least one facet is active there, givingThus the unit sphere is covered by the spherical caps centred at with angular radius . Since , this radius lies in and the spherical cap area upper bound applies. Subadditivity of surface area givesUsing for ,The facet lower bound for ball approximations is exponential in the dimension.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the same normalized spherical cap area , constant and function as above. Put . The supplied ratio estimate givesThe middle inequality holds for every , since . Applying the upper projection bound for the spherical cap at yieldsso .
RecallAt the expression in parentheses is positive, because and . It increases up to and then decreases strictly to a negative value at . Hence it crosses zero exactly once on , from positive to negative. The minimum of is again an endpoint value; and . This proves the stronger range of the spherical cap area upper bound:
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Normalize the surface area of the spherical cap by writingTwo elementary descriptions of a spherical cap are useful. The spherical polar coordinates formula givesProjecting orthogonally onto the last coordinates givesIndeed, the upper hemisphere is the graph , whose surface area factor is on . This establishes the upper projection bound directly.
Set . The supplied ratio bound implies for . Consequently, at ,Also,On , the expression in parentheses is strictly decreasing; it starts positive and ends negative. Thus first increases and then decreases, so its minimum on this interval is at an endpoint. Since , both endpoint values are nonnegative. The spherical cap area upper bound follows:
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
No: the Lebesgue measure can decrease when separate components of the Minkowski sum merge. A one-dimensional example is enough to disprove the assertion in general. TakeThe Minkowski sum consists of four open intervals, with left endpoints and common length . At the four open intervals are disjoint, soAt the middle two open intervals coincide and the remaining three are disjoint, soFor a counterexample in any prescribed dimension , take Cartesian products of these open sets with in the remaining coordinates. Compare with , where is sufficiently small, and choose the interval width so small that . The four intervals remain disjoint at , givingChoosing makes the latter smaller. Here and . The Brunn–Minkowski inequality gives a lower bound at each value of ; it does not give the claimed monotonicity for arbitrary open sets.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
First take nonempty bounded open sets . Their Minkowski sum is open and hence a Lebesgue measurable set. Apply the Prékopa–Leindler inequality to their indicator functions and the indicator function of . This gives the multiplicative formTo obtain the usual additive Brunn–Minkowski inequality, put , , and . Both normalized open sets have Lebesgue measure one. For ,The multiplicative bound and the scaling rule for Lebesgue measure implyReplacing by and using continuity from below extends this form of the Brunn–Minkowski inequality to all nonempty open sets, including those of infinite Lebesgue measure. This open-set form is sufficient here and avoids any measurability qualification for sums of arbitrary measurable sets.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 112 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write for Lebesgue measure on . The Prékopa–Leindler inequality says that if and nonnegative measurable functions satisfythen their Lebesgue integrals satisfyIt suffices initially to take . Zero integrals give a trivial bound; infinite integrals can be handled by truncating and and applying the monotone convergence theorem. As usual, a zero factor makes the asserted lower bound zero.
Here is a one-dimensional proof using quantile functions. Put , , and let , , be the quantile functions of the probability density functions and . At almost every the quantile derivative identity givesFor completeness, these reciprocal derivative identities follow by differentiating the corresponding cumulative distribution functions at their Lebesgue points and then differentiating the inverse function relation. Sampling a quantile function at a uniform argument samples the density itself, so the exceptional set, including locations where the density vanishes or is infinite, has probability zero. Gaps in a density's support can give jumps in its quantile function; they do not invalidate the argument below.
The monotone function obeys the monotone substitution inequality:This form uses the ordinary derivative of a monotone function, rather than any jump or singular part: its weighted image measure is dominated by Lebesgue measure. One can see this first for intervals, where , and then extend to nonnegative measurable functions by simple function approximation. Thus no assumption of strictly positive smooth probability density functions is hidden in the proof.
Using the hypothesis and the weighted arithmetic-geometric mean inequality, we obtainIntegrating over proves the one-dimensional Prékopa–Leindler inequality.
For higher dimensions, use mathematical induction and Tonelli theorem. Write and setApply the one-dimensional Prékopa–Leindler inequality to the last-coordinate slices, with . It givesApply the induction hypothesis in and use Tonelli theorem once more. For finite total integrals, infinite slice integrals occur only on null sets and may be replaced by zero there; this only weakens the displayed premise. If the data are only Lebesgue measurable rather than Borel measurable, the exceptional nonmeasurable slices can be handled in the same way for , and by setting on its exceptional null set. The total integrals are unchanged, and the slice premise holds everywhere it is needed. The result therefore holds for general nonnegative measurable functions.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 111 4 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Within each fixed unitary irreducible representation, choose the selected right singular vectors to be orthonormal. Their corresponding left singular vectors are also orthonormal, even when a singular value is repeated: choose an orthonormal basis in each eigenspace of and put . Therefore, when ,This is (iv), with the unnormalized Hilbert-Schmidt inner product and the Kronecker delta. No orthogonality of differently shaped matrices is being asserted.
For the unheaded continuation, partition into blocks . ThenThe Schur averaging of rectangular matrices formula isfor any matrix . The average is an intertwiner; the Schur lemma makes it zero for inequivalent irreducible representations, and a scalar multiple of the identity for the same representative. The trace determines that scalar in the latter case.
Apply this with . The Hilbert-Schmidt inner product normalization just proved givesExpanding the squared Euclidean norm now yieldsThus the final identity follows from averaging, although itself need not be the identity. The whole construction is the spectral inverse theorem for the matrix-valued U2 quantity.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 111 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The selected singular value decomposition directly givesEach is a real nonnegative singular value. The scale factor in both matrices cancels in this equation and is chosen to give the precise Hilbert-Schmidt inner product normalization in (iv).
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 111 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The singular values discarded by the threshold in (i) satisfy , so their contribution to the fourth moment is at most . The selected singular values consequently satisfyBecause , this implies . On the other hand, , and henceThusThe lower bound also shows that the selected list is nonempty. Both endpoints are inclusive, as required.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 111 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use , the necessary parameter range for the bounds involving . The construction comes from the singular value decomposition of matrix Fourier blocks. For each inequivalent unitary irreducible representation of dimension , consider the Hilbert space with the Hilbert-Schmidt inner product and the operatorIts operator norm is at most one, since is a unitary matrix and . Thus all its singular values lie in .
Two identities control their weighted moments:Here the expectation in is uniform on the solutions of the constraint, and the trace on used to compute each moment is the ordinary operator trace. We justify the identities explicitly to fix their normalizations and the noncommutative order.
The adjoint operator is , soFor rectangular matrices, the operator has trace , as is seen on the matrix-unit basis. Squaring the previous operator therefore givesThe required representation theory consists of unitarization of a finite-group representation, the Schur orthogonality relations, and the regular representation decomposition. The last gives the character expansion of the identity deltaSumming the two operator traces with weights selects in the first, and in the second. Multiplication by converts each independent-variable expectation to its conditional expectation. This proves . In particular is real and nonnegative, despite the apparently complex summands in its original formula. Since , the nonvacuous hypothesis has .
Select every singular value satisfying . Index the selected pairs by , set , , and choose unit right singular vectors and unit left singular vectors with . DefineBoth are matrices, proving (i). Repeated group representations in this list are literally the same chosen representative, rather than different equivalent realizations.
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





