Interval (mathematics)

.

Uses your system voice; voice and rate in settings.

≈ 17 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, an interval is the set of all real numbers lying between two fixed lower or upper bounds ("endpoints") with no "gaps". For example, the set of real numbers consisting of , , and all numbers in between is an interval, denoted and called the unit interval.

An interval may contain neither endpoint (called an open interval), both endpoints (called a closed interval), or either endpoint (called a semi-open or semi-closed interval). The intervals just described are the bounded intervals.

Often intervals are also allowed to extend without bound in one or both directions, with the unbounded side being denoted by a positive or negative infinity symbol. The set of all positive real numbers is an interval in this sense, denoted ; the set of all real numbers is an interval that is unbounded on both ends, denoted . Intervals are ubiquitous in mathematical analysis.

For example, they occur implicitly in the epsilon-delta definition of continuity; the intermediate value theorem asserts that the image of an interval by a continuous function is an interval; integrals of real functions are defined over an interval; etc. For example, interval arithmetic consists of computing with intervals instead of real numbers for providing a guaranteed enclosure of the result of a numerical computation, even in the presence of uncertainties of input data and rounding errors. Intervals can be defined more generally on any totally ordered set, such as integers or rational numbers.

The notation of integer intervals is considered in the special section below.

Definition of an interval

An interval is a subset of the real numbers that contains all real numbers lying between any two numbers of the subset. Examples are the numbers x from one to two, 1 \leq x \leq 2 , and the numbers y greater than 10, i.e. y > 10 . Under this definition, the empty set and the entire set of real numbers are both intervals.

The endpoints of an interval are its supremum (least upper bound), and its infimum (greatest lower bound), if they exist as real numbers. If the infimum does not exist and the interval is not empty, one says often that the corresponding endpoint is negative infinity, written -\infty.

Similarly, if the supremum of a non-empty interval does not exist, one says that the corresponding endpoint is positive infinity, written +\infty. Non-empty intervals are completely determined by their endpoints and whether each endpoint belongs to the interval.

This is a consequence of the least-upper-bound property of the real numbers, which implies that if the elements of a non-empty interval are all less than some finite value, then the interval has a supremum. This characterization is used to specify intervals by means of , where a square or rounded bracket (parenthesis) indicates whether or not an endpoint belongs to the inteval.

Open and closed intervals

