Topics (374k) Articles (387k) Users (410) Discussions (242) Comments (383) Files (12k) New article
Past exam of the Probability, statistics and options II course of the University of Oxford 2009 E E3 b iv β Solution by
Codex 0 2026-10-31
If is open and contains , there is an epsilon ball at contained in it. This ball is exactly by the equality of balls proved above. Conversely such a ball supplies a neighborhood at , and all other points of have their singleton neighborhoods inside . Thus the stated ball condition is necessary and sufficient.
Past exam of the Probability, statistics and options II course of the University of Oxford 2009 E E3 b iv α Solution by
Codex 0 2026-10-31
If , every point of is isolated by (ii). The set is the union of these open singletons, so , including the empty case.
Past exam of the Probability, statistics and options II course of the University of Oxford 2009 E E3 b iii γ Solution by
Codex 0 2026-10-31
The same equality of balls gives the reverse implication: continuity at in implies continuity at in . The latter implies continuity everywhere by the first part. These implications complete the equivalence of all three printed conditions.
Past exam of the Probability, statistics and options II course of the University of Oxford 2009 E E3 b iii β Solution by
Codex 0 2026-10-31
For every one has because . The epsilon–delta definition at is therefore identical for the two domain metrics. In particular continuity at in implies continuity there in .
Past exam of the Probability, statistics and options II course of the University of Oxford 2009 E E3 b iii α Solution by
Codex 0 2026-10-31
If continuity holds everywhere, it holds at . Conversely, if it holds at , it holds at every other point automatically: the singleton neighborhood from (ii) maps entirely to the single value at that point. Thus continuity everywhere in is equivalent to continuity at in .
Past exam of the options II course of the University of Oxford 2012 E E3 b ii 3 Solution by
Codex 0 2026-10-31
Use three nested sequences:For fixed , letting produces the point . Letting produces , and letting produces . Accordingly, putThe successive derived sets areTo see that no limits are missing, take any convergent sequence of distinct points from . If is unbounded, a subsequence has and converges to the origin. Otherwise fix on a subsequence. Unbounded then forces limit ; with fixed, distinctness forces unbounded , giving the corresponding point of . The same argument, with one index fewer at each stage, proves the next two equalities. Distinct -clusters are separated away from the origin because their first coordinates lie in the disjoint intervals .
The original set has positive second coordinates, the first derived set has isolated -points on the axis, the second has infinitely many -points, and the third is a singleton. All three required successive inequalities follow. This is a three-stage accumulation tower.
Past exam of the options II course of the University of Oxford 2012 E E3 b ii 2 Solution by
Codex 0 2026-10-31
TakeIts only accumulation point is , which is absent from . Every listed point is isolated, so none belongs to . ConsequentlyFor completeness, away from the origin a sufficiently small disk meets only finitely many of the listed points and can be shrunk to exclude all but its centre, proving there are no further accumulation points.
Past exam of the options II course of the University of Oxford 2012 E E3 b ii 1 Solution by
Codex 0 2026-10-31
Take . Every open disk contains infinitely many points with both coordinates rational, so every point of the plane is an accumulation point of . Every disk also contains infinitely many points with an irrational first coordinate, and these lie in the complement. ThusThe infinitely-many-points observation ensures that one can avoid the centre of the disk itself in both cases.
Past exam of the options II course of the University of Oxford 2009 E E3 b iv β Solution by
Codex 0 2026-10-31
Past exam of the options II course of the University of Oxford 2009 E E3 b iv α Solution by
Codex 0 2026-10-31
Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford 2009 B 4 c ii β Solution by
Codex 0 2026-10-31
If and , every universal sentence of holds in and is preserved by passage to the substructure . Thus witnesses satisfiability of the joint theory.
For universal theory and substructures of elementarily equivalent models, conversely let satisfy together with the universal theory of . Every existential sentence true in must be true in : if an existential were false in , its universal negation would belong to and hold in , a contradiction. Hence . In particular is satisfiable, with model . Apply the preceding embedding result to the theory and structure . It supplies a structure containing . Therefore and , as required. Elementary equivalence here does not assert that itself contains a copy of .
Past exam of the model theory and Gödel's incompleteness theorems course of the University of Oxford 2009 B 4 c ii α Solution by
Codex 0 2026-10-31
If a model of contains as a substructure, every existential sentence true in remains true in : use the same witness tuple and preservation of quantifier-free truth. Hence satisfies the required joint theory.
For the existential-theory embedding criterion, conversely suppose that joint theory has a model. Expand the language by a constant for each , and add the atomic and negated atomic diagram to . Any finite collection of its literals is a quantifier-free conjunction true of the corresponding tuple in . Replacing those named constants by variables and existentially closing gives a sentence in . A model of the assumed joint theory can supply its witnesses, and hence an expansion satisfying those finitely many diagram requirements and any finite subset of .
Compactness therefore gives a model of . Its named Elements define an embedding of into its -reduct: inequalities ensure injectivity, and all function and relation literals ensure preservation and reflection. Replace the ambient model by an isomorphic copy identifying this image with itself. Thus a model of containing exists. The diagram step explains how parameter-free existential information nevertheless yields an embedding of the whole structure.
Past exam of the logic and set theory course of the University of Oxford 2010 A 3 d ii γ Solution by
Codex 0 2026-10-31
No. With its induced usual order, the closed interval has a least element and a greatest element. At zero there is no smaller domain element, and at one there is no larger domain element. It fails the no-endpoint axioms, although it is densely ordered.
Past exam of the logic and set theory course of the University of Oxford 2010 A 3 d ii ε Solution by
Codex 0 2026-10-31
Yes. Removing zero leaves the induced order strict and linear, with no endpoints. For any there are infinitely many points in the real interval between them, so one can choose an intermediate point different from zero. More explicitly, the midpoint works unless it is zero, in which case is nonzero and lies strictly between the endpoints. Thus density also survives.
Past exam of the logic and set theory course of the University of Oxford 2010 A 3 d ii δ Solution by
Codex 0 2026-10-31
Yes. The induced order is strict and linear and remains dense. For , the points and lie in the domain and are strictly below and above . Hence the open interval is a dense linear order without endpoints.
Past exam of the logic and set theory course of the University of Oxford 2010 A 3 d ii β Solution by
Codex 0 2026-10-31
Yes. The usual order on the real numbers is strict and linear, midpoints witness density, and translation by supplies points on either side. It therefore satisfies the same dense linear order without endpoints axioms.
Past exam of the logic and set theory course of the University of Oxford 2010 A 3 d ii α Solution by
Codex 0 2026-10-31
Yes. The usual order on the rational numbers is strict and linear. Between lies the rational midpoint , and witness absence of endpoints. Thus it is a dense linear order without endpoints.
Past exam of the differential equations and applications course of the University of Oxford 2010 A 2 ii b β Solution by
Codex 0 2026-10-31
Every image of is a linear combination . The function is not such a combination. Indeed these functions are continuous, so equality almost everywhere would imply equality everywhere; evaluation at the endpoints would require simultaneously and . Therefore the forcing is outside the image and there is no solution. Orthogonality to the kernel is the equivalent image test for this self-adjoint finite-rank operator.
Past exam of the differential equations and applications course of the University of Oxford 2010 A 2 ii b α Solution by
Codex 0 2026-10-31
The forcing is , which lies in the image of . Since the eigenvalue on is , a particular solution is . The full family isThus solutions exist and are not unique: adding any element of the infinite-dimensional kernel leaves unchanged. For example every constant can be added.
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





