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 2008 iii Paper 10 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Suppose is generated by elements. An index of a subgroup gives a transitive action of on cosets. After labelling them by , this is a homomorphism , and the subgroup is the stabilizer of one label. There are at most homomorphisms, since images of the generators determine the map, and at most point stabilizers for each map. Thus there are finitely many subgroups of each specified finite index, with the coarse bound .
The finite residual isIt is equivalently the intersection of the kernels of all homomorphisms to finite groups. Intersecting all finite-index subgroups gives the same subgroup, since each contains its normal core, a normal subgroup of finite index. A residually finite group is one with , equivalently every nonidentity element survives in a finite image.
A Hopfian group is one whose surjective endomorphisms are all injective, hence automorphisms. Let be surjective, retaining the finite-generation hypothesis. For each , pulling back by sends a normal subgroup of index to another normal subgroup of the same index. It is injective on this finite set: equality of two preimages implies equality of the subgroups because is surjective. Therefore it is a permutation. For every finite-index normal subgroup , some satisfiesIt follows that . Intersecting over proves finite residual contains surjective endomorphism kernels:If is also a residually finite group, this forces every surjective endomorphism to have trivial kernel, proving that a finitely generated residually finite group is Hopfian.
For the specified Baumslag-Solitar group, use the convention and writeIn the abelianization, the defining relation gives , so the image of is zero, while generates an unrestricted infinite cyclic group. Thus through the exponent sum of . The kernel is generated by all : any word can be rewritten as a product of conjugates of followed by the final power of . Alternatively , so all , while killing them leaves a cyclic quotient. Therefore
Define and . This respects the defining relation becauseThe image contains , , and , hence contains and is all of . It is not injective. Indeedmaps to . But it is a reduced word in the HNN extension with associated subgroups and . Its potential subwords do not have even exponent, and its potential subword does not have exponent divisible by three. It has no pinch in an HNN extension, so Britton's lemma gives . We have explicitly exhibited a surjective, noninjective endomorphism.
It remains to treat the whole second commutator subgroup, not just this one kernel element. SetThese kernels form an increasing sequence of normal subgroups, so is a normal subgroup. Every iterate is surjective, and the preceding finite residual argument gives .
Conjugating the defining relation gives for every integer . Repeated substitution gives, for ,Also . Thus when ,Every pair of the generating elements of therefore commutes modulo . The image of in is abelian, which means . This proves the full statement using iterated endomorphism kernels in BS(2,3):
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 10 3 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A finitely presented group is one isomorphic to , where and are finite, is the free group on , and the double brackets mean normal closure. Equivalently, there is a surjection from a free group of finite rank onto whose kernel is normally generated by finitely many words. The universal property of the free group extends choices of generator images uniquely, and quotienting imposes the chosen relations.
For the semidirect product, choose finite group presentationsFor each , choose an -word representing . We claim that a finite presentation of a semidirect product isAll relations hold in the desired semidirect product, so the presented group maps onto it. We must also show there are no extra elements in the kernel. For inverse conjugations, choose an -word representing . Conjugating this word by using the displayed relations gives an -word representing , so proves . Thus we can move both positive and negative -letters to the right, rewriting every word as . If its image in is trivial, projection to makes trivial using ; its remaining image in then makes trivial using . The kernel is trivial, proving the claim and finite presentability.
For a poly-infinite cyclic group, write its subnormal series as with infinite cyclic factors. Given a subgroup , intersect the series with . The homomorphism has kernel , soEach factor is trivial or infinite cyclic; deleting repetitions gives a poly-infinite cyclic series for . For an extension with poly-infinite cyclic groups, lift the series of to its full preimages in and append the series of . The lifted quotient factors are those of , and the lower factors are those of . Normality at every consecutive step is preserved. This proves closure under both subgroups and extensions.
Finite presentability follows by induction on the length of a poly-infinite cyclic series. The trivial group is finitely presented. For a nontrivial group, its first proper term has a shorter series and . Lift to an element . Its powers give an injective section of the quotient map, since maps to . Hence . By induction is finitely presented, and has a finite presentation. The finite presentation of a semidirect product proved above completes the induction. Thus every poly-infinite cyclic group is finitely presented.
For the final example, take the dyadic affine Baumslag-Solitar groupwhere the generator of acts on the additive group by multiplication by two. Here is a verification of this identification, rather than an assumption about the presentation. Put for . The relation gives , soTheir union is abelian and is normal: conjugation by shifts to , while conjugation by shifts to for and sends to . Every word can consequently be written for some and .
Let act on the rational line by and by . These affine transformations satisfy the relation, and acts by . It is the identity only when . Thus the action is faithful and identifies with all dyadic translations. We have the required seriesBoth factors are torsion-free abelian groups, and is visibly finitely presented. But is not finitely generated, since finite sets have bounded powers of two in their denominators. Every poly-infinite cyclic group has the maximal condition on subgroups: its factors have that condition, and Question 1 proves closure under extensions. Therefore cannot be poly-infinite cyclic. This gives a finitely presented counterexample to replacing infinite cyclic factors by arbitrary torsion-free abelian factors.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 10 2 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The free product is a group with homomorphisms from such that any pair of homomorphisms extends uniquely to a homomorphism . Concretely its elements are reduced words with nonidentity syllables alternating between the factors. Multiply by concatenating and then combining adjacent syllables from the same factor, deleting identities. The empty word is the identity, and this normal form theorem for a free product also makes the factor maps injective.
The Klein combination theorem, in its ping-pong form, is as follows. Suppose two nontrivial subgroups act on a set , with disjoint nonempty subsets , such thatIf at least one factor has at least three elements, then through the natural factor maps. The cardinality condition is needed in this version: two order-two groups can have the same image swapping the two domains.
Here is the proof. Assume . A reduced word beginning and ending with an -syllable sends into by successive application of the displayed inclusions, so cannot act as the identity. A word beginning and ending in becomes one of the preceding type on conjugating by any nonidentity . If it begins in and ends in , choose different from both and its first syllable. The word remains reduced after combining its first two syllables and begins and ends in , so again it is nonidentity. If it begins in and ends in , apply this last argument to its inverse. Every nonempty reduced word is covered, so the natural homomorphism has trivial kernel. This proves the Klein combination theorem.
Apply it to the two cyclic groups generated by the given Möbius transformations. On takeTheir powers areFor and , , so . For , put ; thenso . The powers displayed also show that both transformations have infinite order. The Klein combination theorem consequently gives
For the finite-index formula, realize the free group as the fundamental group of the rose with edges. A subgroup of index corresponds to a connected -sheeted covering graph. Explicitly, its vertices are right cosets and for each basis generator there is a directed edge projecting to the corresponding rose edge. This graph is connected because basis words reach every coset, and the based loops correspond precisely to words in .
The covering graph has vertices and geometric edges: each positively oriented rose edge has one lift from each vertex. A maximal tree has edges, and the complementary edges freely generate its fundamental group. Thus is a free group with the Nielsen–Schreier formulaThis uses the connected cover associated with ; no claim that arbitrary disconnected covers are connected is needed.
Finally the specified basis of gives . Its abelianization is , by the universal property of the free group, and reduction modulo two gives a quotient . Images of any generating set must span this -dimensional vector space, so it contains at least members. Therefore , and the same argument applies to the free group above.
Using exactly the unshifted definition printed in the paper, the unshifted rank gradients are determined byThe supremum is , attained for . For , mapping one basis generator onto a generator of and the others to zero provides subgroups of every positive index . Hence the infimum is , approached as :For the trivial free group , both values are zero. Subtracting one from would change the upper answer; that is a different convention from the one requested here.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 10 1 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The maximal condition on subgroups, denoted , says that every ascending sequence of subgroups eventually stabilizes. Suppose a subgroup were not finitely generated. Starting with the trivial subgroup, repeatedly choose an element of outside the subgroup generated so far. This produces a strictly ascending sequence, contradicting .
Conversely, suppose every subgroup is a finitely generated group. The union of an ascending sequence is a subgroup. A finite generating set of lies in a single , since the sequence is ascending. Thus , and for all . We have proved
For the extension arguments, let and let be the quotient map. If and are finitely generated groups, choose generators of and lifts of generators of . For every , its image is a word , so . ThereforeHere denotes the minimal number of generators. If instead and satisfy the maximal condition on subgroups, take any . Its intersection and its image are finitely generated by the condition in those two groups. The exact sequence and the preceding argument make finitely generated. The equivalence already proved now gives for . Hence both finite generation and the maximal condition are preserved by group extensions.
An infinitely generated group of finite Prüfer rank is the additive group . A finite set of rational numbers lies in for a common denominator , and its generated subgroup is cyclic: after multiplying by , use the greatest common divisor of the integer numerators. Every finitely generated subgroup of therefore needs at most one generator, while needs one. But no finitely generated subgroup contains once its elements all lie in . Thus
If has Prüfer rank , every finitely generated subgroup of any subgroup is also a finitely generated subgroup of , so . For a quotient , let be finitely generated and choose lifts . The subgroup needs at most generators and maps onto , so . This proves the rank bound for every subgroup and quotient.
Now suppose and have Prüfer ranks and . For finitely generated with also finitely generated, the extension generating argument givesThe final request needs an argument even when is not finitely generated. Write . Choose at most elements whose images generate , omitting unused entries if fewer are needed. For each , choose a word in these with the same image and setThe finitely generated subgroup of has generators , again allowing fewer. Each original belongs to , and all these new generators belong to . Thus without requiring finite generation of the full intersection. Taking the supremum proves the Prüfer rank bound for extensions:
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 1 6 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a unital star-subalgebra , the Von Neumann double commutant theorem statesHere is the commutant of an operator algebra, consisting of operators commuting with every element of . The double commutant is closed in either topology: multiplication by a fixed bounded operator is continuous in both. Therefore both closures of lie in .
For the converse, let and choose finitely many vectors . In putIt is invariant under the diagonal action of and its adjoints, so its orthogonal projection commutes with that diagonal action. Consequently each matrix entry belongs to . The diagonal operator with entry therefore commutes with . Since , the tuple belongs to , and hence so does . By the definition of , one element approximates this entire tuple arbitrarily closely. This is exactly approximation in every strong-operator neighborhood of . It proves and thus both asserted equalities. In particular, is a Von Neumann algebra.
The Kaplansky density theorem strengthens the result by preserving norm bounds:It also holds for the self-adjoint and positive unit balls; the full ball can in fact be approximated in the strong-star topology, meaning strong convergence of both operators and adjoints. We prove the bound rather than merely scaling the unbounded approximants furnished by the double commutant theorem.
First put , a unital C-star algebra. Its self-adjoint part is weak-operator dense in : symmetrize any weak approximating net. For a convex subset, strong and weak operator closures agree. To see this explicitly, separation from a strong closure supplies a continuous real functional on finitely many image vectors, hence one of the form , which is also weak-operator continuous. The Hahn-Banach separation theorem would then separate the point from the weak closure as well. Thus every self-adjoint is a strong limit of self-adjoint , initially without a common norm bound.
The needed functional-calculus continuity follows directly from resolvents. The resolvent identity givesThe first factor has norm at most one, so the right side tends strongly to zero. The same holds at . Both resolvent nets are uniformly bounded, so their products converge strongly. Their scalar functions generate a self-adjoint algebra separating points of and vanishing at infinity. The Stone-Weierstrass theorem, applied to the one-point compactification, makes this algebra uniformly dense in . Uniform approximation and the functional-calculus norm bound therefore showThis proves strong continuity of functional calculus through resolvents without an unjustified uniform bound on the original .
If and , choose a real compactly supported continuous equal to the identity on and bounded in absolute value by one. Then are self-adjoint contractions and converge strongly to . For a positive contraction , choose instead equal to the identity on ; this gives positive contractions. These prove the two restricted versions for .
For an arbitrary contraction , apply the self-adjoint result in the matrix algebra toThe strong closure of is , since finitely many entries may be approximated simultaneously. The upper-right entries of the approximating self-adjoint contraction matrices belong to , satisfy , and converge strongly to . The lower-left entries are and converge strongly to . This proves the full strong-star assertion for .
Finally transfer the bounds from to the possibly nonclosed algebra . A contraction has an approximant with , so is an -contraction within of . Self-adjoint approximants are obtained by symmetrizing first. For a positive contraction, approximate by and use the positive contraction , which tends in norm to as . Combining these norm approximations with each finite-vector strong approximation proves all versions for . The reverse inclusions follow because the relevant norm bounds and the inequalities defining a positive operator are preserved by strong limits.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 1 4 Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a discrete group, one standard definition of amenability is the fixed-point property: every continuous affine action on a nonempty compact convex set in a locally convex space has a fixed point. The equivalent state formulation, which may be stated without proof here, is that there is a left-invariant invariant mean on . Equivalently, every unital left-translation-invariant star-subalgebra of admits a left-invariant state, with continuity for the supremum norm; one may equally pass to its norm closure. A state means a positive linear functional of norm one with value one on the constant function one. Restriction proves the subalgebra formulation from the full-algebra version, and taking the full algebra proves the converse. Such a mean is finitely additive on indicator functions, not necessarily countably additive.
Write on and on bounded functions. We prove equivalence of this mean condition, the Reiter condition, and existence of a Følner sequence.
Assume first that an invariant mean exists. Fix a finite set . In the real Banach space with sum norm, consider the convex setIf zero were outside its norm closure, the Hahn-Banach separation theorem would give bounded real functions and such thatfor every such . Testing point masses at showsApplying the positive invariant mean makes the left side zero and the right side at least , a contradiction. Therefore zero is in the closure: for any a finitely supported probability measure makes the sum of the translation defects over less than . Enumerate the countable group, take the first elements for and , and obtain a sequence satisfying the Reiter condition. This proves (1) implies (2).
Next assume (2). An probability measure can be approximated in norm by finitely supported probability measures, by restricting to a large finite set and renormalizing. Replacing by changes each defect by at most . Thus simultaneous small defects for finitely many translations can be achieved with finite support.
For such , set . The elementary identity for givesIf the sum of defects over is less than , some with must satisfy ; otherwise integration would contradict that strict inequality. Applying this layer-cake extraction of Følner sets to successive finite sets of translations gives nonempty finite with each relative boundary tending to zero. Hence (2) implies (3).
Conversely, normalized counting measures satisfyso (3) implies (2). Finally, from (2) define states . The dual unit ball of is weak-star compact by the Banach-Alaoglu theorem; take a convergent subnet, since this compactness need not be metrizable. Its limit is positive with , andThus is invariant, proving (2) implies (1). Together these implications establish all three equivalences. Countability is used to obtain sequences from finite tests; it is not a justification for replacing the compactness subnet by a subsequence.
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





