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 105 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let tend to in the Sobolev space , using density of smooth functions in a Sobolev space. Write . Applying the Morrey inequality on a cube to a unit cube centered at , and bounding its average by the Holder inequality, givesfor every smooth . Hence is a Cauchy sequence in the supremum norm and has a bounded continuous limit by uniform convergence. On every finite-measure cube, this limit is also the limit, so almost everywhere.
For , choose , so that . The second estimate from part (a), followed by passage to the limit, givesThus is a Hölder continuous function andIt is the unique continuous representative: two continuous functions agreeing almost everywhere agree everywhere.
For , take a smooth cutoff function equal to one near zero and setIts weak derivative has size near zero, whose th power is integrable because . Thus , but it is essentially unbounded in every neighborhood of zero and has no continuous representative. The value assigned at zero is irrelevant.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 105 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put and . The fundamental theorem of calculus along a line segment, followed by averaging, givesFor fixed , use the change of variables formula . Its Jacobian determinant is . The transformed domain lies in , because a cube is a convex set. Moreover, implies . Thus Tonelli theorem givesThe diagonal is a null set. The Holder inequality with now applies: implies , and integration in spherical coordinates bounds the kernel byThis proves the Morrey inequality on a cube, uniformly even when approaches its boundary:Apply this at both and the center and use the triangle inequality to obtain
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For every , level zero of the core tower of a partition is its core of a partition , of size . The character degree coprime to p from the core tower criterion says that if , this level must have size equal to the units digit of in base .
But , whereas . Hence every character in has degree divisible by , andEquivalently, the core-tower size coefficient at position zero needs at least one carry in normalization to the base- digits. Each carry contributes one to the P-adic valuation of a symmetric-group character degree from the core tower.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We use the core-quotient bijection for partitions: an ordered -tuple and a fixed -core determine a unique partition of an integer, withThe irreducible characters in both and therefore correspond to the same ordered tuples of total size . Replacing the empty core of a partition by while keeping the quotient of a partition fixed gives a bijection from to . In particular .
For such a pair, all levels of the core tower of a partition above level zero agree. At level zero, their sizes are and , respectively. Put . When , the base-p digit sum satisfiesThe P-adic valuation of a symmetric-group character degree from the core tower then givesThus the same bijection preserves degree coprimality to and restricts to a bijection between the indicated sets of irreducible characters of degree coprime to p. ConsequentlyFor , take to be the empty partition; the construction becomes the identity.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-11-05
We use the abacus divisible-hook correspondence in its multiset form: the hook lengths of that are divisible by , divided by , form exactly the disjoint union of the multisets of hook lengths of the components of its quotient of a partition for modulus .
Iterating this correspondence gives, for every ,as multisets. Each Young diagram has one hook for every cell, so the cardinality of the right-hand side is , the sum of the component sizes.
For any positive integer , its p-adic valuation is the number of positive for which . Summing this identity over hooks and interchanging the finite sums provesThusThe sums are finite because hook lengths are bounded by , and the total size at each level of the quotient tower of a partition decreases by at least a factor until it reaches zero.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The implication is false. ChooseThe hook lengths areThus does not divide this irreducible character degree, but no hook has length .
There is no contradiction with part (i): removing two horizontal rim hooks of length three gives the empty core of a partition, so and the core degree is one. Having total weight of a partition two does not force a single hook of length twice the modulus.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The implication is false. ChooseThe inequalities and the relation hold. At cell , the hook length is .
For the partition of an integer , the Hook-length formula giveswhich is divisible by . This also agrees with the degree of the standard representation of the symmetric group .
The obstruction is visible in the core of a partition: removing the horizontal rim hook of length nine leaves , which has no hook length nine and hence is the -core. Its degree is . The large hook ensures the required weight of a partition here, but the core degree is not coprime to .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 3 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The equivalence is true. Write for the total size at level of the core tower of a partition , and for the corresponding total size in its quotient tower of a partition. We use the size relation and the P-adic valuation of a symmetric-group character degree from the core tower:Here is the base-p digit sum. These imply the character degree coprime to p from the core tower criterion: if , then exactly when at every level. Indeed carrying units from one position to the next decreases the sum of coefficients by ; the valuation vanishes precisely when there are no carries.
For , we also use power-core truncation of a prime-core tower: for , its core tower agrees with that of below level and is empty at every level at least . Moreover , the weight of a partition for modulus . To see the truncation, removal of a rim hook of length preserves the first -core and, under the abacus divisible-hook correspondence, becomes removal of a -hook in one quotient component. Iterating preserves all the lower cores; after all such removals, quotient level is empty.
If , the criterion gives , for , and the lower are the base- digits of . It follows that , andConversely, suppose and . Then and its lower core-tower sizes are the digits of . Quotient level of has total size . Each component there has size less than , hence is already a -core and has empty -quotient. Thus and every higher level is empty. Combined with truncation, this gives exactly the digits of , so .
ThereforeIf , necessarily and ; the -core is empty, its weight is , and the Hook-length formula shows that every degree is coprime to . Thus the equivalence holds in that boundary case too, with the empty partition having degree one.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put . The Hook-interval decomposition at a Young-diagram cell is the disjoint unionHere is a proof of the identity using the hook criterion in a beta set. Keep only the cells weakly southeast of , translating that cell to ; this gives the partition of an integerLet and use its beta set of a partition . These numbers are precisely the hook lengths down the original column from , with . The hooks along the first row of are the differences for the gaps . The remaining positions in that interval are the beads , giving exactly the displayed disjoint decomposition. The first-row and first-column hook lengths of agree with those in the original Young-diagram hook.
Because , a leg cell satisfies exactly when . Thus divisibility by identifies the relevant cells of the Young-diagram hook with the multiples of in . There are exactly of those, provingThe count includes the corner cell itself.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The converse is false. Take , , and the partition of an integer . Its hook lengths, arranged in its Young diagram, areBoth and occur, but does not, even though . Henceis a counterexample with distinct .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the hook criterion in a beta set: for a finite beta set of a partition , each hook length is a difference with , and , and every such difference is a hook length.
A hook length therefore gives a bead and a gap . Along the progressionthe first position is a bead and the last is a gap. Some adjacent positions are consequently a bead followed by a gap. Their difference is , so is a hook length. Similarly the progression from to in steps of gives a hook length . Every position used is nonnegative because it lies between and .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Apply Young's rule, stated asHere the Kostka number counts Semistandard Young tableaux of shape with entries equal to and entries equal to . Their rows weakly increase and their columns strictly increase. A column can therefore have at most two cells, so only a partition of an integer can occur.
In such a semistandard Young tableau, all entries in the second row must be and all entries above them must be . The whole first row is then fixed by the content: its first entries are and its remaining entries are . This is possible exactly when and . Because , the second inequality follows from the first. There is exactly one filling for every , and none for any other shape.
Consequently each displayed Specht module has multiplicity one, proving the two-row Young permutation module decompositionFor , the zero second part is omitted. As a dimension check, the Hook-length formula gives , with ; the sum telescopes to , the dimension of the original permutation representation.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The Young permutation module is the symmetric-group subset permutation representation on the -element subsets of : the second row of a tabloid specifies the subset. For , restriction of a character to fixing splits these subsets into two orbits of a group action, according as they contain .
The corresponding permutation representations are on the -subsets and the -subsets of . Their Young permutation modules have two row sizes and , respectively. Sort each pair into decreasing order and omit any zero part; swapping the two row labels gives an isomorphic permutation representation. This sorting matters at .
We use Young's rule: over the complex numbers, the multiplicity of in is the Kostka number , and it can be nonzero only if dominates in the dominance order on partitions. Since each above has at most two parts and size , dominance givesThus has at most two nonzero parts. The character inner product measures this constituent multiplicity, soIf , the original and restricted modules are the trivial representations, giving the same conclusion. For , there is no partition of with three parts, so the assertion is vacuous.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 103 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Fix a Young tableau of shape , let be its column stabilizer, and putThese are the Column antisymmetrizer of a Young tableau and its polytabloid. The Specht module is generated by as a cyclic module, so the nonzero R-module homomorphism has . Because its extension commutes with the group algebra action,Expand in the tabloid basis of the Young permutation module . At least one tabloid therefore satisfies .
If a row of contains two entries from the same column of , their transposition fixes . Pairing the terms indexed by and in makes them cancel. This remains valid in characteristic two, since the paired coefficients sum to zero there as well. Thus each row of meets each column of in at most one entry.
The first rows of consequently contain at most entries from column of , where is the conjugate partition. HenceBy the dominance order on partitions, this provesThis is dominance from a nonzero column antisymmetrizer. The extension is what allows us to apply to an element of without dividing by the column stabilizer's order, which might vanish in the given field.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We first prove the useful lemma that dominant root-lattice highest weights have zero weight. Write for the root lattice, and let a dominant integral weight be the highest weight of a finite-dimensional irreducible representation.
First, is a nonnegative integral combination of simple roots. Indeed, write , separating its positive and negative coefficients in the root basis. The two parts have disjoint supports, and distinct simple roots have nonpositive inner product, so . If , thenOn the other hand, dominance gives for each simple root, hence . This contradiction proves .
Now suppose a nonzero weight has all . The identityshows that some satisfies and . We use the standard sl2 Lie algebra fact that its lowering operator is injective on any positive eigenspace in a finite-dimensional representation. This follows from the classification of finite-dimensional sl2 representations: in each irreducible , the only weight killed by the lowering operator is the lowest weight .
Consequently a nonzero vector of weight lowers to a nonzero vector of weight . Its simple-root coefficients remain nonnegative and their sum decreases by one. Starting at , repeated lowering must therefore reach the zero weight. Notice that intermediate weights need not remain dominant; positivity of the chosen coroot pairing is enough at each step.
For a minuscule representation, every weight belongs to , so the zero weight just obtained lies in this orbit. Every Weyl group element is invertible, and forces . This proves that minuscule weights in the root lattice are zero. Under the assumption , every possible highest weight lies in , henceHere is the one-dimensional trivial Lie algebra representation, by the classification of finite-dimensional irreducible highest-weight representations.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the coroot in the pairing. The original PDF retains this mark, which is lost in the local TeX transcription. Fix any positive root , and put . For a dominant integral weight, is a nonnegative integer; positive coroots are nonnegative integral combinations of simple coroots.
Let be a highest-weight vector, and restrict to the sl2 subalgebra associated with a root . It is killed by its raising operator and has eigenvalue . If , its lowering operator produces a nonzero vector: otherwise would vanish. Therefore is a weight.
Choose a Weyl group invariant positive-definite inner product on the real weight space. All weights of a minuscule representation have the same norm, since they belong to . ButIf , this is negative, a contradiction. Thus for every positive root,When , the lower weight is precisely the Weyl reflection , consistent with the orbit condition.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The formal character of a weight module is , where are formal basis symbols in the group algebra of the weight lattice, satisfying . For a finite-dimensional irreducible highest-weight representation, the highest weight has weight multiplicity one. Another standard result is that weight multiplicities are invariant under the Weyl group: .
A minuscule representation has all its weights in a single Weyl group orbit. Since the highest weight is present, that orbit is , and the invariance just stated shows every point of it is present with multiplicity one. Consequently the formal character of a minuscule representation isThe sum is over distinct weights, rather than over all elements of : summing over would count each weight times.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
In the defining representation of the symplectic Lie algebra , the weights are . Their highest weight, for the root basis of part (b), is thereforeThe flip on the tensor square commutes with the action of , giving with dimensions and .
If is a highest-weight vector of weight , then is a highest-weight vector of weight in the symmetric square. By Weyl complete reducibility theorem, this ensures an irreducible summand occurs. Its dimension is by part (b), exhausting the symmetric square.
Let denote the preserved symplectic form. The symplectic contraction of an exterior square is the nonzero equivariant mapwhere the target is a trivial Lie algebra representation. Thus its kernel has dimension . Choose a weight vector of weight in a symplectic basis, with . The vector belongs to this kernel and has weight . It is a highest-weight vector: none of , for , is a weight of , whose weights are and zero. Hence the kernel contains ; its dimension exhausts the kernel. Weyl complete reducibility theorem supplies a complementary invariant line .
The resulting tensor-square decomposition of the defining sp4 representation is
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the C2 root system realization in an orthonormal basis with simple roots and . This numbers the short root first, as required. The fundamental weights and half-sum of positive roots areso . For the four positive roots, the factors of the Weyl dimension formula areMultiplying yields the Weyl dimension formula for C2:As checks, has dimension , dimension , and dimension .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 102 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a dominant integral weight , let be the finite-dimensional irreducible highest-weight representation with highest weight . Set , the half-sum of positive roots. With the coroot of , the Weyl dimension formula isHere is the positive system of a root system specified by the chosen root basis. The fundamental weights are the basis dual to the simple coroots: . Thus with nonnegative integers . The denominators are positive; equivalently one can use in each factor, since the coroot normalization cancels.
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





