Brouwer inward-pointing zero lemma Created 2026-09-24 Updated 2026-10-05
Let be a finite-dimensional real inner-product space and let be continuous. If on the sphere , then has a zero in the open ball. Otherwise the radial projection of gives a map of the ball that contradicts the Brouwer fixed-point theorem.
No-retraction theorem Created 2026-09-24 Updated 2026-09-24
No closed disc retracts continuously onto its boundary. This is equivalent to Brouwer fixed-point theorem by the standard ray construction and the antipodal map.
Past exam of the mathematics course of the University of Cambridge 2005 ii Paper 1 11F Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2006 ii Paper 1 2G Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2007 ii Paper 4 2F Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 2 2F a Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2008 ii Paper 2 2F b Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 11F a Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2009 ii Paper 2 11F b Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 11F iii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 11F ii Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2010 ii Paper 2 11F i Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 32 2 Solution Created 2026-10-03 Updated 2026-10-07
For a single resource, assume unit-capacity calls arrive as a Poisson process of rate , holding times have independent exponential distributions with mean , and a call is rejected when all units are occupied. Let . Its occupancy is a birth-death process on , with birth rate below capacity and death rate in state . Detailed balance for a birth-death process givesBy Poisson arrivals see time averages, the Erlang loss formula isThis derivation assumes exponential holding times; the standard insensitivity result extends the same formula to independent holding times of the same mean, but is not needed here.
A loss network with fixed routing has finitely many resources , capacities , and call types with a fixed nonempty set of resources. Type has Poisson arrivals of rate , independent holding times of mean , and offered load . It is accepted only if every resource on its route has a free unit, and otherwise is lost. In the displayed equations use the unit-incidence matrix for and zero otherwise. The equations concern this unit-demand model, rather than arbitrary multi-unit requirements.
The Erlang fixed point approximation replaces the correlated resource availabilities by independent ones. A type- call survives blocking at resources other than with approximate probability . Treating this filtering as Poisson thinning gives the reduced offered loadApply the single-resource formula to obtain . Independence and Poisson thinning here are approximations; no such approximation is claimed for the exact network's joint stationary distribution.
Assume first . The right side is a continuous map from into itself, so the Brouwer fixed-point theorem gives existence. To prove uniqueness, let be the carried load of an Erlang loss resource, also the mean of the truncated Poisson occupancy. Differentiation yieldsThus increases continuously from zero to one and increases from zero to .
Write , and define and , with . Each is continuous and strictly increasing. A fixed point satisfiesThese are precisely the stationary equations for the convex potential for the Erlang fixed pointThe first term is convex; the second is strictly convex because each strictly increases. Hence is strictly convex. Its gradient cannot vanish at two distinct points: the difference of gradients dotted with the difference of points is strictly positive, with a positive contribution from every changed coordinate in the integral term. This also covers boundary coordinates , using the right derivative there. Every fixed point has , since its offered load is finite, so the change of variables is valid. There is exactly one fixed point. If a capacity is zero, its blocking probability is one; delete it and all routes using it before applying the argument to the remaining positive capacities. Unused resources have blocking probability zero.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 55 2 Solution Created 2026-10-03 Updated 2026-10-07
The topological degree measures an oriented net number of sheets of a map. Its simplest integer-valued setting is a map between connected oriented closed manifolds of the same positive dimension . The hypotheses matter: an integer sign count needs orientations; compactness prevents preimages from escaping; and the same dimension makes a regular fiber discrete. A fundamental class gives the definition for continuous maps:Here and are generated by their chosen fundamental classes. Reversing either orientation changes the sign of the degree of a map between oriented manifolds. Disconnected sources contribute a sum over components; disconnected targets require a degree for each target component rather than one universal integer.
For a smooth map, choose a regular value . The Sard theorem guarantees plentiful choices. Each point of has an invertible derivative, so the inverse function theorem makes it an isolated point. The fiber is finite by compactness of . An oriented coordinate chart defines , and the degree as a sum of local degrees becomesAn empty fiber contributes zero. The sign is independent of the chosen oriented charts. Thus the mapping degree counts sheets with signs, not simply the number of preimages: orientation-preserving and orientation-reversing sheets cancel.
A differential-form argument both proves that this count is independent of and relates it to the topological definition. Around a regular value, take a small neighborhood whose full preimage is a disjoint union of neighborhoods mapped diffeomorphically onto . Compactness rules out additional preimages approaching from elsewhere. Choose a smooth top-degree form supported in , with . The change of variables formula givesAlthough need not be everywhere positive, it represents the same normalized top cohomology class as any normalized volume form. The top de Rham cohomology of a compact connected oriented manifold says that two top forms with equal integrals differ by . Their pullback integrals agree, because the Generalized Stokes theorem gives . Therefore the degree by integration of a pullback volume form isfor every smooth top form . Pairing de Rham cohomology with fundamental classes identifies this integer with the homological definition. This proof also shows that every regular value gives the same signed sum.
The homotopy invariance of mapping degree makes it stable under continuous deformation. Homologically this follows from homotopic maps inducing the same map on homology. For a smooth homotopy , a direct proof uses and the Generalized Stokes theorem on the cylinder to getwith the cylinder orientation chosen to give the indicated boundary signs. Smooth approximation extends the geometric description to continuous maps, while the fundamental class definition already applies without differentiability. The multiplicativity of mapping degree follows from functoriality and givesA constant map has degree zero when . If the mapping degree is nonzero, the map is onto: a point outside its image is a regular value with empty preimage. An orientation-preserving diffeomorphism has degree , and an orientation-reversing one has degree . An orientation-preserving -sheeted covering map has degree ; the signs of sheets must be included for other orientation conventions.
Examples show both the strength and the limits of the invariant. On the circle, has degree , including negative integers and zero; it is the winding number. On the sphere , an ambient reflection has degree , and the antipodal map has degree , because the determinant of on the ambient is . On the torus, an integer matrix induces a map of degree , obtained by pulling back the constant top form. However, degree does not classify general manifold maps: the identity and an integer shear on the two-torus both have degree one but induce different maps on , so are not homotopic.
The mapping degree gives useful obstruction and existence arguments. There is no retraction of a closed ball onto its boundary sphere: such a retraction would make the degree-one identity of the boundary null-homotopic, since it would extend across a contractible ball, contradicting homotopy invariance and the degree-zero constant map. This is the degree obstruction underlying the Brouwer fixed-point theorem. Also an everywhere nonzero tangent vector field on an even-dimensional sphere would, after normalization, produce the homotopy from the identity to the antipodal map. Orthogonality makes every value a unit vector, but the endpoint degrees are and , impossible. This proves the corresponding Hairy ball theorem obstruction.
There are appropriate extensions rather than an unrestricted integer degree for every pair of manifolds. For a proper map between connected oriented manifolds without boundary of equal dimension, the regular-value count remains finite and is invariant; compactly supported top forms or locally finite homology replace the compact fundamental-class description. Without orientations, degree modulo two counts preimages modulo two and uses mod-two fundamental classes. For manifolds with boundary one uses relative mapping degree for maps of pairs, keeping the boundary away from the chosen target value. Maps of unequal dimensions, or nonproper maps where preimages can escape to infinity, do not in general admit this same signed sheet-count invariant. The central principle is an integer signed count stable under homotopy, with its hypotheses explicitly preserved.
Past exam of the mathematics course of the University of Cambridge 2013 iii Paper 38 5 a Solution Created 2026-10-03 Updated 2026-10-07
Let be the row payoff matrix and . For in the probability simplex , write and define the symmetric Nash gain mapThe map is a continuous function, has nonnegative coordinates, and sums to one. The Brouwer fixed-point theorem states that every continuous self-map of a nonempty finite-dimensional compact convex set has a fixed point. Apply it to , and let .
Set . The fixed-point equation gives . If , every positive has strictly positive gain, so . Buta contradiction. Thus and every pure payoff is at most . Since their -weighted average equals , every supported action attains that maximum. Consequently is a best response to itself.
The column player's payoff vector against is , so exactly the same inequalities establish its best response. ThereforeThis supplies the whole fixed-point construction and fixed-point-to-equilibrium argument, rather than assuming Nash's theorem as a black box.
Past exam of the mathematics course of the University of Cambridge 2015 ii Paper 2 9I Solution Created 2026-09-24 Updated 2026-10-06
Sperner's lemma says that a triangulated triangle whose vertices are labelled , with each outer vertex having its own label and each boundary edge using only its endpoint labels, contains a small triangle with all three labels. In fact the number of such triangles is odd. Count incidences of small triangles with edges labelled . Interior edges contribute twice. On the outer edge, the number of changes between these labels is odd; the other two outer edges contribute zero. A small triangle contributes one incidence if it has all three labels, two if it uses both but not , and zero otherwise. The total parity proves the assertion.
The resulting no-retraction theorem is: there is no continuous retraction of a closed disc onto its boundary. Work first with a closed triangle . If fixes the boundary, colour each vertex of increasingly fine triangulations by an index of a largest barycentric coordinate of . The largest coordinate is at least ; on the boundary the colouring satisfies Sperner's lemma. Choose a tricoloured small triangle in each triangulation. By compactness and shrinking mesh, a subsequence of their three vertices converges to one point . Continuity forces all three barycentric coordinates of to be at least , so is the triangle's centre, contradicting . A homeomorphism of a disc with proves the disc assertion.
Brouwer fixed-point theorem states that every continuous self-map of a closed disc has a fixed point. If it had none, the ray from through would meet the boundary beyond , continuously in . That intersection defines a retraction, since a boundary point is already the outgoing intersection. This contradicts the no-retraction theorem.
Finally fix and define . The displacement bound implies , so maps the closed radius- disc centred at into itself. Brouwer fixed-point theorem gives , which is exactly . Since was arbitrary, is surjective.