An does not include any endpoint and can be succinctly indicated with parentheses. For example, (0, 1) = \{x \mid 0 is the interval of all real numbers greater than 0 and less than 1 . (This interval can also be denoted by ]0,1[ , see below).

The open interval (0, +\infty) consists of real numbers greater than 0 , i.e., positive real numbers. The open intervals have thus one of the forms \begin{align} (a,b) &= \{x\in\mathbb R \mid a where a and b are real numbers such that a In the last case, the resulting interval is the empty set and does not depend on .

The open intervals are those intervals that are open sets for the usual topology on the real numbers, and they form a base of the open sets. A is an interval which includes both endpoints, which are finite. A closed interval is denoted with square brackets.

For example, is the closed interval with contents greater than or equal to and less than or equal to . Closed intervals are by definition non-empty. Thus every closed interval has the form \begin{align} \;[a,b] &= \{x\in\mathbb R \mid a\le x\le b\} \end{align} where a . The interval consisting of a single point [a,a]=\{a\} is sometimes called a degenerate closed interval.

In addition to the closed intervals [a,b] common in analysis, unbounded intervals that include their finite endpoint such as [a,\infty) or (-\infty,b] are topologically closed (meaning that they contain all of their boundary points that are real numbers) but are not usually called "closed intervals" in analysis, that term being reserved for the closed and bounded case. The (bounded) closed intervals together with the semi-infinite closed intervals, and the interval (-\infty,\infty) comprise those intervals that are closed sets for the usual topology on the real numbers.

Half-open intervals

A has two distinct finite endpoints, and includes one but not the other. It is said to be left-open or right-open depending on whether the excluded endpoint is on the left or on the right. These intervals are denoted by mixing notations for open and closed intervals.

For example, means greater than and less than or equal to , while means greater than or equal to and less than . The half-open intervals have the form \begin{align} \left(a,b\right] &= \{x\in\R \mid a In summary, a set of the real numbers is an interval, if and only if it is an open interval, a closed interval, or a half-open interval.

The only intervals that appear twice in the above classification are and that are both open and closed.

Degenerate intervals

A is any set consisting of a single real number (i.e., an interval of the form ). Some authors include the empty set in this definition. A real interval that is neither empty nor degenerate is said to be , and has infinitely many elements.

Bounded intervals

An interval is said to be left-bounded or right-bounded, if there is some real number that is, respectively, smaller than or larger than all its elements. An interval is said to be bounded, if it is both left- and right-bounded; and is said to be unbounded otherwise. Intervals that are bounded at only one end are said to be half-bounded.

The empty set is bounded, and the set of all reals is the only interval that is unbounded at both ends. Bounded intervals are also commonly known as finite intervals. Bounded intervals are bounded sets, in the sense that their diameter (which is equal to the absolute difference between the endpoints) is finite.

The diameter may be called the length, width, measure, range, or size of the interval. The size of unbounded intervals is usually defined as , and the size of the empty interval may be defined as (or left undefined). The centre (midpoint) of a bounded interval with endpoints and is , and its radius is the half-length .

These concepts are undefined for empty or unbounded intervals.

Categorisation by minimum and maximum elements

An interval is said to be left-open if and only if it contains no minimum (an element that is smaller than all other elements); right-open if it contains no maximum; and open if it contains neither. The interval , for example, is left-closed and right-open. The set of non-negative reals is a closed interval that is right-open but not left-open.

An interval is said to be left-closed if it has a minimum element or is left-unbounded, right-closed if it has a maximum or is right unbounded; it is simply closed if it is both left-closed and right closed.

An interval is a subinterval of interval if is a subset of . An interval is a proper subinterval of if is a proper subset of . The interior of an interval is the largest open interval that is contained in ; it is also the set of points in which are not endpoints of .

The closure of is the smallest closed interval that contains ; which is also the set augmented with its finite endpoints. For any set of real numbers, the interval enclosure or interval span of is the unique interval that contains , and does not properly contain any other interval that also contains .

Segments and intervals

There is conflicting terminology for the terms segment and interval, which have been employed in the literature in two essentially opposite ways, resulting in ambiguity when these terms are used. The Encyclopedia of Mathematics defines interval (without a qualifier) to exclude both endpoints (i.e., open interval) and segment to include both endpoints (i.e., closed interval), while Rudin's Principles of Mathematical Analysis calls sets of the form [a, b] intervals and sets of the form (a, b) segments throughout.

These terms tend to appear in older works; modern texts increasingly favor the term interval (qualified by open, closed, or half-open), regardless of whether endpoints are included.

Notations for intervals

The interval of numbers between and , including and , is often denoted . The two numbers are called the endpoints of the interval. In countries where numbers are written with a decimal comma, a semicolon may be used as a separator to avoid ambiguity.

Including or excluding endpoints

To indicate that one of the endpoints is to be excluded from the set, the corresponding square bracket can be either replaced with a parenthesis, or reversed. Both notations are described in International standard ISO 31-11.

Thus, in set builder notation, \begin{align} (a,b) = \mathopen{]}a,b\mathclose{[} &= \{x\in\R \mid a Each interval , , and represents the empty set, whereas denotes the singleton set  . When , all four notations are usually taken to represent the empty set. Both notations may overlap with other uses of parentheses and brackets in mathematics.

For instance, the notation is often used to denote an ordered pair in set theory, the coordinates of a point or vector in analytic geometry and linear algebra, or (sometimes) a complex number in algebra. That is why Bourbaki introduced the notation to denote the open interval. The notation too is occasionally used for ordered pairs, especially in computer science.

Some authors such as Yves Tillé use to denote the complement of the interval  ; namely, the set of all real numbers that are either less than or equal to , or greater than or equal to .

Infinite endpoints

In some contexts, an interval may be defined as a subset of the extended real numbers, the set of all real numbers augmented with and . In this interpretation, the notations , , , and are all meaningful and distinct. In particular, denotes the set of all ordinary real numbers, while denotes the extended reals.

Even in the context of the ordinary reals, one may use an infinite endpoint to indicate that there is no bound in that direction. For example, is the set of positive real numbers, also written as \mathbb{R}_+. The context affects some of the above definitions and terminology.

For instance, the interval  =  \R is closed in the realm of ordinary reals, but not in the realm of the extended reals.

Integer intervals

When and are integers, the notations ⟦a, b⟧, , , or just , are sometimes used to indicate the interval of all integers between and included. The notation is used in some programming languages; in Pascal, for example, it is used to formally define a subrange type, most frequently used to specify lower and upper bounds of valid indices of an array.

Another way to interpret integer intervals are as sets defined by enumeration, using ellipsis notation. An integer interval that has a finite lower or upper endpoint always includes that endpoint. Therefore, the exclusion of endpoints can be explicitly denoted by writing , , or .

Alternate-bracket notations like or are rarely used for integer intervals. \operatorname{cl}(a,b)=\operatorname{cl}(a,b]=\operatorname{cl}[a,b)=\operatorname{cl}[a,b]=[a,b], \operatorname{cl}(a,+\infty)=\operatorname{cl}[a,+\infty)=[a,+\infty), \operatorname{cl}(-\infty,a)=\operatorname{cl}(-\infty,a]=(-\infty,a], \operatorname{cl}(-\infty,+\infty)=(-\infty,\infty). The intersection of any collection of intervals is always an interval.

The union of two intervals is an interval if and only if they have a non-empty intersection or an open end-point of one interval is a closed end-point of the other, for example (a,b) \cup [b,c] = (a,c]. If \R is viewed as a metric space, its open balls are the open bounded intervals  , and its closed balls are the closed bounded intervals  . In particular, the metric and order topologies in the real line coincide, which is the standard topology of the real line.

Any element  of an interval  defines a partition of  into three disjoint intervals 1 , 2 , 3 : respectively, the elements of  that are less than  , the singleton  [x,x] = \{x\}, and the elements that are greater than  . The parts 1 and 3 are both non-empty (and have non-empty interiors), if and only if is in the interior of  . This is an interval version of the trichotomy principle.

The integral of a real function is defined over an interval. The endpoints of the interval involved usually occur as a subscript and superscript, so the integral \int_a^b f(x) \, dx applies to all x belonging to the interval [a, b] . Intervals occur implicitly in the epsilon-delta definition of continuity of a function f(x) : the following account makes them explicit.

The function f is said to be continuous at a point a if for any given value \varepsilon > 0 (epsilon greater than zero) there is a value \delta > 0 (delta greater than zero) for which f(x) lies in the open interval \left( f(a)-\varepsilon , f(a)+\varepsilon \right) whenever x is chosen from the interval \left( a-\delta, a+\delta \right) . The possible values of \varepsilon and \delta themselves belong to the unbounded interval (0, +\infty) , but are usually considered to describe small positive increments.

The idea is that a small symmetric interval around point a exists where the value of f(x) stays within an open interval of radius \varepsilon centred around f(a) . The intermediate value theorem captures the intuition that if f\colon [a, b]\to \R is a real valued continuous function on an interval [a, b] and d is any value between f(a) and f(b) , then we expect to find a value c between a and b where f(c)=d . For example, if f(x)=x^2 is defined on the interval [3,4] , then given d=10 between f(3)=3^2=9 and f(4)=4^2=16 , there is a value c between 3 and 4 where f(c)=c^2=10 . An equivalent formulation of the theorem asserts that the image of an interval by a continuous function is an interval.

P(\mu-2\sigma \leq X \leq \mu+2\sigma) \approx 0.95 for a normally distributed random variable X . Take \bar{X} to be the sample mean for a fixed sample size, which is an estimator for \mu . It also has a normal distribution with its own standard deviation \sigma_\bar{X} .

The previous inequalities can then be written in terms of \mu to give P(\bar{X}-2\sigma_\bar{X} \leq \mu \leq \bar{X}+2\sigma_\bar{X}) \approx 0.95. If the value of the standard deviation \sigma_\bar{X} is known, then the interval [\bar{X}-2\sigma_\bar{X}, \bar{X}+2\sigma_\bar{X}] will be a confidence interval for \mu with a confidence level of approximately 0.95.

Its endpoints are the random variables \bar{X}-2\sigma_\bar{X} and \bar{X}+2\sigma_\bar{X} , whose actual values will depend on the sample taken.

Generalizations

A finite interval is (the interior of) a 1-dimensional hyperrectangle. Generalized to real coordinate space \R^n, an axis-aligned hyperrectangle (or box) is the Cartesian product of n finite intervals. For n=2 this is a rectangle; for n=3 this is a rectangular cuboid (also called a "box").

Allowing for a mix of open, closed, and infinite endpoints, the Cartesian product of any n intervals, I = I_1\times I_2 \times \cdots \times I_n is sometimes called an n -dimensional interval. A facet of such an interval I is the result of replacing any non-degenerate interval factor I_k by a degenerate interval consisting of a finite endpoint of I_k.

The faces of I comprise I itself and all faces of its facets. The corners of I are the faces that consist of a single point of \R^n.

Complex intervals

Intervals of complex numbers can be defined as regions of the complex plane, either rectangular or circular. (a,b) =\{x\in X \mid a [a,b] =\{x\in X \mid a\lesssim x\lesssim b\}, (a,b] =\{x\in X \mid a [a,b) =\{x\in X \mid a\lesssim x (a,\infty) =\{x\in X \mid a [a,\infty) =\{x\in X \mid a\lesssim x\}, (-\infty,b) =\{x\in X \mid x (-\infty,b] =\{x\in X \mid x\lesssim b\}, (-\infty,\infty) =X, where x means x\lesssim y\not\lesssim x. Actually, the intervals with single or no endpoints are the same as the intervals with two endpoints in the larger preordered set \bar X=X\sqcup\{-\infty,\infty\} -\infty defined by adding new smallest and greatest elements (even if there were ones), which are subsets of X. In the case of X=\mathbb R one may take \bar\mathbb R to be the extended real line. \mathbb Q=\{x\in\mathbb Q \mid x^2 is convex, but not an interval of \mathbb Q, since there is no square root of two in \mathbb Q. Let (X,\lesssim) be a preordered set and let Y\subseteq X. The convex sets of X contained in Y form a poset under inclusion.

A maximal element of this poset is called a convex component of Y. By the Zorn lemma, any convex set of X contained in Y is contained in some convex component of Y, but such components need not be unique. In a totally ordered set, such a component is always unique. That is, the convex components of a subset of a totally ordered set form a partition.

There is an ideal I\subseteq L and a filter F\subseteq L such that S=I\cap F. z = \tfrac12(x + y) + \tfrac12(x - y)j, where j^2 = 1. This linear mapping of the plane, which amounts of a ring isomorphism, provides the plane with a multiplicative structure having some analogies to ordinary complex arithmetic, such as polar decomposition.

See also

Arc (geometry) Inequality Interval graph Interval finite element Interval (statistics) Line segment Partition of an interval Unit interval

A Lucid Interval by Brian Hayes: An American Scientist article provides an introduction. Interval computations website Interval computations research centers Interval Notation by George Beck, Wolfram Demonstrations Project.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376253329 under CC BY-SA 4.0; modifications have been made.

Words in each sectionInteger intervalsInteger intervalsInteger intervals: 778 words778Complex intervalsComplex intervalsComplex intervals: 349 words349Open and closed interva…Open and closed intervalsOpen and closed intervals: 316 words316Definition of an interv…Definition of an intervalDefinition of an interval: 212 words212Including or excluding …Including or excluding endpointsIncluding or excluding endpoints: 187 words187Bounded intervalsBounded intervalsBounded intervals: 177 words177GeneralizationsGeneralizationsGeneralizations: 145 words145Half-open intervalsHalf-open intervalsHalf-open intervals: 131 words131Infinite endpointsInfinite endpointsInfinite endpoints: 121 words121Segments and intervalsSegments and intervalsSegments and intervals: 109 words109Sub-intervals and relat…Sub-intervals and related constructionsSub-intervals and related constructions: 102 words102Categorisation by minim…Categorisation by minimum and maximum elementsCategorisation by minimum and maximum elements: 97 words97Degenerate intervalsDegenerate intervalsDegenerate intervals: 44 words44Notations for intervalsNotations for intervalsNotations for intervals: 42 words42See alsoSee alsoSee also: 18 words18
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001376253329 · captured 2026-09-22 · ledger · version history

Cite this page as: encyclopegia.org, “Interval (mathematics)”, snapshot enwiki-001376253329. https://encyclopegia.org/a/interval-mathematics

Sources cited in this revision

12 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.