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 139 2 vi b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The strict statement as printed needs the qualification if . Part (a) already shows in the present situation, and the next part proves ; an unconditional would contradict that conclusion.
To prove the needed conditional statement, suppose . A fixed part has . Indeed, a different has smaller multiplicity along some component of ; otherwise would be a nonzero effective linearly trivial divisor. Adding a member of the movable part avoiding that component contradicts fixedness.
The Hodge index theorem for algebraic surfaces, together with and , gives . If equality held, Riemann–Roch theorem for algebraic surfaces would give , and Serre duality would give . Hence , a contradiction. ThereforeThis is the fixed-part elimination on a K3 surface argument.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 139 2 vi a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First derive the intersection constraints. Since is nef and are effective, ; their sum is , so both vanish. Since the movable divisor is nef, , and forces both to vanish. In particularFor every component of , nefness and imply . The isotropic orthogonality consequence of the Hodge index theorem gives . If , Riemann–Roch theorem for algebraic surfaces and Serre duality give , since cannot be effective. Choose different from . It cannot contain : otherwise would be a nonzero effective numerically trivial divisor, contradicting its positive intersection with an ample divisor. Choose a member of avoiding . Replacing one copy of in by now produces a member of with smaller multiplicity along , contradicting the definition of the fixed part. Therefore
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 139 2 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The relevant invariant of a divisor is its Iitaka dimension, also called its Kodaira dimension. If two linearly independent global sections occur in , their ratio is a nonconstant rational function. The sections are linearly independent, because a nonconstant rational function over an algebraically closed field is transcendental over that field. Thus some complete linear system of a divisor has positive-dimensional image, contradicting .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 139 2 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Write . This is the fixed part of a linear system. The movable part of a linear system is , with ; multiplication by the defining section of identifies its sections with those of . In particular , and no curve occurs in every member of . The occurrence of in the definition request is understood as .
For any integral curve , choose a member not containing . Their intersection number is a sum of nonnegative local intersection multiplicities, so . Therefore the movable divisor is nef. If , the same assertion is immediate.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 5 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove . Consider one nonsplit short exact sequencewith simple. Lift the canonical surjection from the projective cover through , obtaining . Its image maps onto . The intersection is either zero or , since is simple. If it were zero, would identify with , splitting the extension. Hence , and surjectivity onto then implies .
Therefore both and occur as Jordan–Hölder factors of the indecomposable projective . Replacing every edge in an Ext chain by this observation proves (ii). Together with the preceding two implications, this provesThe repeated word “projective” in the printed version of (ii) has no mathematical effect.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 5 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove . The central block idempotents split every finite-dimensional module into its block components. A nonzero indecomposable representation, in particular an indecomposable projective module, has only one such component; otherwise these give a nontrivial direct-sum decomposition.
Every Jordan–Hölder factor of a module in a block belongs to that block, since its central idempotent acts as identity on submodules and quotients. Thus any two simple factors of the same projective indecomposable are in the same block. Applying this along the proposed chain yields .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 5 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove , the main step in Ext-connected components determine blocks. Suppose a block of a finite-dimensional algebra had more than one component of the graph of nonsplit extensions between its simple modules. Partition its simple types into one component and the union of the others. There are no cross-extensions, so part (a) decomposes the left regular -module as . Both summands are nonzero: every simple -module is a quotient of the regular module and therefore occurs among its composition factors.
The maximality in (a) makes these summands canonical. Every right multiplication is a left -module endomorphism, so it preserves them. Thus they are two-sided ideals, and their projection commutes with both left and right multiplication. Putting givesSince both summands are nonzero, . This contradicts the primitivity of the central block idempotent . There is therefore just one Ext component within each block, proving that simples in the same block satisfy .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 2 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a nonzero group representation , there is a -equivariant identificationwhere acts on endomorphisms by conjugation. The identity endomorphism is a nonzero fixed vector, so its span is a trivial submodule. It follows that the trivial simple module is a Jordan–Hölder factor of , and character additivity gives .
Here “constituent” means a composition factor; the trivial submodule need not be a direct summand. Also the assertion needs : the zero-dimensional module has the zero Brauer character, whose product with its conjugate has no constituent. This is an implicit nonzero-character qualification in the printed statement.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For a p-regular element , diagonalize its actions on and . If their eigenvalues are and , the tensor product of group representations has eigenvalues . The lift of roots of unity is multiplicative, soThus as Brauer characters.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 138 2 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let be a p-regular element, with eigenvalues on . On both acting on and acting on the dual representation , the eigenvalues are . Multiplicative lifts of roots of unity satisfy . HenceAll these identities concern the domain of a Brauer character, namely the p-regular elements. If necessary, extend the p-modular system to contain the relevant roots of unity and use one consistent choice of lifts.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 iv c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Assume satisfies the countable chain condition for forcing. We prove cardinal preservation by chain-condition forcing using the possible-values lemma for chain-condition forcing, and give the argument explicitly for ccc.
Let be an uncountable cardinal of . If it ceased to be a cardinal, some ordinal would admit a surjection onto in an extension. By the forcing theorem, there would be a condition and a forcing name such thatInside , for each choose a maximal antichain in a forcing order below deciding the ordinal value of . Conditions deciding that value are dense below . The chain condition makes the chosen antichain countable in , so the corresponding set of possible decided values is countable in .
A generic filter containing meets the downward closure of every such maximal antichain, so its value belongs to . Therefore its whole range lies in the ground-model setThe last inequality is infinite cardinal arithmetic and uses only that is uncountable and ; no regularity of is needed. Some ordinal in exists already in and cannot occur in the range, contradicting the forced surjectivity.
Finite cardinals cannot collapse, and cannot become finite: a finite domain has finite image, and transitive models agree on the natural numbers. Old non-cardinals cannot become cardinals because their old bijections persist. Thus
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 iv b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The countable chain condition for forcing says that every antichain in a forcing order is a countable set. Equivalently,In this question the assertion is evaluated inside . Although every subset of the countable set is externally countable, that observation does not establish the internal chain condition: need not contain an enumeration of an antichain.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 iv a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
A cardinal-preserving forcing over leaves every ground-model cardinal number a cardinal in every generic extension. In the present notation, for every -generic filter and every ordinal ,Set forcing preserves ordinals, and an old bijection witnessing that an ordinal is not a cardinal remains available. Thus this condition also means that the two models have exactly the same cardinals. Cardinality here is computed inside the respective models, not from their external sizes.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 ii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For the reverse implication, suppose and . By the existential clause of syntactic forcing, the setis dense below ; the existential quantifier ranges over forcing names of . Definability of the syntactic forcing relation and axiom schema of separation put in .
To apply genericity, augment it to the globally dense setA condition compatible with has an extension below , then one in , and an incompatible condition already lies in . Thus is a dense subset of a forcing order in . The generic filter meets it. Since , directedness prevents from containing a condition incompatible with , so some exists.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 3 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove the implication from existence of a witness in the extension to a condition forcing the existential statement. If , choose a witness and a forcing name with . The assumed instance of the truth lemma supplies withThe syntactic forcing relation is monotone under stronger conditions, so every also forces this same named instance. In particular, the conditions below having some forced witness are dense below a forcing condition . The existential clause of syntactic forcing therefore givesOnly the truth lemma assumed for individual named instances and the recursive existential clause were used.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 2 ii c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Induct on using the transitivity and inclusion already established. The zero stage is immediate. Suppose . Being an ordinal is expressible by a bounded formula in set theory, for example transitivity, transitivity of all members, and membership comparability. It is therefore absolute for the transitive set . The subset of its elements that are ordinals is internally definable, soBy inclusion, all smaller ordinals are present as well. Conversely, if an ordinal belongs to , then , since every member of a definable power set is a subset of the preceding domain. All members of are ordinals, so and . Hence the ordinal part of the successor level is exactly .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 2 ii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The argument in part (a) established for every ordinal . A transfinite induction on now proves that every earlier level is contained in . If , use the inductive inclusions into followed by . At a limit stage, every earlier level is one of the sets in the defining union. Equality of indices is trivial. ThusThe constructible hierarchy is a nondecreasing family of sets.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 2 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
We prove simultaneously that each is a transitive set and that . The key observation is that if is transitive and , then andThis is an internal definition with parameter , so . Hence . Every is a subset of ; if , then . Thus the definable power set is transitive too.
Start with the empty set. At successor stages the observation proves transitivity and inclusion. At a limit stage the union of the earlier transitive sets is transitive, and the same observation then proves its inclusion in its own definable power set. This completes the transfinite induction and gives
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 1 vi c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the cardinalhood formula from part (b), and let a finite flag choose between it and its negation:Here abbreviate their parameter-free definitions as Finite von Neumann ordinals, and both belong to . This is one first-order formula with two free variables.
For , part (b) proved and . The shared parameters therefore make true in and false in , disproving upward set-theoretic absoluteness. The shared parameters make it false in and true in , disproving downward set-theoretic absoluteness. Hence the same formula fails both directions, with explicit witnesses to each failure.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 121 1 vi b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let be the formula expressing cardinal number status:Ordinalhood and the assertion that a given set is a bijection between fixed sets are each expressible by a bounded formula in set theory. If regarded as a non-cardinal ordinal, a witnessing smaller ordinal and bijection would remain present and valid in . Ordinalhood itself is absolute between the transitive models. Thus implies : this is downward absoluteness of cardinalhood.
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





