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 37 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For a steady flow network, let each origin-destination class have fixed demand . Route flows satisfy . The link flow is , and a link has continuous travel delay . Its route delay is .
A Wardrop equilibrium describes nonatomic traffic: each traveler is too small to alter aggregate delays by changing route. For each class there is a minimum delay such thatThus all used routes of one class have equal minimum cost, and an unused route cannot offer a shorter trip. The condition concerns private travel time, rather than total network delay.
Equivalently, for every feasible route vector ,Indeed, each used route has class minimum cost, so reallocating demand cannot reduce the cost evaluated at the original flows; conversely a positive flow on a non-minimum route gives an improving transfer. This variational inequality form remains meaningful even when route costs are not separable link functions.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 37 1 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
With alternative routing, a rejected direct call can try a longer route. The attempt rates now depend on blocking itself, giving an additional feedback absent from fixed routing.
For an explicit example, take three nodes with a unit-resource link between each pair, all of capacity . For every unordered pair, direct calls arrive at rate and have mean holding time one. A call first tries its direct link; if that link is full, it tries the unique two-link route through the third node, and otherwise is lost. Under a symmetric Erlang fixed point approximation, all links have blocking . A given link sees its own direct load . It can also carry overflow from either of the other two pairs; each contributes reduced load , since the direct link must block and the other link of the alternative route must accept. HenceThis is an instance of multiple Erlang fixed points under alternative routing. Put . Evaluation using the positive Erlang B formula recurrence , givesThe sign statements can be certified with rational arithmetic at these rational arguments. The intermediate value theorem gives a distinct root in each of , and ; numerical roots are approximately , and .
Thus the alternative-routing fixed point is not unique. The mechanism is extra link occupancy from overflow: moderate blocking stimulates two-link calls and can reinforce congestion. This multiplicity belongs to the approximation. The exact finite stochastic model has a unique stationary law on its reachable communicating class; the extra approximate solutions do not create three exact invariant distributions.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 37 1 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The exact normalizing sum can be expensive on a large loss network. The Erlang fixed point approximation replaces joint resource acceptance by a product of marginal acceptances. Here consider unit requirements , positive integer capacities and finitely many fixed routes. Let be resource blocking and . A route- call contributes to the offered traffic at resource after surviving the other resources on its route. Thus the reduced-load approximation iswhere the Erlang B formula isThe estimated route acceptance is . This is an independence approximation, not an alternative exact factorization of the stationary law in part (i).
Uniqueness follows from a convex potential for the Erlang fixed point. For a single resource, the carried load of an Erlang loss resource is . It increases strictly from zero to as increases: differentiating the expected value of its upper-truncated Poisson distribution with respect to gives the strictly positive occupancy variance. Blocking also increases strictly, as is evident on dividing the Erlang denominator by its final term.
Use . Let be the unique offered load with , and set , with . This function is strictly increasing and tends to . DefineEach exponential term is a convex function, and each integral is a strictly convex function because its derivative is strictly increasing. Therefore is a strictly convex function. It is also a coercive function on the nonnegative orthant: an unbounded coordinate makes its integral grow asymptotically linearly with positive slope . A unique minimizer exists.
If resource carries some positive offered route, its inward derivative at is negative, so its minimizing coordinate is positive. At such a coordinate the first-order equation isDividing by gives precisely . A resource with no positive offered route uniquely has , hence . Thus the minimizer and the fixed point coincide, proving existence and uniqueness of the Erlang fixed point for fixed unit-resource routing. This does not by itself guarantee convergence of every simultaneous substitution algorithm; the uniqueness claim concerns the solution of the equations.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 37 1 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
A loss network models calls that need several resources simultaneously and are rejected, rather than queued, when insufficient capacity remains. Take finite resource and route sets. Let be the integer amount of resource required by a route- call, its capacity, andUnder fixed routing, each arriving call has a predetermined resource requirement. Take independent Poisson processes of rates and independent holding times with exponential distribution of rates . A feasible arrival changes to at rate ; a departure changes it to at rate . Put and assume each route uses a finite positive-capacity resource, so the state space is finite.
The product-form stationary distribution of a loss network isFor any feasible adjacent pair,These detailed balance equations prove stationarity and make the process a reversible Markov chain. Equivalently, Independent random variables with Poisson distributions of means are conditioned on satisfying the joint capacity constraints. The conditioning makes resource occupancies dependent even though the unconstrained counts are independent.
By Poisson arrivals see time averages, a route- arrival sees acceptance probability , interpreting the numerator as zero for a negative capacity. Hence its blocking probability is and the expected value of its number in service is . This connects a stationary occupancy law to observable rejection and carried traffic.
The insensitivity of loss networks extends this occupancy formula to independent general holding-time distributions with the same expected values, under the usual fixed resource requirements and admission rule. Counts alone then need not be a Markov chain; residual holding times belong in a Markov description. The invariant occupancy formula survives. This is useful because detailed call-duration distributions can be difficult to estimate, while their means are much easier to measure.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The linear independence of the first elements of each orthonormal system shows that and have the same finite dimension and are closed subspaces of a Hilbert space. Apply part (b) with and . Since , the positive directed subspace angle cosine givesLet be the oblique projection onto along . Define . Its residual is orthogonal to every with , so the required measurements agree. Conversely, if has the same measurements, then ; uniqueness of the direct sum decomposition gives . Thus this is finite-dimensional Hilbert sampling reconstruction.
There is also an explicit coefficient description. Use the inner product convention linear in its first entry and putThen . The orthonormal systems show and , so the smallest singular value of is . Hence , another direct proof of existence and uniqueness.
For , both summands of this direct sum are nonzero: the infinite orthonormal system contains . The permitted oblique projection norm formula therefore applies without its degenerate exception, givingThe operator norm immediately yields the stability estimate . For the approximation bounds, put . Because fixes , we haveso the operator norm estimate gives . For the lower bound, while . The Pythagorean identity givesThe unique measurement-matching reconstruction is stable and within the secant function factor of the best orthogonal projection approximation:If a zero-dimensional reconstruction is admitted, it is simply and its error equals the norm of ; that case is best stated directly instead of using the angle of a zero space.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use . Positivity of the directed subspace angle cosine givesso is injective. The two vector spaces have the same finite dimension, . By the rank-nullity theorem, is also surjective. There is no need to assume a second positive directed subspace angle cosine in this finite-dimensional case.
For any , find with . Then . If , then , and injectivity gives . HenceThe direct sum is again bounded: . If , then and , so closedness of gives and the conclusion directly; no angle of an empty unit sphere is needed. Equal finite dimensions are essential to the surjectivity argument, whereas mere injectivity between infinite-dimensional Hilbert spaces is insufficient.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Interpret the angle as the directed subspace angle defined by the infimum of projected unit vectors; it is different from the smallest angle between two subspaces. WriteConsider the bounded linear operator given by . Its adjoint operator, between these two Hilbert spaces, is : for and , the orthogonal projections give . The two positive directed subspace angle cosines yieldThe first bound makes injective and gives a closed range. Explicitly, if converges, then , so is a Cauchy sequence. The closed subspace of a Hilbert space is complete, and its limit maps to the proposed range limit. The second bound gives . A vector orthogonal to the range has , so it must be zero. The range is therefore dense as well as closed in , and is onto. This is the mechanism of invertibility from lower bounds on an operator and its adjoint.
For any , choose the unique with . Then , so . Moreover, if , then and hence . Every vector has a unique decomposition, andThe direct sum is a topological one as well: the component depends boundedly on , with operator norm at most .
For precision, the quoted equality of the norms of complementary oblique projections needs both summands nonzero. For example, with , and , the oblique projection is , so but . The secant function has value one here, so the second equality in the quoted formula fails. With nonzero complementary summands its intended version is valid. The proof above does not use that formula. The angle itself is undefined on a zero source space because it has no unit vectors; expressing the hypotheses as the two lower bounds handles zero spaces without ambiguity.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
For one-column Gram matrices, unit Euclidean norm of the columns gives . The restricted isometry constant formula therefore gives . For a two-column Gram matrix, put . The difference from the identity matrix has the formup to the convention for the complex inner product. Its characteristic polynomial is , so the eigenvalues are and its matrix 2-norm is . Maximizing over pairs gives , where is the mutual coherence.
Part (b), together with the minimality defining the restricted isometry constant, gives . Every summand defining cumulative coherence is at most the mutual coherence, so . Thus, for normalized columns and ,The upper range matters because the printed definition of cumulative coherence stops at . For , only is needed; the maximum over pairs defining mutual coherence is otherwise empty.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the natural empty-sum convention for cumulative coherence. This is needed for the printed case . For the conclusion is immediate. Otherwise let be its support of a vector, with . The Gram matrix has diagonal entries one because the columns have unit Euclidean norm. Each off-diagonal row sum is bounded byThe last inequality uses monotonicity of cumulative coherence: enlarging an index set only adds nonnegative summands. There are enough indices to enlarge it because .
The Gershgorin circle theorem places every eigenvalue of within distance of one. Since is a Hermitian matrix, its eigenvalues are real, and the finite-dimensional spectral theorem givesThis is the cumulative coherence bound for restricted isometry. The lower bound remains valid when , although it is then nonpositive. No assumption that the matrix is already a near isometry is required. The distortion is bounded by on every order- sparse vector.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Work in , the domain of the matrix ; the printed in the introduction is a dimension typo. For a fixed nonempty support of a vector , write for the coordinates of in . ThenThe Gram matrix is a Hermitian matrix, so its difference from the identity matrix is also a Hermitian matrix. By the finite-dimensional spectral theorem, its matrix 2-norm is the largest absolute eigenvalue, equivalentlyIndeed, an expansion in an orthonormal eigenbasis bounds every Rayleigh quotient by the largest absolute eigenvalue, and an appropriate eigenvector attains that bound. The restricted isometry constant must bound this quantity for every of size at most , and the maximum of these quantities suffices for all sparse vectors of order . There are finitely many sets, so the maximum exists. The empty set contributes zero. Therefore
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Use the stated characterization by the Lq null space property. Raising an Lq quasi-norm comparison to its positive exponent preserves its order, so the hypothesis at says that, for every nonzero and every ,We prove the corresponding inequality; this is monotonicity of uniform sparse recovery in the exponent.
Fix a nonzero null space vector and arrange its coordinate magnitudes as . Assume . The Lq null space property rules out a nonzero null space vector supported on at most coordinates, so and . Since , the factors are at most for and at least for with . Terms with contribute zero and require no negative power of zero. ThusThe largest coordinates maximize the -power sum on any set of size at most . Its complement therefore has the smallest complementary -power sum. The displayed strict inequality proves the Lq null space property at exponent for every allowed support of a vector. The stated recovery characterization now applies to the Lq quasi-norm at .
If , the measurement constraint already singles out , for every objective; if , only the zero sparse vector needs recovery. These cases do not need a positive threshold. Uniform recovery at implies uniform recovery at every :
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
First the null space property implies sparse injectivity. If a nonzero had at most nonzero coordinates, partition its support of a vector into disjoint with . Applying the null space property to each of these sets yieldswhich is impossible. Hence the null space contains no nonzero sparse vector of order .
The feasible vector has , where the L0 sparsity count counts its nonzero coordinates. Any different feasible with would give a nonzero null space vector with at most nonzero coordinates, contrary to sparse injectivity. Consequently every different feasible has strictly larger L0 sparsity count. The unique sparsest feasible vector is :This proof does not treat the L0 sparsity count as a genuine norm; no triangle inequality for it is needed.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 36 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Let be the support of a vector , with . Suppose the null space property holds. Every other feasible vector is , where . Splitting its L1 norm over and and using the triangle inequality givesThus the sparse vector is the unique minimizer in basis pursuit. Notice that the argument works for complex coordinates: it uses the absolute value inequality, rather than a real sign function.
Conversely, suppose basis pursuit uniquely recovers every sparse vector of order . Fix and any with . Take and . These vectors have the same measurements, because , and they are distinct since . The vector has at most nonzero coordinates, so uniqueness givesThis is the null space property for every such . Uniform unique recovery by basis pursuit is equivalent to the order- null space property.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 4 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Put and . The tree and orchard residual mean squares in ANOVA have expectations and . Equating these to the observed values gives the method-of-moments variance component estimatesIn particular and the estimated intraclass correlation coefficient is . These are point estimates from the current experiment, rather than guaranteed variance values for the next season.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Report the six treatment-combination means and their uncertainty, together with useful marginal treatment contrasts, standard errors and confidence intervals. Means are needed to interpret direction and practical importance, while the fitted interaction term determines whether one factor's effects should be reported separately at levels of the other. For the pairwise marginal comparisons in part (c), ordinary model-based 95% Student t confidence intervals use times the corresponding standard error; a simultaneous set of comparisons needs an appropriate adjustment.
Also describe orchard selection, actual randomization, treatment delivery, numbers of trees observed, missing data and response units. Check orchard-level residuals for unequal variance, outliers or systematic patterns using a residual-versus-fitted plot and an appropriate distributional diagnostic. Explain that twelve orchards provide independent treatment replication; 360 tree measurements provide subsampling precision. No numerical treatment means or numerical confidence intervals can be recovered from the supplied sums of squares in ANOVA alone.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
The orchard residual mean square in ANOVA is on the original tree-response scale: it equals 30 times the corresponding residual mean square in ANOVA for orchard means. Thus the estimated variance of one orchard's sample mean is .
Each pruning marginal sample mean averages four independent orchard means, giving variance . Two different pruning marginals use disjoint orchards, so the variance of their estimated treatment contrast isEach spray marginal sample mean uses six orchards. Similarly,The corresponding standard errors are and in the units of weight per tree. These compare per-tree marginal sample means, averaging equally over the other factor, even when an interaction term is fitted. Comparing orchard totals instead would multiply these variances by .
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 35 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-07
Under the usual normal linear model for independent orchard means with common error variance, the treatment ratios have null F-distributions with denominator six statistical degrees of freedom. Their upper-tail P-values are approximatelyUse the unrounded ratios when evaluating these P-values. Thus none of spray, pruning or their interaction term is significant at a 5% significance level. Spray gives modest evidence if a 10% significance level was chosen in advance, but this is not strong evidence.
Failure to reject does not establish absence of treatment effects. Only two orchards per combination and six residual statistical degrees of freedom leave considerable uncertainty and potentially low statistical power. The table alone cannot give the direction or magnitude of individual effects: that requires treatment means. These model-based F-tests also rely on appropriate orchard allocation and comparable residual variation; they should not be interpreted as unconditional conclusions from the table alone.
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





