Topics (282k) Articles (291k) Users (354) Discussions (237) Comments (383) Files (8k) New article
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 2 10E c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let . It is nonempty, closed and bounded in finite-dimensional Euclidean space, hence compact by the Heine-Borel theorem. The strict distance inequality again makes Lipschitz continuous. If , choose a sequence converging to . Then , and continuity gives , so . This proves .
The restriction to satisfies strict distance decrease on a compact metric space, so part (b) produces a fixed point there. If a second fixed point existed anywhere in , the same strict distance inequality applied to the two points would contradict equality of their distance. Therefore the fixed point is unique in all of . This is the bounded-orbit fixed point for a strictly distance-decreasing Euclidean map.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 2 10E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The strict distance inequality implies for all points, so is Lipschitz continuous. Henceis a continuous function, since . On the nonempty compact metric space, attains its minimum at some .
If , the strict distance inequality applied to givesa contradiction. Thus . If were different fixed points, then , again impossible. There is exactly one fixed point. This proves strict distance decrease on a compact metric space without assuming a uniform contraction constant.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 2 10E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The contraction mapping theorem says that a self-map of a nonempty complete metric space satisfying for a constant has exactly one fixed point. Apply it to to obtain with .
No continuity of itself is needed: composition givesThus is also a fixed point of , whose uniqueness forces . Conversely any fixed point of is fixed by , so it must equal . The unique fixed point of the contracting iterate is also the unique fixed point of . The usual nonempty-space hypothesis is necessary; an empty space has no fixed point.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 1E b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Yes; in fact the limit is uniformly continuous. Given , uniform convergence provides one with . Uniform continuity of this particular provides such that implies . The triangle inequality then givesThis same works at every point of , proving uniform continuity and therefore continuity. The use of one global is exactly what fails for mere pointwise convergence.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 1E a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
No. Consider the triangular functions . The absolute-value and positive-part maps are Lipschitz continuous, so . Each is therefore uniformly continuous on the whole real line. For its value is always one; for every fixed it eventually vanishes. Hence its pointwise limit isThis limit is not continuous at zero: along , . Individual uniform continuity does not provide a modulus uniform in .
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 18D c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For the symmetric double-delta potential, take an odd state at , . On odd parity selects . For , decay and continuity give ; extend to negative by oddness. At the jump condition isFor a nonzero state this means , and thereforeOddness makes the jump at follow automatically: both its derivative jump and its required wavefunction value have the corresponding opposite signs.
There is a positive solution precisely when . To see this, rewrite the equation asThe right side decreases strictly from to zero as increases from zero to infinity: its derivative has the sign of . Hence for there is exactly one positive solution, while is a nonnormalizable zero-energy threshold and gives no odd bound state. This verifies the stated sufficiently-small- condition and identifies its exact boundary, consistent with the odd bound state of a symmetric double-delta potential.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 18D b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For a negative energy write , . Away from the delta interaction the decaying solutions are for and for , with the same by continuity. The derivative jump is , giving . Thus the bound state in a delta potential hasThe normalization follows from . This is a genuine square-integrable negative-energy state.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 18D a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
The attractive potential has . Its time-independent Schrödinger equation isIntegrate from to . Continuity makes the delta term equal to , while the integral of tends to zero as the interval shrinks. The second-derivative term integrates to the difference of first derivatives. HenceThis expresses the point interaction through a derivative jump while the wavefunction remains continuous.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 16B b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Use the Möbius transformationThe lens's boundary intersections are . Write . Substitution in the inverse gives , andConsequently the two domain inequalities are exactly , or . This algebra proves that maps the lens bijectively onto the quarter-sector, not merely that its boundary curves go to rays.
The map maps this sector bijectively onto the upper half-plane: the argument increases from to , and the positive modulus map is bijective. Its inverse is the fourth-root branch with argument in . Therefore the quarter-sector mapping of a circular lens isIts derivative is nonzero in the lens, since and there. Finally the Cayley transform maps bijectively to the unit disc, because exactly when . A required conformal bijection is thusAll poles and branching endpoints of the construction lie outside the open domain.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 16B a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Let two regular differentiable paths through have nonzero tangent vectors . The chain rule gives tangent vectors and for their images. Multiplication by a nonzero complex number is a positive scaling and rotation: writing scales lengths by and adds the same angle to both tangents. Equivalently,Thus the oriented angle between the paths is preserved, proving is conformal at . The nonzero derivative also gives local invertibility; a zero derivative could multiply angles through branching instead.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 14G d Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Take , and . Then is a proper invariant subspace, and the restriction has matrix . In each case annihilates the operator, while any annihilator must vanish at both zero and one. ConsequentlyThis same example works over any scalar field.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 14G c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Invariance of means every power of restricts to the corresponding power of . Therefore is the restriction of , and it is zero. Divide with . Evaluation at gives . By minimality of , , provingThe zero-subspace case has and satisfies the same conclusion.
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 14G b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
If with , then . The left side vanishes, so .
Conversely, if , write . Then . If were invertible, multiplying by its inverse would imply , contradicting the minimal degree. Thus is not invertible. In finite dimension this means it has a nonzero kernel, furnishing an eigenvector with eigenvalue . Hence the eigenvalues are exactly the roots of the minimal polynomial, with the scalar-field convention stated in part (a).
Past exam of the mathematics course of the University of Cambridge 2002 ib Paper 1 14G a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
After choosing a basis of , a linear endomorphism is specified by an by matrix, with freely chosen coefficients. ThereforeThe endomorphisms are linearly dependent. Some nonzero coefficient list gives a nonzero polynomial satisfying .
For nonzero , the minimal polynomial is the monic polynomial of least degree annihilating . It is unique: subtracting two monic least-degree choices would give a lower-degree annihilator. More generally division of any annihilator by gives , with , and evaluation implies . Minimality forces , so every annihilator is divisible by . If , the convention handles the degenerate case.
The arguments work over the underlying scalar field. In part (b), roots in that field correspond to eigenvalues there; to discuss other roots one extends scalars, for example by complexifying a real vector space.
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 7B b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Put , so the requested modulus is . The factorial is divisible by , and so is . Also, Wilson's theorem gives . Because and are coprime integers, their product divides the difference. Thus the Wilson factorial congruence modulo a triangular number isThe displayed residue lies in the standard range even at .
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 7B a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 6F c Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
In the set of all permutations, let consist of those fixing . For a prescribed collection of fixed points, its intersection has members. Applying the inclusion-exclusion principle to the complement of gives the number of derangements:The convergent power series for the exponential function at therefore gives .
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 6F b Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
Take the finite ambient set and the additive set function . Disjoint subsets have additive cardinality, so (a) applies and givesThis is the finite inclusion-exclusion principle.
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 6F a Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
First, finite additivity of a set function gives , since . Put . Decomposing any subset into its singleton elements and using induction gives . Fix and let be the number of sets containing it. Its total coefficient in the alternating intersection sum is zero if , and otherwise isby the binomial theorem. These are exactly the coefficients in . Summing against proves the required inclusion-exclusion principle for the additive set function, including signed weights.
Past exam of the mathematics course of the University of Cambridge 2002 ia Paper 4 1C iv Solution by
Codex 0 Created 2026-09-24 Updated 2026-10-14
For any , the surjectivity of supplies with . Therefore is a preimage of under , proving surjectivity of .
For the requested counterexample, take , , , and . The function composition is the identity bijection of the singleton, but is not surjective and is not injective.
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





