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 73 1 b v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Sphere 2 is now force-free and torque-free. Its translation and spin follow the incident rigid-motion components, so it emits neither a Stokeslet nor a rotlet. Its first disturbance is a stresslet from the incident rate of strain, of magnitude . Its return velocity at sphere 1 is consequently :More precisely, that leading correction is . It vanishes for purely transverse forcing, for which the first translational correction is of order .
The first-return spin requires an additional cancellation. The leading incident strain at sphere 2 isIt is axisymmetric about the line of centers, so the reflected stresslet has zero vorticity at sphere 1 on that axis. A naive vorticity estimate of order therefore has zero coefficient. The finite-size correction to the incident strain and the next force-free scattering multipoles are two powers of smaller; these generically giveThis suppressed spin from a force-free distant sphere is also consistent with the reciprocal torque-to-self-translation coupling. Purely longitudinal forcing gives zero spin exactly by axial symmetry. Distinguishing the stresslet's on-axis curl from its generic off-axis scale is essential here.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 73 1 b iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Put . To the needed accuracy the Faxén translation law gives . Enforcing its prescribed velocity therefore givesHere the force on sphere 1 remains prescribed; no extra second-order inversion term is needed in . Substitute this force into the incident field at sphere 1:The negative second-order term reflects the reduced force required on sphere 2 because sphere 1 already entrains it.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 73 1 b iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let , and define the dimensionless leading cross-mobility tensorFor a given applied force, the outgoing Stokeslet is fixed by that force, regardless of the sphere's entrainment velocity. At the other center the Faxén translation law gives its force-only velocity plus the incident Stokeslet velocity. The finite-size dipole and the Laplacian Faxén correction first contribute ; an emitted stresslet reflection is still smaller at this order. ThereforeThere is no second-order translational term for prescribed equal forces.
The vorticity of translating-sphere Stokes flow is ; its potential dipole has zero curl. Apply the torque-free Faxén rotation law to the other sphere's field, using at sphere 1 and at sphere 2. This yieldsthrough second order in the dimensionless spin . Neglected spin terms are higher order. This is the method of reflections for Stokes flow, with the ambient field at each application excluding that sphere's own disturbance.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 73 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The minimum dissipation theorem fixes the boundary velocities and the far-field velocity: among admissible incompressible velocity fields, the Stokes flow minimizesFor a competitor with zero boundary data for , integration by parts eliminates the cross term and leaves .
Extend the actual two-sphere velocity rigidly through sphere 2. It is an admissible field in the one-sphere exterior, with the same translation and rotation of sphere 1. It is continuous across the filled boundary, incompressible, and adds zero strain dissipation inside. Applying the theorem to the exact isolated-sphere flow therefore givesWith all applied couples and the second force zero, the boundary-work identity is . Thus , which provesThis fixed-force comparison of minimum viscous dissipation uses a comparison at fixed actual velocity first; directly comparing different-force or different-velocity solutions would not justify the result.
If , the power is instead , so the preceding estimate no longer bounds the force contribution alone. The two-sphere hydrodynamic mobility matrix generally has a nonzero self translation-rotation coupling: the freely moving second sphere reflects the first sphere's torque field. In the planar geometry this coupling produces a velocity perpendicular to ; by choosing the sign and magnitude of the couple when the force has a component in that direction, its contribution to can exceed the isolated force-only value. There is no universal force-only inequality with an additional applied couple. Special geometries can eliminate the coupling, but do not restore a general theorem.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 73 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write . At fixed geometry, Linearity of Stokes flow makes the translational velocities linear in the couples. With zero forces and couples perpendicular to , isotropy and reflection symmetry allow only terms proportional to in each . There is no longitudinal term: reflect in the plane containing and the common torque axis, taking account of the axial-vector transformation of torque, and use linearity under torque reversal. HenceThe direction of can still change; constant separation does not mean stationary centers.
When the couples are equal, a rotation through about their common axis exchanges the identical spheres and reverses the in-plane translational velocities while leaving the axial angular velocities unchanged. Uniqueness of Stokes flow then givesThe midpoint is stationary and the pair can orbit it. The body spin need not equal the angular rate of that orbit. These symmetry statements hold at arbitrary noncontact separation, not just in a distant rotlet approximation.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 72 1 c ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let the stationary scattering potential fluctuation have autocorrelation function of a random fieldBecause is centered, this is also its covariance function. Multiplying the two real wave phase integrals and taking expectations givesThe two minus signs cancel. This is the wave phase variance, since the wave phase mean is zero. More generally the phase covariance in the first Rytov approximation replaces the first kernel by and the second by . Finite observation/scattering windows, or suitable weighted-integrability hypotheses, make these double integrals well-defined in a stationary infinite-medium model.
The correlation needed here is that of the scattering potential fluctuation. With the printed , the covariance of a squared random field isIt involves a fourth moment of , so its value is not generally determined by the ordinary two-point correlation alone. If one additionally assumes a zero-mean Gaussian random field, Isserlis theorem yields . That assumption is not printed and must not be inserted silently. Alternatively, for a physical weak fluctuation , gives . The general answer uses ; either reduction to a refractive index two-point correlation requires an extra assumption.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 72 1 c i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Assume a real refractive index and write the scattering potential as , so by construction. With the real kernel components in the question, the logarithmic Rytov approximation separates intoInclude the incident wave phase and the mean-potential wave phase in the deterministic reference : at each observation point it is . It need not be spatially constant. The amplitude is . The phase covariance in the first Rytov approximation therefore starts from the fluctuating wave phaseUnder the integrability assumptions needed to interchange the expectation and integral,For a complex absorbing potential, the corresponding phase fluctuation is ; the displayed scalar formula is the real-index case. The zero mean comes from centering , not from setting the mean of equal to zero. In particular the printed does not imply . A physical positive refractive index usually has a nonzero background mean; a zero-mean assumption normally refers to its fluctuation. The algebra above remains meaningful for a signed real random field and explicitly retains its mean scattering potential.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 63 4 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
For an excited eigenstate, . The matrix-element identity in condition (i), together with the two-sided Fourier cutoff, givesThe reverse matrix element has frequency and also vanishes. Equivalently, is Hermitian because is Hermitian and is real, so the two elements are conjugate. ThusThe spectral gap eliminates precisely the couplings needed to make the unique ground state an eigenvector of every filtered term. Couplings between excited states with smaller energy differences can remain; the spectral filter need not diagonalize the whole operator.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 63 4 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the Fourier transform convention . Since , it is real, so . The positive-frequency cutoff therefore also eliminates frequencies at or below . Normalization gives .
For spectral filtering of Hamiltonian terms, chooseIn an energy eigenbasis, its matrix elements areAt the frequency is zero, so the normalization preserves the ground-state expectation:The spectral filter is a positive weighted average of unitary conjugations; in particular the integral is bounded in operator norm by . We can choose it even without an extra assumed tail bound: the evenization of a nonnegative bandlimited filter proved in part (e) produces another admissible spectral filter with the same type of positive-time decay. Make that choice consistently in all the filtered terms and shell definitions below.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 63 3 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Write the final topological quantum order constants as and , to avoid confusing the allowed support diameter with the small time coefficient. For any initial operator of operator norm at most one,and similarly for the partner state. The minus sign follows from and the Heisenberg picture convention . The Lieb-Robinson bound and its localization corollary apply to either time direction, using .
Choose , with , and localization buffer . The enlarged support obeysThe Lieb-Robinson localization by Haar twirling corollary supplies an operator approximating withDo not assume that the approximate operator has norm at most one: it only has . Apply final-state local indistinguishability to . The two approximation errors then giveIf the lattice has polynomially many sites in its diameter, , the error tends to zero uniformly in these supports. For sufficiently large , take . The initial pair is then indistinguishable within on supports of diameter at most . Together with the exact orthogonality from condition (i), this proves the initial state is topologically ordered for sufficiently small linear-time coefficient. The constants for initial and final order need not be identical.
The backward preservation of local indistinguishability has an explicit finite-system qualification: it holds whenever the displayed error is small enough. The conventional bounded-density, fixed-dimensional lattice interpretation supplies that condition. The question leaves growth control implicit; for an arbitrary collection of qudits one cannot discard the prefactor merely because is large. This identifies exactly the assumption needed by the supplied localization proof.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 63 3 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Let . Define the second initial state by , while . The unitary time evolution preserves their inner product:Both initial states are normalized and evolve to the chosen final pair. This supplies the orthogonal partner needed for topological quantum order. The remaining requirement is local indistinguishability, which is proved in the next condition's solution.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 61 4 a ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An explicit measurement-based quantum computation pattern uses six vertices . Prepare a graph state with every vertex in and apply a Controlled-Z gate for each edgeThe first two links on each wire permit graph-state preparation of a computational-basis input followed by the logical J gate. Use the following single-qubit measurements:
All entangling edges can be made at preparation time because Controlled-Z gates commute. A future edge that does not touch a currently measured vertex can equivalently be deferred, which allows the one-bit teleportation identities to be applied in their logical order.
The two initial measurements implement with Pauli frames on the logical inputs. The first adaptive J gate then has output frame on . Propagating through gives framesup to branchwise global phase. The second adaptive J gate converts the latter intoA correction does not alter a computational-basis measurement, while an correction flips its bit. Consequently the deterministic classical postprocessing isThis reproduces the output-bit distribution of the original quantum circuit, including its known byproduct corrections.
Six-vertex graph state, adaptive equatorial measurements and classical parity correction for the two-wire circuit
. Details. There is an additional simplification for these particular zero inputs. Since , , and , the exact final state is , independently of the angles. The requested bit is therefore fair. A single isolated graph-state vertex measured in already simulates that bit distribution; the six-vertex pattern also explicitly realizes the circuit and its corrections.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 61 4 a i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The J gate is , with . Prepare a fresh qubit in and apply the Controlled-Z gate between it and the input . The resulting state isMeasure the input in the equatorial qubit measurement basis . The unnormalized output isEach outcome has probability . Thus one-bit teleportation realizeson the new qubit. Apply the known Pauli X gate correction for the literal output, or keep the correction in a Pauli frame and adapt later measurements. The old qubit is measured, so this is not cloning the input.
Direct multiplication of the given matrices gives . The displayed negative exponent in the supplied relation has the wrong sign for exact matrix equality. The discrepancy is only a global phase in a fixed measurement branch, so it does not change this measurement implementation or its outcome probabilities. The positive-sign identity is used when tracking exact matrices.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 61 1 b ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The linear decoding must be done coherently, so its output is available inside the next Boolean quantum oracle call. Use registers of qubits and a shared phase ancilla qubit in . Define the Bernstein-Vazirani decoding controlled by a quantum registerThe ancilla qubit is implicit. For every computational index , the Walsh-Hadamard transform calculation givesIn particular on these states. Initialize to and to . The three query stages areThe middle equality uses the matching index , not a classical guess of that string. The second performs uncomputation, removing the hidden-string register without losing its phase on . Apply to to obtainThis requires precisely two queries to and one to , and only additional fixed quantum gates. No measurement of is made: such a measurement would spoil the required coherence. Preparing all registers and the phase ancilla qubit uses only the initially available zero states.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 61 1 b i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Prepare an additional qubit in by applying and then the Hadamard gate to . Apply to the data register. The Boolean quantum oracle then produces quantum phase kickback:A final Walsh-Hadamard transform gives an amplitude for equal toTo see this identity, the sum factors over the bits; any position at which and differ contributes . This is Bernstein-Vazirani phase kickback, and its output isThere is exactly one oracle query, fixed quantum gates, and no probabilistic intermediate step. The ancilla qubit can be left in or reset to using its known inverse preparation. The construction includes the case .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 60 2 ii c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Because is determined by , its conditional entropy satisfies . Equate the two forms of the chain rule for conditional entropy to obtainConditioning cannot increase classical Shannon entropy: by nonnegativity of mutual information. Thus . When , the value of is exactly and . When and , the value is excluded, leaving at most possibilities. By maximum entropy on a finite alphabet,Averaging the two conditional cases now yieldsand consequentlyThis is Fano's inequality via an error indicator. Events of zero probability contribute zero to the average and need no conditional distribution. For , the inference is automatically correct and the entropy is zero; the displayed logarithmic form is intended for . Optimality of the guess is not needed for the inequality: it holds for every deterministic .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 60 2 ii b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Apply the definitions of conditional entropy and insert :Inserting instead gives the alternative chain rule for conditional entropyBoth are expansions of the same joint conditional uncertainty, with the variables exposed in opposite orders.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 60 2 ii a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The error indicator is a Bernoulli random variable with probabilities and . Its Shannon entropy is therefore the binary entropyUse , so this expression also covers error probabilities zero and one.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 60 2 i b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The Shannon second coding theorem states that the operational channel capacity of a finite discrete memoryless channel is : rates below this maximum admit block codes with error tending to zero, and rates above it cannot have vanishing error. For this channel the preceding calculation givesusing maximum entropy on a finite alphabet. The transition matrix is a doubly stochastic matrix. Therefore the uniform input has uniform output: . It achieves the entropy upper bound, and henceEquivalently this is the weakly symmetric channel capacity theorem: permutations of a common row and equal column sums make the uniform input optimal. If is uniform, the output contains no information about the input and the formula gives zero.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 60 2 i a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Every conditional output distribution is a permutation of . Since Shannon entropy is invariant under a permutation, its value is the same for every input symbol. Thus, for any input distribution,All Shannon entropies in this solution are in bits. A different fixed logarithm base changes every entropy and capacity by the same constant factor.
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






