Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the computer science course of the University of Oxford 2019 Algorithms 2 a ii Solution by
Codex 0 2026-10-25
An extreme point cannot be written as a nontrivial convex combination of two distinct points of : if with and , then .
A vertex of a linear polyhedron is a feasible point at which the active constraints include linearly independent row normals. Equivalently, some independent bounding hyperplanes intersect uniquely at that point. This definition does not require to be bounded or full-dimensional. For a linear polyhedron, it is also equivalent to the point uniquely maximizing a suitable linear function: sum the selected active inequalities to construct one such linear function.
Past exam of the computer science course of the University of Oxford 2019 Algorithms 2 a i Solution by
Codex 0 2026-10-25
Take and . Their convex combination satisfiesThus every such convex combination remains in , so is a convex set. The assertion also holds when is empty.
Past exam of the complex analysis: conformal maps and geometry course of the University of Oxford 2023 2 d Solution by
Codex 0 2026-10-25
Use the simply connected domain shown in the diagram. A Riemann mapping theorem map followed by an automorphism of the unit disk sends its marked points to and . Split this disc along its real diameter. Map the upper conformal quadrilateral from c to a rectangle , with and as vertical sides and as its bottom. The lower half is a second identical rectangle. The full disc is obtained by gluing the two rectangles along their two vertical sides and their bottom sides; the two top sides form the original outer boundary.
In this doubled rectangle extremal-length duality, loops enclosing both marked bottom corners have shortest flat length . They must meet both vertical seams, and a closed curve's total horizontal travel is at least ; the doubled horizontal segments attain it. Crosscuts separating the two corners must meet the bottom seam, and run from outer boundary back to outer boundary. Their total vertical travel is at least , attained by doubled vertical segments. The total flat area is .
These flat metrics are extremal, not merely lower bounds. For an arbitrary metric, average the lengths of the doubled horizontal segments over their height and apply the Cauchy-Schwarz inequality to get . Averaging the doubled vertical segments gives . ConsequentlyThe conformal metric on the doubled rectangles pulls back to an admissible metric on the original punctured domain; the two marked corner points have zero area. Here consists of crosscuts with endpoints on the outer boundary, as drawn. Boundedness alone, without the illustrated domain topology and the specified curve families, would not justify this construction.
Past exam of the complex analysis: conformal maps and geometry course of the University of Oxford 2023 2 c Solution by
Codex 0 2026-10-25
Regard the upper half-disc, with cyclic boundary vertices , as a conformal quadrilateral. Map it to a rectangle of width and height , so the boundary arcs and become its vertical sides. The rectangle formulas for the conformal modulus of a quadrilateral giveThe remaining two boundary arcs, and the semicircle, become the horizontal sides. Thus these are precisely the dual joining families in the same quadrilateral.
Past exam of the complex analysis: conformal maps and geometry course of the University of Oxford 2023 2 b Solution by
Codex 0 2026-10-25
The symmetry rule for extremal length says that if a domain and its curve family are invariant under reflection, the supremum defining extremal length may be taken over reflection-invariant conformal metrics. More generally, for a conformal or anticonformal involution , use metrics satisfying .
Past exam of the complex analysis: conformal maps and geometry course of the University of Oxford 2023 2 a Solution by
Codex 0 2026-10-25
By conformal invariance of extremal length, work first on . For a conformal metric , let be the infimum of lengths of curves joining the two circles, and its area. Each radial segment is admissible, so the Cauchy-Schwarz inequality gives, for every angle,Integrating in angle gives . Conversely, has shortest joining length and area , attaining the bound. Thus the conformal modulus of an annulus givesThe second formula is the pullback of by . Pullback preserves curve lengths and metric area, so every displayed positive multiple is an extremal metric in .
Past exam of the complex analysis: conformal maps and geometry course of the University of Oxford 2023 1 a Solution by
Codex 0 2026-10-25
For , the automorphism of the unit disk sends to zero. The holomorphic function maps the unit disc into itself and satisfies . The Schwarz lemma therefore gives . Evaluate at to obtain the Schwarz-Pick theorem:The denominators do not vanish because both their products have modulus less than one.
Past exam of the commutative algebra course of the University of Oxford 2023 3 e Solution by
Codex 0 2026-10-25
Set , a quotient module. The exactness of localization gives, for every maximal ideal ,If , the hypothesis makes this quotient module zero. If , choose . Its image in is a unit, so and the displayed quotient module is again zero. ThusFor completeness, if , its annihilator is a proper ideal, and hence lies in a maximal ideal . The vanishing criterion in a module localization shows in : any element annihilating lies inside . This contradicts the vanishing just proved. Hence , andThe use of localization detects zero elements is valid for every module; neither finite generation nor a Noetherian hypothesis is needed.
Past exam of the commutative algebra course of the University of Oxford 2023 3 d Solution by
Codex 0 2026-10-25
Let be the nilradical of . By b, the reduced locus of a ring isThe Noetherian ring hypothesis makes the ideal finitely generated; write . Fix . For every , the vanishing criterion in a module localization gives with . The product lies outside the prime ideal and satisfies . When , take .
For every prime ideal in the distinguished open setthe element is a unit in . The equality therefore implies , so is reduced. Thus , proving that is a Zariski-open subset of the spectrum of a ring.
More precisely, let , the annihilator of a module . The argument shows that if and only if some lies outside . HenceEquivalently, the complement is the support of a module . This is vanishing of a finitely generated module near a prime applied to : its finite generation lets the separately chosen denominators be combined into one element annihilating all of .
Past exam of the commutative algebra course of the University of Oxford 2023 3 c Solution by
Codex 0 2026-10-25
If is reduced, its nilradical is zero. By b, every localization at a prime ideal has zero nilradical, so in particular is reduced for every maximal ideal .
Conversely, suppose every such localization is reduced. Take a nilpotent element . Then is nilpotent in every , hence zero there. To see directly that , suppose otherwise and consider the proper annihilatorChoose a maximal ideal containing this annihilator. The equality in would imply for some , by the vanishing criterion in a module localization. But then , a contradiction. This is the principle that localization detects zero elements. ThereforeThe argument also includes the zero ring, which is reduced and has no maximal ideals.
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





