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 1 6 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False. We construct a two-generated countable group that cannot embed in any finitely presented group. Choose a subset which is not a recursively enumerable set, for example a positive-integer coding of the complement of the halting set. Such sets exist because there are only countably many finite programs but uncountably many subsets of the positive integers. On generators indexed by , form the possibly infinite-graph Right-angled Artin groupThe shift preserves the defining relations and has inverse shift , so it is an automorphism. Form the semidirect productIts base embeds by the definition of a semidirect product. Since , the group is generated by just and is countable.
The shift-invariant graph groups encode arbitrary sets construction has the exact testThe forward direction for is a defining edge relation. If , kill all vertex generators except . Every defining commutator then either contains a killed generator or is trivial; no relation is imposed between these two retained generators. Thus there is a retraction of onto the rank-two free group on . Their commutator is a nonempty reduced word there, so it is nonidentity in and remains so in .
Now suppose embedded in a finitely presented group . Choose fixed words in its finite generators representing the images of . The null words of are recursively enumerable: enumerate all finite products of conjugates of its relators and their inverses, then freely reduce. Substituting into and dovetailing these enumerations for all would enumerate exactly , contradicting its choice. These finitely many image words may be hard-coded; the argument does not require an algorithm finding an embedding. This proves the enumerable identities of finitely generated subgroups obstruction and supplies a concrete construction of the required countable counterexample.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 6 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False: free rank is not monotone under subgroup embeddings. In fact every finite-rank free group embeds in , hence in every with . Let freely generate a rank-two subgroup and set for .
To prove that these form a free basis of a group for their subgroup, take a nonempty reduced word and combine each maximal run with the same index into a block , with and . Its expansion isEvery interior power and every power is nonzero, so the free reduction leaves a nonempty word. This proves the conjugates of one free generator freely generate property and injectivity of . In particular,
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 6 i Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
False. Take the finite, hence countable, cyclic group . Its elements and have orders two and three. A group embedding preserves the order of every element, whereas conjugate group elements have the same order: . Therefore their images cannot be conjugate in any containing group. This gives the required obstruction. The torsion-free group hypothesis in Question 5 avoids this conflict of element orders.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let send the free generators to the given presentation generators, and let , the normal closure of the relators . The Mihailova subgroup here is exactly the fiber product of groupsTo prove this equality, each specified generator belongs to the displayed fiber product, so is contained in it. The diagonal generators produce every . Conjugating by a diagonal element gives ; products give all for . Conversely, if , then andIn particular if and only if in . Thus membership in this finitely generated subgroup is undecidable, despite the soluble word problem for a group in the ambient direct product of groups .
For an explicit finite presentation, use and for the first and second copies of the free basis. The base has presentation . The pairs and are and . Consequently the requested HNN extension has the finite presentationCommutation with the displayed subgroup generators implies commutation with all their products and inverses, so these finitely many relations are exactly the specified centralizing extension. The associated subgroup is on both sides, and the associated isomorphism is the identity.
For an input word in the generators of , form and the effectively constructed wordIf in , then and by centralization. If , then ; the displayed word contains stable letters and no pinch in an HNN extension, so Britton's lemma gives . This is the centralizing HNN extension detects subgroup membership equivalenceA solution of the word problem for a group in would therefore solve that in , a contradiction. The finitely presented extension has insoluble word problem.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the order of a group element , allowing . For finite , take ; for infinite , take . SetThe normal form theorem for a free product embeds both factors, so is a free factor. The cyclic subgroup has order , just as does. Hence is a well-defined group isomorphism , and we may form the HNN extensionThe single displayed conjugacy relation implements the full cyclic isomorphism by taking integer powers. Britton's lemma embeds in , so the original is preserved. Now takeCancellation of successive gives . This proves the adjoining a root by an HNN extension construction and all required embedding claims. If , then , , and ; the HNN relation is vacuous and the same calculation gives . The construction also works for . It uses the actual order of as an existence parameter, not an algorithm for determining an unknown order.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The allowed algebraic characterization is the Boone-Higman theorem:The simple group need not itself be finitely presented. The primary statement is Theorem I of An algebraic characterization of groups with soluble word problem. In particular, a finitely generated group with insoluble word problem for a group cannot embed in any finitely presented simple group: otherwise take that group as both and in the characterization.
Use the following effective form of the permitted Messuage lemma for groups. Given a finite group presentation of and a word , one can algorithmically write a finite presentation such that in implies , while implies that embeds in . The construction is performed without first deciding whether is trivial. A collapse-and-embedding lemma with these properties is also stated as Lemma 5.13 in Combinatorial Group Theory. No proof of that allowed lemma is needed here.
Fix a finitely presented group with insoluble word problem for a group, whose existence is allowed. For each input word in its generators, construct by the lemma and then form the finite presentation ofIf , then , which is a nontrivial simple group. If , the lemma embeds in , and the normal form theorem for a free product embeds in . If were simple, it would be a finitely presented simple group containing , contradicting the characterization. HenceAn algorithm deciding simplicity from arbitrary finite presentations would therefore solve the insoluble word problem for a group in . This proves simplicity of finitely presented groups is algorithmically undecidable. Using avoids any convention about whether the trivial group is called simple.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
All three generators commute, so the group is the abelian group modulo the integer relation lattice generated by and . Thus exactly whenEliminating gives , and is even. Conversely, if is even and , take and ; these are integers and reproduce all three coordinates. ThereforeOne can also see the invariant factors directly. The second relation gives . Substitution into the first gives . Put ; thenThe two presentations are equivalent by the explicit substitutions in both directions, so this is not just a quotient guess. An arbitrary input word is first converted, using commutativity, to its exponent totals . Its coordinates are , giving a terminating word problem for a group algorithm.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The class-two qualifier is essential: the presentation is in the variety of two-step nilpotent groups, so is included. Use the group commutator convention and put . Centrality and the allowed commutator identities give , so an ordinary finite presentation of the same group isThe commutator subgroup is generated by : modulo it the two generators commute, and centrality makes its normal closure simply its cyclic subgroup. To prove that has exactly order three and that no hidden relations remain, construct the group on triplesThe bilinear cross term makes multiplication associative: both bracketings contribute to the last coordinate. The identity is and the inverse is . The elements and have central commutator of order three, and generate .
Conversely permits word collection in a two-step nilpotent group, expressing every element as with taken modulo three. The map , , sends that collected word to . Equality of such coordinates is therefore necessary as well as sufficient. This proves the unique normal form and the requested finite presentations:To solve the word problem for a group, first total the exponents of and ; they give the quotient coordinates . If either is nonzero, the word is nonidentity. For the central coordinate, scan the word maintaining initially zero. Reading changes to , while reading changes to , with . Reduce modulo three. HenceFor example, , whereas . Both examples have zero abelian quotient coordinates; the second finite presentation detects their different central coordinates. The displayed one-relator presentation without the class-two laws would be a different group.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 1 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the quotient group homomorphism. Its restriction to is injective because its kernel there is . Since , for every generator. Let be the abstract free group on letters and define the surjective group homomorphism by . If , thenInjectivity on implies in . Those elements are a free basis of a group, so is the empty reduced word in . Thus . This is freeness detected by a quotient, and proves
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
In a homogeneous ambient fluid, and is constant. Use kinematic fluxes or, equivalently, the primitive form of the unsteady top-hat line-plume balances:Here is the positive buoyant reduced gravity. Seek a nonsteady separable power-law ansatz with both time differentiation and vertical transport retained. Matching powers in the volume equation forces with no time dependence. Matching the two momentum terms then gives , and the buoyancy force has , where is a shifted age. Thus writeSubstitution determines the constants rather than just the exponents. The volume equation gives , so for a nonzero buoyant plume . The momentum equation gives , while the buoyancy equation gives . The buoyant nontrivial branch has and . Consequently the separable decaying top-hat line plume isThe Boussinesq approximation requires . The corresponding mass density-weighted fluxes, to this order, areFor a direct check, is time independent and . Hence , , and . This verifies all three balances and the required width coefficient.
This nonsteady branch is not the steady, continuously supplied, constant-flux line plume. The latter has constant and half-width in the same top-hat convention. Also, the unshifted power law has as and is singular at . It is therefore an interior separable solution, not by itself a solution with a nonzero continuously operating point-source flux at the origin. A finite-width source boundary, a virtual origin, or a matching region is needed to connect it to physical source and initial data. For example, replacing by supplies a finite base width and time-varying positive base fluxes when . No source or initial flux history is specified in the question to select that matching; the requested power-law width follows from the local balances above.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Keep the half-section convention of part (a). Define the mass density-weighted mass flux, buoyancy flux and momentum flux byThe full-section fluxes are . These factors must be changed consistently if full fluxes are used; mixing a full-width flux with a half-width entrainment source would introduce a spurious factor two.
For positive , , , and . The mass equation in part (a), the momentum equation, and the buoyancy equation therefore becomeThese are direct algebraic rewritings with the mass density factors retained. In particular, is the buoyancy inventory per unit height as well as the integrated buoyancy force. If desired, can be reconstructed from .
At leading Boussinesq order use a constant reference mass density in the inertial fluxes, , , and write so . Set in the stratification source and use . The unsteady top-hat line-plume balances are thenEquivalently the kinematic fluxes , and obey the same equations with removed from the first source. This explicit distinction between mass density-weighted and kinematic fluxes fixes the normalization for the power-law solution.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The entrainment coefficient is the ratio of the inward ambient-fluid velocity normal to a buoyant plume edge to the characteristic buoyant plume velocity. For an upward buoyant plume, take . There are two edges at half-width , so the full-section volume source is . Dividing every integral balance by two gives consistent half-section equations.
For top-hat plume profiles, volume conservation and mass conservation areThe mass entering the buoyant plume is ambient mass with local mass density . The Boussinesq approximation uses a common reference mass density in inertia while retaining the mass density deficit in buoyancy. The mass equation may be kept to the first order in that deficit to derive its transport.
Multiply the volume equation by the time-independent ambient mass density. The product rule givesSubtract the mass equation and multiply by . The entrainment sources cancel exactly, leavingwhereFor stable stratification, and the buoyancy frequency is real. Rising fluid moves into lighter ambient fluid and loses its mass density deficit relative to that local ambient. Thus environmental stratification reduces the buoyant plume's buoyancy flux, even though the ambient fluid entering by entrainment contributes no mass density deficit at its own height.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Assume the carrier fluid has ambient mass density , the particles have mass density , and volumes add. The well-mixed current then hasHere is the particle-fluid reference reduced gravity per unit volume fraction, which is the convention needed in the requested expansion. The initial current reduced gravity is ; it should not be confused with itself. The Boussinesq approximation requires .
For particles to remain well mixed, the turbulent vertical mixing time must be short compared with the settling time. In a turbulent diffusion description with diffusivity , require , or . Equivalently, characteristic turbulent vertical speeds should substantially exceed the particle settling velocity. Turbulence can maintain an approximately uniform concentration in the body while particles still settle relative to the fluid. At the impermeable bed, fluid has no normal transport into the solid boundary, but particles can reach and be captured by it. Assume no resuspension after capture.
Use a gravity-current box model of length , uniform depth and uniform concentration . Neglect ambient entrainment and the small volume change caused by depositing dilute solids, so remains constant. Take a constant front Froude number and the gravity-current front condition . With , the deposition flux is per unit bed area. The particle-volume budget isHence the integral model isThe model assumes a fixed rear boundary, one advancing front, a deep stationary ambient, negligible drag during the inertial spreading regime, and a perfectly absorbing bed. The supplied hindered-settling law is retained in the deposition closure.
For , eliminating time givesThe concentration integral is . ThereforeAs the particle concentration tends to zero, the current reduced gravity and front speed tend to zero. The hindered-settling runout in a rectangular channel isIt is a finite limiting distance; in this idealized model, the exponential tail of particle loss makes complete stopping asymptotic in time. For , omit . Using givesThe original PDF has in this expression; the TeX aid's is a transcription error. Dimensions independently confirm the square: has dimensions of length to the fifth power. If one instead names the initial current reduced gravity , the same expansion is . Late loss of turbulent mixing, viscous resistance or bed resuspension can change the physical runout beyond this specified box model.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the upward coordinate of the preceding kinematic sedimentation calculation, with the given smooth profile on and clear fluid above. This asks for the first characteristic breaking of that profile; a separately imposed packed-bed discontinuity would be a different boundary problem.
Substitution of the initial concentration into the characteristic speed givesThe characteristic Jacobian isIt first vanishes at the upper edge . That edge has zero concentration and descends initially at , soAlthough the derivative of the initial profile jumps to zero in the clear region, the concentration itself is continuous there. The shock starts with vanishing amplitude. Both limiting concentrations at onset are zero, and the Rankine-Hugoniot condition consequently givesThis is a downward speed .
After formation the upper state remains clear, , and the lower state is positive. The parabolic-profile sedimentation shock hasIt therefore initially slows down in magnitude: its signed upward-coordinate speed increases from . One can also verify that its captured left state increases. Write , where labels the incident lower characteristic. Conservation of the particle volume initially above that characteristic givesThe derivative of the right-hand side with respect to is . Thus decreases as time increases, and increases. The downward shock speed continues to decrease on this branch until a bed or another boundary interacts with it. No later boundary behavior is needed for the requested conclusion.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Hindered settling is the reduction of the particle settling velocity by displaced-fluid backflow and interactions with other particles. In the specified model, the downward speed is at vanishing concentration and falls to zero at the maximum packing fraction . The characteristic speed of a concentration disturbance will differ from this individual-particle speed.
Take positive upwards. For a locally uniform horizontal suspension without diffusion or bulk fluid motion, the upward particle flux isParticle volume conservation gives the scalar conservation lawThis is the quadratic hindered-settling flux. Along its characteristic curves,For a smooth initial profile , the map is . Its Jacobian is . A shock develops where this first reaches zero: the compressive condition is , andwhen the minimum is negative and no earlier boundary discontinuity is imposed. A discontinuous compressive initial state can instead contain a shock from .
Let separate states below the shock and above it. Integrating the conservation law across a moving thin interval gives the Rankine-Hugoniot conditionEquivalently, the flux relative to the shock agrees on both sides. For this quadratic flux,Since , a physical compression shock has and satisfies : characteristic curves enter it from both sides. These conditions select the shock over a nonphysical expansive discontinuity.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the state vector , the primitive equations are , withThe characteristic polynomial isConsequently the three characteristic speeds areFor and , the hyperbolic system has three distinct real eigenvalues. The long-wave speed relative to the current is , while transports a buoyancy/contact disturbance.
A left eigenvector for the material characteristic is , givingFor , left eigenvectors can be chosen asMultiplying by these rows gives the characteristic compatibility for an entraining triangular-channel current. With all differentials evaluated along the indicated characteristic,The source follows directly from and .
Since , an equivalent form isCombining it with the material buoyancy equation also givesOnly when entrainment vanishes and is spatially constant do become constant Riemann invariants on these characteristic curves. Dropping the buoyancy differential in the general problem would lose one of the required transport couplings. The characteristic formulas with apply to the nondegenerate region ; dry or neutrally buoyant limits require their conservative form instead.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The occupied cross-sectional area and interface width areThe incoming volume flux per unit channel length is . Volume conservation therefore gives . Ambient fluid carries no excess mass density, so integrating the excess-mass density balance gives . These two equations imply dilution of the reduced gravity, even though total integrated buoyancy is conserved.
The integrated horizontal hydrostatic pressure force, divided by the reference mass density, isThe prismatic walls contribute no axial component of pressure force. Since ambient fluid enters with zero horizontal velocity, it supplies no horizontal momentum flux. Thus the entraining shallow-water current in a triangular channel obeys the conservative equationsTo put them in primitive form, let be the material derivative. The volume equation gives . Subtracting times the volume equation from the momentum equation, and times it from the buoyancy equation, yieldsThe momentum source is the acceleration of newly entrained ambient fluid, not bed drag. The source in the reduced gravity equation describes mixing with ambient fluid of zero excess mass density. In particular, the rectangular-channel coefficients cannot be used: the triangular area produces both in the depth equation and in the buoyancy-gradient force.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The shallow-water approximation assumes a horizontal length scale much greater than the current depth, . Vertical acceleration is then small compared with gravity and pressure is given by the hydrostatic approximation. A depth-averaged model also assumes that the horizontal velocity and excess mass density can be represented by nearly uniform cross-sectional values. Here the ambient fluid is deep or sufficiently undisturbed that its motion and interface-pressure perturbations can be neglected.
The Boussinesq approximation assumes : mass density differences are retained in gravitational forces but a common reference mass density is used for inertia. A dense bottom current has the positive reduced gravityThus the pressure excess over the ambient hydrostatic value at height within the current is . We neglect bed drag, molecular diffusion and horizontal turbulent stress in the leading balances, but retain the prescribed turbulent entrainment across the interface. Negligible bed drag does not imply that entrainment has no effect on the current's velocity or mass density.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Model the specified drag by a prescribed head loss, . A modified conserved head is consequentlywith an arbitrary reference constant absorbed into . More generally the last term is . The effective bed elevation for the shallow-water specific energy calculation is . The critical momentum equation becomesThis is the head-loss correction to hydraulic control.
When , , and regularity at gives . Therefore, for ,The effective bed has a strict maximum there, with elevation increment relative to .
Let and require . At the control . At the shallow-water specific energy is , while at the control it is . Equality of the modified head gives . HenceThe inlet has and is supercritical flow; the branch whose depth increases into the control makes the required smooth transition. At the control the increasing branch has slope , as follows by expanding the modified head to second order.
The numerical discharge uses a constant loss rate on the entire segment from to . The wording specifies that rate only near the control, which is sufficient to locate but does not by itself determine the inlet-to-control head loss. If the loss elsewhere is unspecified, write . The same calculation gives and ; the boxed value is the constant-loss specialization.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 90 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Differentiate the Bernoulli equation at fixed discharge, using . This givesAt a smooth hydraulic control, and the right-hand side must vanish. For the specified geometry,For the intended positive parameters , positive finite depth requiresThe control lies between the bed summit and the width minimum, rather than necessarily at either one. For the corresponding interval is . If , the coincident summit and throat admit without imposing a depth through this first-derivative relation. The limiting cases or must be handled before division: their control is at the bed summit or throat, respectively.
At , the critical-depth formula simplifies toThis establishes the requested depth without assuming that the bed summit and throat coincide.
There is a further regularity qualification if a critical candidate is to be a simple, smooth transcritical hydraulic control. At fixed , define the critical-head envelopeReal depths require . At a control , so must have a local maximum, not a local minimum. The first condition is precisely the compatibility equation above, andFor the positive-parameter case, a nondegenerate control therefore additionally satisfiesIndeed . The interval gives all positive-depth candidates, while this inequality excludes candidates with no smooth critical crossing. At it becomes for a simple control; the requested depth relation remains necessary whenever such a control exists. Equality is a degenerate critical point requiring higher-order analysis. For example, , makes the midpoint a local minimum of , so positivity of the depth alone would incorrectly identify it as a regular control.
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





