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 ib Paper 2 6A Solution by
Codex 0 2026-10-14
In SI units, Gauss's law relates the outward electric flux through a closed surface to its enclosed charge:The outward unit normal specifies the sign of the electric flux.
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 2 20H Solution by
Codex 0 2026-10-14
The modified transition matrix describes the original Markov chain until it hits , and then keeps it at the first state hit. Each state of is therefore an absorbing state, andFor a nonnegative superharmonic function for a Markov chain satisfying the boundary condition, part (c) and positivity of the transition matrix give by induction . Also . ConsequentlyLet to obtain . Since satisfies the conditions by parts (a),(b), is their pointwise minimal solution. This extends the hitting probability is the minimal nonnegative harmonic extension principle to the superharmonic inequality. Nonnegative sums justify the argument on a countable state space as well as a finite one.
Now suppose the Markov chain is irreducible and recurrent, and let satisfy condition (a). In such a chain every state is hit almost surely from every other state. To see this directly, recurrence gives infinitely many visits to a starting state . Irreducibility supplies a finite path from to any target with positive probability , chosen with no return to before reaching . At each successive return to , the Strong Markov property gives another trial with conditional success probability at least . The chance of avoiding through such trials is at most , which tends to zero.
Apply the absorbing modification at the singleton . Part (c) holds for arbitrary satisfying (a), soSince and the probability tends to one, . Interchanging yields equality. Thus every nonnegative superharmonic function is constant on an irreducible recurrent Markov chain.
Conversely, if an irreducible Markov chain is not recurrent, choose a state with return probability . Its hitting probability for satisfies condition (a), and . The first-step formula for a return after time zero gives . Therefore cannot be constant: a constant function with value one at would have . This supplies a nonconstant nonnegative superharmonic solution. HenceThe admissible constant solutions are precisely the nonnegative constants. This is recurrence characterized by constant nonnegative superharmonic functions.
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 2 12G Solution by
Codex 0 2026-10-14
For stereographic projection, choose the north pole of the unit sphere and identify the plane with the complex plane by . Project a point along the line joining it to ; adjoin for the north pole to identify the whole sphere with the Riemann sphere. A point of that line is . Its last coordinate vanishes when , givingUsing , or solving this line's second intersection with the sphere, gives the inverseA great circle lies in a plane through the origin. Its projected equation isIt is a straight line only if , meaning the plane contains the north pole and the south pole. Thus if all three sides of a nondegenerate spherical triangle projected to straight sides of a Euclidean triangle, all three distinct side planes would contain both poles. Each pair of side planes could then meet on the sphere only at those same two poles, which cannot supply three distinct triangle vertices. A nondegenerate spherical triangle cannot project to a Euclidean triangle. If a side passes through the projection pole, its image is unbounded and also cannot be a finite triangle side.
A nonidentity rotation in three dimensions has an axis through the origin: an orthogonal three-by-three matrix of determinant one has an eigenvalue one, since nonreal eigenvalues pair as conjugates, real eigenvalues are , and their product is one. Its axis meets the unit sphere in an antipodal pair, which is fixed. In the identity case every point is fixed, so an antipodal pair can again be selected. Projecting and giveswhenever both points are finite. Thus the associated Möbius transformation fixes an antipodal pair satisfying the claimed relation. The universally valid relation is on the Riemann sphere, with and paired. A rotation about the projection axis fixes exactly that pair, so the PDF's literal finite product needs this extended-coordinate convention. This is the antipodal stereographic coordinate relation.
Past exam of the mathematics course of the University of Cambridge 2009 ib Paper 1 17D Solution by
Codex 0 2026-10-14
Use the steady inviscid, hydrostatic, slowly varying channel approximation, without a hydraulic jump. Conservation of volume flux per unit width gives . The free-surface Bernoulli equation isDividing by yieldsThe parameter here is the squared upstream Froude number. For nonzero discharge, regarding as a function of , its derivative is . It has its unique maximum at , where the local Froude number is one. Substitution gives . This maximum is the hydraulic control over a smooth hump.
Past exam of the mathematics course of the University of Cambridge 2009 ia Paper 1 7A Solution by
Codex 0 2026-10-14
Let be an eigenvector of the Hermitian matrix , with eigenvalue . Multiplying by givesThe denominator is the positive real number , whileThus the numerator is real, and every eigenvalue of a Hermitian matrix is real. This argument does not require distinct eigenvalues.
Past exam of the mathematics course of the University of Cambridge 2009 ia Paper 1 2B Solution by
Codex 0 2026-10-14
For a complex matrix, its Hermitian conjugate is obtained by transposing and taking entrywise complex conjugates:The defining conditions areFor a square matrix, either one of the two inverse identities in the unitary matrix condition implies the other. A Hermitian matrix may have complex entries, but its diagonal entries are real.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 9 1 Solution by
Codex 0 2026-10-14
A topological group is a group with a topology for which multiplication and inversion are continuous. A Hausdorff axiom is not built into this definition. For neighbourhood bases at each point, the precise neighbourhood criterion for a topological group isNecessity follows from continuity: the inverse image of a neighbourhood of contains a product neighbourhood of , and the inverse image of a neighbourhood of contains a neighbourhood of . Conversely, these inclusions give exactly those neighbourhood conditions for continuity of multiplication and inversion, since the rectangles form a basis for the product topology.
An equivalent identity-level formulation is useful. Bases must be obtainable by translation, , and for every one must haveThese conditions are necessary because translations are homeomorphisms, multiplication is continuous at , inversion is continuous at , and each conjugation is a homeomorphism. For sufficiency at , first choose with , then with and take . This gives . For inversion near , first choose with , then with ; thus . The pointwise criterion is therefore satisfied everywhere. If Hausdorffness is also required, the additional identity-neighbourhood condition is : it gives separation of distinct points by translating sufficiently small neighbourhoods.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 82 2 Solution by
Codex 0 2026-10-14
The method of multiple scales applies when a small perturbation acts cumulatively over a long time, as in weakly perturbed harmonic oscillators or slowly modulated waves. A regular asymptotic expansion can contain secular terms, such as , which cease to be small on the time scale of interest. Introduce independent fast and slow times, for example and , and allow the leading amplitude and phase to depend on . The solvability condition in the method of multiple scales removes resonant forcing at each order and determines that slow evolution. For the Mathieu equation, these amplitude equations reveal parametric resonance and its instability intervals.
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 8 5 Solution by
Codex 0 2026-10-14
A Hopf algebra over is a unital associative algebra equipped with a coalgebra structure such that both maps are algebra homomorphisms, and with an antipode . The defining identities arewhere is multiplication and is the unit map; the counit identities use the standard identifications with and . The first compatibility conditions define a bialgebra; the antipode provides its convolution inverse. Multiplication commutativity and coproduct cocommutativity are independent conditions, as the two examples below demonstrate.
For the final construction, let , with , and take the numerical Yang-Baxter R-matrix, in the ordered basis ,It is invertible. Its four action rules are , , , . Applying these rules on the eight basis vectors of verifies , the Yang-Baxter equation.
In the RTT construction, introduce and impose , where , . Entrywise multiplication givesFor example its entry gives , hence . DefineThese maps descend to the RTT algebra. Indeed two matrices in commuting tensor factors each satisfy RTT, andMatrix associativity gives coassociativity and the identity matrix gives the counit. Thus RTT first gives a bialgebra; the R-matrix alone does not automatically provide an antipode.
Here the quantum determinant is central and satisfies , , as follows by substitution of the displayed relations. Impose . This quotient is the coordinate Hopf algebra of quantum SL2, withThese assignments extend as an anti-algebra map: for example reversing gives , and reversing the determinant relation gives . The remaining relations are checked in the same way. Direct multiplication gives : the first diagonal entry of is , its second is , and the off-diagonal entries vanish by the -commutation relations. These are precisely the antipode identities on generators, proving that the quotient is a Hopf algebra.
To verify both required failures of symmetry, map this algebra onto the quantum Laurent plane with generators and relation , by , , , . Construct this algebra directly on the vector space with basis , , , and product . The exponent identity makes multiplication associative, and the basis products give with invertible. Since for , the Hopf algebra is noncommutative. Under the same quotient in both tensor factors,because the four terms are distinct tensor-basis vectors. Hence it is also noncocommutative. The construction yields , for example at .
Past exam of the mathematics course of the University of Cambridge 2008 iii Paper 75 3 Solution by
Codex 0 2026-10-14
For a real continuous function on , the Chebyshev alternation theorem gives a unique best uniform approximation from the space of polynomials of degree at most . If is not already in that space, a candidate is best if and only if there exist ordered points and a sign withThus a nonzero best error has at least alternating extrema of equal magnitude. If is already a polynomial of degree at most , the unique best approximant is itself with zero error.
Existence does not require assuming that the infimum is attained: a minimizing sequence has uniformly bounded polynomial norms, and evaluation at fixed distinct nodes bounds its coefficients through an invertible interpolation matrix. A convergent coefficient subsequence then attains the infimum. The alternation criterion characterizes that minimum and gives uniqueness. In the following parts, whenever occurs.
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





