Community Hub0 Subscribers
Community hub
Unit interval
View on Wikipediafrom Wikipedia
In mathematics, the unit interval is the closed interval [0,1], that is, the set of all real numbers that are greater than or equal to 0 and less than or equal to 1. It is often denoted I (capital letter I). In addition to its role in real analysis, the unit interval is used to study homotopy theory in the field of topology.
In the literature, the term "unit interval" is sometimes applied to the other shapes that an interval from 0 to 1 could take: (0,1], [0,1), and (0,1). However, the notation I is most commonly reserved for the closed interval [0,1].
Properties
[edit]The unit interval is a complete metric space, homeomorphic to the extended real number line. As a topological space, it is compact, contractible, path connected and locally path connected. The Hilbert cube is obtained by taking a topological product of countably many copies of the unit interval.
In mathematical analysis, the unit interval is a one-dimensional analytical manifold whose boundary consists of the two points 0 and 1. Its standard orientation goes from 0 to 1.
The unit interval is a totally ordered set and a complete lattice (every subset of the unit interval has a supremum and an infimum).
Cardinality
[edit]The size or cardinality of a set is the number of elements it contains.
The unit interval is a subset of the real numbers . However, it has the same size as the whole set: the cardinality of the continuum. Since the real numbers can be used to represent points along an infinitely long line, this implies that a line segment of length 1, which is a part of that line, has the same number of points as the whole line. Moreover, it has the same number of points as a square of area 1, as a cube of volume 1, and even as an unbounded n-dimensional Euclidean space (see Space filling curve).
The number of elements (either real numbers or points) in all the above-mentioned sets is uncountable, as it is strictly greater than the number of natural numbers.
Orientation
[edit]The unit interval is a curve. The open interval (0,1) is a subset of the positive real numbers and inherits an orientation from them. The orientation is reversed when the interval is entered from 1, such as in the integral used to define natural logarithm for x in the interval, thus yielding negative values for logarithm of such x. In fact, this integral is evaluated as a signed area yielding negative area over the unit interval due to reversed orientation there.
Generalizations
[edit]The interval [-1,1], with length two, demarcated by the positive and negative units, occurs frequently, such as in the range of the trigonometric functions sine and cosine and the hyperbolic function tanh. This interval may be used for the domain of inverse functions. For instance, when 𝜃 is restricted to [−π/2, π/2] then is in this interval and arcsine is defined there.
Sometimes, the term "unit interval" is used to refer to objects that play a role in various branches of mathematics analogous to the role that [0,1] plays in homotopy theory. For example, in the theory of quivers, the (analogue of the) unit interval is the graph whose vertex set is and which contains a single edge e whose source is 0 and whose target is 1. One can then define a notion of homotopy between quiver homomorphisms analogous to the notion of homotopy between continuous maps.
Fuzzy logic
[edit]In logic, the unit interval [0,1] can be interpreted as a generalization of the Boolean domain {0,1}, in which case rather than only taking values 0 or 1, any value between and including 0 and 1 can be assumed. Algebraically, negation (NOT) is replaced with 1 − x; conjunction (AND) is replaced with multiplication (xy); and disjunction (OR) is defined, per De Morgan's laws, as 1 − (1 − x)(1 − y).
Interpreting these values as logical truth values yields a multi-valued logic, which forms the basis for fuzzy logic and probabilistic logic. In these interpretations, a value is interpreted as the "degree" of truth – to what extent a proposition is true, or the probability that the proposition is true.
See also
[edit]
Look up unit interval in Wiktionary, the free dictionary.
- Interval notation
- Unit square, cube, circle, hyperbola and sphere
- Unit impulse
- Unit vector
References
[edit]- Robert G. Bartle, 1964, The Elements of Real Analysis, John Wiley & Sons.
Unit interval
View on Grokipediafrom Grokipedia
Definition and Fundamentals
Definition
The unit interval, often denoted by $ I $, is the closed subset of the real numbers consisting of all points between 0 and 1, inclusive of the endpoints:
[9]
This set includes the boundary points 0 and 1, forming a bounded segment on the real line.[10] Visually, it represents a straight line segment starting at 0 and ending at 1, serving as a fundamental one-dimensional object in analysis and topology. The concept of the unit interval builds on Georg Cantor's late 19th-century work in set theory, where he examined intervals of real numbers, building on his 1874 proof of the uncountability of the reals, and in 1877 demonstrated that the unit interval has the same cardinality as the unit cube in any finite number of dimensions.[11] The term and its explicit use in modern mathematical contexts emerged in early 20th-century analysis, with significant contributions from Felix Hausdorff, who in his 1914 book Grundzüge der Mengenlehre analyzed intervals like [0,1] in the development of axiomatic set theory and topology.[12] Although variants such as the open interval $ (0,1) $, which excludes the endpoints, or half-open intervals like $ [0,1) $, are used in certain contexts, the closed unit interval [0,1] is the conventional choice, especially for its topological compactness.[13]
Notation and Conventions
The unit interval is primarily denoted using the closed interval notation , where the square brackets indicate inclusion of the endpoints 0 and 1, following the standard interval notation for bounded closed intervals on the real line.[14] This notation emphasizes the set . In many mathematical texts, particularly in topology and homotopy theory, it is also commonly abbreviated as the single capital letter , defined explicitly as .[15] Variants of the unit interval employ different endpoint inclusions to suit analytical needs: the open unit interval is denoted , while half-open forms include and .[1] The closed form is preferred in topological discussions due to its compactness and connectedness as a subspace of , whereas the open is often favored in real analysis and measure theory to focus on interior points without boundary complications.[16] Typographical conventions for the unit interval in print typically render it in italics or boldface to distinguish it as a mathematical object, ensuring clarity in dense prose. In digital typesetting with LaTeX, the standard command is$[0,1]$ for inline usage or `
` for display, which automatically handles spacing and font styling within math mode.[17] These practices promote consistent representation across diverse mathematical literature.
Properties
Topological Properties
The unit interval , equipped with the subspace topology inherited from the real line under the standard topology, exhibits several fundamental topological properties that underscore its role as a prototypical compact space. As a closed and bounded subset of , it satisfies the conditions of the Heine-Borel theorem, which states that a subset of is compact if and only if it is closed and bounded.[18] Specifically, is closed because its complement in is the union of the open intervals and , and it is bounded since all its points lie within the open ball of radius 1 centered at the origin in .[18] Consequently, every open cover of admits a finite subcover, ensuring that continuous images of are compact and that it supports key theorems in analysis and topology.[18] The space is also connected, meaning it cannot be expressed as the union of two disjoint nonempty open sets.[19] This follows from the fact that connected subspaces of are precisely the intervals, and is such an interval.[19] Moreover, is path-connected: for any two points with , the straight-line path for is a continuous map from to connecting them.[20] Path-connectedness implies connectedness, reinforcing the indivisibility of in the topological sense. The metric structure on is induced by the Euclidean metric on , defined by for .[21] This makes a complete metric space, as every Cauchy sequence in converges to a point within it, inheriting completeness from the closed embedding in .[21] It is also totally bounded, coverable by finitely many open balls of any positive radius (for instance, by balls of radius ), and has diameter 1, the supremum of distances between its points, attained at the endpoints 0 and 1.[21] Regarding homeomorphisms, is homeomorphic to any closed bounded interval with via the affine map , which is continuous, bijective, and has a continuous inverse.[22] However, is not homeomorphic to the open unit interval , as removing an interior point from disconnects it into two components, whereas removing any point from leaves it connected.[22] Locally, is compact and metrizable, with every point possessing a compact neighborhood, such as a closed subinterval contained within it.[23] Its topology has a basis consisting of sets of the form where are real numbers, which includes half-open intervals at the endpoints like for and for .[23] This basis is countable when restricted to rational endpoints, confirming that is second countable.[23]Order Properties
The unit interval , equipped with the standard order inherited from the real numbers , is a totally ordered set: for any , either or , with serving as the minimum element and as the maximum element.[24] This order is linear and antisymmetric, ensuring a unique total ranking of its elements without incomparabilities.[25] The order on is dense, such that between any two distinct points in the interval, there exists at least one with ; this property follows from the density of both rational and irrational numbers within the reals, restricted to the bounded segment .[26] Density implies that the order has no "gaps," allowing for infinite subdivision while maintaining the total ordering. Under the lattice operations defined by the minimum (meet, ) and maximum (join, ), forms a complete lattice: for any subset , the infimum and supremum exist and belong to , bounded by the global minimum and maximum .[24] This structure supports the computation of meets and joins for arbitrary collections, reflecting the completeness of the underlying real order.[25] As an oriented interval, possesses a natural direction from to , which is preserved by monotone functions: non-decreasing maps maintain the order relations, ensuring implies .[27] Such functions respect the interval's inherent progression along the order. The unit interval is convex in , meaning that for any and , the convex combination lies entirely within , forming the line segment between and .[28] This convexity underscores the interval's role as a connected segment under the linear order.Cardinality
The unit interval is uncountable, a fact established by Georg Cantor's diagonal argument from 1891. To see this, suppose for contradiction that there exists a countable enumeration of all elements in , where each has a decimal expansion with digits . Construct a number by setting if the -th digit of is 9, and otherwise. Then differs from in the -th decimal place for every , so is not in the enumeration, yielding a contradiction. This argument applies to a subset of with representations using only digits 4 and 9 to avoid non-unique expansions, but extends to the full interval, proving uncountability.[29] The cardinality of , denoted , equals the cardinality of the continuum . This follows from the existence of a bijection between and , composed as followed by the tangent function, yielding , which maps bijectively onto ; the endpoints 0 and 1 add only two elements, preserving cardinality via the Schröder–Bernstein theorem. Moreover, , the cardinality of the power set of the natural numbers, via binary expansions: each corresponds to a sequence where and , identifying the subset ; non-uniqueness for dyadic rationals affects only countably many points and does not alter the overall cardinality.[30] The continuum hypothesis (CH) asserts that , meaning no infinite cardinal lies strictly between (the cardinality of ) and . CH is independent of the Zermelo–Fraenkel set theory with the axiom of choice (ZFC): Kurt Gödel proved in 1938 that ZFC is consistent with CH (and the generalized continuum hypothesis) by constructing the inner model of constructible sets satisfying these axioms, assuming ZFC's consistency. Paul Cohen showed in 1963 that ZFC is also consistent with the negation of CH using the forcing technique to build models where . Thus, neither CH nor its negation can be derived from ZFC alone.[31][32] Although uncountable, contains a countable dense subset, namely . The set is countable as the union over positive integers of the finite sets of fractions in lowest terms with , so any subset is countable; density follows from the density of the rational numbers in the real numbers, which implies that every non-empty open subinterval of [0,1] contains a rational number. This countable dense subset highlights the distinction between combinatorial size and topological density in .[30]Measure and Integration
Lebesgue Measure
The Lebesgue measure on the unit interval is defined such that , providing a complete, translation-invariant measure on the Borel -algebra that extends the intuitive notion of length to more general sets. The outer measure for any subset is given by the infimum of the sums of lengths of countable open covers of , while the inner measure uses suprema over measures of compact subsets; a set is Lebesgue measurable if these coincide. This measure is -additive on the Borel -algebra, ensuring countable unions of disjoint measurable sets have measures summing to the measure of the union.[33][34] The Borel -algebra consists of all sets generated by the open intervals within , and includes all open and closed subsets of the unit interval as Borel measurable sets. Every open set in is a countable union of such intervals with rational endpoints, confirming the generative role of intervals.[35] Although the Lebesgue measure covers a rich class of sets, not all subsets of are measurable; the Vitali set, constructed by partitioning into equivalence classes under rational translations and selecting one representative from each using the axiom of choice, exemplifies a non-Lebesgue measurable subset. This construction yields a set whose measure cannot be consistently defined, as its rational translates are disjoint and cover up to measure zero, yet their total measure would contradict the unit length if assigned a value. The unit interval serves as a foundational domain for Lebesgue integration, where the space comprises equivalence classes of measurable functions with finite , equipped with the norm . The Lebesgue integral extends Riemann integration to broader classes of functions, including those discontinuous on sets of measure zero. Compactness of implies uniform continuity for continuous functions, facilitating their measurability and integrability. Lebesgue measure on exhibits translation invariance for shifts by , where for measurable , though the interval's lack of group structure under addition modulo 1 limits full invariance compared to .[36]Riemann Integration
The Riemann integral provides a foundational method for computing the integral of a function defined on the unit interval [0,1]. For a bounded function , the integral is defined as the limit of Riemann sums , where the interval is partitioned into subintervals of lengths and is a point in each subinterval , taken as the norm of the partition approaches zero.[37] If is continuous on the compact interval [0,1], it is uniformly continuous, ensuring the limit exists and is independent of the choice of points .[38] This guarantees that every continuous function on [0,1] is Riemann integrable.[39] An equivalent formulation, known as the Darboux integral, defines integrability through upper and lower sums. For a partition , the upper sum is where , and the lower sum is where . The function is Riemann integrable if the upper integral equals the lower integral , with the common value being the integral.[40] A criterion for integrability states that is integrable if and only if for every , there exists a partition such that , which relates to the oscillation of being controlled on fine partitions. This approach emphasizes the convergence of sums without tagged points, aligning closely with the Riemann sum definition.[41] The fundamental theorem of calculus connects differentiation and integration on [0,1]. If is Riemann integrable on [0,1] and , then is continuous on [0,1] and differentiable on (0,1) with almost everywhere; moreover, if is an antiderivative of (i.e., for all ), then .[42] For example, taking , the antiderivative is , so .[43] This theorem underpins the evaluation of definite integrals via antiderivatives on the unit interval. Improper Riemann integrals extend the definition to functions unbounded near endpoints. For continuous on but unbounded at 0, the improper integral is , provided the limit exists. For instance, has antiderivative , so , converging despite the singularity at 0.[44] Every Riemann integrable function on [0,1] is Lebesgue integrable with the same integral value, but the converse does not hold; for example, the Dirichlet function if is rational and 0 otherwise is not Riemann integrable due to its discontinuities everywhere, yet it is Lebesgue integrable with integral 0.[45] This highlights the Riemann integral's limitations for highly discontinuous functions on the unit interval.[46]Applications
In Probability Theory
In probability theory, the unit interval [0,1] serves as the canonical sample space for the uniform distribution, where the probability measure is the Lebesgue measure normalized to have total mass 1.[47] For a random variable uniformly distributed on [0,1], the cumulative distribution function is for , and the probability density function is for .[48] This distribution assigns equal probability to every subinterval of equal length within [0,1], making it a foundational model for continuous randomness.[49] Any continuous random variable on [0,1] can be generated from a uniform random variable on [0,1] using the inverse cumulative distribution function (CDF) transform, also known as the probability integral transform.[50] Specifically, if is the CDF of a target continuous distribution, then follows that distribution, enabling the simulation of arbitrary continuous distributions from uniforms on the unit interval.[51] This transformation underpins much of computational probability, as it allows uniform samples to produce samples from more complex distributions via quantile functions.[52] The uniform distribution on [0,1] arises as a special case of the beta distribution with shape parameters and .[53] The beta distribution, supported on [0,1], has density where is the beta function, and the case simplifies to the constant density 1, recovering the uniform.[54] In Bayesian statistics, the uniform prior (beta(1,1)) is often used as a non-informative prior for parameters in [0,1], such as success probabilities in binomial models, due to its flatness implying equal prior plausibility across the interval.[55] Monte Carlo methods exploit uniform sampling from [0,1] to approximate definite integrals numerically.[56] For a function integrable over [0,1], the integral is estimated by , where are i.i.d. uniform on [0,1]; by the law of large numbers, this sample average converges to the expected value as .[57] This basic estimator forms the basis for broader Monte Carlo integration techniques in simulation and computational statistics.[58] The law of large numbers applies directly to i.i.d. uniform random variables on [0,1], stating that their sample average converges almost surely (or in probability) to the mean .[59] Furthermore, the central limit theorem ensures that the standardized sample average converges in distribution to a standard normal with variance , providing asymptotic normality for inference on uniform-based estimators.[60] These limit theorems justify the reliability of Monte Carlo approximations and uniform sampling in probabilistic modeling.[61]In Fuzzy Logic
In fuzzy set theory, the unit interval provides the codomain for membership functions, allowing for graded degrees of belonging rather than binary membership. Introduced by Lotfi A. Zadeh in 1965, a fuzzy set on a universe is defined by a membership function , where denotes complete non-membership, full membership, and intermediate values in represent partial membership degrees.[62] This framework extends classical set theory to handle vagueness and imprecision in real-world applications.[62] Fuzzy logics build on this by assigning truth values in to propositions, enabling many-valued reasoning beyond classical bivalence. In Łukasiewicz logic, an infinite-valued system originally developed in the 1920s and adapted to fuzzy contexts, truth values lie in , with negation defined as and conjunction options including the minimum or the Łukasiewicz operation . [63] Gödel logic, another prominent fuzzy system, interprets conjunction as , disjunction as , and the top element as , structuring as a Heyting algebra suitable for intuitionistic fuzzy reasoning. [64] T-norms play a central role in defining fuzzy intersections and conjunctions on , serving as continuous, associative, commutative, and monotonic binary operations with for all . Examples include the product t-norm , which models probabilistic-like intersections in fuzzy sets.[65] These operations ensure the algebraic structure of fuzzy logics remains sound and complete over . Zadeh's framework found practical use in control systems, where fuzzy controllers map crisp inputs to outputs in via membership functions and inference rules, then defuzzify to real actions.[62] For instance, Mamdani controllers employ -valued rules to manage nonlinear systems like temperature regulation, demonstrating robustness in uncertain environments.Generalizations
To Higher Dimensions
The unit hypercube in $ n $-dimensions, denoted $ [0,1]^n $, is defined as the Cartesian product of $ n $ unit intervals $ [0,1] $.[66] This construction inherits the compactness of the base unit interval, making $ [0,1]^n $ a compact subset of $ \mathbb{R}^n $. Under the $ n $-dimensional Lebesgue measure, the volume of the unit hypercube is 1, as it generalizes the length 1 of the one-dimensional interval.[66] The unit ball in $ \mathbb{R}^n $, defined as $ { x \in \mathbb{R}^n \mid |x| \leq 1 } $ where $ | \cdot | $ is the Euclidean norm, provides a rounded analog to the hypercube. For example, in $ \mathbb{R}^2 $, it is the unit disk. Unlike the hypercube, which has flat faces, the unit ball is strictly convex, yet both are compact sets in $ \mathbb{R}^n $.[67] Topologically, the closed unit hypercube $ [0,1]^n $ is homeomorphic to the closed unit ball via mappings such as radial projections that scale points based on their infinity norm relative to the Euclidean norm. Both spaces are compact, connected manifolds with boundary, ensuring their equivalence under continuous deformations.[68] The $ n $-dimensional volume of the unit ball is given by
where $ \Gamma $ is the gamma function.[67] This volume approaches 0 as $ n $ increases, in contrast to the fixed volume 1 of the unit hypercube, illustrating the curse of dimensionality where high-dimensional balls concentrate most mass near the boundary relative to the enclosing cube.[69]
In optimization, the probability simplex $ \Delta^{n-1} = { x \in [0,1]^n \mid \sum_{i=1}^n x_i = 1 } $, a subset of the unit hypercube, parameterizes distributions over $ n $ outcomes and is central to problems like entropy maximization or resource allocation.[70]