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 2009 iii Paper 10 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Gelfand-Mazur theorem says that a nonzero complex unital Banach algebra in which every nonzero element is invertible is isomorphic to by the scalar map . With the usual normalization , that isomorphism is isometric. Commutativity need not be assumed in the theorem; it follows from the conclusion.
Every complex Banach division algebra is the scalar field. We use complex scalars throughout this question, including for ; the complex-algebra character and spectrum conclusions depend on that convention.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Part (c) makes relatively open in . It is also relatively closed: if a sequence in converges to , part (e) forbids . Sequences detect closure here because the topology comes from a norm.
Intersecting this clopen subset with any connected component of gives a clopen subset of the connected space . It is therefore either empty or all of . Thus is the union of those connected components of that it meets. This is connected-component permanence of subalgebra invertibility; it does not require connected components to be path connected.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose the inverse norms did not tend to infinity. Some subsequence would satisfy . Since , for its large indices . Thenis invertible in by the Neumann series, contradicting the hypothesis. Hence , the inverse norm divergence at noninvertible boundary points property.
If were invertible in , then continuity of inversion in a Banach algebra would give in . Explicitly, the same factorization around gives a Neumann series and the bound , with the inverse norms locally bounded in . Since every belongs to the closed subalgebra , so would . That would make , again a contradiction. Therefore .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let . From the two inverse identities we have . The candidate inverse isIndeedandBoth products have been checked, so this is valid in a noncommutative Banach algebra. It is the identity underlying the nonzero spectra of products in opposite orders result.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For , any with has the factorizationThe second factor has a Neumann series inverse in , so . Hence the group of invertible elements of a Banach algebra is open in .
For use its inverse in instead. The same small-perturbation argument proves invertibility of in whenever and . Therefore both and are open subsets of ; in the second argument the inverse need not lie in .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Because is a closed subalgebra of a Banach algebra, it is itself complete. If , the Neumann series converges in :Multiplying the partial sums by on either side gives , which tends to . Thus every such is invertible in , and is an interior point of .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For strictness, take , where is the unit circle, and let be the uniform closure of the polynomials in the coordinate function . This is a closed unital subalgebra of the Banach algebra . The coordinate has inverse in . But cannot belong to : for every polynomial ,and the same identity holds for every element of by uniform convergence. It fails for , since . Thus . This algebra is the boundary realization of the disk algebra.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write with , where is real valued. The normalization and the operator norm bound imply, for every real ,The left side is , soDivide by and let to obtain . Divide by , reversing the inequality, and let to obtain . Thus for every real-valued . The first-order term in is what forces reality; this is the complex-functional step in the unital contraction positivity criterion.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
We construct the Jordan decomposition of a bounded functional on C(K) directly, without assuming a measure representation. For , defineThis is finite, nonnegative, and positively homogeneous, since is allowed and . If , separately chosen approximate maximizers add to an admissible function for , giving . For the converse, any splits into the continuous functionswith and . Hence and is additive on the positive cone.
Extend it to a linear functional by for . This is well defined: two decompositions satisfy , and additivity gives the same difference. Every continuous real function has such a decomposition, for example into its pointwise positive and negative parts. The extension is positive. Define ; for , the choice shows , so is also positive. Part (a) makes both positive linear functionals continuous.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Put . If , the linear functional is zero and is positive. Otherwise, for a nonzero let . Then and , so boundedness givesPositive rescaling gives . Thus is a positive linear functional. This is the scalar form of the unital contraction positivity criterion.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Positivity of the linear functional gives monotonicity. For any , the pointwise bounds therefore implyThus the positive linear functional is bounded, hence continuous, and its operator norm is at most . Evaluating on the constant function , which has supremum norm one when is nonempty, gives the reverse inequality. HenceFor empty the function space and functional are zero, so the same conclusion holds. This is the norm of a positive functional on C(K) identity.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 f Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
By part (a), is a bounded continuous function, hence is Borel measurable and integrable for the given probability measure. By part (e), , and its restriction to the unit ball is also bounded and integrable. For every , the supporting inequality says . Taking expectations and using the barycentre hypothesis for this particular givesThus , the Jensen inequality. This proof only uses the stated weak barycentre identity; a vector-valued integral for the identity map is not needed.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The bound in part (b) and domination give . Applying the same bound to , and using linearity, gives . ConsequentlyA bounded linear functional is continuous, so belongs to the continuous dual space . The domination by a sublinear functional alone was algebraic; the local Lipschitz continuity supplies the needed boundedness.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The dominated real form of the Hahn-Banach theorem extends the zero linear functional on to a linear functional with everywhere. If , convexity of the ball puts the whole segment in . Its increasing secant slopes giveThereforeThis constructs a supporting affine minorant at . Part (e) shows that it is a continuous supporting functional for a locally bounded convex function.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write . Rescaling the parameter in the directional derivative gives for , and handles . For sufficiently small , convexity givesSubtract , divide by , and let . The finite limits from part (b) giveThese are exactly the defining conditions of a sublinear functional. In particular, a directional derivative of a convex function is sublinear; it need not be linear.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix , and take sufficiently small that . For , convexity along the line segment givesThus the positive secant slopes are nondecreasing in their parameter, and have a limit as the parameter decreases to zero. The local Lipschitz continuity from part (a) bounds their absolute values by , where . Hence the directional derivative exists as a finite real number andFor it is zero.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 10 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose with on , and fix . We prove a local Lipschitz continuity bound, which gives more than continuity. Let , put , and suppose . The point lies in , while andBy convexity, . Interchanging givesThe case is immediate. Every point has such a neighborhood, so is locally Lipschitz and therefore continuous throughout . This is the bounded convex functions are locally Lipschitz on an open ball argument; no finite-dimensional assumption is needed.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 6 vi Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False, even when the HNN extension also has a finite presentation. Take the base and its Mihailova subgroup from Question 4(b). Its word problem for a group is soluble: project a word to each free factor and freely reduce both projections, as in part (iv). The base is finitely presented, but the HNN extensionhas insoluble word problem by the explicit reduction in Question 4(b). Namely, for an input word in the presentation with insoluble word problem, set ; thenThe obstruction is undecidable membership in the associated subgroup, not undecidable equality in the base. Soluble base word problem alone does not let one recognize the pinches needed for a normal form theorem for an HNN extension algorithm.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 6 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False. Use the two-generated group constructed in part (iii) for a non-recursively-enumerable . Sending the two free generators to gives a surjective group homomorphismThe source is a finitely presented group, with presentation . The target is not finitely presented: if it were, its null words could be enumerated from a finite set of relators, and the tested commutators would enumerate , as proved in part (iii). Thus even a quotient of a rank-two free group need not admit a finite presentation. A quotient by a finitely normally generated kernel would be finitely presented, but the assertion places no such restriction on its kernel.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 6 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
True. Let and , using disjoint finite generating alphabets. The direct product of groups has finite presentationThe commuting relations let every word be reordered as a word in followed by a word in ; the two projections then show that no additional relations within either factor are imposed. For an input word , form its projections and by deleting all letters from the other factor. Evaluate each projection with the given word problem for a group algorithm for that factor. The product coordinates giveBoth component algorithms halt, so this is a terminating algorithm. No subgroup-membership procedure or comparison between unknown presentations is required.
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





