Brouwer fixed-point theorem Created 2026-09-24 Updated 2026-10-14
The Brouwer fixed-point theorem says that every continuous map has a fixed point when is a nonempty compact set and a convex set in a finite-dimensional vector space over the real numbers. Equivalently, take for a finite , with the usual Euclidean space structure: there is some such that . The conclusion guarantees at least one fixed point, without asserting uniqueness or telling us how quickly to find one. [ref]
The standard pictures are a closed ball, including a closed unit ball, and a simplex. A filled disk qualifies; its bounding circle alone does not. A probability simplex also qualifies even though its dimension is smaller than that of its ambient Euclidean space. The hypotheses have concrete meanings: being a convex set keeps every line segment between allowed points inside , and compactness prevents escape or loss of a limiting point. In Euclidean space, the Heine-Borel theorem identifies compact sets with closed sets that are bounded sets. Crucially, every output must belong to the same as the input.
For a fully computable example, let be the filled unit disk. Apply a counterclockwise quarter-turn rotation, shrink by , and add a translation:
This affine map is a continuous map. Because the rotation preserves the Euclidean norm, the triangle inequality gives, for every ,
Thus the whole image lies strictly inside . More precisely, it is a disk of radius centred at . This containment check is what makes the Brouwer fixed-point theorem applicable; a formula being a continuous map by itself would not suffice.
The fixed point can now be found by a system of linear equations:
Indeed, substitution gives . Its Euclidean norm is , safely inside . The figure shows arrows from sample inputs to their outputs; an arrow disappears at the fixed point because the displacement vanishes there.
Figure 1.
A quarter-turn, shrinking, and translation keep a disk inside itself
. Details.
Repeated iterations of a map happen to succeed for this example. Starting at and setting gives , , and . Subtracting the fixed point equation yields , so the Euclidean distance to shrinks by exactly each step. This extra fact follows from the contraction mapping property and the Banach fixed-point theorem. It is additional information beyond the Brouwer fixed-point theorem.
The distinction becomes visible with two simpler continuous maps of the same disk. The pure rotation has exactly one fixed point, , since and force both to vanish. Yet iterations of a map starting at here cycle through , , and forever. Their Euclidean distance from stays one, so there is no convergence in a metric space. The reflection has an entire line segment of fixed points, namely . Starting off that line segment produces an alternating pair. Existence, uniqueness, and convergence of iterations of a map are separate questions.
Figure 2.
Existence of a fixed point does not imply uniqueness or convergence of iteration
. Details.
Removing hypotheses changes the answer. Restrict the same quarter-turn rotation to the circle . It remains a continuous map into that compact set, but its only possible fixed point, , has been removed. The circle is not a convex set. Conversely, on the unbounded convex set , the translation has no fixed point; on the open interval , also has none. Neither domain is a compact set. The finite-dimensional closed ball statement should likewise not be extended to arbitrary infinite-dimensional vector spaces, where a closed ball need not be a compact set.
The one-dimensional version explains the connection to the intermediate value theorem. For a continuous map , put . Then and , so the intermediate value theorem gives for some . In higher dimensions, the Brouwer fixed-point theorem supplies a corresponding existence principle when this scalar sign argument is unavailable. Its practical value is ensuring that a proposed equation has a solution once a suitable domain is found; it supplies no general promise of a fast algorithm.
A useful application is positive matrix eigenvector from simplex normalization: rescale the output of a strictly positive matrix to make its entries sum to one. For example, take
On this probability simplex, has entry sum , so the normalized continuous map is . Both entries are positive and sum to one, keeping the image inside the probability simplex. Its fixed point equation is , hence . Consequently satisfies : a strictly positive eigenvector with eigenvalue . In larger dimensions, the Brouwer fixed-point theorem guarantees the corresponding positive eigenvector without requiring us to solve a system of linear equations in advance. The fixed point expresses preservation of relative weights, rather than preservation of their unnormalized size.
Proofs can be approached through the no-retraction theorem or Sperner's lemma. In the latter approach, increasingly fine triangulations locate approximate fixed points; compactness supplies a convergent subsequence, and continuous maps turn its limit into an exact fixed point. [ref]
A primary historical reference is L. E. J. Brouwer's 1911 paper Über Abbildung von Mannigfaltigkeiten, whose digitized original is hosted by Zenodo under DOI 10.1007/BF01456812. This gives a direct route to the early literature behind the Brouwer fixed-point theorem. [ref]
Cayley transform between the half-plane and disk Created 2026-10-03 Updated 2026-10-14
The Cayley transform gives a conformal bijection between an unbounded half-plane and the unit disc. Two conventions are useful. For the right half-plane, use
For the upper half-plane, use
Rotating the upper half-plane onto the right half-plane by explains the relationship . The factors of distinguish which half-plane is mapped onto the unit disc. [ref]
Figure 1.
The upper half-plane Cayley transform bends a rectangular grid into the unit disc while preserving angles at intersections
. Details.
In particular, , and . The whole positive imaginary axis becomes the real diameter: for . Horizontal grid lines become circles tangent to the unit circle at when completed by their endpoint at infinity; they are not hyperbolic geodesics.
On the Riemann sphere, maps the extended real line onto the unit circle:
Every finite real has ; the remaining point corresponds to infinity. The pole is outside the upper half-plane, and the pole of at is on the boundary of the unit disc. Neither pole obstructs the interior conformal bijection.
For a short verification, subtract the squared moduli:
These identities put each interior image in the required domain; solving gives the stated inverse function. Both maps are holomorphic, with , so the conformal bijection preserves Euclidean angles between tangent directions.
Euclidean distance is not preserved: and are one unit apart, whereas and are only one third of a unit apart. The striking feature is that does preserve length for the hyperbolic metrics of the Poincaré half-plane model and Poincaré disk model:
Consequently it is an isometry for these hyperbolic metrics, including their induced hyperbolic distances. For the same example, the corresponding hyperbolic geodesic segments have equal length:
Thus the Cayley transform lets us choose the most convenient picture: a straight boundary for calculations, or a bounded unit disc for visualization. It also transports automorphisms of the unit disk into upper half-plane automorphisms by function composition .
For a sphere with centre and radius , and a plane with unit normal , the orthogonal projection of onto the plane is . The orthogonal decomposition gives the intersection circle radius by the Pythagorean theorem. A genuine circle requires ; equality gives tangency and larger distance gives no intersection. The signed displacement is not determined by the two radii alone: it is with sign fixed by the oriented plane.
Chord of a circle 2026-10-14
A chord joins two points of a circle by a straight segment. If the circle has radius and the chord midpoint lies a distance from its center, the perpendicular bisector and Pythagorean theorem give the displayed length. The length exceeds that of an inscribed equilateral triangle precisely when .
The circle and the closed interval are both compact and connected, so those two properties alone do not distinguish them. Instead examine connectedness after removing a point. Every punctured circle is connected: after rotating the missing point to , the continuous map from the connected open interval maps onto it. Continuous maps preserve connectedness. [ref]
If a homeomorphism existed, choose . Its restriction would give a homeomorphism between and . But the latter splits into two nonempty disjoint open sets in its subspace topology, and , contradicting connectedness of the punctured circle. Removing an endpoint of leaves a connected space; the proof deliberately chooses the preimage of an interior point. This illustrates how a simple connectedness test can rule out every possible homeomorphism.
Circle from an affine complex-modulus equation Created 2026-10-06 Updated 2026-10-07
An equation , with and real coefficients, becomes after squaring. If , completing the square gives a circle. The original locus is only the part where . Checking this sign on the candidate circle prevents extraneous points introduced by squaring. This method combines the complex modulus with elementary conic geometry.
Under the hypotheses of Jensen's formula, the circle log-mean is the angular average of the natural logarithm of the complex modulus. The factor normalizes the integral to a mean. It averages values at equally weighted angles on the circle, and Jensen's formula computes it from and the interior zeros of a function.
Circle packing 2026-10-06
Arrangement of circles in a plane without interior overlap. The covered area fraction is its packing fraction. Equal-radius square packing has fraction .
For north-pole stereographic projection on the unit sphere, substitute into a planar circle equation. The displayed plane equation follows, and its intersection with the sphere is a circle. The plane contains the sphere's centre exactly when , giving a great circle.
Around each of points draw its at most distinct-distance circles. On every circle containing at least three points, join cyclically consecutive points by arcs. The resulting loopless multigraph has at least edges and a drawing with crossings. A pair joined by several arcs has every corresponding centre on its perpendicular bisector, which is the key to bounding multiplicity.
Circulation (physics) 2026-10-14
Use circulation to summarize how much a velocity field runs along an oriented closed curve , such as a circle around a fluid vortex. Its definition is the line integral
where is tangent to in the chosen direction. Reversing that direction reverses the sign of circulation. Its units are , because velocity is multiplied by a length. Counterclockwise circulation in the horizontal plane is positive when the chosen unit normal vector is , according to the right-hand rule.
For solid-body rotation , a counterclockwise circle of radius has constant tangential velocity . Multiplying by its circumference gives
For the potential line vortex , the same circle instead gives , independent of . Stipulate , and : both velocity fields have , although their vorticities in the fluid are and zero respectively. On a circle of radius , their circulations are and . The comparison plot in vorticity shows this difference in radius dependence.
The bridge between circulation and vorticity is Stokes theorem:
Here the velocity field must be continuously differentiable on a neighborhood of the entire spanning surface inside the fluid, and its boundary orientation must match the unit normal vector . For solid-body rotation, the disk is admissible and its surface integral is . For the potential line vortex, the origin is singular and excluded from the fluid: a disk crossing it is not admissible. On an annulus, Stokes theorem instead gives , with both circulations here measured counterclockwise; the induced inner boundary direction is clockwise. Nonzero circulation therefore does not imply nonzero local curl in the available fluid. [ref]
This is useful because Stokes theorem lets a local vorticity measurement determine a loop's circulation when a suitable surface exists, while Kelvin's circulation theorem tracks circulation along a moving material curve. The beauty is the precise link between a local derivative and a global line integral, with the domain deciding which conclusions are valid.
Circumcircle 2026-10-14
The circumcircle of a nondegenerate triangle is the unique circle through its three vertices. Its center is the circumcenter, found by intersecting two perpendicular bisectors; equality of distances to all three vertices proves existence, and subtracting the squared-distance equations proves uniqueness. For a right triangle, the midpoint of its hypotenuse is equidistant from all vertices, so its circumradius is half the hypotenuse length.