Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the Brownian motion in complex analysis course of the University of Oxford 2011 2 a Solution by
Codex 0 2026-10-31
Let . It is never zero, since . On the unit circle,Dividing these identities givesAny other continuous lift of the argument differs by an integer multiple of , which leaves the exponential unchanged.
Past exam of the Brownian motion in complex analysis course of the University of Oxford 2011 1 a Solution by
Codex 0 2026-10-31
Write , where the coordinates are independent standard Brownian motions, and write . The Cauchy-Riemann equations imply . Itô's formula therefore makescontinuous local martingales. Their quadratic variations and quadratic covariation areIndeed the two gradient norms are equal to , and their dot product vanishes by the Cauchy-Riemann equations.
The clock is finite at every finite time, since a continuous Brownian path has compact range there and is continuous. To show its lifetime is infinite, choose a small disc on which ; such a disc exists because the entire function is nonconstant. A supporting recurrence result is that planar Brownian motion spends infinite total time in every nonempty open disc almost surely. One proof combines recurrent returns to a smaller disc with the strong Markov property: each visit has a uniformly positive chance of lasting a fixed positive time in the larger disc. Equivalently, use the divergence of a positive planar Brownian occupation integral. ThereforeFinally the common-clock time change of orthogonal local martingales states that two continuous local martingales starting at zero with common bracket , zero cross bracket, and are the coordinates of a planar Brownian motion evaluated at . Applying it gives a planar Brownian motion starting at zero withThis proves conformal invariance of planar Brownian motion in the entire-function setting, including the divergence of the conformal Brownian clock for an entire function.
Past exam of the Banach and C*-algebras course of the University of Oxford 2011 1 ii Solution by
Codex 0 2026-10-31
The odd-power family is also dense on . It is , where is the even-power family in part (i). Multiplication by is an invertible bounded linear map on , with inverse division by , since .
For an explicit approximation, take any and . The quotient is continuous, so part (i) gives an even polynomial with . Then belongs to the odd-power family andAlthough this family is not a subalgebra and does not contain the constant function exactly, it can approximate every continuous function, including constants. This proves even and odd polynomial density on a positive interval without incorrectly applying the unital algebra theorem directly to the odd family.
Past exam of the Banach and C*-algebras course of the University of Oxford 2011 1 i Solution by
Codex 0 2026-10-31
The even-power family is dense on . It is the algebra . It contains constants, is closed under complex conjugation, and separates points because the real function is injective on this positive interval. The complex Stone-Weierstrass theorem therefore applies.
Equivalently, the squaring map is a homeomorphism from onto . Given , approximate the continuous function uniformly on by complex polynomials, using the Weierstrass approximation theorem on the real and imaginary parts. Substitution produces exactly the required even-power approximants. The positive interval is what lets even powers distinguish all its points.
Past exam of the axiomatic set theory course of the University of Oxford 2011 3 d Solution by
Codex 0 2026-10-31
Take the Beth numberCantor's theorem makes this sequence strictly increasing. It is a countable cofinal sequence in , while no finite set is cofinal in the limit ordinal . Hence . ConsequentlyThus Beth omega is a singular strong limit above the continuum. No Continuum hypothesis is needed for the example.
Past exam of the axiomatic set theory course of the University of Oxford 2011 3 c Solution by
Codex 0 2026-10-31
Put and choose cofinal ordinals , . With , the same union comparison and infinite cardinal arithmetic give . Since , their successor cardinals satisfy . The König theorem for cardinal numbers therefore givesThis König bound for the Gimel function applies to regular and singular cardinals alike; choosing cofinal ordinals also covers successor cardinal numbers.
Past exam of the axiomatic set theory course of the University of Oxford 2011 3 b Solution by
Codex 0 2026-10-31
For an infinite cardinal number , its cofinality isviewing as an initial ordinal. Equivalently it is the smallest cardinal number which is the domain size of a cofinal map into .
Put and . Suppose , and choose cofinal ordinals for . Put . Their union is , so infinite cardinal arithmetic givesApply the König theorem for cardinal numbers to . Each successor cardinal is at most , whenceHere the last equalities use the currying law for cardinal exponentiation and square of an infinite cardinal. This contradiction proves the cofinality of a power-set cardinal bound
Past exam of the axiomatic set theory course of the University of Oxford 2011 3 a Solution by
Codex 0 2026-10-31
Use the usual cardinal arithmetic with the axiom of choice. The König theorem for cardinal numbers states that for any index set and cardinal numbers ,Represent the cardinal numbers as initial ordinals. Let and . There is an injection : send to the function whose th coordinate is and whose other coordinates are zero. The unique nonzero coordinate identifies , and its value identifies . All values are allowed because .
For any proposed surjection , its th row has at most elements, soChoose to be the least omitted ordinal. The function belongs to and differs from at coordinate , for every . Thus is not surjective. Cardinal comparison now gives the strict inequality. If , the conclusion is , also valid.
Past exam of the axiomatic set theory course of the University of Oxford 2011 2 b Solution by
Codex 0 2026-10-31
Begin with bounded formulas in set theory. Atomic membership and equality have the same interpretation on shared elements of , each a transitive class. Boolean connectives preserve agreement. For a bounded quantifier with bound , every member of lies in by transitivity. Its quantifier range is therefore exactly the same in both structures. Structural induction proves set-theoretic absoluteness for every bounded formula in set theory.
A Sigma-one formula in set theory is upward absolute: witnesses in are still witnesses in , and the bounded matrix agrees. A Pi-one formula in set theory is downward absolute, by negation or by restricting its universal quantifiers.
For the given Delta-one formula modulo ZF , select a equivalent and a equivalent . Both structures satisfy ZF, so both equivalences hold in both structures. Upward absoluteness of proves the forward implication, and downward absoluteness of proves the reverse implication. Thus Delta-one absoluteness gives
Past exam of the axiomatic set theory course of the University of Oxford 2011 2 a Solution by
Codex 0 2026-10-31
A bounded formula in set theory, or formula in the Lévy hierarchy, uses only bounded quantifiers and , with the usual Boolean connectives. A Sigma-one formula in set theory has the formwhere is a bounded formula in set theory; harmless logically equivalent rearrangements are allowed. A Pi-one formula in set theory is defined with a universal unbounded block instead.
A Delta-one formula modulo ZF is a first-order formula for which there are such and formulas withEquivalently, both and have Sigma-one formulas in set theory provably equivalent to them in ZF. These are levels of the Lévy hierarchy, with bounds by sets.
Past exam of the axiomatic set theory course of the University of Oxford 2011 1 c Solution by
Codex 0 2026-10-31
Every finite ordinal belongs to , so and . However, , whose elements are the hereditarily finite sets.
Suppose were an internal power set of . Internally , and is an available element of the structure. Thus the Axiom of power set would require . But means , which would put , a contradiction. ThereforeThis proves power-set failure at the first rank above V omega by an internal obstruction, including the subset itself.
Past exam of the axiomatic set theory course of the University of Oxford 2011 1 b Solution by
Codex 0 2026-10-31
Fix . Since is a limit ordinal, choose with . Transitivity gives . Every subset therefore belongs to , and consequentlyThe last inclusion uses , since a finite number of successor steps remains below a limit ordinal. In particular every subset of is also an element of the transitive set .
Take . For any , transitivity ensures that the internal statement agrees with the external one. HenceSuch a exists for every , so satisfies the Axiom of power set. This power-set axiom at limit ranks actually holds for every nonzero limit ordinal; the stated restriction is sufficient.
Past exam of the approximation theory and finite element methods course of the University of Oxford 2010 B 6 Solution by
Codex 0 2026-10-31
The bilinear square finite element contains the terms . In anticlockwise corner order beginning at , its shape functions areThe mass matrix has entries . Each product separates into one-dimensional factors, with and . Diagonal, adjacent-corner and opposite-corner entries are respectively , , . ThusNumber global grid nodes by , with , and . For an interior node, four elements contribute to its diagonal, two to each axial neighbour and one to each diagonal neighbour. Its global row therefore has the nine-point stencilIn the stated ordering the axial entries occur at columns and ; the four diagonal ones occur at . No boundary degrees of freedom have been removed.
For general valid quadrilaterals, use an isoparametric finite element. Map the unit square to an element by and define physical shape functions . Require a one-to-one nondegenerate map and compatible common edges. On a shared edge the map and the trace of each shape function are linear between the same endpoints; the neighbouring traces therefore agree. The assembled functions are continuous and lie in , giving a conforming finite element space. On a non-parallelogram the pulled-back functions are generally not bilinear polynomials in the physical coordinates themselves.
Past exam of the approximation theory and finite element methods course of the University of Oxford 2010 B 5 Solution by
Codex 0 2026-10-31
Take the affine trial space and the test space . Multiplication by and integration by parts incorporate the right Neumann boundary condition as a load:For the continuous piecewise-quadratic trial space, impose the left value exactly and use the same equation for every piecewise-quadratic test function vanishing at . With a basis of that test space and , the finite element equations areThe Endpoint Poincaré inequality, reflected about the interval midpoint, makes the derivative norm a norm on . Galerkin orthogonality then gives the exact best-approximation identity: for every admissible ,Therefore minimizes the derivative error over all admissible piecewise-quadratic functions.
To prove the requested error bound, assume . Then and . We need an elementary Poincare-Wirtinger inequality on each element of length : if has mean zero, its continuous representative has a zero somewhere, and the fundamental theorem of calculus and Cauchy-Schwarz inequality give .
Choose an affine function whose slope is the average of on and whose average equals the average of . Then and both have mean zero. Applying the just-proved bound twice yieldsDefine a quadratic interpolant on by integrating from the true left-endpoint value. The equal-average condition ensures that it reaches the true right-endpoint value, so these pieces join to an admissible continuous piecewise-quadratic function . Sum the squared estimates and use the best-approximation property:Only the maximum element length is used; equal spacing is unnecessary.
For the Aubin–Nitsche duality argument, let and solve , , . Explicitly , so . Integration by parts and Galerkin orthogonality givewhere is its nodal piecewise-linear interpolant, which belongs to the quadratic test space. On each element is the average of , so the same mean-zero inequality gives . Canceling when nonzero proves the additional order:
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





