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 2018 iii Paper 115 1 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The tangent bundle is , with its smooth vector-bundle structure from coordinate charts. A vector field is a smooth section of this bundle. The Lie bracket of vector fields is their commutator as derivations:In coordinates, .
The four numbered conditions here are hypotheses of one argument, so the following sections assemble its proof. Let . Because all are tangent to the boundary, evaluating on a tangent vector there evaluates the volume form on vectors in the -dimensional boundary tangent space. Alternation gives . This uses the interior product of a differential form and will make the boundary restriction of the de Rham cohomology class vanish.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 113 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The sheaf of nonzero rational functions on an irreducible variety is a flasque sheaf. Indeed, its sections on any nonempty open subset are : irreducibility makes nonempty open subsets connected and makes any two of them meet, so locally constant rational-function values must agree. Restrictions between such opens are identities; restriction to the empty set is also surjective. The preliminary argument therefore givesApply the long exact sequence in sheaf cohomology to the short exact sequence of sheaves of multiplicative abelian groupsIts relevant part isPart (b) identifies the first map with the principal divisor map . Exactness therefore identifies its cokernel with . Combining this with part (a) givesThe connecting map sends a divisor to the class of the unit ratios of its local rational representatives; these are precisely the transition data of the associated line bundle, up to the usual choice of inverse transition convention.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 113 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put , the quotient in sheaves of abelian groups, where is the sheaf of nonzero rational functions on an irreducible variety and is the sheaf of units of the structure sheaf. At a closed point, the discrete valuation induces an isomorphismThe kernel consists precisely of the units of the discrete valuation ring, and surjectivity follows by taking powers of a uniformizer.
A global section of is locally represented by nonzero rational functions. Since has a finite affine cover and is Noetherian, it is quasi-compact, so finitely many such representatives suffice. Each has only finitely many zeros and poles; consequently the valuations of the section define a finite divisor on an algebraic curve. A section with zero valuation at every closed point is zero in every stalk and therefore zero. This gives an injective mapIt is surjective as well. For , take a rational uniformizer at each point of its finite support. On a sufficiently small neighborhood of , the function has the prescribed divisor there: remove the other points in its zero and pole set and the other support points of . On the complement of the support use the rational function . On overlaps these representatives have the same valuations at every point, so their ratios are units everywhere on the overlap, and their classes in agree. The sheaf gluing axiom now supplies a global section. ThusSince is irreducible, . Under this identification the map to is . Its image is exactly the group of principal divisor elements, and hence
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 113 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First consider the preliminary cohomological facts. The exam's term flabby means flasque sheaf: every restriction map is surjective. For open sets , lift a section of to using the given surjectivity when is flasque. Extend that lift to using the flasque sheaf , then project to . This proves that is a flasque sheaf.
One construction of a flasque resolution starts with the sheaf , with pointwise restriction. It is a sheaf of abelian groups with surjective restrictions, and sending a section to all its germs embeds in it. Repeating on the cokernels constructs an exact sequencewith each flasque. Define sheaf cohomology by the cohomology of the cochain complex of global sections of such a resolution; the groups are independent of the chosen flasque resolution. If is itself flasque, the quotient result just proved makes every successive cokernel flasque. Applying the assumed surjectivity of sections to each successive short exact sequence of sheaves proves exactness of the global-section complex in positive degrees. Thus for .
Now let be the function field of the smooth algebraic curve. Its divisor class group isHere is the discrete valuation of the discrete valuation ring , and consists of the principal divisor elements . These sums have finite support: on a finite affine cover, represent as a fraction of regular functions; each nonzero numerator or denominator has only finitely many zeros on a curve, since a proper closed subset of a Noetherian one-dimensional irreducible space is finite.
For a divisor on an algebraic curve , define the line bundle associated to a divisor byIn this expression the valuation condition applies to nonzero . If is a uniformizer, the stalk is . Shrinking around removes all other zeros and poles of and all other points in the support of , so this also gives an actual local generator. Thus is a locally free sheaf of rank one. Multiplication gives an isomorphismon every stalk. If , then , so the construction factors through a homomorphism .
It is injective: if is trivial, an isomorphism from supplies a nonzero global rational generator . At each closed point, generates , giving , hence .
It is surjective: take a line bundle and a nonzero rational section , obtained by choosing a frame on any nonempty trivializing open set. If is a local frame, write with . Since changes of frame are units, is independent of the frame near . A finite trivializing cover shows that these numbers have finite support. Set . The map gives , because at the condition is exactly regularity of . Replacing by changes by , so this construction is well defined on classes. This proves the divisor class group and Picard group of a smooth curve identification
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Work in the prime field and set . We will choose , use the other to enumerate , and ensure that the first values of are distinct. The zero-sum condition will then force the last value to be the missing field element.
Consider the polynomialIt has total degree of a polynomial . Its terms of highest total degree form the homogeneous polynomial given by the square of the Vandermonde determinant, . For coefficient extraction we need the coefficient of ; lower-degree terms of cannot contribute to it.
Apply the Dyson constant-term identity from part (i) in variables, with every exponent equal to one. Pairing its factors for givesThe constant term is . Thus the desired coefficient issince none of is zero in the prime field.
For completeness, the coefficient form of the Combinatorial Nullstellensatz, also called the Alon-Tarsi lemma, says that if and each finite set in a field has size , thenTo justify this formula, the univariate Lagrange interpolation polynomial coefficient functional kills powers below and takes the value one on . Apply the product of these functionals to each monomial of . Every monomial of total degree at most other than the target has some exponent below the corresponding , so it is killed. The target survives with coefficient one. In particular, a nonzero target coefficient ensures a point of the product set where is nonzero.
Use and for every . The degree bound holds with equality, so there is with . Its first factors ensure that the are distinct; its second factors ensure that , , are distinct. With , the enumerate the whole prime field.
Let be the unique field element missing from , and write . Since ,The same sum is , hence . Taking completes the enumeration. We have proved zero-sum sequences as differences of permutations of a prime field:No distinctness assumption on the was used. The argument also includes : then , the products defining are empty and equal to one. Keeping explicit avoids assuming that the sum of all field elements is zero, which would fail for .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let denote the constant term, retaining the dimension as a subscript when it changes. We use the Good recurrence for the Dyson constant term. For algebraically independent variables, Lagrange interpolation polynomial applied to the constant polynomial one givesAt , this becomes the rational identityWhen every , multiplying by the given Laurent polynomial cancels one factor in row of the product and givesThis is a polynomial identity after cancellation; no choice of an expansion of a rational function is involved.
The boundary case is essential. If , the factors in row are absent. The only factors involving are then for , and all their powers of are nonpositive. To obtain power zero in , one must select the constant term one from each of them. Taking the constant term in therefore deletes that variable and exponent:For , the empty product is one, so . The all-zero exponent vector also gives one.
Now put , where . This multinomial coefficient obeys the same deletion rule for a zero exponent. For positive exponents,Induction on , and within each dimension on , consequently determines uniquely and identifies it with . This proves the Dyson constant-term identity:
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We establish small-set edge isoperimetry in a square grid directly by counting row and column transitions. Regard the vertices of the grid graph as . Put , so . Start with the corner square and add the vertices . In this shape every occupied row and column is a proper initial interval. There are occupied rows and occupied columns, each contributing exactly one edge to the edge boundary in a graph in its direction. This gives .
For the reverse bound take an arbitrary -vertex set , and let be its numbers of occupied rows and columns. A row or column that is occupied but not full has at least one transition between and its complement, hence at least one corresponding boundary edge.
Suppose first that no row and no column is full. Then and . If , the arithmetic-geometric mean inequality would givecontrary to the stipulated size. Thus .
If there is a full row but no full column, all columns are occupied and proper, giving at least vertical boundary edges. The case of a full column but no full row is identical with the directions exchanged.
It remains to consider a set with both a full row and a full column. All rows and columns are now occupied. If rows and columns are full, then and . The remaining rows and columns each contribute a boundary edge, soSince , this exceeds , which is larger than . These cases exhaust all sets and proveAs usual, and are integers; the specified interval is nonempty only for .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove the edge-isoperimetric theorem for binary initial segments by counting edges of the induced subgraph. Identify each vertex of the hypercube graph with an integer via its binary digits; the binary order on the discrete cube is increasing integer order. Let be its Hamming weight, and setA vertex in the initial segment has exactly neighbours of smaller label, obtained by changing a one to zero. Each induced edge is counted once, so an initial segment of size has induced edges.
The arithmetic ingredient is the binary digit-sum inequalityHere is a proof, including the parity cases needed for arbitrary sizes. Pair the numbers to obtainWrite and induct on , assuming . If , the claim is immediate. Otherwise the recurrences express as follows:Every pair on the right has smaller total size. The induction hypothesis bounds the right sides below by zero: the required lower bounds for the two terms are respectively , , and in the last three rows. This establishes the binary digit-sum inequality.
Now induct on to show that every -vertex subset of has at most induced edges. The zero-dimensional case is immediate. Split a set into its two coordinate sections , of sizes . By induction the edges within the sections number at most . The edges between the sections form a matching in a graph, so at most are present. HenceFinally, is a regular graph of degree , so its edge boundary in a graph satisfies . For the binary initial segment , equality holds. Therefore
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For , the lower bound is four pairs. On useThe first pair separates points in different halves, and the next two separate points within each half. The four pairs are distinct and have total incidence . They are therefore a valid separating family of disjoint set pairs attaining the bound.
For , label points by triples . The following six pairs attain the bound of six. Coordinates not mentioned in a row are unrestricted:If two triples first differ in , row 1 separates them. If they agree in and differ in , row 2 or 3 does. If they agree in both and differ in , row 4, 5, or 6 does. The total incidence is , and each point belongs to exactly three pairs. ThusThe empty fourth pair matters for . The original PDF requires disjoint subsets but does not require either side to be nonempty, so the construction is permitted. Under the additional convention that both sides of every pair must be nonempty, the answer would be no: four pairs of total incidence at most eight would each have two singleton sides and could separate at most four of the six unordered pairs of points. The construction already has both sides nonempty.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put and assign distinct complete binary sequences in to the points. For each coordinate , let be the points with bit zero and those with bit one. Distinct sequences disagree in some coordinate, so these pairs form a separating family of disjoint set pairs.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Encode each point by a partial binary sequence of length : coordinate is fixed to zero if , fixed to one if , and unrestricted otherwise. Disjointness makes these prescriptions consistent. Let be the number of fixed coordinates, equivalently the number of pairs containing , and let be the set of complete sequences consistent with them. Then .
The separating family of disjoint set pairs ensures that and are disjoint whenever : one coordinate prescribes opposite bits. Counting the sequences in these disjoint subcubes gives the disjoint subcube packing inequalitySince is a convex function, Jensen inequality impliesTaking logarithms yields . Therefore, for ,The PDF omits the qualification . For , it follows from feasibility: separation requires positive total incidence, so the stated incidence bound cannot hold with . For , separation is vacuous, and makes the printed quotient undefined; the intended parameter range is .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First we need all equality cases, rather than just the examples from part (c). The threshold estimate in part (b), with , shows that any maximum-weight k-Sperner family has Lubell mass exactly .
For each , let be the largest number of members in a strict chain in a partially ordered set within ending at . Its values lie in . If then , so each height class is an antichain. Its Lubell mass is at most one by the LYM inequality, andConsequently every height class has Lubell mass one. By equality in the LYM inequality, each is a full rank level. Since the classes are disjoint, the maximizing family is a union of exactly distinct full levels.
Let again be the th largest , let ranks have , and let ranks have . Equality in the threshold estimate requires all higher-weight levels, no lower-weight levels, and any of the tied levels. Thus the number of maximizing weighted k-Sperner families isConversely, every such is realizable. Assign on chosen ranks, on further ranks, and on all remaining ranks, then set . These weights are positive and have exactly the stated tie pattern.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Choose distinct ranks whose values are the largest, resolving any tie arbitrarily, and take the union of their full levels. Along a strict chain in a partially ordered set, cardinality strictly increases, so this set family is a k-Sperner family. Its weight is the sum of the selected rank weights because a full level of rank has members. Thus the bound in the weighted theorem for k-Sperner families is always attained:
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
A k-Sperner family meets every maximal chain in a Boolean lattice in at most members. The random-chain calculation in part (a) therefore gives the generalized LYM inequality . Define the proportion of rank that is present byThen and . This reduces the weighted theorem for k-Sperner families to allocating at most units of mass among ranks, each of capacity one.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 109 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Choose a Uniformly random maximal chain in a Boolean lattice by taking a uniformly random permutation of and successively adjoining its elements. A fixed -element set occurs on this maximal chain in a Boolean lattice with probability . Because an antichain meets every such chain in a partially ordered set at most once, linearity of expectation gives the LYM inequality:Here is the Lubell mass.
For equality in the LYM inequality, the integer must equal one for every maximal chain in a Boolean lattice, since every chain has positive probability. Choose of rank . If , take and , and choose a permutation with its first elements equal to , its th element , and its next element . Interchanging those two adjacent elements changes precisely the rank- member of the corresponding maximal chain in a Boolean lattice, replacing by . All other members are unchanged and none belongs to the antichain. The new chain must still meet , so .
Successive exchanges connect all -element subsets: exchange an element outside a desired target for an element missing from it, decreasing the number of differences each time. Thus contains the whole rank- level. Every set of another rank is comparable with some set in that level, so the antichain contains nothing else. If or , its sole possible member is already the whole corresponding level. Conversely, every full level meets every maximal chain in a Boolean lattice exactly once. Hence
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 107 6 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
With the interior ordering correction in part (a), iteration of part (c) givesThe bounded monotone sequence has a pointwise limit . By compact embedding of Hölder spaces, a subsequence converges in for , necessarily to this same limit. All convergent subsequences have that limit, so compactness gives convergence of the full sequence in . Passing to the limit in gives the equation and boundary values. The uniform Hölder seminorm bounds on second derivatives pass to the limit, so , and the barriers remain ordered:This proves the intended monotone iteration for a semilinear elliptic equation. With only the boundary ordering printed in the PDF, the counterexample in part (a) shows the requested trapped solution need not exist.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 107 6 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a sequence trapped between the fixed barriers, let bound their absolute values and put . The mean value theorem givesThe global Schauder estimate, including the fixed boundary data , and implyApply the supplied Hölder interpolation inequality with . Its remaining supremum-norm term is bounded by , yieldingIf , the stronger bound without a previous-iterate term holds directly. The constant depends on the fixed domain, exponent, barriers, boundary data and , independently of .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 107 6 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the interior ordered subsolution and supersolution correction from part (a). Recursively solve the Poisson equation with boundary value , starting from . Part (a) gives . If , thenThe first difference has zero boundary values, the second nonnegative values. The weak maximum principle for elliptic operators applied to their negatives gives . Induction proves the bounded monotone sequenceWithout interior ordering, the counterexample in part (a) disproves the claim.
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





