Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 34D b ii Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 34D b i Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 34D a Solution Created 2026-09-24 Updated 2026-10-14
A clockwise engine Carnot cycle has four reversible steps. At hot temperature , isothermal expansion absorbs and does positive work by the gas. Adiabatic expansion then cools it to , with zero heat and positive work by the gas. Isothermal compression at emits and requires work on the gas. Finally adiabatic compression returns it to , with zero heat and work on the gas.
For an ideal gas, the isotherms obey and the adiabats , the latter being steeper. In the plane, the isotherms are horizontal and the adiabats vertical, forming a clockwise rectangle. Heat occurs only on the horizontal legs, while work occurs on all four legs.Reversing the arrows gives a refrigerator, reversing the heat and work signs.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 2F c Solution Created 2026-09-24 Updated 2026-10-05
Let and defineThen everywhere, but is not in the image of a function. The map is discontinuous at , giving a bounded-displacement map which is not surjective.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 2F b Solution Created 2026-09-24 Updated 2026-10-05
For arbitrary , the continuous map satisfies . Applying the preceding Brouwer fixed-point theorem argument with this positive bound gives . Hence , and is surjective.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 2F a Solution Created 2026-09-24 Updated 2026-10-05
Let be the closed unit disc and setThe displacement bound gives , so is continuous. The Brouwer fixed-point theorem applies because is nonempty, compact and convex. At a fixed point , . Therefore .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 27J c Solution Created 2026-09-24 Updated 2026-10-05
Put . At the choice time,Buy a European call option of strike and maturity , together with a European put option of strike and maturity . If the call is selected, the short-maturity put expires worthless. If the put is selected, sell the call and combine its value with the short-maturity put's cash payment; put-call parity makes this exactly enough to buy the maturity- put. This self-financing replication provesIt requires tradability of the priced options at the choice time, but not completeness of every other market claim. The identity also covers and .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 27J b Solution Created 2026-09-24 Updated 2026-10-05
The difference of the terminal European call option and European put option payoffs is . Replicating that difference by one share and a borrowing position gives conditional put-call parityThus the call is more valuable exactly when the right side is positive. With a put selected at equality, the chooser option payoff isAt equality both choices have the same price, even though their eventual payoffs can differ. Put-call parity assumes no dividends or other intermediate stock cash flows, as in the stated asset-price model.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 27J a Solution Created 2026-09-24 Updated 2026-10-05
For a finite-state, finite-horizon discrete-time frictionless market with a strictly positive numéraire, the fundamental theorem of asset pricing states no arbitrage if and only if there exists an equivalent martingale measure under which all discounted asset prices are martingales. Equivalence means the same null events as the physical measure. In this setting market completeness is equivalent to uniqueness of the equivalent martingale measure, and a replicable payoff has price . Without finite-state hypotheses, stronger integrability and closure conditions are needed; this is the standard multi-period course version.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 26K d Solution Created 2026-09-24 Updated 2026-10-05
The almost-sure bound gives , so Slutsky theorem transfers both consistency and the asymptotic normal law to . The continuous mapping theorem and delta method then giveIf , the latter is the Dirac measure at zero, conventionally a degenerate normal distribution; a nondegenerate second-order limit would need a different normalization and extra smoothness.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 26K c Solution Created 2026-09-24 Updated 2026-10-05
A maximum-likelihood estimate is a measurable maximizer of over . Under identifiability, consistency conditions, an interior true parameter, sufficient differentiability and finite positive Fisher information, the standard limits areThe variance in the normal distribution is the reciprocal of the per-observation Fisher information, not of . Strong consistency needs additional hypotheses if it is to replace convergence in probability; the regular asymptotic result stated here does not require claiming it.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 26K b Solution Created 2026-09-24 Updated 2026-10-05
The per-observation Fisher information is . Sinceand the integral of is the second derivative of , the regularity assumptions giveFor independent observations the total Fisher information is , because centered individual score functions have zero cross terms.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 26K a Solution Created 2026-09-24 Updated 2026-10-05
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 25K b Solution Created 2026-09-24 Updated 2026-10-05
A renewal process has independent identically distributed, nonnegative, almost surely finite inter-arrival times , epochs , and count . Allowing zero inter-arrivals is harmless provided . The hypothesis ensures there is with .
The strong law of large numbers for the indicators gives , so is finite for finite . Conversely every fixed is finite, so eventually . On their countable common probability-one event, this proves .
For fixed , put . The hinted comparison process has epochs , hence . Equivalently,If , for this is bounded by , by summing the first binomial distribution. Thus for . If , deterministically. Therefore a strictly positive exponential moment exists for every fixed finite , with the same allowed for all such . Almost-sure finiteness of the inter-arrivals is implicit in a proper renewal process; allowing an infinite inter-arrival with positive probability would invalidate the divergence claim.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 25K a Solution Created 2026-09-24 Updated 2026-10-05
In a neutral Moran model, a population has labelled individuals; reproduction copies one individual's type to a uniformly chosen other individual, keeping population size fixed. One convenient time convention puts independent rate- Poisson arrows on each ordered pair of distinct individuals. Backwards in time, two sampled ancestral lineages merge whenever one copies the other, at total rate per unordered pair. In the convention where each individual reproduces at rate , this pair rate is if the parent cannot replace itself, and time must be rescaled accordingly.
Kingman's coalescent on labels is the continuous-time Markov chain on partitions of , initially all singleton blocks, in which each pair of distinct blocks merges at rate . With blocks, the waiting time is exponential of rate , and the merging pair is uniform. Kingman's infinite coalescent is the consistent partition process on whose restriction to each finite label set has this law; consistency and the extension theorem construct it. These time conventions are part of the definition.
Let be the number of blocks in the first labels. The expected time to reach at most blocks isMarkov inequality gives . As increases these counts increase to the total number of infinite-coalescent blocks, so the same bound holds for that number. Letting shows it is finite almost surely for each . Apply this simultaneously to positive rational times; monotonicity of the block count then covers every positive real time. Hence Kingman's infinite coalescent comes down from infinity almost surely.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 24J d Solution Created 2026-09-24 Updated 2026-10-05
The assertion is false. On , put . Then for every , so the family is bounded. For every , choose ; then . The tail criterion for uniform integrability fails.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 24J c Solution Created 2026-09-24 Updated 2026-10-05
boundedness means , with the essential-supremum norm for . For finite , let . On , , soThis proves uniform integrability. For an bounded family the tails are identically zero beyond the common essential bound.
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 24J b Solution Created 2026-09-24 Updated 2026-10-05
For conjugate exponents , , Hölder's inequality is . If either finite norm is zero, the corresponding variable is zero almost surely. Otherwise normalize , . Young inequality follows by minimizing the right side minus in , whose derivative is . Integration gives , proving the result. Infinite norms give the usual extended-value inequality whenever the right side is unambiguous. At the endpoints, follows from the almost-sure bound for , with the symmetric version for .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 24J a Solution Created 2026-09-24 Updated 2026-10-05
A family of integrable random variables is uniformly integrable whenEquivalently the integrals of their tails vanish uniformly. This includes uniform boundedness, since .
Past exam of the mathematics course of the University of Cambridge 2017 ii Paper 3 22I c Solution Created 2026-09-24 Updated 2026-10-05
Let . The proper transform isIndeed, in the blowup chart , write with . Homogeneity gives . Away from the exceptional divisor , the equation is , and its closure retains that equation, removing the exceptional factor . Every point with is approached algebraically along the line , so no component in this displayed set is extraneous.
For , the fibre is the single point , and the projection is an isomorphism over . Over the fibre is the projective plane cubic . In characteristic zero this cubic is smooth: a coordinate zero in the three derivative equations would force all coordinates zero; with all nonzero, multiplying , , gives , impossible. Thus the exceptional fibre is a smooth genus-one plane cubic. The fibre description itself does not require this optional smoothness conclusion; characteristic requires separate treatment.
There are unlisted articles, also show them or only show them.
