Topics (349k) Articles (361k) Users (417) Discussions (237) Comments (383) Files (12k) New article
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 49 4 Solution by
Codex 0 2026-10-06
For a single barotropic perfect fluid in general relativity, the perturbations obey . This adiabatic closure is needed: constant background alone would not eliminate an independent entropy perturbation. The absence of scalar anisotropic stress allows the common potential used in Newtonian gauge in cosmology.
Substituting the density constraint into the pressure equation gives the gravitational potential evolution of a barotropic fluidSince , the conformal Hubble parameter is . The bracket cancels identically, leavingFor a Fourier transform mode, becomes .
During radiation domination, and . Set and write . The resulting equation is , so the two Spherical Bessel functions in the hint giveAt , the two solutions approach a constant and a mode proportional to . The regular adiabatic mode, normalized to its primordial potential, isAfter entry into the sound horizon, , the potential oscillates at cosmological sound speed with envelope . The Hubble radius and sound horizon differ by the sound-speed factor; outside the Hubble radius the regular potential is constant, while well inside it radiation supports acoustic oscillations.
During matter domination, gives at every wavenumber. HenceThe growing density mode has a constant potential both outside and inside the Hubble radius; the other potential mode decays. Pressureless matter has zero cosmological sound speed, so horizon entry does not produce the radiation acoustic decay. These formulas cover both independent solutions, while the subsequent sketches select the regular adiabatic growing mode.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 42 1 Solution by
Codex 0 2026-10-06
The scaling hypothesis for critical phenomena says that the singular part of the equilibrium free energy is a generalized homogeneous function of its thermal and field-like controls. Smooth backgrounds must first be removed; the hypothesis does not claim that the entire free energy, including arbitrary regular terms, has a pure scaling form.
For the ordinary scalar quartic LG theory, set with and , and rescale the uniform order parameter asThe order-parameter-dependent free-energy density becomesDefine as the minimum of the braces, with the sign of the quadratic term respectively positive or negative. ConsequentlyFor an extensive , additionally contains the system volume. The printed double-inequality subscript labels the two temperature branches: the upper-temperature function is and the lower-temperature function is . It does not classify positive and negative magnetic fields. In particular and ; below the transition the field dependence has a cusp at zero, so derivatives are taken on a selected branch.
For the following derivatives, take to be a density, so is the magnetization density; for total free energy the derivative gives total magnetization instead. Differentiate this mean-field scalar free-energy scaling form. The magnetization is , giving and . The magnetic susceptibility is , giving . At zero field the nonzero curvature amplitudes are and .
To allow nonclassical critical exponents, replace the fixed powers byThe heat-capacity critical exponent is defined by ; temperature differentiation gives the thermal exponent in . The order-parameter critical exponent has , and the magnetic-susceptibility critical exponent has . Differentiating the scaling form givesEliminating proves the Rushbrooke scaling relationThe critical-isotherm exponent is defined by . At fixed small , the limit requires , so that the temperature factors cancel. Therefore , yielding . But the two differentiated identities also give , and hence the Widom scaling relationThese are relations among the leading power indices. At marginal dimensions, multiplicative logarithms can accompany them, and an additive analytic background must not be mistaken for the singular scaling contribution.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 4 5 Solution by
Codex 0 2026-10-06
For a group presentation with finite, let be its free group. For a nontrivial relator defineThe p-deficiency in the unshifted convention used here isIf the weighted sum diverges the value is ; identity relators may be omitted or assigned weight zero. Roots are taken in the free group, not in the presented quotient. Some authors subtract one from this definition; here the requested threshold is .
Two elementary bounds explain why p-deficiency detects infinitude. The p-rank of a group isHere denotes the subgroup generated by all th powers. Each relator that is not a th power imposes at most one linear relation in this vector space, and a th-power relator imposes none. If there are relators of the first type, then
The second bound is the index-p rewriting bound for p-deficiency. Suppose has index , and its preimage in is . The Nielsen–Schreier formula gives rank . For a relator , there are two cases in the Reidemeister–Schreier theorem. If , its coset-conjugates are all th powers in , with total weight at most . If , then , since . Its cosets generate , so representatives show that the rewritten conjugates of are redundant up to conjugation in . One relator suffices, and has weight at most . In both cases the total weight is at most times the old weight. Thus the induced group presentation of satisfiesThe argument applies termwise to infinitely many relators whenever the weighted sum converges.
If , the p-rank of a group bound gives a surjection to , hence a normal subgroup of index . The rewriting bound gives that subgroup another presentation of p-deficiency at least one. Iterating produces subgroups of index for every . p-deficiency at least one implies infinitude.
Now enumerate the nonidentity elements of and choose the presentationIts p-deficiency obeysThe infinitude criterion shows that is infinite. It is generated by two elements, and every element is represented by some or is the identity; the imposed relation makes its order a power of . Thus . This is a torsion group construction by p-power relators; the presentation intentionally has infinitely many relators.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 4 4 Solution by
Codex 0 2026-10-06
A residually finite group has the property that every survives under a group homomorphism to some finite group. Equivalently, the intersection of its finite-index normal subgroups is trivial. A Hopfian group is a group for which every surjective endomorphism is an automorphism.
Suppose is generated by elements. A group homomorphism is determined by the images of these generators, so there are at most such maps. Every subgroup of index gives a transitive coset group action on an -element set, and the subgroup is the stabilizer of a point in that action. There are at most point stabilizers per action. The finite-index subgroup count for a finitely generated group therefore gives
Now let be a surjective endomorphism. For any fixed , inverse image under preserves the index of a normal subgroup. It is also an injective function on the finite set of normal subgroups of index : if , surjectivity gives . It is therefore a permutation of that finite set. Given any finite-index normal subgroup , there is another such subgroup with , so . If is a residually finite group, intersecting all these gives . Hence is an automorphism. Every finitely generated group that is a residually finite group is a Hopfian group.
A useful residual finiteness of semidirect products theorem is: if is a finitely generated group, thenMore generally, the forward construction only requires that have a separating family of finite-index normal subgroups invariant under the action, and that be a residually finite group. Necessity follows by restricting finite separating maps to the embedded subgroups and .
For sufficiency, first consider with : projection to and then a suitable finite quotient separates it. If and , choose a finite-index normal subgroup with . Because is finitely generated, it has only finitely many subgroups of index at most . Their intersection is a finite-index characteristic subgroup of , is contained in , and is invariant under every automorphism in the action. The quotient is finite. Let be the induced action. The mapis a group homomorphism to a finite group and separates . This proves the theorem and the more general invariant-subgroup criterion. The finite-generation condition is used to produce the characteristic subgroup , not assumed for .
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 4 2 Solution by
Codex 0 2026-10-06
A soluble group, also called a solvable group, has a terminating derived series:For a subgroup , induction gives , so subgroups of soluble groups are soluble. For a surjective group homomorphism , , so quotients of soluble groups are soluble. Finally, in a group extension , suppose and . Then and . Soluble groups are closed under subgroups, quotients and group extensions.
A virtually soluble group contains a soluble group as a finite-index subgroup. The finite-index facts proved in parts (i)–(iii) imply closure under subgroups and quotients: intersect a finite-index soluble subgroup with the chosen subgroup, or take its image under the quotient map.
For group extensions, no finite-generation hypothesis may be inserted. We first establish the finite-index characteristic soluble subgroup lemma. If is a virtually soluble group, the kernel of its action on the cosets of a finite-index soluble subgroup is a soluble normal subgroup of finite index. Among soluble normal subgroups containing , choose with maximal , possible because is finite. If is any soluble normal subgroup of , then is soluble: it is an extension of by . Maximality forces . Thus is the unique largest soluble normal subgroup of , making it a characteristic subgroup, and it has finite index.
Now suppose has both and virtually soluble. Replace by the preimage of a finite-index soluble subgroup of . The subgroup just constructed is characteristic in and therefore normal in . In , the subgroup is a finite normal subgroup, and is a soluble group. The centralizer has finite index in , since conjugation gives a map with finite image. Its intersection with is the center of a group , an abelian group, while its quotient by embeds in the soluble group . Thus is a soluble group. Its preimage in is an extension by , so it too is soluble and has finite index in . Virtually soluble groups are closed under group extensions.
For the final example take the restricted direct sum of groupswhere is the nonabelian simple group of even permutations on five letters. Every finite collection of elements lies in a product of finitely many finite factors, so is a locally finite group and hence a torsion group. It cannot contain a nonabelian free group, which is a torsion-free group.
To show that is not a virtually soluble group, let be any finite-index subgroup and let be the kernel of the finite coset action. Each coordinate maps either injectively or trivially into the finite quotient , by Simplicity of the alternating group A5. The nontrivial images of distinct factors commute, and each has trivial centre, so any of them generate a direct product of groups of order . Only finitely many such images can occur in a finite quotient. Therefore , and hence , contains a whole coordinate copy of , which is not soluble: its nontrivial commutator subgroup is normal and therefore equals . No finite-index subgroup of is soluble.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 32 7 Solution by
Codex 0 2026-10-06
For mutually exclusive event types, let be the first event time and its type. The cause-specific hazard for cause isIt is a rate conditional on having had no event of any cause. The cumulative incidence function, also called the cumulative risk function, is the actual probability .
The total hazard function is , giving . Surviving every cause to time and then experiencing cause givesIn competing risks, is generally not , because competing events remove individuals before they can experience cause . This formula does not require assuming independent latent failure times for the different causes.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 32 6 Solution by
Codex 0 2026-10-06
For an event at from subject , with covariate vector , define the Schoenfeld functionThe second term is the hazard-weighted mean covariate in the risk set just before the event. The Schoenfeld residual is this function evaluated at the fitted coefficient, . Calculate one residual vector per event, using every at-risk subject, including those who will subsequently be censored. There is no ordinary event residual assigned at a right censoring time.
The Cox partial likelihood score function is . At the true constant coefficient in a Cox proportional-hazards model, the conditional event subject is selected with weights proportional to , so each Schoenfeld function has conditional mean zero. If the coefficient varies with time, that centering changes. Plot residuals against event time or a transformation of it, smooth them, and investigate departures from zero. Scaled Schoenfeld residuals account for the risk-set covariate variance and can display departures in coefficient units; score function tests based on residual-time association provide a formal check. Risk-set composition affects unscaled residual variance, and the total residual score function can be zero by fitting even when a time trend is present.
Past exam of the mathematics course of the University of Cambridge 2014 iii Paper 31 4 Solution by
Codex 0 2026-10-06
Write the year- count as a sum of its individual counts, with . The specified conditional independence within that year givesDividing by and scaling the conditional variance by therefore givesThis is the Bühlmann–Straub model: larger exposures reduce the process noise in a year's average.
Define the population parameters and total observed exposure byHere is the expected process variance and the variance of hypothetical means. Assume finite second moments. The law of total variance gives , and conditional independence between years gives for : their only shared variation is the latent conditional mean.
To derive the Bühlmann–Straub credibility estimate, minimize mean squared error among affine estimates of . For coefficients and , the optimal intercept is . Centering at and conditioning on shows that the resulting error isThe cross term vanishes because has conditional mean zero; the conditional noise cross terms vanish by the between-year independence assumption.
For fixed , the Cauchy-Schwarz inequality giveswith equality when . Minimize the remaining quadratic . Its minimizing value is the Bühlmann–Straub credibility factorThe experience term is exposure-weighted:Since the future conditional mean count is , multiplying the optimal estimate by the known future exposure givesIt is the best affine linear least-squares projection, not a claim that the exact conditional expectation given all data is always affine. If , the conditional mean is a known constant almost surely and one takes ; if , the observations reveal it without process noise and . The ordinary case has .
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





