An absolutely continuous probability distribution on the real line has a probability density function with respect to Lebesgue measure : for every Borel set , . Its cumulative distribution function is an absolutely continuous function, with derivative almost everywhere. The probability density function and cumulative distribution function example under probability distribution illustrates this class.
Consider the original worked example on . First, existence: a polynomial function is a continuous function, and . The intermediate value theorem therefore supplies a zero of a function , even before its value has been calculated.
Second, uniqueness is a separate argument. The derivative is . The derivative criterion for monotonicity, obtained from the mean value theorem, makes a strictly increasing function. Two distinct zeros of a function would contradict that strict increase. Thus this root bracket contains exactly one zero of a function; indeed the same derivative argument proves uniqueness on the entire real line.
Third, localization uses the existing bisection method. Set ; after completed halvings, retain with opposite endpoint signs. Each update tests the old midpoint . The first five exact updates areEvery retained root bracket contains by the intermediate value theorem. After ten halvings, exact arithmetic givesHence . The new midpoint and its bisection error bound areThis midpoint is the estimate after the tenth update; the last tested point was . In general the retained width is , so the bisection error bound is . Nine halvings already suffice for an error at most , since . This guarantee comes from the width of the root bracket, independently of any displayed decimal approximation to the unknown zero of a function. Endpoint signs must be established reliably if evaluations use floating-point arithmetic.
Additive function Created 2026-09-24 Updated 2026-10-18
For real numbers, an additive function is a group homomorphism from to itself. It preserves scalar multiplication by every rational number, so it is a linear map when domain and codomain are viewed as vector spaces over the rational numbers. Being a linear map over the real numbers additionally requires for every real number . On the real line this stronger condition is equivalent to . Additivity alone does not imply it.
Antiderivative Created 2026-09-24 Updated 2026-10-14
An antiderivative recovers a function from its local rate of change. For a real-valued function on an open subset of the real line, a differentiable function is an antiderivative whenFor example, has the antiderivatives for every real additive constant . Their derivatives agree, while their values can differ. On an interval, the constant of integration describes the entire freedom in the answer. [ref]
https://openstax.org/books/calculus-volume-1/pages/4-10-antiderivatives. OpenStax Calculus 1, §4.10: antiderivatives and their families
The indefinite-integral notation records this family on an interval. For the illustrated family, the extra condition selects . Thus reversing differentiation requires both a rate and a reference value if a unique function is wanted.
The fundamental theorem of calculus supplies a construction when is continuous on an interval . Choose and set ; then . Integrability alone does not guarantee a classical antiderivative. The Heaviside step function is Riemann integrable on bounded intervals, but cannot be a derivative throughout an interval containing its jump: Darboux theorem for derivatives requires every intermediate value. [ref]
https://www.jirka.org/ra/html/sec_mvt.html. Lebl, Basic Analysis I, §4.2.5: the intermediate-value property of derivatives
Antiderivatives on disconnected domains 2026-10-14
Let be an open subset of the real line, and let be antiderivatives of the same function on . Each connected component is an open interval. On that component, , so the mean value theorem gives . The constants on different components are independent: there is no subinterval inside joining them. Conversely, adding any chosen constant on each component preserves the derivative everywhere on .
For example, the domain of is . Every antiderivative on this domain has the formwith arbitrary real . The logarithm of the absolute value differentiates to on each side. The function with and is therefore a valid antiderivative, although it cannot be written as with one global constant.
Two disconnected intervals allow independent constants while the derivative stays the same
. Details. An initial condition at fixes and leaves free. Fixing both constants requires one reference value in each connected component, or additional conditions that couple the components. The locally constant function captures this remaining freedom.
Aspherical space Created 2026-10-03 Updated 2026-11-05
A path-connected topological space is aspherical if for every . For a connected CW complex, this is equivalent to its universal cover being a contractible space. Indeed, a covering map preserves all higher homotopy groups, while the universal cover is simply connected; the Whitehead theorem then makes its map to a point a homotopy equivalence.
The circle is aspherical because its universal cover is the real line. The torus is aspherical because its universal cover is . Their only nonzero positive-degree homotopy groups are their fundamental groups, and . In contrast, is not aspherical since .
For an aspherical CW complex with fundamental group , maps from a connected based CW complex are classified byExtending a map over successive higher cells encounters precisely the vanishing higher homotopy groups of , giving both existence and uniqueness up to based homotopy. For free homotopy classes, the homomorphisms are instead identified up to conjugation in .[ref]
Boundary of a set Created 2026-10-05 Updated 2026-10-14
The boundary of a subset of a topological space consists of the points whose every neighbourhood in meets both and its complement . Equivalently,Here the two operations are closure and interior. The second formula shows that the boundary is a closed set and that and its complement have the same boundary. It locates precisely the points where membership cannot be decided from a small neighbourhood alone. [ref]
For in the usual real line, the interior is , the closure is , and the boundary is . In particular, belongs both to and to its boundary, while belongs to the boundary but not to . A boundary point need not be excluded from the original set: open sets exclude all their boundary points, closed sets contain all theirs, and this half-open interval does one of each.
The upper panel visualizes the relative example from open set: for and , an open ball about zero in is when . This open ball stays in ; points outside are not required. The middle panel shows that is clopen in itself, with interior and closure both and empty boundary, although its boundary in the real line is . The lower panel returns to ambient space and separates the interior, closure, and boundary of ; both marked boundary points are included in the boundary itself.
Bounded function Created 2026-09-24 Updated 2026-11-05
A real- or complex-valued function is bounded when one finite constant controls all its values:For example, is bounded by one on the real line. The reciprocal is bounded by one on , but is an unbounded function on , showing that the domain of a function matters. Each value at an allowed input may be finite even when no common bound exists.
Box topology 2026-10-14
The box topology on has a basis of a topology consisting of all Cartesian products with every an open set in ; infinitely many coordinates may be restricted. It contains the product topology and agrees with it for finite .[ref]
18.901, Fall 2024 lecture notes. Lecture 12, Exercise 12.1.2(1)-(2), printed page 43: box basis, comparison with the product topology, and finite-factor equality
For copies of the usual real line, the box topology is strictly finer when . The box is not an open set in the product topology: a basic cylinder set containing zero leaves some coordinate unrestricted, so it contains . This is a construction for every finite coordinate set, not evidence from testing a finite prefix.
Cauchy's functional equation Created 2026-09-24 Updated 2026-11-05
Cauchy's functional equation asks for functions satisfyingThe identity must hold for every pair of real numbers, and a solution is an additive function. It says that combining two inputs before applying gives the same result as combining their outputs.[ref]
Remarks on the Cauchy functional equation and variations of it by Daniel Reem. Daniel Reem, Remarks on the Cauchy functional equation and variations of it, version 7, §1.1, Eq. (1) and the real domain
For example, satisfies the identity because . At and the two sides giveFor positive widths, a rectangle of height three makes this visible: cutting its width into and partitions its area into and . The same identity also holds for negative inputs, where is a signed output rather than an ordinary area.
The function f(x)=3x preserves addition: partitioning a rectangle and checking exact rational grid sums
. Details. Every function with a fixed real number solves Cauchy's functional equation. The surprising question is whether these are all the solutions. Rational homogeneity of an additive function forces for every rational number , but reaching an irrational number requires an additional argument. Continuity at just one point or being a bounded function on an interval of positive length supplies that argument; without such a condition, discontinuous additive functions exist.[ref]
Remarks on the Cauchy functional equation and variations of it by Daniel Reem. Reem, version 7, §1.1, printed p. 2: classical continuity and bounded-interval conditions and nonlinear solutions
This makes Cauchy's functional equation a useful test of the boundary between algebra and analysis: a rule about addition fixes all rational multiples, while a tiny amount of continuity fixes the entire real line. For example, the continuous exponential functional equation reduces to an additive function after taking a logarithm, so this result explains why its nonzero solutions are exponential functions.
Causal extension by zero 2026-10-14
Extend a function given for nonnegative time to the real line by setting it to zero before the starting time. This turns unilateral convolution into whole-line convolution and identifies a Laplace transform slice with a Fourier transform after exponential function weighting.
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, useFor the upper half-plane, useRotating 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]
https://ocw.mit.edu/courses/18-04-complex-variables-with-applications-spring-2018/ef46ddd9941227b8700c945bb7475ae9_MIT18_04S18_topic10.pdf. Orloff, MIT Topic 10, Example 10.14 and section 10.11
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 .
Closed set Created 2026-09-24 Updated 2026-10-14
A subset of a topological space is closed when its complement in that same ambient space is open: . For example, the closed interval is closed in the usual real line because its complement is the open set . Always specify the ambient topological space: a subset can be closed in a subspace topology without being closed in the surrounding space. [ref]
https://www.maths.ox.ac.uk/system/files/attachments/Preliminary%20Reading%20%281%29.pdf. Richard Haydon, Oxford topology preliminaries, Section 0.1
Being closed is not the logical negation of being open. In the usual real line, all four combinations occur: is open but not closed; is closed but not open; the half-open interval is neither open nor closed; and both the empty set and the whole real line are open and closed, hence clopen. Nor does being closed imply being a bounded set: is closed because its complement is open, but it is not a bounded set. The symbol is not an extra point that this interval must contain.
The four combinations of openness and closedness in the real line
. Details. The coloured strokes mark membership; filled endpoint circles mean included points, and hollow endpoint circles mean excluded points. The empty set has no coloured points, while arrows at both ends of the coloured real line indicate that membership continues indefinitely. These examples use the usual topology of the real line.
In a metric space , a subset is closed exactly when every convergent sequence in whose limit of a sequence lies in has . For example, lies in for and has limit of a sequence , which is missing; thus this half-open interval is not closed in the real line. This criterion is useful for keeping limiting constructions inside a prescribed set. [ref]
In every topological space, the general criterion is , using closure; equivalently, contains all its limit points. A closed set is always a sequentially closed set, but the converse can fail outside metric spaces. Arbitrary intersections and finite unions of closed sets are closed, by taking complements in the topology axioms.
Closure (topology) 2026-10-14
The closure of a subset of a topological space is the smallest closed set containing . Equivalently, it is the intersection of all closed sets containing , or the set of points whose every neighbourhood in meets . The notation makes the ambient topological space explicit. This definition works without a metric or any appeal to sequences. [ref]
https://math.mit.edu/~hrm/palestine/munkres-topology.pdf. James Munkres, Topology, closure and interior of a set
For in the usual real line, : every neighbourhood of meets , while a point outside has an open ball disjoint from . Passing to the closure adds the missing endpoint and retains all original points, including isolated points when present. In general, the closure is together with its limit points; its individual points are the adherent points of .
The closure turns an arbitrary subset into a closed set with no unnecessary added points. It satisfies and ; a subset is closed exactly when . In a metric space, exactly when some sequence of points of has limit of a sequence : choose its th point in . For a general topological space, keep the neighbourhood definition; sequences need not detect every point of the closure.
Commuting functions Created 2026-10-14 Updated 2026-11-05
Two self-maps are commuting functions when their function compositions satisfy . Order then makes no difference: the self-maps and on the real line both give when applied successively. By contrast, and give and , so they do not commute.
Mathematical induction gives for all nonnegative integers , where powers mean repeated function composition. Sharing a fixed point or an invariant set is insufficient to imply commutation. For rational maps of the Riemann sphere with degree of a rational map of the Riemann sphere at least two, commutation does imply equality of their Fatou sets and Julia sets, by the commuting rational maps of degree at least two have the same Julia set theorem.
Compact space Created 2026-09-24 Updated 2026-10-14
A topological space is compact when every open cover has a finite subcover: whenever open sets satisfy , some finite selection satisfies . A subset of an ambient topological space is compact when its subspace topology is compact; equivalently, every open cover of by ambient open sets has a finite subcover. The word every matters: finding one finite subcover of one open cover is not enough to establish compactness. [ref]
The closed interval is compact by the Heine-Borel theorem. For a concrete open cover, take the three open intervals , , and . Their union is , so they cover every point of , including both endpoints. The overlaps have lengths and , leaving no gaps. Each member is necessary for this particular open cover: removing them respectively leaves , , or uncovered.
Above, hollow markers denote the excluded endpoints of the covering open intervals, while the solid endpoints belong to the covered closed interval. Below, each displayed open interval is one member of an infinite open cover of ; finitely many rows always leave points near zero uncovered. The rows are vertically separated for readability and all refer to the same real line.
The open interval is a bounded set but is not compact: the open setsgive an open cover of , since every has for sufficiently large . These are also open sets for the subspace topology on . Any nonempty finite selection has a largest index , so its union is just and misses the point , which still belongs to . Thus no finite subcover exists, however many members we select. The same family is not an open cover of , since it misses both endpoints.
In a metric space, compactness is equivalent to sequential compactness: every sequence in the subset has a convergent subsequence whose limit of a sequence belongs to that subset. This equivalence does not extend to all topological spaces. For example, for has limit of a sequence zero in . The same sequence lies in , but every subsequence still has limit of a sequence zero on the real line, so no subsequence converges to a point of . Merely approaching a boundary is harmless when the required point remains available. [ref]
https://ocw.mit.edu/courses/18-100b-analysis-i-fall-2010/b7780b2a0629359b11c5de998c72a147_MIT18_100BF10_compactness.pdf. MIT Analysis I, Compactness vs. Sequential Compactness, Theorem 1 and its metric-space proof
The same sequence approaches an included endpoint in a closed interval and a missing endpoint in an open interval
. Details. Both panels show the sequence for approaching zero. In the closed interval, zero is an allowed limit of a sequence; in the open interval, the hollow marker identifies the missing point. This single sequence disproves sequential compactness of ; compactness of still requires control of every open cover or every sequence, supplied by the Heine-Borel theorem.
An infinite set with the discrete topology similarly fails compactness, using the open cover by all its singletons. Every finite set is compact in any topology: select one covering open set for each point. The empty set is compact because the empty selection is a finite subcover. This open cover definition does not require the topological space to be Hausdorff; in algebraic geometry it is often called quasi-compactness.
The beauty of compactness is that information valid around each point can often be controlled using finitely many regions. A finite subcover lets us combine finitely many local bounds, or choose the smallest of finitely many positive tolerances, to obtain control across the whole compact space. This is why compactness repeatedly turns approximation into existence and why it is so useful in optimization through the extreme value theorem.
Every closed set in a compact space is compact, and a continuous image of a compact space is compact. The latter proof pulls an open cover back by inverse images, selects a finite subcover, and maps forward. This makes compactness useful for proving existence: the extreme value theorem guarantees that a continuous function from a nonempty compact space to the real line attains both a minimum and a maximum. For example, on has maximum at and minimum zero at its endpoints. On its infimum is still zero but is never attained. [ref]
Compact subset of a Hausdorff space Created 2026-09-24 Updated 2026-10-14
Let , where the ambient topological space is Hausdorff and is compact in its subspace topology. Then is a closed set in : the complement is an open set in . The ambient space need not be compact. For example, is a compact closed interval in the non-compact Hausdorff real line.[ref]
The ambient Hausdorff hypothesis matters even when itself is Hausdorff. In the Sierpiński space , the open sets are , so the closed sets are . Thus is compact and Hausdorff in its one-point subspace topology, but is not closed in : its complement is not an open set. Every open neighborhood of contains , so separation from fails. In contrast, the discrete topology on the same underlying set is Hausdorff and makes both singletons closed.
A compact subset is closed in the two-point discrete space but need not be closed in the Sierpiński space
. Details. The diagram lists every open set and closed set, so the distinction can be checked directly. All subsets in both panels are compact: for any open cover of a finite set, choose one covering open set per point, obtaining a finite subcover. Compactness alone therefore cannot distinguish the two panels.
Here is the finite-selection mechanism in the general proof. For and each , the Hausdorff property gives disjoint open neighborhoods of and of . The give an ambient open cover of . Select a finite subcover and setThen , , and . The finite intersection makes an open set; an infinite intersection would not guarantee this. Thus every point of has an open neighborhood contained in that complement, proving that is closed. The empty set is already closed.
This theorem combines with the continuous image of a compact space theorem to make every continuous map from a compact space to a Hausdorff space a closed map: a closed subset of its domain is compact, and its image is compact and hence closed in the target. This is the reason the inverse in the compact-to-Hausdorff continuous bijection theorem is continuous. The converse implication, from closed to compact, needs additional hypotheses: the real line is closed in itself but not compact; in a compact space, every closed subset is compact.
Compact support Created 2026-09-24 Updated 2026-11-05
A function has compact support when its support is a compact set. On the real line, this means the closure of its nonzero region is closed and bounded. The function has compact support .
Decay is a different condition: tends to zero as , but is nonzero everywhere, so its support is all of and is not compact. Smooth functions with compact support are used as test functions in distribution theory.
Complementary error function Created 2026-10-05 Updated 2026-10-14
The complementary error function describes the Gaussian integral area remaining beyond the endpoint. For a real ,It is an entire function for complex arguments when defined by . On the real line it decreases from two to zero, with and .[ref]
For example, is a sizeable tail, whereas is extremely small. In the tested floating-point arithmetic, a direct evaluation of gives zero because the computed error function has already rounded to one. Evaluating the complementary error function directly preserves this tail. It is the useful quantity in an upper-tail normal distribution probability and in the decaying side of an error-function diffusion front.
For large positive real , the leading asymptotic expansion isThe first corrections are multiplying the leading term. This is an asymptotic expansion, not an assertion that summing arbitrarily many terms converges at a fixed .[ref] The complementary error function tail bound provides finite- inequalities instead.
Completion of a measure Created 2026-09-29 Updated 2026-11-05
The completion of a measure extends a measure space so that every subset of a measurable null set is measurable. Its completed sigma-algebra isand the extension is . This is well-defined: two such representations differ only inside a measurable null set, so their measurable parts have the same measure. The extension agrees with on and is a complete measure.[ref]
For example, completing the Borel measure given by length on the real line gives Lebesgue measure on the Lebesgue measurable sets, including every subset of every Borel null set. Completion of a measure changes which sets are measurable; it does not identify distinct sets. If and differ only on a null set, they can still be different sets in the completed sigma-algebra. Equality modulo null sets is an additional quotient construction.









