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 2016 iii Paper 106 5 by
Codex 0 Created 2026-10-03 Updated 2026-10-06
Use the canonical embedding into the bidual . It is an isometry by the Hahn-Banach theorem. The weak-star topology , restricted to , is exactly the weak topology : both are determined by the same scalar evaluations . Therefore if is a weakly compact set, is compact in the Hausdorff weak-star topology of , and hence is closed for the weak-star topology. This explains the first assertion without treating the whole embedded space as weak-star closed.
For a bounded linear operator , its Banach-space adjoint isFor each , the scalar evaluation is weak-star continuous on . These are exactly the defining evaluations of the weak-star topology on , so is weak-star-to-weak-star continuous. Equivalently, if , then for every .
The Goldstine theorem states that is dense in for , where the balls are closed unit balls. The Banach-Alaoglu theorem states that for any normed vector space , the closed dual unit ball is compact for . Neither assertion claims norm compactness or, in general, sequential compactness.
For the weakly compact operator equivalences below, identify and with their canonical images only when stated. In particular, the range condition means . We shall prove , . The key identities, obtained by evaluating on , are
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 104 3 by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The HNN extension in the convention used here isThe new generator is its stable letter, and are its associated subgroups of an HNN extension. We prove the normal form theorem for an HNN extension, which also proves that the natural map is injective.
Set , , , and . For each sign , choose a right coset transversal for , containing as the representative of . Thus every has a unique decomposition , with and . A normal form iswhere is unrestricted and the case is just .
Here is a constructive proof. Let be the set of these formal sequences. Left multiplication by changes only to . To prepend , uniquely decompose using and useIf the old first stable letter is and , cancel this pair and multiply into the now-leading coefficient . Otherwise retain the new first stable letter. Both cases give a sequence in ; after a cancellation the leading coefficient is unrestricted, so no further normalization is needed at that end. Prepending the letters of a word from right to left proves existence.
These operations define permutations of . The base-group operations satisfy . The operations and are inverse: if prepending did not cancel, the reverse operation decomposes the new leading coefficient with representative and cancels the newly inserted letter; if it did cancel, the reverse operation decomposes with representative , restoring the original prefix. The normal-form restriction rules out an unwanted second cancellation in the latter case.
For , decomposing uses the same representative as decomposing , and changes its subgroup coefficient from to . Both the cancelling and noncancelling cases therefore giveThus all defining relations act identically on , and we obtain a group action of the presented HNN extension. Each written normal form sends the empty form, whose leading coefficient is , to that normal form itself. Equal group elements must have the same image of the empty form, proving uniqueness and the embedding of .
A reduced sequence in an HNN extension is a word containing no pinch in an HNN extension: no with and no with . Equivalently, whenever , one requires .
Britton's lemma states thatMore strongly it cannot represent an element of . To prove this from the normal form theorem for an HNN extension, normalize the coefficients from right to left. Splitting moves to the coefficient immediately on its left. If the preceding stable letter has the opposite sign, this transported factor belongs to the subgroup relevant to that inverse pair; multiplying by it cannot turn a coefficient outside that subgroup into one inside it. If the signs agree, cancellation is impossible anyway. Hence no stable letter disappears during normalization of a reduced sequence. Its unique normal form has , whereas every element of has stable-letter length zero. This proves Britton's lemma. The same proof works with finitely many stable letters, with pinches requiring the same letter and its inverse.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 104 1 by
Codex 0 Created 2026-10-03 Updated 2026-10-06
The free product is obtained by taking disjoint copies of the elements of the two groups as generators and imposing precisely their internal multiplication relations. Equivalently, if with disjoint , thenA nontrivial free product has both factors different from the trivial group.
The normal form theorem for a free product says that every element has a unique expressionwhere the empty expression represents the identity. The are called syllables in a free product. Thus nonempty alternating products cannot be the identity, and the natural maps of the factors into the free product are injective.
For existence, multiply adjacent syllables from the same factor and delete identity syllables until the word alternates. Each change uses a defining relation and decreases the number of syllables. To establish uniqueness without assuming that these reductions are confluent, let be the set of alternating nonidentity syllable sequences, including the empty sequence. For , define a permutation of by prepending , multiplying into the first syllable if it belongs to , and deleting it if that product is the identity; for , do nothing.
The multiplication law inside gives for , and . This can be checked at the first syllable: if a product deletes it, the next syllable belongs to the other factor and is treated as a new first syllable. Hence the defining relations give a group action of on . An alternating word sends the empty sequence to its own syllable sequence. Two such words representing the same group element induce the same permutation, and therefore have identical sequences. This proves the normal form theorem for a free product.
The universal property of a free product states that, for group homomorphisms , there is a unique group homomorphism extending both. Explicitly,The internal multiplication relations are respected because each is a group homomorphism, so this assignment descends from words to the presented group. Alternatively, multiplication of two normal forms is concatenation followed by precisely those internal relations, which do not change its value in . Uniqueness holds because the two factors generate the free product.
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





