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 2013 iii Paper 1 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A linear map is a nilpotent endomorphism if for some positive integer , and a semisimple endomorphism if it is diagonalizable over . Decompose into its generalized eigenspaces , where . Define on to be , and set . Then is diagonalizable, is nilpotent, and both preserve these vector subspaces and commute. ThusFor uniqueness, suppose with semisimple, nilpotent and . Both commute with , so preserve each . On an eigenspace of of eigenvalue inside , the map is and has only the eigenvalue . Since the same subspace lies in , . Hence on , proving and . This is the additive Jordan–Chevalley decomposition.
We need a polynomial consequence of this decomposition. Hermite interpolation supplies a polynomial with , by prescribing for each eigenvalue. For any endomorphism , its semisimple part can likewise be expressed as a polynomial in with zero constant term: if zero is an eigenvalue, its interpolation condition already forces this; if not, add the independent condition .
On , the maps and commute. The first is diagonalizable, with eigenvalues on . The second is nilpotent, sincewhich vanishes for when . Uniqueness therefore proves adjoint compatibility of additive Jordan decomposition: .
Now assume . The condition implies that both and are invariant under , and every polynomial in with zero constant term maps into . Define to be multiplication by on . It commutes with . On , acts by . Polynomial interpolation on the finite set of differences gives with . The preceding paragraph then expresses as a polynomial in with zero constant term. Consequently , so .
The assumed trace orthogonality nilpotence lemma now follows directly. On , and , while the matrix trace of the nilpotent restriction of is zero. HenceEvery summand is nonnegative, so every eigenvalue of is zero. Its Jordan–Chevalley decomposition therefore has , and is nilpotent. Notice that neither nor was required to be a Lie subalgebra.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 1 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The endomorphisms of the finite-dimensional vector space over the complex numbers form the general linear Lie algebra with the usual addition and scalar multiplication and Lie bracket . This commutator is bilinear and antisymmetric, and expanding the six products verifies the Jacobi identity.
For a Lie subalgebra , being an abelian Lie algebra means . A nilpotent Lie algebra has , eventually zero; a solvable Lie algebra has , eventually zero. These are the lower central series of a Lie algebra and derived series of a Lie algebra, respectively. Nilpotence is a condition on the Lie bracket, and does not require every member to be a nilpotent endomorphism: a nonzero scalar multiple of the identity spans an abelian Lie algebra.
A flag of a vector space is an increasing chain of vector subspaces. The flag we construct is a complete flag, , where , and each is an invariant subspace for . We first prove the common-eigenvector assertion in the Lie theorem, by induction on ; the zero algebra is immediate. For nonzero solvable , its derived algebra is proper, so there is a codimension-one ideal of a Lie algebra containing . Write . By induction there are and a linear functional on such that for every .
Let be the cyclic subspace spanned by . The commutator derivation identity and show inductively thatThus and all its initial cyclic spans are -invariant. If , the first cyclic vectors form a basis, is also -invariant, and . For , the trace of a matrix commutator givesHence , since the field has characteristic zero. The nonzero common weight spaceis -invariant: . The restriction of to has an eigenvector, because is an algebraically closed field. This is a common eigenvector for . Its line is invariant, and repeating the argument on the quotient vector space gives the complete invariant flag. Equivalently, this proves simultaneous triangularization of a Lie algebra representation.
In a basis adapted to this complete flag, every member of is upper triangular, so every member of its derived algebra is strictly upper triangular. Products of strictly upper triangular matrices vanish, and each iterated Lie bracket of such matrices is a sum of these products. Consequently the derived algebra is a nilpotent Lie algebra. We may therefore take : it is an ideal, and the quotient Lie algebra is abelian. This also covers .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 83 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An Aronszajn tree is a set-theoretic tree of height , with countable levels and no uncountable chain in a partial order, equivalently no cofinal branch. The strict predecessors of a node are well-ordered, and its height is their order type. Such trees exist in ZFC, as the following rationally labelled Aronszajn tree construction shows.
We build countable nonempty levels for all . A node is a strictly increasing function , and the tree order is proper initial-segment extension. Every restriction must lie in . Give nonempty the rational labeland give the empty root label . We require labels to increase strictly along the tree. We also maintain the bounded rational extension property:Keeping room below every rational cap is what makes the limit step possible.
Start with . At a successor stage, for every and every rational with , includein . Its label is , strictly larger than its predecessor's. This level is countable. To extend an earlier node below a prescribed cap , first extend to below by the inductive property, if necessary, then choose a new rational label between that label and . Thus the extension property is preserved.
Now let be a nonzero limit. The whole tree below is countable. For each pair with , , and , construct one node at height extending below . There are only countably many such pairs.
Choose a rational with and an increasing sequenceSet . Given with , setThis is rational and satisfies . The successor rule supplies at height . If , take ; otherwise use the already established extension property below to extend to with label below .
The union has domain and extends . It is strictly increasing, and every shorter restriction is already in its prescribed level. All its values are below , while it contains the values . HenceEvery predecessor's label is below the label of some , and hence below . Thus strict increase of labels survives at the limit. Include one such for each pair in , discarding duplicates. This gives a countable level and preserves every bounded extension requirement. In particular applying it to the root makes the level nonempty. The choices here are permitted by the ambient axiom of choice; transfinite recursion through the set completes the construction.
Put . A node of domain has exactly the restrictions of domains as predecessors, so its height is . Therefore has height and countable levels. Since is strictly increasing on comparable nodes, an uncountable chain would inject into the countable set , which is impossible. Each label fiber is a tree antichain, so the tree is even a special Aronszajn tree:
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 83 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The maximum is . We construct that many aleph-one-like linear orders, whose proper initial segments are countable, and prove that they are nonisomorphic. As usual the rational-type requirement concerns nonempty proper initial segments; the empty segment occurs in every order.
Let be the club set of nonzero limit ordinals below . For , form the order sumHere means a new least point followed by a copy of the rational numbers; distinct blocks are disjoint, and all points of an earlier block precede every point of a later one. Every block is countable, dense and has no greatest point. Since , the full total order has neither a least nor a greatest point. It has size .
The sum is dense: within a block use density, and for points in different blocks choose a larger point in the earlier block. If is a proper initial segment and lies in block , then is contained in the union of the blocks through . There are only countably many such blocks, each countable. Thus is countable, rather than an uncountable interval in an aleph-one-dense order.
Every nonempty is dense and has no least point. If it has no greatest point either, the back-and-forth method gives : enumerate both orders, alternately include the least unused element from either enumeration in a finite partial order isomorphism, and choose its partner in the appropriate open interval. Density and absence of endpoints always supply a new partner. The union is a bijective order isomorphism. If has a greatest point, remove it, apply the same argument, and reattach it. Hence every nonempty proper initial segment is isomorphic to or .
The stationary information is recorded at the limit cuts. WriteThis is a continuous increasing kappa-filtration by countable initial segments. At a limit , the complement has a least point exactly when .
Suppose is an order isomorphism. Since each filtration stage is countable, its image under and the corresponding image under are bounded in block index: the supremum of their countable collection of countable ordinals remains below . Choose so thatThe setis a club set. To see unboundedness, start above any given ordinal and recursively choose larger than every for . The supremum of the countable sequence remains below and belongs to . Closure follows because below a limit of members of , each fixed lies below one of those members.
For , continuity of the filtrations gives both inclusions needed forThe isomorphism therefore preserves whether the complementary final segment has a least point. ConsequentlyThis club agreement of countable filtrations proves the invariant: if is stationary, the orders cannot be isomorphic.
We also construct enough pairwise different stationary encodings. For each , fix an injection , and setFor fixed , these sets partition the stationary tail . At least one is stationary: otherwise choose a club avoiding each one and intersect the countably many clubs to obtain a club avoiding the entire tail. The countable-intersection fact follows directly: above any starting point choose an increasing sequence, visiting each club infinitely often; its countable supremum belongs to every club by closure. For each let be the least such . One value occurs for uncountably many , since a countable union of countable sets is countable. For that fixed the cells are pairwise disjoint, by injectivity of . Enumerating those cells givesa family of pairwise disjoint stationary subsets of . This is the explicit Ulam matrix on omega-one proof of disjoint stationary subsets of omega-one.
For put . If , their symmetric difference contains an entire and is stationary. The stationary encoding in an aleph-one-like dense order therefore produces pairwise nonisomorphic orders .
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 83 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put , an infinite cardinal number. The original PDF has the double exponent ; the single-exponent expression in the TeX aid is a transcription error.
We explicitly construct an independent family of subsets with members on a set of size . LetFor each finite there are finitely many possibilities for . The collection of finite subsets of an infinite cardinal has size , so ; the points give the reverse bound. Thus .
For every defineTo verify independence, take distinct and bits . For each pair , choose a point of and let contain all these finitely many points. The traces are pairwise distinct. SetThen exactly for those with . Every finite Boolean pattern is therefore realized. The cases work by the same definition, allowing . In particular the sets are all distinct, so the finite-trace independent family construction gives exactly independent members.
For each function , prescribe when and when . Independence gives the finite intersection property. Their finite intersections generate a proper filter on a set: its members are the subsets of containing one of those intersections.
To extend this to an ultrafilter, order its proper filter extensions by inclusion. The union of a chain is again a proper filter, so Zorn's lemma supplies a maximal one, . If neither a subset nor its complement belonged to this filter, adjoining would still generate a proper filter: otherwise some existing member would be disjoint from and force its complement into the filter already. Maximality therefore gives the ultrafilter dichotomy. Using the ambient axiom of choice, choose such an extension for every .
Distinct functions differ at some . Their ultrafilters respectively contain and its complement, and cannot be equal. There are such functions. Transporting the ultrafilters along a bijection proves the lower bound. The upper bound is immediate because every ultrafilter is a subset of :Thus the number of ultrafilters on an infinite set is
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 83 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We work in the ambient theory ZFC for this question. Write , using the transitive closure convention that contains and all its membership descendants.
First construct a set containing exactly the intended objects. If is a countable set, apply well-founded induction to membership on this transitive set. If all members of have countable set-theoretic rank, thenIndeed is countable, and a countable union of countable sets is countable in ZFC. The induction therefore gives . The collectionis now a genuine set by the axiom schema of separation inside the cumulative hierarchy level , and it contains every hereditarily countable set. It is a transitive set, since implies .
If is a countable subset of , thenThe right side is countable, so . Thus has countable-subset closure. This proves existence of a set with the required closure before taking any intersection.
To make the least-set argument precise, form the nonempty setIt is a subset of and contains . Its intersection is also closed: a countable subset of is a countable subset of every and therefore belongs to each such . For any set with the prescribed closure, , whence . This is leastness among all such sets, not just among subsets of .
Finally, well-founded induction on shows for every such : when all members of are in , the countable set is a countable subset of , so . Hence , proving that the definition gives precisely
For the cardinal bound, code the entire countable membership ancestry. A code is a triple , where , is a well-founded relation and an extensional relation, and is distinguished. There are at most such codes: and are coded by subsets of countable sets, and a Cantor pairing function with finitely many tags codes the triple as a subset of .
The well-founded recursiondefines its collapse, as in the Mostowski collapse theorem. The range is countable and transitive; thus each decoded belongs to . Conversely, for , choose a bijection and the point with . Set exactly when . Transitivity of makes this relation extensional, and Axiom of foundation makes it well-founded. The recursion then gives , so this code decodes to .
We have a surjection from a set of at most continuum many codes onto . Using the permitted axiom of choice, well-order the codes and assign each its least code; this is an injection. In fact every subset of is hereditarily countable, giving the reverse bound as well:
The axioms hold except Power Set. axiom of extensionality and Axiom of foundation are inherited by this transitive structure. The empty set and belong to it, giving the empty-set axiom and the axiom of infinity. The axiom of pairing follows from countable-subset closure. For , is a countable subset of , giving the Axiom of union. Any subset of is countable and lies in , so the axiom schema of separation holds for all formulas interpreted in .
For the Axiom schema of replacement, let a formula interpreted in assign a unique to each . Relativize that formula to the set and use the ambient Axiom schema of replacement to collect its range. The range is countable and consists of members of , hence belongs to . The same argument, selecting one witness for each member of the countable domain, proves axiom schema of collection. An ambient choice function on a family has a countable graph of ordered pairs of hereditarily countable sets. Each such pair is in , and countable-subset closure puts the graph in , proving the internal axiom of choice.
However, all external subsets of are elements of . An internal power set of would therefore have to be the full external , by transitivity and absoluteness of subset membership. That is uncountable by Cantor's theorem, whereas every member of is countable. Thus the axioms satisfied by hereditarily countable sets areHere the asserted axiom list includes both Axiom schema of replacement and axiom schema of collection; no equivalence relying on Power Set is being silently invoked.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 82 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use a Boolean circuit of unbounded-fan-in AND and OR gates, with negations pushed to the input Boolean literals. Its circuit depth is the largest number of AND/OR gates on an input-to-output path, and its circuit size counts these gates. Constants and Boolean literals may be supplied as inputs. Equivalent standard size conventions only enlarge the absolute constants. One can merge adjacent gates of the same type; the depth-reduction argument below keeps the two possible normal forms available at each gate.
A random restriction with parameter independently leaves each variable live with probability and otherwise fixes it to zero or one with probability each. The Håstad switching lemma states that for a width- DNF or conjunctive normal form ,Width bounds Boolean literals in a term or clause, not the number of terms. A decision tree of depth at most has both a DNF and a conjunctive normal form of width at most and has real multilinear degree at most . Indeed every leaf condition is a product of at most factors or ; sum the accepting leaves. The switching lemma controls the canonical decision tree, hence implies this representation bound.
We detail the Boolean circuit simplification parameters. First use a -random restriction. For a bottom AND gate, let count its live Boolean literals on the event that no fixed Boolean literal kills it. For distinct Boolean literals,Thus the probability of retaining more than live Boolean literals without becoming constant is at most . The same calculation applies to bottom OR gates, with the opposite killing value. Repeated Boolean literals are removed and contradictory Boolean literals make a constant gate. A union bound makes all nonconstant bottom gates width at most , except with probability at most .
Now apply successive restrictions, each retaining probability of the remaining variables. At a two-layer gate, the current bottom forms are width- DNFs or conjunctive normal forms. The Håstad switching lemma bounds its probability of failing to reduce to decision-tree depth at most by . Convert the successful decision tree into the opposite normal form, whose terms or clauses have width at most , and merge its outer gate with the adjacent gate of the same type. This removes one layer. Repeat upwards until the output has a depth- decision tree.
The bookkeeping matters: although a decision tree may give clauses, each subsequent switching event is charged to the corresponding original Boolean circuit gate, not to each newly created clause. The lemma permits any number of terms. Each original gate is charged once, so the sum of the failure probabilities is at most , without an extra exponential size factor. Conditioning on successful preceding stages is harmless because each next restriction is fresh and the width bound holds for every preceding success. For a general Boolean circuit the conjunctive normal form or DNF representation at a shared gate can be chosen separately for each outgoing use; no extra gates need to be counted as switching targets.
The composed restriction has live-variable probabilityFixed values are still unbiased and coordinates independent. We have proved the useful intermediate estimateFor , the initial bottom-gate argument alone gives this conclusion. This is a depth-reduction estimate, not the desired Fourier-tail theorem used as a black box.
Next derive exactly how restrictions affect the Fourier-Walsh transform. Let be the random live set and the fixed assignment outside . With , the restricted coefficient at isOrthogonality of the fixed-coordinate characters eliminates cross terms after averaging over . Thereforeand then averaging over gives the expected Fourier weight after a random restriction identityThe original high-degree tail is not preserved: each original coefficient is weighted by a binomial distribution survival probability. On successful restrictions the left-hand tail vanishes; on failures it is at most one by Parseval's identity and . Hence its expectation is at most .
Put . If , choose and the preceding value of . For every , the binomial distribution mean satisfiesIts variance is at most . The Chebyshev inequality givesThus the exact expectation identity bounds at least half the original tail above , andWhen the same bound follows from the trivial total-weight bound . We obtain explicit absolute constants,This supplies the requested overview of the Linial-Mansour-Nisan theorem with the actual switching scale, gate-count bookkeeping and restriction-to-Fourier calculation. The argument uses the unbounded-fan-in AND/OR Boolean circuit basis; allowing arbitrary gates would make the theorem false, since one parity gate could have all its nonconstant Fourier weight at level . The original theorem is Linial, Mansour and Nisan's circuit Fourier bound.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 82 5 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We first construct a genuinely compact Besicovitch set; a sequence of unrelated small-area sets would not suffice. The compact Kakeya construction from small projections below gives the limiting compact set together with its segments.
Let consist of nonempty compact sets whose horizontal projection is exactly . With the Hausdorff metric this is a complete metric space. Indeed a Hausdorff-Cauchy sequence is eventually contained in one bounded closed rectangle and converges there to a nonempty compact set; horizontal projection is Lipschitz for Hausdorff distance, so its value is preserved in the limit.
For put and . The function is upper semicontinuous. To verify this, cover the compact set by finitely many open intervals with total length less than . Joint continuity of the compact images in the Hausdorff metric puts every sufficiently nearby image inside the same cover. This proves the required upper bound, uniformly over a compact parameter interval when a strict bound holds throughout it.
Fix and . The setis open. It is also dense, by the following explicit finite approximation. Given and tolerance , partition into equal subintervals and choose at each left endpoint. Above that subinterval put the segmentEach segment lies within of its chosen point in . Add a finite -net of points of to their union, ensuring the reverse Hausdorff inclusion. For large the resulting compact set belongs to and has Hausdorff distance less than from . The image of each segment under has length , and the added points contribute zero length. Henceso .
Take a finite grid of 's whose -neighborhoods cover . The finite intersection of the open dense sets is dense and implies . Thusis open and dense. The Baire category theorem gives a compact , and therefore for every .
DefineThis is the continuous image of the compact set , hence compact. Its section at horizontal coordinate is , of measure zero. The Fubini theorem gives . For every slope , horizontal surjectivity supplies , and contains the segment , , of length . Four rotated copies, through angles , cover all unoriented directions. Their finite union is compact, has area zero, and contains a unit subsegment in every direction:The point-line dual construction is the mechanism in Körner's construction; the density calculation above supplies the needed proof, rather than assuming that small-area sets automatically admit a suitable nested limit.
For the multiplier discussion, define by . The Plancherel theorem gives boundedness on . We explain why a putative bound, , would contradict Kakeya packing; duality of Lp spaces then treats .
First, such a bound would force the vector-valued inequalityfor arbitrary directions , where is the half-plane Fourier projection onto the half-plane . To see the important curvature step, let project onto the radius- disk and modulate by . Its conjugated symbol is , tending almost everywhere to . Dilations give the same putative norm bound for every . Apply this common operator to , average over independent random signs, and use the Khintchine inequality. Letting gives the displayed estimate by convergence and Fatou lemma, first for finitely many smooth function functions and then by approximation. The disk has a boundary normal in every direction; a fixed polygon does not.
The geometric input for this overview is the standard finite Perron tree packing used in Fefferman's original proof: for arbitrarily small one obtains long thin rectangles with and , while fixed longitudinal translates are pairwise disjoint. This is a quantitative finite arrangement, stronger than merely having a compact null set. The splitting/sliding procedure subdivides an angular triangle into narrow triangles and overlaps their bases; the extensions along their axes separate in reverse order. Its area estimate has the form relative to the original total triangle area: the merged central part shrinks by at each generation, and the accumulated caps contribute at most . Taking close to one and then large makes the ratio arbitrarily small. Inscribed rectangular portions retain a fixed proportion of the total area. The reflected extensions explain why the translates can be disjoint even though the original rectangles overlap strongly.
Here is the analytic contradiction, with the relevant powers explicit. Take . In coordinates parallel and perpendicular to the long axis , the directional Hilbert transform integrates only along that axis. If the longitudinal interval is , then outside itOn a fixed translate such as , this has magnitude at least . Since up to the harmless choice of half-plane sign, on . Their disjointness gives a lower bound for the vector-valued output norm.
Writing , Hölder's inequality for givesThe putative vector-valued inequality would implywhich is impossible as . The disk multiplier is self-adjoint, so a bound for would give one for its conjugate exponent below two. Thus the disk multiplier is bounded only at among . This explains both the random-sign step and the precise geometric amplification; it is not an assertion that frequency rectangles by themselves produce a logarithmic norm blow-up.
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





