Solution set Created 2026-10-14 Updated 2026-10-31
The solution set of a mathematical condition in a specified domain collects every allowed value that satisfies it:It describes the answer without committing to the steps used to find it. For the equation over the real numbers, the solution set is ; restricting to positive real numbers leaves . For , the solution set is over the rational numbers and the empty set over the integers. The domain is part of the question.
An equation can have one solution, several solutions, no solutions, or an entire domain of solutions. Over the real numbers, gives the singleton set , gives the empty set, and the mathematical identity gives the whole real line. Changing that second equation's domain to the complex numbers gives . The elementary definition by values that satisfy an equation and the classification by solution sets appear in College Algebra 2e, §2.2: Solving Linear Equations in One Variable.
Three equivalent equations have the same singleton set of solutions , even though their displayed function values differ
. Details. Requiring several conditions simultaneously takes the intersection of their solution sets. The squared equation has solution set . Adding the restriction giveswhich is also the solution set of . The extraneous solution example explains why the sign restriction is needed. Requiring at least one of several conditions instead takes their union. This turns logical combinations of constraints into reusable operations on sets.
For several variables, a solution is an ordered assignment, usually represented by a tuple. The real equation has solution set , a straight line in the Euclidean plane with coordinates . Adding intersects that straight line with another, leaving the single tuple . A system of linear inequalities has no solution exactly when the intersection of its individual solution sets is the empty set. For optimization constraints, this common solution set is the feasible region.
Because a solution set is a set, the order in which its members are listed is irrelevant. The multiple root of is still the one solution ; its multiplicity of a root is additional polynomial information, rather than a second occurrence inside the solution set. Equivalent equations preserve the solution set on the stated domain, even if their algebraic forms differ.
Standard normal distribution Created 2026-09-24 Updated 2026-10-14
The standard normal distribution is : the normal distribution with mean zero, variance one and standard deviation one. Its standard normal density integrates to one; its standard normal distribution function records the area accumulated from to a threshold. The distinction matters: , , and for a standard normal random variable .
For a toy measurement , leave the measurement unit unspecified. The standardization of a normal random variable converts into standard scores . Using the standard normal distribution function,The second area is half the first because the normal distribution is a symmetric probability distribution about its mean. The numerical heights differ: , yet the corresponding shaded areas are equal because in the change of variables.
Let and give each factor of the usual topology of the real line. The familiar standard basis vectors extend to unit sequences with when and zero otherwise. Their finite linear combinations are exactly the finitely supported sequences, rather than all of .
For every fixed coordinate , for all . Therefore in the product topology. More directly, any basic cylinder set containing zero contains every with : all of its tested coordinates are then zero. The moving unit entry escapes every fixed finite collection of observations.
In the l-infinity sequence space of bounded real sequences, however,Thus the same sequence does not converge to zero in the supremum norm. Here the comparison is between the subspace topology inherited from the product topology and the norm topology on . The supremum norm is not a finite-valued norm on all of , which also contains unbounded sequences. In the box topology on , the neighborhood of zero excludes every , so is not a convergent sequence with limit zero there either.
Strictly decreasing function 2026-10-14
A real-valued function is a strictly decreasing function if every pair in its domain of a function satisfies . It is a nonincreasing function and is injective, with a strictly decreasing inverse function on its image of a function. Negating a strictly increasing function gives a strictly decreasing function: is an example on the real line, even though its derivative vanishes at zero. Equal outputs are forbidden, unlike for a general nonincreasing function.
Strictly increasing function Created 2026-09-24 Updated 2026-10-14
A real-valued function is a strictly increasing function if every pair in its domain of a function satisfies . It is therefore injective, and each output has at most one preimage. Its inverse function on its image of a function is also strictly increasing. Every strictly increasing function is a nondecreasing function; the converse fails when outputs repeat.
The polynomial is a strictly increasing function on the real line, although its derivative is zero at zero. Indeed, for ,because can vanish only when . Thus a positive derivative everywhere is sufficient on a real interval, but is not necessary for a strictly increasing function.
Strict monotonicity does not ensure continuity: for and for is a strictly increasing function with a jump discontinuity. Its image of a function omits , so the inverse function exists only on the actual image of a function, rather than on all the real numbers.
Student's t-distribution Created 2026-09-29 Updated 2026-10-20
The Student's t-distribution describes a standard normal random variable divided by an independent estimate of its scale. For any real , let have the standard normal distribution and let have the chi-squared distribution, with and independent. ThenThe parameter is called the number of statistical degrees of freedom. It need not be an integer: the chi-squared distribution is a gamma distribution with shape and rate . The independence assumption is essential; specifying only the two marginal distributions does not determine the probability distribution of their ratio.
Its probability density function on the whole real line iswhere is the gamma function. Every member is a symmetric distribution about zero. At it is the Standard Cauchy distribution; as it approaches the standard normal distribution. The essential shape change is the tail: at any fixed finite , decays like a constant times , much more slowly than the standard normal density's exponential decay. Thus it is a heavy-tailed distribution. [ref]
1.3.6.6.4. t Distribution. NIST and SEMATECH e-Handbook of Statistical Methods; NIST/SEMATECH e-Handbook, Section 1.3.6.6.4: density, Cauchy special case and normal limit; the ratio derivation here also permits noninteger degrees of freedom
The left panel shows the centers; the right panel uses a logarithmic scale to reveal the tails that a linear plot hides. All four curves have location zero and scale one. They do not have the same variance: the curve has no finite mean or variance, whereas has variance 3 and has variance .
More generally, the absolute moment for is finite exactly when , as follows by comparing the tail integrand with . ConsequentlyFor there is no finite mean; symmetry alone cannot supply one. For the mean exists but the variance is infinite. For even the centered definition of variance is unavailable because the mean does not exist.
A shifted and scaled version , , has probability density function . The scale is not its standard deviation: for ,For example, and scale give standard deviation , rather than 2. The distinction matters when using a Student's t-distribution to model data with occasional extreme values, as well as when interpreting a Student t confidence interval.
Support Created 2026-10-14 Updated 2026-11-05
For a scalar-valued function on a topological space , its support isThe closure matters. On the real line, is nonzero exactly on , but its support is the closed interval . A point where vanishes can still belong to the support if nonzero values occur arbitrarily near it.
For the discrete topology, every subset is closed, so the support is simply the set of inputs with nonzero values. This is the convention used when representing a finitely supported count function. A function has compact support when the displayed closed set is compact.
Support of a probability distribution Created 2026-10-06 Updated 2026-11-05
For a probability measure on a topological space, its support isA point belongs to the support when observations can fall arbitrarily close to it with positive probability. This is a neighbourhood condition, not a requirement that the point itself have positive probability mass or that a chosen density be positive there.
For the uniform distribution on viewed as a law on the real line, the support is , including both endpoints. A density on vanishes at zero, but zero still lies in its support because every open neighbourhood of zero has a positive integral of . A discrete distribution with mass at , , likewise has zero in its support despite assigning it probability mass zero.
If a distribution's support equals an interval, every open subinterval of that interval has positive probability. The weaker condition does not imply that the support equals : a uniform law on also assigns probability one to , but assigns zero to its subinterval . This distinction matters when using support to describe feasible observations or randomized effort in a contest.
Thomae function Created 2026-09-24 Updated 2026-11-05
The Thomae function on the real line is at irrational and for a rational written in lowest terms with . It is continuous at every irrational point and discontinuous at every rational point.
To see continuity at an irrational , choose . In any bounded neighborhood there are only finitely many reduced rationals with denominator at most ; avoid them with a smaller neighborhood of . All remaining values are less than . At rational , irrational points approaching it have value zero instead of . Despite these dense discontinuities, the function is Riemann integrable on every closed finite interval, with integral zero.
Topological manifold Created 2026-09-24 Updated 2026-10-14
A topological -manifold without boundary is a topological space satisfying three conditions: it is Hausdorff, it is second countable, and every point lies in an open set with a homeomorphism onto an open set . Here is a fixed dimension of a manifold, and has the usual topology of Euclidean space. The pair is a coordinate chart. Unless explicitly qualified, “topological manifold” here means without boundary.[ref]
The Hausdorff condition requires disjoint open neighbourhoods for distinct points. Second countability requires a countable basis of a topology. Neither follows merely from the local homeomorphisms: non-Hausdorff manifolds fail the first condition, while an uncountable disjoint union of copies of the real line fails the second. Indeed, a basis of a topology must supply a different nonempty member inside each copy, so it cannot be countable.
The circle and the real line are both one-dimensional topological manifolds, with the same local model. Their global topologies differ: the circle is compact, while the real line is not. By contrast, the junction of a topological tripod already fails the local test. Thus local coordinate charts specify what kind of small pieces are allowed; global topological invariants distinguish how those pieces fit together.[ref]
Introduction. Introduction to Topological Manifolds by John M. Lee, second edition, Chapter 1, pages 1–3 on local models and pages 5–6 on topological invariants
The usefulness of a topological manifold is that local questions about continuity can be transported into Euclidean space, while compactness, connectedness, and the fundamental group still record global information. For calculus, further structure is needed: a smooth atlas requires smooth transition maps, letting the chain rule reconcile derivatives computed in different coordinate charts. A topological atlas by itself only guarantees homeomorphisms between coordinates.[ref]
Week 2 course notes. Topology I: smooth manifolds, Week 2, Section 1.2, equation (11) and Definitions 1.15–1.16, pages 5–6
Topological tripod Created 2026-10-07 Updated 2026-10-14
A topological tripod is three copies of the closed interval with their zero endpoints identified to a single junction . Equivalently, embed three line segments with distinct directions in the Euclidean plane and use the subspace topology. It is a compact, connected metric space, and is Hausdorff, second countable, and paracompact. Every interior arm point has a coordinate chart to an open interval, and each outer endpoint has a half-interval chart as in a topological manifold with boundary. The junction has neither kind of chart.
Removing the center of a small neighborhood leaves two pieces on a line or circle, but three at a tripod junction
. Details. Here is a precise local obstruction. Let be a small open neighbourhood of consisting of initial segments of the three arms, excluding their outer endpoints. Every connected open neighbourhood of contained in contains an initial segment on every arm, because is open at . Its intersection with each arm has no gaps: if a point between and a point of were missing, cutting there would separate the part beyond it from the rest of , contradicting connectedness. Thus has exactly three connected components, one interval per arm.
Suppose a coordinate chart to the real line existed at . Choose a small open interval about lying inside , and restrict the chart to . This is a connected open neighbourhood of contained in . Removing leaves three connected components in , while removing leaves two in . A homeomorphism preserves connected components, so this is impossible. This restriction step is essential: the count is proved for any sufficiently small connected chart neighborhood, not merely one chosen drawing.
A higher dimension of a manifold cannot repair the junction. For , repeat the argument with an open ball about : a punctured open ball in is path-connected, whereas still has three connected components. A zero-dimensional chart would make an isolated point, which it is not. A chart at a boundary point of a topological manifold with boundary similarly gives a punctured relative half-ball: one connected component when , and a path-connected space when . Consequently the topological tripod fails the local definition even when intrinsic boundary is allowed.
The circle provides a useful warning about scale: deleting a point from the whole circle leaves a connected space, but deleting it from a sufficiently small connected arc leaves two connected components. Local chart tests use the latter. The circle and interval are not homeomorphic article uses deletion from the whole spaces for a different, global obstruction.
Topology Created 2026-09-24 Updated 2026-10-18
Topology studies topological spaces through open sets and continuous maps. Its central equivalence is a homeomorphism: a bijection that preserves continuity in both directions. This lets us distinguish spaces by connectedness or compactness even when numerical metric values are irrelevant. The open interval and the real line have the same topology in this sense, although only the former is a bounded set with its usual metric.
The upper panels show an explicit homeomorphism and the inverse image test for a continuous map. The lower panels exhibit an obstruction to a homeomorphism: removing any point from a circle leaves a connected space, whereas removing an interior point from a closed interval gives two connected components.
Homotopy is a different notion: it varies a continuous map continuously with a parameter and may collapse points. For example, contracts to zero. Thus this closed interval and a singleton have the same homotopy type, but there is no homeomorphism between them because there is no bijection. Homotopy equivalence need not preserve compactness. [ref]
The abstract viewpoint already appears explicitly in Tietze's 1923 paper: he describes topology as the study of properties invariant under invertible continuous maps with continuous inverses, and discusses axioms for neighbourhoods, citing Hausdorff's 1914 book, page 213. [ref]
https://gdz.sub.uni-goettingen.de/fulltext/PPN235181684_0088/00000294?_format=xml. Tietze, Beiträge zur allgemeinen Topologie I, page 290
Translation of a function Created 2026-10-06 Updated 2026-11-05
A translation of a function shifts its function input without altering its values relative to that shift. On the real line, moves the graph of a function rightward by : if has its peak at zero, has it at . These shifts satisfy and .
Translation invariance of Lebesgue measure preserves each finite Lp norm. For the Fourier transform convention , a change of variables givesThe phase sign depends on the stated shift and Fourier transform conventions. In particular, a spatial shift changes phase while preserving the modulus of the transform.
Two ends of a real-line compactification 2026-10-31
For a Hausdorff compactification , let be the intersections of the closures of the positive and negative tails, respectively. Each is nonempty and connected by the closed-filter-base theorem. Their union equals the remainder: an image point has a bounded-interval neighbourhood excluding sufficiently long tails, whereas every neighbourhood of a remainder point meets tails by density and compactness of bounded intervals. If the remainder is finite, each must be a singleton, so there can be only one or two remainder points. In particular there is no three-point compactification of the real line.
Two stereographic charts on the circle 2026-10-14
Take the circle with its subspace topology. Write for its west point and for its east point. Two coordinate charts obtained by stereographic projection areBoth take values in the entire real line. Geometrically, join to and intersect the resulting line with : the height is . Projecting from instead gives height . Each projection omits its own starting point, but the other coordinate chart includes that point. Hence .[ref]
To verify the homeomorphisms, solve the displayed equations for . The inverse functions areEach formula lies on the circle, avoids its excluded point, and is continuous for every real argument. Substitution into the projection formulas returns or ; substitution in the other direction returns . Thus these are continuous bijections with continuous inverse functions, as required for coordinate charts. Since the Euclidean plane is Hausdorff and second countable, the subset with its subspace topology is too. This checks all three conditions for a topological manifold, rather than just drawing a smooth-looking curve.
On the overlap , both are excluded, so . Using , the topological transition map isFor example, has and . The two connected components of the overlap, the upper and lower arcs, correspond to the positive and negative parts of the punctured real line. The values and represent and , respectively, and belong to only one chart each. The reciprocal coordinate change and its inverse function are smooth functions away from zero, so this topological atlas also supplies a smooth atlas.
Why can neither chart be enlarged to a single coordinate chart on the whole circle? The circle is a closed set and a bounded set in the Euclidean plane, hence compact by the Heine-Borel theorem. A global coordinate chart would give a homeomorphism to a nonempty open set . Its image would be compact and therefore closed in the real line. By connectedness of the real line, this forces , which is not compact. This is the one-dimensional instance of no compact manifold has a single Euclidean chart. Locally the circle is indistinguishable from the real line; globally compactness obstructs a single chart.
Uniform derivative convergence with an anchored value Created 2026-10-07 Updated 2026-10-14
Let be continuously differentiable functions on an interval . If by uniform convergence on and at one fixed , then converge locally uniformly to a continuously differentiable function with . If is bounded, the convergence is uniform on all of .[ref]
6.2 Interchange of limits. Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl, §6.2.3, Theorem 6.2.10 and the unbounded-interval observation following its proof
The anchor fixes the additive constant that a derivative cannot see. By the fundamental theorem of calculus, defineThe uniform limit theorem makes a continuous function, so the fundamental theorem of calculus gives . The displayed estimate proves uniform convergence wherever has a common finite bound, and therefore proves locally uniform convergence on any interval.
For example, on take . Its derivative is , with supremum error from , and . The reconstructed uniform limit is ; the exact supremum error is , equal to the bound above. Without an anchor, the constant functions have zero derivatives but no finite pointwise limit. On the real line, has convergent anchored values and uniformly convergent derivatives, but its supremum error from zero is infinite. The bounded-distance condition has a real role.
If real polynomials converge by uniform convergence to on all of the real line, then for some and constants , for every , with convergent. Indeed, a common uniform error below one gives everywhere. A bounded polynomial on the real line is constant, since every nonconstant polynomial grows in absolute value at infinity. Evaluating at zero identifies the limit of a sequence of constants, so is a polynomial. This conclusion depends on the entire real line being the domain.
Uniformly continuous function Created 2026-09-24 Updated 2026-10-18
A uniformly continuous function has one input tolerance valid throughout its domain of a function. For , with , uniform continuity meansChoose the output tolerance first, then a positive valid for every pair of function inputs. It may depend on , the function and its domain of a function, but not on the pair’s location. The absolute values measure input and output distance.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §3.4, Definition 3.4.1: a single positive input tolerance for all pairs in the specified real domain
Compare the quantifier order with the epsilon-delta definition of continuity:Both lines end with . In the first, can depend on the point ; in the second, it is chosen before . Thus uniform continuity implies continuity at every point. Each requested gets its own shared tolerance.
For an exact example, take the polynomial function on the closed interval . For every pair of function inputs in that interval, polynomial factorization givesConsequently works everywhere on this domain of a function. With , the common tolerance is . Near the right endpoint, for example, and have input distance and output distance . The bound is sufficient; it does not claim the largest admissible input window at each point.
On the whole real line, the same polynomial function is a continuous function but fails uniform continuity. Take the sequences and , for positive integers . ThenFor any proposed , choose an integer . The inputs are closer than , yet their outputs violate the fixed tolerance . The sequences need not themselves have a finite limit: their mutual distance is what tends to zero. This is the obstruction captured by the sequential criterion for uniform continuity. Restricting the domain of a function to removes these escaping pairs.
A uniformly continuous function need not be a bounded function. The identity function on the real line has , so always works, although its image of a function is the unbounded real line. Uniform continuity controls changes between nearby inputs, not the overall size of outputs. Likewise, an unbounded domain of a function does not by itself prevent uniform continuity.
The square root supplies a different common tolerance on the interval . Assuming , put and . Since ,Interchanging the inputs when necessary provesThus guarantees uniform continuity on the entire domain of a function, including zero. For , any input distance below suffices. The pairs and both have input distance ; their output distances are respectively and . The common guarantee accommodates quite different local sensitivities.
This Hölder continuity bound allows a curved tolerance rule. It is weaker than a Lipschitz bound: at zero the output change divided by the input change isNo finite Lipschitz constant works near zero, even though uniform continuity does. A Lipschitz function does have uniform continuity, choosing when its Lipschitz bound is positive; when it is a constant function.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §3.4, Proposition 3.4.8 and Example 3.4.10: Lipschitz continuity implies uniform continuity; the square root on the nonnegative half-line separates the properties
Square-root input changes share an output tolerance even though amplification near zero is unbounded
. At left, the exact output changes for base points stay inside whenever and . The right panel computes the amplification for inputs : it grows without bound as decreases. These are calculated function graphs, with no experimental measurements. Details.For general metric spaces, replace the absolute values by the respective distance functions. The Heine-Cantor theorem gives an existence guarantee: every continuous function on a compact metric space is uniformly continuous. In particular, continuity on a finite closed interval provides a common tolerance, even when no simple formula for it is known.[ref]
Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl. §7.5, Definition 7.5.10 and Theorem 7.5.11: uniform continuity between metric spaces and the compact-domain theorem
For a short proof outline, fix . Continuity gives each point an open ball of radius within which outputs differ from by less than . The open balls of half these radii still cover the domain of a function. Compactness supplies a finite subcover. Take to be the smallest half-radius in this finite set. Two inputs closer than lie together in one of the original open balls, so the triangle inequality bounds their output distance by . The beautiful step is that the compact set turns local choices into finitely many choices, whose minimum stays positive.
A shared tolerance also makes uniformly continuous functions preserve Cauchy sequences: after choosing for , all sufficiently late input pairs are closer than , so all corresponding output pairs are closer than . Unlike a convergent sequence argument, this does not require an input limit inside the domain of a function. It is why uniform continuity is useful for extending a function toward missing endpoints and for the decay argument below.
Upper half-plane (complex analysis) Created 2026-09-24 Updated 2026-10-14
The upper half-plane is the open setIt contains precisely the complex numbers with positive imaginary part: is inside, lies on its boundary, and belongs to the lower half-plane. In the complex plane its boundary is the real line; in the Riemann sphere the boundary also includes infinity. It is a convex set, hence a simply connected domain, and the Cayley transform between the half-plane and disk makes it biholomorphic to the unit disc.
With the hyperbolic metric , the same domain becomes the Poincaré half-plane model. Its hyperbolic geodesics are vertical lines and upper semicircles whose centres lie on the real line. Under the Cayley transform, these become arcs of circles orthogonal to the unit circle, with diameters as the straight-line cases. [ref]
Boundary points and hyperbolic geodesics correspond under the Cayley transform from the upper half-plane to the unit disc
. Details. Matching colours identify each hyperbolic geodesic and its image. The vertical line through zero maps to a diameter; the vertical line through one maps to an arc ending at and . A semicircle from to also maps to a diameter, whereas the semicircle from to maps to a curved arc. Their endpoints lie on the boundary, outside the domains: the endpoints are infinitely far from interior points in hyperbolic distance.
The upper half-plane is useful because its straight boundary and explicit upper half-plane automorphisms make conformal maps and hyperbolic geometry calculable. The picture explains why shortest hyperbolic geodesic routes can look curved in Euclidean coordinates; their lengths are measured with the position-dependent hyperbolic metric.
For historical context, in his letter to Klein of 22 September 1882, Poincaré constructs a quadrilateral bounded by four circles orthogonal to a fundamental circle, and studies transformations generating repeated copies. In modern language, the sides inside that circle are hyperbolic geodesics in a disk model. The letter directly exhibits the connection between transformation groups, geometry and complex functions. [ref]
https://henripoincarepapers.univ-nantes.fr/chp/text/klein-en-1882-09-22.html. Poincaré to Klein, 22 September 1882, English translation, opening construction
Upper-half-plane indentation rule Created 2026-09-24 Updated 2026-10-05
Suppose a contour follows the real axis, closes in the upper half-plane, and avoids each simple real pole by a small semicircle above it. Each indentation is clockwise and tends toIf the large arc vanishes and there are no enclosed poles away from the real axis, the Cauchy principal value is therefore









