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 2003 iii Paper 38 5 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The independence analysis is not justified without further assumptions. Three binary responses from the same subject generally remain correlated after conditioning on baseline covariates and treatment. The fitted independent-Bernoulli likelihood discards that correlation and gives incorrect model-based standard errors and tests if it is present. Positive within-subject correlation commonly makes those errors too small.
There is an important distinction between estimating the mean and estimating uncertainty. If the stated marginal logistic regression is correct and responses are fully observed, the independence score still has zero expectation. With independent subjects and regularity, its root can consistently estimate marginal coefficients despite within-subject dependence; a subject-level sandwich covariance matrix is then needed. True independence is a special case in which the original standard errors would be appropriate.
Dropout creates a separate issue. Restricting that score to observed responses need not preserve its zero expectation if observation depends on the response history or unseen depression outcomes. Therefore both point estimates and uncertainty may be wrong. Neither random treatment assignment nor baseline adjustment alone establishes an ignorable missingness mechanism. We need a model matched to the scientific estimand and explicit assumptions about missing data.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 38 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The first fit is a Bernoulli logistic-regression model for the probability of a positive response. Its fitted linear predictor isand its fitted probability is . There are eight coefficients. The null degrees of freedom identify , and the residual degrees of freedom are .
Each slope is a change in the log odds per unit of its covariate, holding the others fixed. Exponentiating gives conditional odds ratios; for example a ten-unit glucose increase multiplies fitted odds by , and a ten-year age increase by . These are changes in odds, not multiplicative changes in probability, and the observational associations are not automatically causal effects. The intercept corresponds to all numerical covariates being zero, generally an extrapolation beyond meaningful subjects.
The standard errors come from the inverse Fisher information matrix of the logistic regression. With binomial dispersion parameter fixed at one, the displayed t ratios are asymptotic normal Wald statistics. In the full fit, glucose and the pedigree measure have clear individual evidence of nonzero slopes, with two-sided and . The body-mass and age terms are borderline, with and ; pregnancy count is weaker, . Blood pressure and skinfold have little individual evidence after adjustment. These labels should not be converted into a claim that the weaker predictors have no effect, or used as automatic model-selection rules.
A deviance residual here isIts square is the observation's contribution to binomial deviance, so the squared residuals sum to the printed residual deviance. The five-number summaries describe the distribution of these signed residuals. The null deviance belongs to an intercept-only logistic regression; the full fitted deviance is . Four Fisher scoring iterations record convergence of the numerical likelihood fit.
The second model uses only glucose:Its two coefficients leave residual degrees of freedom. A ten-unit glucose increase multiplies its fitted odds by . This differs from the adjusted multiplier , because the models condition on different covariates; both adjustment and noncollapsibility of the odds ratio can change logistic coefficients. The glucose-only model has deviance , so its maximized log-likelihood is lower than the full model's.
For these fixed-dimensional nested models, analysis of deviance and Wilks theorem giveThus the additional six predictors collectively improve the glucose-only model, even though several individual Wald tests are not significant. These comparisons assume independent subjects, an appropriate logistic mean structure, full rank, and regular finite parameter estimates without separation.
It would be incorrect to infer that absolute fit is good merely because . Individual Bernoulli deviance need not have a chi-squared calibration: there is just one binary observation per saturated probability, and the saturated dimension increases with sample size. A simple counterexample is an intercept-only model with true probability , for which , not one. For absolute adequacy, inspect residual patterns and predicted-risk calibration, use meaningful grouped comparisons when appropriate, or calibrate a chosen fit statistic by parametric bootstrap. The regular nested-model tests above are not subject to that saturated-model dimensionality problem. Only the displayed summaries and a few example rows are supplied, so patient-level diagnostics or complete numerical refitting cannot be reconstructed from this page alone.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 38 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For independent Bernoulli random variables, the log-likelihood isEvery likelihood factor is at most one, so . In the statistical saturated model, choose independently for each observation. The probability of each realised response is then exactly one. With the continuous convention , the Bernoulli saturated log-likelihood is thereforeThe inclusion of probabilities zero and one is important: if the parameter space required , zero would be the supremum approached at the boundary, rather than an attained maximum.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 35 4 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
True: quantum entropy is subadditive. Write . Positivity ensures the support of lies in that of . Indeed, if , then ; all summands are nonnegative, so for every . Thus annihilates , and similarly the kernel from the other factor.
On the resulting support, . Using the defining property of the partial trace and nonnegativity of quantum relative entropy proved in part (i),HenceEquality holds exactly for the product state . This proves Subadditivity of Von Neumann entropy directly.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 35 4 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False. Take the Bell stateThe joint state is pure, so . Taking either partial trace kills the off-diagonal terms and gives , whose two eigenvalues are . Thus , contradicting the proposed inequality . Quantum entanglement allows a pure joint state to have mixed subsystem states.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 35 4 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The concavity inequality is true, but its printed equality condition is false. At equality always holds, even for distinct states; for example take and . The correct statement on isFor , entropy is therefore strictly concave.
We give the matrix inequality needed for the proof. Define the quantum relative entropy if the support of is contained in that of , and otherwise. Diagonalize the two states with eigenvalues , and put . Each row and column of sums to one. The elementary scalar inequalityfollows from , with equality exactly at ; use limits at zero. ConsequentlyEquality forces whenever . Hence every eigenvector of is also a -eigenvector with eigenvalue , so . Conversely identical states give zero relative entropy. This proves nonnegativity of quantum relative entropy and its equality condition, including states with zero eigenvalues under the support convention.
Now set . For its support contains both component supports. Direct expansion givesSince both coefficients are positive, equality holds exactly when both component states equal , equivalently . At either endpoint the mixture has only one component and equality is automatic. This proves the corrected strict concavity of Von Neumann entropy.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 34 2 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Consider a triangle of three equal links, each with capacity . Each vertex pair receives direct calls of offered load . A call tries its direct link first; on finding it full, it tries the two-link path through the third vertex. Take exponential distributions of mean one, so the arrival rates are also .
In a symmetric Erlang fixed point approximation, let be the blocking probability of each link. A given link sees its own direct load . Each of the other two call classes offers overflow only if its direct link blocks and the other link of its two-link path accepts. The reduced load into the given link therefore has two extra terms . The scalar consistency equation isWrite its continuous residual as . The following strict intervals certify alternating signs:These are exact rational certificates, not rounded floating-point evidence. For each rational argument, start with and iterate for ; all operations are rational. Direct integer comparisons with the displayed thresholds certify the intervals. This uses rational certificates for the Erlang loss recursion.
The intermediate value theorem now supplies at least one zero in each ofThus the alternative-routing approximation has at least three distinct symmetric solutions. The mechanism is positive overflow feedback at moderate blocking, followed by saturation at high blocking. This does not give several stationary distributions for the exact finite loss network: its reachable irreducible Markov chain still has a unique stationary distribution. Multiple approximate fixed points concern the self-consistency model.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 34 2 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For unit resource requirements, treat the resource-blocking events as approximately independent. Let be the approximate blocking probability at resource . Screening class- traffic by every resource other than produces the reduced-load approximationThe modeled resource is excluded from its own screening product. For general integer requirements, the standard generalized approximation is ; in the unit-requirement case this reduces to the displayed formula. The approximate route acceptance is . The independence used here is an approximation to the correlated exact stationary distribution, not an extra property of that law.
Here is a proof of fixed-routing existence and uniqueness. Suppose first that every retained capacity is a positive integer. Links of zero capacity permanently reject their routes and can be removed. If has the upper-truncated Poisson distribution with parameter , its mean isThe derivative follows by differentiating the normalized weights: . The probability at the upper endpoint similarly givesThus increases from zero to one, while increases from zero to . This is the monotonicity of the Erlang blocking probability.
Set . For defineHere the inverse is with respect to offered load, and the value at zero is zero. This function is the carried load evaluated at the inverse blocking coordinate, so it is continuous and strictly increasing, with limit as . Consider the convex potential for the Erlang fixed pointEach exponential of a linear function is convex. Each integral is strictly convex because its derivative is strictly increasing. Their sum is strictly convex on the nonnegative orthant. It is also coercive: for large , is bounded below by a positive constant, so the integral grows without bound; the other terms are nonnegative. Hence attains a unique minimum.
At a positive coordinate, the first-order condition isAt , the derivative equals minus the right-hand side and is nonpositive. A boundary minimum can therefore occur there only when that load is zero, in which case the derivative is zero and the same equation holds. Since , division by this positive acceptance probability makes the first-order condition precisely the reduced-load equations above. Conversely every fixed point is such a minimum. Thus fixed routing has exactly one Erlang fixed point, including zero blocking at unused resources. The proof does not rely on a potentially nonconvergent simultaneous substitution algorithm.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 34 2 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A loss network admits a call only when all the resources it requires have available capacity. Calls which fail admission disappear rather than waiting. Under fixed routing, class has a fixed nonzero integer resource-requirement vector , Poisson process rate , and independent exponential distributions with parameter . Let have columns and let be the resource-capacity vector. The feasible call counts areWrite for the offered load. On , the Markov transition rates are if the new state is feasible, and .
The product-form stationary distribution of a loss network isIndeed, whenever is feasible,These pairwise equalities give detailed balance, including the truncated boundary: there is no transition to an infeasible state in either direction. The finite reachable chain is irreducible under positive arrival and holding rates, so this is its unique stationary distribution. It can also be viewed as independent Poisson offered populations conditioned on all capacity constraints. Conditioning usually makes the actual resource occupancies dependent.
An arriving call of class sees this stationary distribution by Poisson arrivals see time averages. Its acceptance probability iswhere a partition function with a negative capacity is zero. This is the blocking partition ratio for a loss network. Thus its blocking probability is , admitted arrival rate is , and mean number present is , by balancing admitted births with departures. With a single unit-demand resource, the formula reduces to the Erlang loss formulaThe stationary count law is also insensitive to the shape of independent holding-time distributions in the standard fixed-routing model when their means are unchanged. With nonexponential holding times, counts alone need not be Markov; residual holding times are included in the state for this insensitivity assertion. State-dependent admission controls and alternative routing do not automatically preserve the same simple product form.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
At a positive state , the future is constant. At zero, the residual holding time is independent rate-one exponential and the next state is an independent uniform mark. Thus the conditional future given the natural filtration depends only on the present state: is a Markov jump process. For any bounded Borel , its transition semigroup isThe Lévy kernel of a Markov jump process, written in destination-state convention, isIn displacement convention it has the same expression , since its only nonzero jump rate is from zero. The Markov jump-process generator is .
We state the generator martingale theorem used here: for a nonexplosive Markov jump process and a bounded with bounded , the process is a true martingale. In this one-jump model it also follows directly from part (a), first for mark indicators and then by bounded-function approximation.
Take , and putHere . Therefore choose the previsible processIt is continuous adapted and thus predictable. To verify the exponential, write with the generator martingale . The semimartingale integration by parts formula, using the continuous finite-variation factor , givesThus is a local martingale. On each fixed horizon it is bounded by , so it is a true martingale with . This is the exponential martingale from a jump generator; for it reduces to the constant process one.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The PDF defines multiplication by an indicator: . PutThen almost surely, , and is a stopping time. It has exponential distribution of rate one and is independent of . The path stays at zero until , jumps to at , and remains there.
Let and . We verify the martingale property directly. On both increments and vanish. On , every observation up to is zero, so the past reveals only that survival event. Conditional on it, is rate-one exponential by memorylessness and remains independent of the mark . With ,whileSubtracting times the second identity from the first gives zero. The process is adapted and integrable, since its absolute value is bounded by on a finite horizon. ThereforeOn we have , so this is exactly the requested process. This first-principles argument uses the natural filtration, which does not disclose the future mark or lifetime. It describes a single marked exponential jump process.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The one-dimensional Lévy characterization of Brownian motion states: a continuous adapted process , with , is standard Brownian motion relative to its filtration if and only if it is a local martingale and for all almost surely.
For necessity, the centered independent Gaussian increments of Brownian motion give both the martingale property and the martingale . The uniqueness characterization of quadratic variation then gives .
For sufficiency fix . The Itô formula givesThe second-order term cancels the time derivative because . Thus is a complex local martingale. Its modulus is the deterministic quantity , bounded on every finite horizon, so its real and imaginary parts are true martingales by the bounded local martingale criterion. For ,Uniqueness of characteristic functions says that the increment has normal distribution independently of . Indeed multiplying the identity by any bounded -measurable variable gives the product characteristic-function identity expressing independence. Iterating over deterministic times gives independent increments. Together with continuity and , these are precisely the defining properties of standard Brownian motion. If the starting value is a fixed , the same argument identifies as standard Brownian motion.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Subtract , which does not affect either the integral or its quadratic variation. Let . Choose a localizing sequence for . By local boundedness of the previsible process , there are increasing stopping times and finite deterministic constants with on . PutContinuity and finiteness on compact intervals imply almost surely. The stopped process is a bounded square-integrable martingale, its bracket is bounded by , and its stopped integrand is bounded by . The indicator is predictable, so the stopped stochastic integral identity is valid.
Fix and abbreviateThe Itô isometry gives , so is a square-integrable martingale. For , apply the same isometry to the predictable integrand , stopped at . This yieldsAlso . Expanding therefore proves that is a true martingale. The process is continuous adapted increasing and starts at zero. By the characterization of continuous martingale quadratic variation as its increasing square compensator, and uniqueness of an increasing square compensator, we have .
Stochastic integration and quadratic variation commute with stopping; for the latter this follows either from squared-increment sums or from the same square-compensator characterization. Hence the desired identity holds up to every . Since these times increase to infinity, they exhaust every finite time interval almost surely, and the continuous identities patch to giveThis is the localized isometry proof of stochastic-integral quadratic variation. No unstopped second-moment or bracket-integrability assumption has been made.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Here and , so the formula in part (b) givesIf vanishes on , this integral is zero. Conversely suppose for all almost surely. Its integrand is continuous along each path; the fundamental theorem of calculus implies for all on that event. For any fixed , the normal distribution of has a strictly positive density at every real point. Since is continuous, a nonzero value at any spatial point would give a nonzero value on an open interval of positive Brownian probability, a contradiction. Thus for every and every positive . Continuity extends this to .
Consequently the exact condition isThese are space-time harmonic functions along Brownian motion, satisfying the backward heat equation. The second coordinate never takes negative values, so no equation is imposed for , beyond compatibility with the assumed global regularity. The normalized finite-variation term is unique by part (a), so it cannot be removed by choosing a different decomposition.
Past exam of the mathematics course of the University of Cambridge 2003 iii Paper 33 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The multidimensional Itô formula for continuous semimartingales states that a transformation has first-order stochastic and finite-variation integrals plus one-half its Hessian contracted with the quadratic covariations. A continuous finite-variation process has zero quadratic variation and zero quadratic covariation with a continuous local martingale. Thus in the present caseThe first integrand is continuous adapted, hence predictable, and locally bounded by stopping the two coordinate paths on exiting compact sets. The standard construction of the Itô integral then makes this integral a zero-starting continuous local martingale. The remaining integrals are pathwise Lebesgue-Stieltjes integrals. On each compact time interval their integrands are bounded along the continuous paths, so their total variations are bounded by a constant times , which is finite. Therefore the normalized terms areThe process is continuous adapted of finite variation and . When is integrable, is a local martingale in the definition of part (a). Uniqueness follows from part (a): the difference of two normalized decompositions is both a continuous local martingale and a continuous finite-variation process starting at zero, hence vanishes.
An initial-value qualification is necessary under that definition. The printed assumptions do not themselves guarantee . Take , with a standard normal random variable known at time zero, and . All path assumptions hold, but . Any decomposition with would force the nonintegrable value , contradicting the local-martingale definition. Without an integrability hypothesis, the always-valid continuous semimartingale decomposition is , with the zero-starting integral above. Alternatively one may use the convention that a local martingale permits an arbitrary finite initial value and localizes its centered increments. With deterministic initial data, as in part (c), there is no issue. This is initial-value integrability in normalized semimartingale decompositions.
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





