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 2014 iii Paper 30 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let . For any , the setis compact. If it is empty there is nothing to prove. Otherwise continuity and the unique minimum give a strictly positive separation gapTake any measurable attained minimizer of . Its defining inequality givesConsequentlyThis proves argmin consistency under uniform convergence in probability. No continuity of is needed once the minimizer exists; compactness and continuity concern the deterministic separation gap. The uniform convergence in probability assumption controls all candidate parameters, including the random minimizer.
For the estimating equation, fix and put , . The prescribed signs make . Pointwise convergence in probability at just these two points impliesand similarly . With probability tending to one, . The intermediate value theorem then gives a zero inside , and uniqueness identifies it with . HenceThis is consistency of a uniquely bracketed zero. It needs no monotonicity, no continuity of the limit , and no uniform convergence of the . The bracket interval must lie in the domain of : read literally, the printed sign condition for every positive puts every real point into , so this requirement is satisfied. More generally it is enough to have an interval about and sign brackets arbitrarily close to it.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 30 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The ordinary column Gram matrix is . Use the normalized empirical Gram matrixso that standard Gaussian entries give . This is the normalization needed for concentration around .
The restricted isometry property of order with constant means that the normalized map approximately preserves the Euclidean norm of all vectors with at most nonzero coordinates:Equivalently, every principal block with satisfies . The least such is its restricted isometry constant. In the unnormalized definition apply this property to itself.
For a standard normal variable , direct Gaussian integration gives for . Independence therefore yields the moment-generating function of a chi-squared distribution, centred here at its mean:The inequality follows from . For , the Chernoff bound with givesAt the trivial probability bound suffices. This proves the requested bound, with a stronger prefactor one.
For the lower tail, gives for . Taking yields . Combining both tails gives the useful chi-squared concentration inequalityFor set . A direct calculation showsThus the exponent is at least , provingThe same threshold bounds the two-sided tail.
Finally fix a deterministic and put . If , independence of the Gaussian rows gives independently. ThereforeThe two-sided bound just proved suppliesFor the quadratic form is deterministically zero; the strict inequality makes the formula valid in that case too. When , replacing the threshold by gives an absolute bound independent of . In particular every fixed such direction concentrates at rate for a fixed confidence level. The restricted isometry property requires a simultaneous statement over sparse directions; this fixed-direction calculation alone is not that stronger assertion.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 30 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Represent the subset model by a set of column indices and let contain those columns. Its ordinary least squares estimator sets the omitted coefficients to zero and hasFor , use . Full column rank of implies full column rank for each . The matrix is an orthogonal projection matrix of rank .
Put and . Projection orthogonality gives the bias-variance decomposition of mean squared errorwhile the expected residual sum of squares isThese equations distinguish the mean-vector prediction risk in this problem from the additional noise in predicting a new response vector.
First take . Let project onto the full column space of . Since the full model contains , the residual estimate of Gaussian noise varianceis unbiased: its numerator has expectation . Consequently an unbiased Gaussian projection risk estimate isIndeed its expectation is for every , even when the subset model omits true effects. Independence of the two terms is not needed for this expectation calculation. The full-model variance estimate is important: the subset residual variance generally includes omitted-variable bias.
For a finite candidate collection, choose a model minimizing , breaking ties in favour of a smaller model. The term is common to all models, so this amounts to minimizingthe Mallows Cp form. The fit improvement competes with an increasing dimension penalty. Unbiasedness holds for each fixed model; the estimate at the data-selected model need not remain unbiased, because selection favours downward fluctuations. The method is a heuristic model selection rule, rather than an assertion that it finds the true model with certainty.
The printed includes a genuine qualification. If , there are no full-model residual degrees of freedom. Except in the balanced case , no integrable data-only unbiased estimator can satisfy the requested identity for all means and unknown variances. Here is a proof of the unknown-variance risk estimation in a saturated Gaussian model obstruction. Since is invertible, ranges over all . Suppose had the required expectation at every and variance . For , let and let . Marginally . Applying the assumed identity conditionally giveswhereas applying it to the marginal distribution gives . Their difference is , which must vanish. Integrability under the marginal Gaussian justifies conditioning. If , the obstruction disappears and the residual sum of squares alone has expectation . ThusThe general construction therefore requires , or an independently available unbiased variance estimate.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 30 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For independent identically distributed observations , the likelihood function and log-likelihood areA maximum-likelihood estimator is a measurable choice , when a maximizer exists. It need not be unique. The one-observation score function is , and the Fisher information matrix isUnder the regularity assumptions, differentiation beneath the integral gives . Differentiating again gives the second information identity. Independent observations have total Fisher information .
Assume fixed parameter dimension, an interior true parameter , a positive-definite matrix , the standard differentiability and integrability conditions, and statistical consistency of . Then the asymptotic normality of a maximum likelihood estimator isHere is the information per observation. Thus the leading covariance matrix of the estimator itself is .
To prove this, statistical consistency places the estimator in an interior ball about with probability tending to one, where its score function vanishes. Write and use the integral first-order Taylor formula for a vector map:This integral matrix is needed in a vector problem; one does not have to assert a common scalar mean-value point for every score component. PutThe regular local uniform law of large numbers, continuity of the expected Hessian matrix, and statistical consistency give . The multivariate central limit theorem givesThe limiting information matrix is nonsingular, so . Solving the Taylor identity and applying the Slutsky theorem proves the displayed normal limit, since . Boundary parameters or singular information are outside this regular theorem.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 3 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
A unipotent algebraic group admits a faithful linear representation in which every group element is a unipotent matrix. For , invertibility is the nonvanishing condition . Therefore is a nonempty Zariski-open subset of the vector space .
Take a Krull-Schmidt decomposition , with pairwise nonisomorphic indecomposable modules. The Fitting lemma makes each a local endomorphism ring. Its residue division algebra is : over an algebraically closed field, every element of a finite-dimensional division algebra has an eigenvalue and hence must be scalar. The semisimple quotient of a module endomorphism algebra consequently gives, for the Jacobson radical ,is surjective with kernel . The nilpotence of makes finite and each unipotent. The kernel is closed and normal. Acting on the multiplicity spaces embeds the product of general linear groups back into and splits this quotient. This proves the Levi decomposition of a quiver automorphism groupSince is the unipotent radical, a nonzero is indecomposable exactly when : the product has a single factor of size one.
For the base change action on quiver representations, the orbit map is . Substituting , with , shows its differential isIts kernel is . The stabilizer is smooth because it is open in that vector space. Hence the differential has rank , and its image is the Zariski tangent space . The normal space to a quiver orbit is thereforeThe ambient quiver representation space is an irreducible affine space, and orbits are locally closed. An orbit is open exactly when its dimension equals that ambient dimension, equivalently when . This proves that rigid quiver representations have open orbits. Such an orbit is dense and unique, since two nonempty open subsets of an irreducible space intersect.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 3 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For a finite acyclic quiver, the arrow ideal of a path algebra is nilpotent, and . If is a simple module, its submodule is either zero or . The latter would imply for every , contradicting nilpotence. Thus , and a simple module over the product of fields is supported at one coordinate. Therefore the simples are exactly , with at , zero elsewhere, and zero arrows; the vertex is unique.
A finite-dimensional semisimple module is consequently , where . Its dimension vector of a quiver representation determines its isomorphism class.
For an arbitrary finite quiver, cycles allowed, the vertex projective module of a path algebra is . Its space at vertex has basis all paths from to , and an arrow acts by adjoining that arrow at the end of the path. Its endomorphism ring iswhere is spanned by the closed paths based at . The opposite multiplication appears because endomorphisms act by right multiplication.
The evaluation isomorphism for a vertex projective isFor , its inverse sends a path starting at to . This proves both injectivity and surjectivity, and is natural in . Vertex evaluation is exact, so is a projective module; alternatively it is a direct summand of the free module .
The closed-path corner of a path algebra is a domain: in a product of two nonzero linear combinations, choose their longest path lengths. Concatenation in that top degree has a unique cut at those lengths, so a product of two nonzero top coefficients cannot cancel. Hence its only idempotents are zero and one. The same is true of the opposite ring, proving is an indecomposable module, even when cycles make it infinite-dimensional.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 3 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write a finite quiver as , with vertex and arrow sets and source/target maps. A representation of a quiver assigns a vector space to each vertex and a linear map to each arrow. A quiver representation morphism is a family satisfying .
The path algebra has every directed path, including each length-zero path , as a basis. Multiplication is composition when endpoints match, and zero otherwise; in , the path is traversed first. The orthogonal idempotents satisfy .
The path-algebra module equivalence is explicit. From a representation, form , let project onto , and let each path act by the composite of its arrow maps. Conversely, an -module gives and . An -module homomorphism restricts to the required vertex maps, and a compatible family extends by direct sum. These constructions are mutually inverse up to their evident natural identifications.
is finite-dimensional exactly when is finite and has no oriented cycle. For a finite acyclic quiver, paths have length at most . An oriented cycle has arbitrarily many distinct powers, giving infinitely many basis paths. If arbitrary infinite quivers are allowed, finiteness of both vertices and arrows is also necessary; the unital module correspondence above uses finite .
Choose only the orientation . The interval representations of an equioriented three-vertex quiver have at vertices , zero elsewhere, and identity arrows within that interval. The complete list isHere is an elementary proof, without the Gabriel theorem. For , set . Choose complementing in , complementing in , and complementing in . Then , and is injective on . Lift bases of to a complement of in , and extend the bases of to . These bases split into precisely the six kinds of interval block. Every block has endomorphism ring , hence is indecomposable, and their different supports make them pairwise nonisomorphic. The same basis argument handles arbitrary vertex dimensions; each indecomposable block itself is finite-dimensional.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 29 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use and write up to its interior-point swallowing time for a Loewner chain . The Chordal Loewner equation givesThe branch of the complex logarithm with argument in is well-defined while . The Itô formula yields the crucial cancellationThe drift is cancelled by the quadratic variation term, because . Thus both and are continuous local martingales, withThis is the logarithmic martingale for SLE4.
We justify absence of a finite swallowing time rather than presuming that the logarithm survives forever. On a finite horizon , . Also is bounded pathwise before . Indeed, while its drift has absolute value at most ; on each excursion outside , integrate from its starting point and bound the Brownian oscillation on . For example,Therefore is bounded above pathwise on this interval.
Suppose . By the Dambis-Dubins-Schwarz theorem, is a Brownian motion run at its own quadratic variation. If that clock diverged as , Brownian oscillation would make unbounded above, contradicting the preceding bound. The one-sided bound criterion for a martingale clock therefore gives a finite clock limit and a finite real limit for . Hence is bounded away from zero near .
Now has a strictly positive limit at . The drift in is integrable there, so continuity of gives a finite limit for as well. The limiting point is in and away from the Loewner driver singularity, and the differential equation extends past , a contradiction. Thus almost surely. A point of the Loewner trace at a finite time belongs to that time's hull, soThis proves the fixed-interior-point avoidance of SLE4 without using simplicity as an input.
The angle remains in at all finite times. The bounded local martingale criterion upgrades its local martingale equation to a genuine martingale:In particular this is the SLE4 angle martingale, and it converges almost surely and in by bounded martingale convergence theorem.
It remains to identify the limiting angle using the assumed simple path tending to infinity. Orient that path from to infinity. Its left component is the one adjacent to the negative real half-axis. Under , the left boundary of the slit domain maps to and the right boundary to . The harmonic measure of the former as seen from isThis follows by conformal invariance of planar Brownian motion: in the upper half-plane, is the bounded harmonic function with values on the left half-axis and on the right.
To justify the limiting boundary classification, condition on a simple proper realization of the path and use an independent planar Brownian motion from . It exits the upper half-plane in finite time almost surely, so its path up to that time is compact. The curve tends to infinity, so its intersection with this compact set is contained in a finite initial curve segment. Once that segment has been drawn, the Brownian path exits the slit domain through its left boundary exactly when is in the final left component: a path from that component cannot reach the right boundary without crossing the curve, and the reverse assertion holds on the right. Endpoints have zero harmonic measure. Bounded convergence of these exit indicators provesTaking expectations in the bounded angle martingale gives the SLE4 left-passage probabilityFor the imaginary axis it is ; near the negative real axis it tends to , fixing the orientation of “left”.
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





