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 28 4 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Conditional on , a Poisson distribution has both conditional expectation and conditional variance equal to . For the uniform distribution on ,Thus and the one-year credibility factor is . With the observed count equal to one, the Bühlmann credibility estimate of the next year's conditional claim expected value isThe estimate gives relatively little weight to one year because the expected process variance is six times the variance of hypothetical means.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 28 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The exponential distribution with rate has moment-generating function for . Shifting it by multiplies the moment-generating function by . Therefore the shifted-exponential Poisson mixture has probability generating functionThe probability generating function converges and is analytic for , and in particular is finite for real .
Write and , so . The factor is the probability generating function of , while is that of a geometric distribution on , with . Choose and independently. The product rule for the probability generating function of a sum of independent counts then proves . The support-zero convention for is essential here.
The convolution of independent random variables gives the finite sumTaking the logarithmic derivative of the probability generating function givesCompare coefficients of , for . The left side is , and the right side is . Hence the shifted-exponential Poisson count recursion isThe constant and linear coefficients supply the starting valuesThese two values determine every subsequent probability by the recursion. The negative second term does not mean that the distribution has negative probabilities: the convolution formula exhibits every as a sum of nonnegative quantities.
At the independent Poisson distribution component is identically zero and the count has a geometric distribution. Both the finite sum and the recursion reduce to . Consequently the Panjer claim-count class parameters areAlthough the shifted model initially has positive , this zero-shift boundary case is well defined.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 28 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a Poisson distribution of parameter , its probability generating function is . Applying the law of total expectation to the Poisson mixture givesThusFor the absolute value of the integrand is bounded by one, so this identity always exists as a Laplace transform of the positive mixing variable. An extension to requires the corresponding moment-generating function to be finite; the conditional computation itself does not guarantee positive exponential moments.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 1 c 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let for . These increments are jointly normal, because each is obtained by evaluating the isonormal Gaussian process on an interval indicator. Indicators of distinct intervals are orthogonal in , soBy uncorrelated jointly Gaussian variables are independent, the increments on all these disjoint intervals are independent. Reversing the sign of the first increment, as in the printed list, preserves this independence.
The three requested properties have now been obtained without an existence theorem for Brownian motion. One can also obtain continuous paths: the Gaussian fourth moment gives . The Kolmogorov continuity theorem therefore supplies a continuous modification on every finite time interval, which can be chosen consistently on the half-line. Modification preserves every finite-dimensional distribution and hence the independent Gaussian increments. This yields Brownian motion itself.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 1 c 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For , linearity of the isonormal Gaussian process givesThe squared norm of this indicator is , so part (a) yieldsAlso, the covariance formula gives , the Brownian covariance kernel. The Gaussian statement concerns the signed increment.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 1 c 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Apply the construction of part (a) to the real Hilbert space , and setChoose . The interval of length zero represents the zero vector of , so . All variables are defined on the single probability space already used for the isonormal Gaussian process.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 1 a 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For the construction above, independence of the normal random variables makes normal with mean zero and variance . Its characteristic function is . The convergence gives convergence, andSince by the Parseval identity for a Hilbertian basis, the limiting characteristic function identifiesThis includes , where the normal distribution is degenerate at zero.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 25 1 a 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Choose an orthonormal basis of the separable Hilbert space and independent standard normal random variables on a common probability space. In finite dimension the sums below are finite; in dimension zero take . In infinite dimension defineIndependence, centring and unit variance giveBy the Parseval identity for a Hilbertian basis, the coefficient sequence is square-summable. Completeness of therefore supplies a limit, and we defineEvery partial-sum map is linear, and passage to the limit preserves this identity. Thus for each fixed , as an identity, hence an almost sure equality. This constructs an isonormal Gaussian process.
The usual meaning is almost-sure linearity for each fixed choice of arguments. A version linear simultaneously for every argument can also be chosen: select a Hamel basis of , choose a measurable representative of on each basis vector, and extend each sample algebraically by finite sums. For every fixed , this extension equals the constructed variable almost surely, so all its required distributions are unchanged.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 23 5 d ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write the progression integers as . Their values lie in an interval of length at most . For every prime , primality forbids the unique residue ; primes dividing impose no restriction because .
Choose . The selected primes exceed , hence exceed these sieving primes. The uniform coprime-denominator estimate just proved yieldsThe assumption implies . ThereforeEndpoint and bounded small-parameter corrections are again absorbed. The proof supplies the more informative short-interval progression bound before using the given size hypothesis.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 23 5 d i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Take to be the primes in the interval and . Every such prime exceeds apart from harmless bounded small cases, so it avoids zero modulo each prime up to . The sifted-interval bound with and givesSince and , the implied constant is absolute. The choice of strict or inclusive endpoint in the prime-counting convention changes at most two terms, absorbed by the bound for .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 21 3 ii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Write and . The cubic is Eisenstein and adjoining adds at most a quadratic extension, so . SetUsing and , compute and . Thus satisfies the Eisenstein polynomial . This proves , degree six, with a uniformiser and the extension totally ramified. It is the splitting field of , so its Galois group is . This is the Eisenstein sextic presentation of the splitting field of X3 minus 3 over Q3.
If , use . Then . The coefficient reduces to in the residue field , so the difference has valuation one. These three automorphisms are the transpositions.
The uniformizer criterion for lower ramification groups consequently givesAs a consistency check, the different exponent is . The derivative of the monogenic Eisenstein polynomial gives the same value, . In particular, stopping the wild filtration at would give the wrong different.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 21 3 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put , with . The shifted cyclotomic polynomial is Eisenstein at : its constant term is , and modulo it is . Therefore is totally ramified of degree and is a uniformiser.
The Galois group is , with . For , let , . Then is a primitive th root. Its difference from one is a uniformiser in the corresponding smaller cyclotomic field, and the relative ramification index is . HenceThe uniformizer criterion for lower ramification groups now determines every group. Write , with . Then the lower ramification filtration of a prime-power cyclotomic extension isFor the middle range is empty and the extension is tame. The formula also includes ; then is already the whole group, so the first possible drop is later than in the odd-prime case. For , the entire extension is trivial.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 iii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A diamond sequence on a regular uncountable implies . For every , regard as a subset of . A correct guess above is exactly , so the sequence's at most guesses include every real.
Force with using finite conditions. The delta-system lemma and agreement on the finite root prove the countable chain condition. It preserves cardinals and the regularity of , while adding at least distinct reals. The reals on distinct coordinates differ on a dense set of conditions, so their number is indeed at least this ground cardinal. In the extension,This gives the requested relative consistency over a model with the indicated regular uncountable cardinal, with the usual forcing-theoretic consistency interpretation.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 iii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let force that is a diamond sequence. For each , construct in the familyThis family is countable in : choose a witnessing condition for each distinct value; different values require incompatible conditions, and the forcing is CCC It is not being asserted that every generic value of is a ground subset. Only values forced equal to a ground subset enter .
For any ground and ground club set , the CCC preserves and remains a club set. Since forces diamond, some strengthening forces for an ordinal , deciding the ordinal witness if necessary. Thus . The ground set of such meets every ground club set and is stationary in .
Consequently witnesses the countable-family diamond assertion in . By the fully proved countable-family diamond equivalence, with and its stationary index set, it follows thatThus CCC forcing cannot create diamond.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 ii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Suppose a ground cardinal became smaller in the extension. There would be a surjection for some ordinal . A finite domain cannot map onto an infinite ordinal, so use part (a) to cover by a ground function of small value sets. Its range is contained in .
If , the ground cardinality of is at most . If , regularity bounds a union of fewer than sets of size less than by a cardinal less than . In either case is a proper ground subset of , and the same missing ordinal remains missing in the extension, contradicting surjectivity.
Hence all ground cardinalities at least are preserved. Ground bijections also remain bijections, so old noncardinals cannot turn into cardinals. The assertion does not prevent collapse of smaller cardinals, and consequently does not by itself preserve the aleph index of .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Choose a name for and a condition forcing that it is a function . The ordinals belong to , by forcing preserves ordinals. For each , choose in a maximal forcing antichain in the cone above , every member deciding as an ordinal below . Conditions deciding an ordinal-valued name are dense, by the forcing theorem.
Let be the set of values decided by members of . The chain condition gives , and Choice and Replacement in assemble all these sets into a function with domain . Since , genericity ensures that meets each deciding forcing antichain above ; equivalently enlarge it to a global maximal forcing antichain by conditions incompatible with . Its chosen value is the actual . ThereforeThis is the possible-values lemma for chain-condition forcing. All size bounds in its construction are internal to the ground model.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 i c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A precise form of the generalized delta-system lemma is this. Let be infinite cardinals, with regular and uncountable, and suppose for every . Every family of distinct sets, each of cardinality less than , contains a subfamily of size and a set such thatThe members form a delta-system with root . A sufficient usual arithmetic hypothesis is for all infinite cardinals . The finite-set case needs only regular uncountable , since finite subsets of each form a family of size less than . This is the form used for the finite-support collapse below.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The canonical forcing name is defined recursively byIf a weakest condition is provided, one may instead pair each only with . The all-conditions version works for an arbitrary nonempty forcing without that extra convention. Induction on rank gives for every generic filter, since each element is activated by some condition of the nonempty . Thus all ground-model objects have canonical names.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 6 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The forcing theorem has two central clauses. Definability: for each first-order formula , the relation on conditions and ground-model names is first-order definable in . Truth lemma: for every -generic and every tuple of names in ,Forcing is monotone under strengthening and agrees with the generic-extension semantics. Together with the generic model construction, is a transitive model of ZFC containing with the same ordinals. The definability and truth clauses are the auxiliary parts used when proving individual extension axioms.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 19 5 iv b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Fix with . The limit points of form a club set in . For each such point , coherence givesAs increases through those limit points, these order types strictly increase. Hence the club set contains at most one member of a fixed fiber . Removing an initial segment past that member leaves a club set disjoint from . Therefore is not stationary. This proves each is non-reflecting, by the nonreflection of fixed order-type fibers.
For uncountable regular , part (a) gives type at cofinality , and the size clause gives type less than at smaller cofinalities. All nonzero limit ordinals below fall into one of these cases. ThusThe index set has cardinality , so this is a disjoint union of non-reflecting subsets. Empty fibers can be omitted; if nonempty pieces are required, a fiber of size can be split further, since nonreflection is inherited by subsets. Such a fiber exists because sets of size at most cannot cover points.
At , the nonreflection definition is vacuous for every subset of , since no smaller ordinal has uncountable cofinality. The partition conclusion is therefore still true by an arbitrary countable partition, although the particular fibers from the weak printed square assumptions need not cover all limit ordinals. Under the standard order-type-bounded square definition, the displayed fiber partition works in this case too.
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





