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 2019 iii Paper 105 3 b i Solution by
Codex 0 2026-10-03
Locally write the real analytic hypersurface as with . The conormal bundle is spanned by . The surface is a characteristic hypersurface at precisely when the principal symbol vanishes on that conormal:Only the matrix , which is a symmetric matrix, contributes to this expression.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 2 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
On the product Hilbert space defineandThe Cauchy-Schwarz inequality makes and bounded. On the diagonal,The Poincaré inequality controls by , andThe displayed diagonal value therefore controls the full product norm, so is coercive. The Lax-Milgram theorem now gives exactly one pair satisfying the weak identities. Hence a unique weak solution exists for every .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 2 b i Solution by
Codex 0 2026-10-03
The Dirichlet boundary condition is built into the first component's space, while the Neumann boundary condition is natural. Thus a weak solution is a pairsuch that for every ,If are up to the boundary, taking compactly supported test functions and applying the fundamental lemma of the calculus of variations gives both differential equations pointwise in . Membership of gives on . Applying integration by parts to the second identity and using its differential equation leavesfor every smooth boundary trace . Hence on , so the equations and both boundary conditions hold classically.
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 1 c ii Solution by
Codex 0 2026-10-03
If the Poincare inequality with a boundary trace failed, after normalization there would be withAs in part 1(c)(i), a subsequence converges strongly in and weakly in to a constant function . The Sobolev trace theorem is a bounded linear map, so the traces converge weakly while their norms tend to zero; hence the trace of is zero. A constant with zero trace is zero, contradicting . Consequently
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 1 c i Solution by
Codex 0 2026-10-03
Suppose the claimed Poincare-Wirtinger inequality were false. There would be such that, after settingwe have , , and . The sequence is bounded in , so part 1(b)(ii) supplies a subsequence converging strongly in and weakly in to some .
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 1 b ii Solution by
Codex 0 2026-10-03
The Sobolev space is a separable Hilbert space. A bounded sequence therefore has a weakly convergent subsequence by the weak subsequence of a bounded Hilbert-space sequence; write in . Since is bounded with smooth boundary, the Rellich-Kondrachov compactness theorem says that is compact. Passing to a further subsequence gives
Past exam of the mathematics course of the University of Cambridge 2019 iii Paper 105 1 b i Solution by
Codex 0 2026-10-03
With the standard Sobolev space inner product, weakly in meansfor every . Equivalently, every bounded linear functional on takes convergent values on the sequence.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 340 2 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
The density axiom and continuity of the Fourier transform at zero imply . Here is a proof that avoids assuming a normalization of the integral. Choose a nonzero whose Fourier transform has bounded support. The MRA projection Fourier identity, with no aliasing once is sufficiently large, isSince , its Fourier transform is continuous and bounded, so this tends to . Density and nesting give in . Thus , in particular it is nonzero. Evaluating the scaling refinement equation in frequency at zero now giveswhich is stronger than the requested absolute-value equality. Multiplying the scaling function by a constant of modulus one normalizes its integral to one without changing .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 340 2 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Use the Fourier transform convention . Nesting and the orthonormal basis of give the scaling refinement equationHere . Compact support makes these inner products zero for all but finitely many , so is a trigonometric polynomial. Expanding the orthogonality of the integer translates of in the orthonormal basis of yieldsConsequentlyThis holds everywhere because is continuous. The invoked properties are nesting, dyadic dilation, orthonormal integer translates, and compact support; mere finite-energy refinement would not imply the quadrature mirror filter identity.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 339 3 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Consider on the finite-dimensional vector space and use the monomial basis. For , a binomial distribution and the falling factorial moment formula givewhere is the Stirling number of the second kind and . This follows by expanding and using . Also .
Each monomial maps to a polynomial of no larger degree. The resulting matrix is triangular with diagonal entries and , . When and , all entries are positive. ThereforeFor constant polynomials the conclusion is immediate. Taking positive indices avoids the undefined sample expression at .
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 339 3 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First address the positivity request in part (a), which has no separate Solution heading in the stub. For , each and each coefficient is nonnegative. Their sum is therefore nonnegative, including at the endpoints:This is the elementary direction of the positive Bernstein coefficients for a strictly positive polynomial criterion; the converse developed later needs strict positivity.
For completeness, the convergence fact listed as (i) also has a short proof. If , the Bernstein polynomial is . Its mean argument is and . Given , uniform continuity of on the compact interval supplies such that whenever . By Chebyshev's inequality, uniformly in ,Letting and then proves . The two numbered items in the source are assumptions supplied for later parts, not additional exam questions; their stub sections contain these supporting derivations.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 339 1 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For every decision with finite worst-case value, the previous dual represents that value as a maximum over . Maximizing it jointly with yields the robust linear optimization over the probability simplex formulation:Indeed every feasible triple gives a dual lower bound on that decision's worst-case revenue, while dual attainment supplies a triple reaching it. This argument only combines two maximizations after dualization; it does not interchange the original max and min.
If the probability simplex intersects , this linear program is feasible and bounded above by , and hence attains an optimum. Its maximizing is a robust optimizer. If the intersection is empty, every decision has worst-case value and the linear program is infeasible, consistently with the extended-value convention. Full column rank of ensures every simplex decision has a finite inner optimum, but is not needed for the qualified equivalence.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 339 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Associate nonnegative Lagrange multipliers with and with . The Lagrangian dual problem is obtained fromIts infimum over unrestricted is finite exactly when . Thus the dual isThe precise finiteness condition is . If , then on the feasible set. The primal is feasible and bounded below, and splitting into positive and negative parts makes the dual feasible. Linear programming duality therefore gives attained equal finite optima. Equivalently, the strictly feasible point satisfies the Slater condition, with the required finiteness hypothesis. This is strong duality in the usual finite sense.
If , there is with . Every , , is feasible and the objective tends to . The dual is then infeasible. Equality of extended values still holds if its supremum over the empty feasible set is defined as , but there are no finite optimizers. The paper does not assume full column rank of , so this qualification is necessary. The same calculation gives the support function of an inverse image of an infinity-norm ball, for finite decisions.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 339 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
For fixed , put . The polyhedral uncertainty set is equivalent to , so the inner problem is the linear programThe variable is unrestricted in sign. The point is strictly feasible. If the optimum is finite, it is attained, so the infimum is a minimum. The use of an infimum also covers possible unbounded cases permitted by the printed assumptions; strict feasibility alone does not guarantee a finite objective.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 3 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Increasing exposure reduces fractional photon shot noise as , but a fixed background mismatch grows in proportion to the signal. The fractional systematic error is , independent of exposure. The systematic-error signal-to-noise ceiling can therefore be poor for a faint source in a bright sky even when random fluctuations are tiny.
Better background subtraction requires matching sky location and time, correcting detector response, dithering or modelling spatial background variations. If were known exactly, one could instead use , which is unbiased and has variance . The ceiling arises from an uncorrected or unknown mismatch in the prescribed subtraction, not an unavoidable property of measuring two patches.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Put and in the root-mean-square accuracy measure:For a fixed uncorrected and , the squared bias eventually dominates the shot-noise terms. ThereforeThe PDF omits the absolute value. Its expression is the positive accuracy ratio only if ; for the residual background changes sign, but an error magnitude and a signal-to-noise ratio in photon counting remain nonnegative. The printed signed formula can instead be read as source divided by signed bias.
For exact background matching , there is no systematic-error signal-to-noise ceiling: grows without bound in this idealized model. With the same conclusion holds. Limits in which itself approaches one with exposure time are different from the fixed-mismatch limit used here.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 3 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Treat and as mean detected counts, or as photon counts with unit quantum efficiency. Let the independent patch measurements be and . For the specified unweighted background subtraction ,The first error is a fixed bias of an estimator; the last expression is the sum of independent photon shot noise variances. Since are already patch totals, no extra factor of the pixel count is needed, and read noise is neglected.
To obtain the systematic-error ceiling requested in the following clause, define the accuracy measure using total root-mean-square error relative to the true source count. By the bias-variance decomposition of mean squared error,For , the shot-noise term is approximately , but the mismatch term must be retained.
There is a terminology qualification: the usual variance-based signal-to-noise ratio in photon counting is and does not include a fixed bias as noise. The printed next-part limit requires the root-mean-square accuracy convention above. A deterministic background mismatch contributes to mean squared error, not to the statistical variance.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 3 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Let be the input photoelectron count and its mean, with quantum efficiency and mean incident photon count . Independent arrivals give a Poisson distribution, so . Conditional on , the preceding gamma distribution gives and . The law of total variance therefore yieldsOne contribution is the ordinary photon shot noise; the other is multiplication excess noise. Thus, neglecting read noise and backgrounds,This is an excess-noise factor in analog operation: actual photon conversion efficiency has not been halved. At low occupancy, thresholding each pixel as zero or one event can avoid most multiplication noise, but high arrival rates produce coincident events that cannot be counted separately. That is why the high-rate result concerns charge measurement rather than ideal binary photon counting.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 3 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
First include the mean-gain calculation preceding the numbered clauses. At each electron-multiplying CCD stage one electron contributes an expected electrons to the next stage. If is the charge after stage , conditional expectation gives . Iteration from input electrons yieldsFor small , if corrections of order are negligible.
In the high-gain approximation the output from one input electron has an exponential distribution of scale . Independent input electrons produce independent cascades, and their charges add. By convolution of independent random variables, assuming the formula for inputs,Together with the single-electron base case this provesIt is a gamma distribution with shape and scale , so it is normalized and has expected value and variance . The formula is a continuous approximation to discrete output charge, not an exact integer-valued branching distribution; for there is a point mass at zero instead.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 338 2 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-05
Both methods reduce structured stellar residuals, rather than removing all noise. In angular differential imaging, changing atmospheric turbulence, imperfect adaptive optics, flexure and thermal drift change the point spread function between frames. The reference then fails to represent the instantaneous stellar field. Small sky rotation makes close companions contaminate their own reference, causing differential-imaging self-subtraction. Extended disks are especially susceptible; subtraction can alter shape as well as total flux. More images help independent photon shot noise, but do not necessarily average away correlated residuals.
Simultaneous spectral differential imaging avoids the time delay, but different channels have non-common-path wavefront errors. Chromatic optical aberrations, wavelength-dependent amplitude errors and out-of-pupil propagation prevent a perfect radial rescaling of speckle patterns. Filter throughput, detector calibration, image registration and atmospheric dispersion also leave subtraction residuals. Nearby bands align the stellar field better but give less positional diversity; wider separation gives more displacement but larger chromatic mismatch. A smooth-spectrum companion, or one too close for appreciable rescaled displacement, can undergo severe differential-imaging self-subtraction.
Artificial-companion injection through the complete processing pipeline and forward modelling can calibrate lost throughput and photometric or astrometric biases. They do not guarantee that every correlated residual is a real source. Independent epochs or spectral evidence remain valuable.
Reference mismatch produces residual speckles; source contamination produces self-subtraction and biased photometry.
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





