# Interval (mathematics)

Short description: All numbers between two given numbers

The addition x + a on the number line. All numbers greater than x and less than x + a fall within that open interval.

In mathematics, a (real) interval is the set of all real numbers lying between two fixed endpoints with no "gaps". Each endpoint is either a real number or positive or negative infinity, indicating the interval extends without a bound. An interval can contain neither endpoint, either endpoint, or both endpoints.

For example, the set of real numbers consisting of 0, 1, and all numbers in between is an interval, denoted [0, 1] and called the unit interval; the set of all positive real numbers is an interval, denoted (0, ∞); the set of all real numbers is an interval, denoted (−∞, ∞); and any single real number a is an interval, denoted [a, a].

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.

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 are likewise defined on an arbitrary totally ordered set, such as integers or rational numbers. The notation of integer intervals is considered in the special section below.

## Definitions and terminology

An interval is a subset of the real numbers that contains all real numbers lying between any two numbers of the subset.

The endpoints of an interval are its supremum, and its infimum, if they exist as real numbers.[1] If the infimum does not exist, one says often that the corresponding endpoint is $\displaystyle{ -\infty. }$ Similarly, if the supremum does not exist, one says that the corresponding endpoint is $\displaystyle{ +\infty. }$

Intervals are completely determined by their endpoints and whether each endpoint belong to the interval. This is a consequence of the least-upper-bound property of the real numbers. This characterization is used to specify intervals by mean of interval notation, which is described below.

An open interval does not include any endpoint, and is indicated with parentheses.[2] For example, $\displaystyle{ (0, 1) = \{x \mid 0 \lt x \lt 1\} }$ 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, +∞) consists of real numbers greater than 0, i.e., positive real numbers. The open intervals are thus one of the forms

\displaystyle{ \begin{align} (a,b) &= \{x\in\mathbb R \mid a\lt x\lt b\}, \\ (-\infty, b) &= \{x\in\mathbb R \mid x\lt b\}, \\ (a, +\infty) &= \{x\in\mathbb R \mid a\lt x\}, \\ (-\infty, +\infty) &= \R, \end{align} }

where $\displaystyle{ a }$ and $\displaystyle{ b }$ are real numbers such that $\displaystyle{ a\le b. }$ When $\displaystyle{ a=b }$ in the first case, the resulting interval is the empty set $\displaystyle{ (a,a)=\varnothing, }$ which is a degenerate interval (see below). The open intervals are those intervals that are open sets for the usual topology on the real numbers.

A closed interval is an interval that includes all its endpoints and is denoted with square brackets.[2] For example, [0, 1] means greater than or equal to 0 and less than or equal to 1. Closed intervals have one of the following forms in which a and b are real numbers such that $\displaystyle{ a\le b\colon }$

$\displaystyle{ [a,b] = \{x\in\mathbb R \mid a\le x\le b\} }$

The closed intervals are those intervals that are closed sets for the usual topology on the real numbers. The empty set and $\displaystyle{ \R }$ are the only intervals that are both open and closed.

A half-open interval has two endpoints and includes only one of them. It is said 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.[3] For example, (0, 1] means greater than 0 and less than or equal to 1, while [0, 1) means greater than or equal to 0 and less than 1. The half-open intervals have the form

\displaystyle{ \begin{align} \left(a,b\right] &= \{x\in\R \mid a\lt x\le b\}, \\ \left[a,b\right) &= \{x\in\R \mid a\le x\lt b\}, \\ \left[a,+\infty\right) &= \{x\in\R \mid a\le x\}, \\ \left(-\infty,b\right] &= \{x\in\R \mid x\le b\}. \end{align} }

Every closed interval is a closed set of the real line, but an interval that is a closed set need not be a closed interval. For example, intervals $\displaystyle{ (-\infty,b] }$ and $\displaystyle{ [a,+\infty) }$ are also closed sets in the real line. Intervals $\displaystyle{ (a,b] }$ and $\displaystyle{ [a,b) }$ are neither an open set nor a closed set. If one allows an endpoint in the closed side to be an infinity (such as (0,+∞], the result will not be an interval, since it is not even a subset of the real numbers. Instead, the result can be seen as an interval in the extended real line, which occurs in measure theory, for example.

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.[4][5]

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

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 0 (or left undefined).

The centre (midpoint) of a bounded interval with endpoints a and b is (a + b)/2, and its radius is the half-length ‹See Tfd›|a − b|/2. These concepts are undefined for empty or unbounded intervals.

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 [0, 1) = {x | 0 ≤ x < 1}, for example, is left-closed and right-open. The empty set and the set of all reals are both open and closed intervals, while the set of non-negative reals, is a closed interval that is right-open but not left-open. The open intervals are open sets of the real line in its standard topology, and form a base of the open sets.

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. So, the closed intervals coincide with the closed sets in that topology.

The interior of an interval I is the largest open interval that is contained in I; it is also the set of points in I which are not endpoints of I. The closure of I is the smallest closed interval that contains I; which is also the set I augmented with its finite endpoints.

For any set X of real numbers, the interval enclosure or interval span of X is the unique interval that contains X, and does not properly contain any other interval that also contains X.

An interval I is a subinterval of interval J if I is a subset of J. An interval I is a proper subinterval of J if I is a proper subset of J.

However, 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[7] 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[8] 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 a and b, including a and b, is often denoted [a, b]. 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,

\displaystyle{ \begin{align} (a,b) = \mathopen{]}a,b\mathclose{[} &= \{x\in\R \mid a\lt x\lt b\}, \\[5mu] [a,b) = \mathopen{[}a,b\mathclose{[} &= \{x\in\R \mid a\le x\lt b\}, \\[5mu] (a,b] = \mathopen{]}a,b\mathclose{]} &= \{x\in\R \mid a\lt x\le b\}, \\[5mu] [a,b] = \mathopen{[}a,b\mathclose{]} &= \{x\in\R \mid a\le x\le b\}. \end{align} }

Each interval (a, a), [a, a), and (a, a] represents the empty set, whereas [a, a] denotes the singleton set {a}. When a > b, 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 (a, b) 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 ]a, b[ to denote the open interval.[9] The notation [a, b] too is occasionally used for ordered pairs, especially in computer science.

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

### 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 [−∞, b] , (−∞, b] , [a, +∞] , and [a, +∞) 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, (0, +∞) is the set of positive real numbers, also written as $\displaystyle{ \mathbb{R}_+. }$ The context affects some of the above definitions and terminology. For instance, the interval (−∞, +∞) = $\displaystyle{ \R }$ is closed in the realm of ordinary reals, but not in the realm of the extended reals.

### Integer intervals

When a and b are integers, the notation ⟦a, b⟧, or [a .. b] or {a .. b} or just a .. b, is sometimes used to indicate the interval of all integers between a and b included. The notation [a .. b] 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 a .. b − 1 , a + 1 .. b , or a + 1 .. b − 1. Alternate-bracket notations like [a .. b) or [a .. b[ are rarely used for integer intervals.[citation needed]

## Properties

The intervals are precisely the connected subsets of $\displaystyle{ \R. }$ It follows that the image of an interval by any continuous function from $\displaystyle{ \mathbb R }$ to $\displaystyle{ \mathbb R }$ is also an interval. This is one formulation of the intermediate value theorem.

The intervals are also the convex subsets of $\displaystyle{ \R. }$ The interval enclosure of a subset $\displaystyle{ X\subseteq \R }$ is also the convex hull of $\displaystyle{ X. }$

The closure of an interval is the union of the interval and the set of its finite endpoints, and hence is also an interval. (The latter also follows from the fact that the closure of every connected subset of a topological space is a connected subset.) In other words, we have[10]

$\displaystyle{ \operatorname{cl}(a,b)=\operatorname{cl}(a,b]=\operatorname{cl}[a,b)=\operatorname{cl}[a,b]=[a,b], }$
$\displaystyle{ \operatorname{cl}(a,+\infty)=\operatorname{cl}[a,+\infty)=[a,+\infty), }$
$\displaystyle{ \operatorname{cl}(-\infty,a)=\operatorname{cl}(-\infty,a]=(-\infty,a], }$
$\displaystyle{ \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 $\displaystyle{ (a,b) \cup [b,c] = (a,c]. }$

If $\displaystyle{ \R }$ is viewed as a metric space, its open balls are the open bounded intervals (c + r, c − r), and its closed balls are the closed bounded intervals [c + r, c − r]. In particular, the metric and order topologies in the real line coincide, which is the standard topology of the real line.

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

A dyadic interval is a bounded real interval whose endpoints are $\displaystyle{ \tfrac{j}{2^n} }$ and $\displaystyle{ \tfrac{j+1}{2^n}, }$ where $\displaystyle{ j }$ and $\displaystyle{ n }$ are integers. Depending on the context, either endpoint may or may not be included in the interval.

Dyadic intervals have the following properties:

• The length of a dyadic interval is always an integer power of two.
• Each dyadic interval is contained in exactly one dyadic interval of twice the length.
• Each dyadic interval is spanned by two dyadic intervals of half the length.
• If two open dyadic intervals overlap, then one of them is a subset of the other.

The dyadic intervals consequently have a structure that reflects that of an infinite binary tree.

Dyadic intervals are relevant to several areas of numerical analysis, including adaptive mesh refinement, multigrid methods and wavelet analysis. Another way to represent such a structure is p-adic analysis (for p = 2).[11]

## Generalizations

### Balls

An open finite interval $\displaystyle{ (a, b) }$ is a 1-dimensional open ball with a center at $\displaystyle{ \tfrac12(a + b) }$ and a radius of $\displaystyle{ \tfrac12(b - a). }$ The closed finite interval $\displaystyle{ [a, b] }$ is the corresponding closed ball, and the interval's two endpoints $\displaystyle{ \{a, b\} }$ form a 0-dimensional sphere. Generalized to $\displaystyle{ n }$-dimensional Euclidean space, a ball is the set of points whose distance from the center is less than the radius. In the 2-dimensional case, a ball is called a disk.

If a half-space is taken as a kind of degenerate ball (without a well-defined center or radius), a half-space can be taken as analogous to a half-bounded interval, with its boundary plane as the (degenerate) sphere corresponding to the finite endpoint.

### Multi-dimensional intervals

A finite interval is (the interior of) a 1-dimensional hyperrectangle. Generalized to real coordinate space $\displaystyle{ \R^n, }$ an axis-aligned hyperrectangle (or box) is the Cartesian product of $\displaystyle{ n }$ finite intervals. For $\displaystyle{ n=2 }$ this is a rectangle; for $\displaystyle{ 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 $\displaystyle{ n }$ intervals, $\displaystyle{ I = I_1\times I_2 \times \cdots \times I_n }$ is sometimes called an $\displaystyle{ n }$-dimensional interval.[citation needed]

A facet of such an interval $\displaystyle{ I }$ is the result of replacing any non-degenerate interval factor $\displaystyle{ I_k }$ by a degenerate interval consisting of a finite endpoint of $\displaystyle{ I_k. }$ The faces of $\displaystyle{ I }$ comprise $\displaystyle{ I }$ itself and all faces of its facets. The corners of $\displaystyle{ I }$ are the faces that consist of a single point of $\displaystyle{ \R^n. }$[citation needed]

### Convex polytopes

Any finite interval can be constructed as the intersection of half-bounded intervals (with an empty intersection taken to mean the whole real line), and the intersection of any number of half-bounded intervals is a (possibly empty) interval. Generalized to $\displaystyle{ n }$-dimensional affine space, an intersection of half-spaces (of arbitrary orientation) is (the interior of) a convex polytope, or in the 2-dimensional case a convex polygon.

### Domains

An open interval is a connected open set of real numbers. Generalized to topological spaces in general, a non-empty connected open set is called a domain.

### Complex intervals

Intervals of complex numbers can be defined as regions of the complex plane, either rectangular or circular.[12]

### Intervals in posets and preordered sets

#### Definitions

The concept of intervals can be defined in arbitrary partially ordered sets or more generally, in arbitrary preordered sets. For a preordered set $\displaystyle{ (X,\lesssim) }$ and two elements $\displaystyle{ a,b\in X, }$ one similarly defines the intervals[13]:11, Definition 11

$\displaystyle{ (a,b) =\{x\in X \mid a\lt x\lt b\}, }$
$\displaystyle{ [a,b] =\{x\in X \mid a\lesssim x\lesssim b\}, }$
$\displaystyle{ (a,b] =\{x\in X \mid a\lt x\lesssim b\}, }$
$\displaystyle{ [a,b) =\{x\in X \mid a\lesssim x\lt b\}, }$
$\displaystyle{ (a,\infty) =\{x\in X \mid a\lt x\}, }$
$\displaystyle{ [a,\infty) =\{x\in X \mid a\lesssim x\}, }$
$\displaystyle{ (-\infty,b) =\{x\in X \mid x\lt b\}, }$
$\displaystyle{ (-\infty,b] =\{x\in X \mid x\lesssim b\}, }$
$\displaystyle{ (-\infty,\infty) =X, }$

where $\displaystyle{ x\lt y }$ means $\displaystyle{ 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

$\displaystyle{ \bar X=X\sqcup\{-\infty,\infty\} }$
$\displaystyle{ -\infty\lt x\lt \infty\qquad(\forall x\in X) }$

defined by adding new smallest and greatest elements (even if there were ones), which are subsets of $\displaystyle{ X. }$ In the case of $\displaystyle{ X=\mathbb R }$ one may take $\displaystyle{ \bar\mathbb R }$ to be the extended real line.

#### Convex sets and convex components in order theory

A subset $\displaystyle{ A\subseteq X }$ of the preordered set $\displaystyle{ (X,\lesssim) }$ is (order-)convex if for every $\displaystyle{ x,y\in A }$ and every $\displaystyle{ x\lesssim z\lesssim y }$ we have $\displaystyle{ z\in A. }$ Unlike in the case of the real line, a convex set of a preordered set need not be an interval. For example, in the totally ordered set $\displaystyle{ (\mathbb Q,\le) }$ of rational numbers, the set

$\displaystyle{ \mathbb Q=\{x\in\mathbb Q \mid x^2\lt 2\} }$

is convex, but not an interval of $\displaystyle{ \mathbb Q, }$ since there is no square root of two in $\displaystyle{ \mathbb Q. }$

Let $\displaystyle{ (X,\lesssim) }$ be a preordered set and let $\displaystyle{ Y\subseteq X. }$ The convex sets of $\displaystyle{ X }$ contained in $\displaystyle{ Y }$ form a poset under inclusion. A maximal element of this poset is called an convex component of $\displaystyle{ Y. }$[14]:Definition 5.1[15]:727 By the Zorn lemma, any convex set of $\displaystyle{ X }$ contained in $\displaystyle{ Y }$ is contained in some convex component of $\displaystyle{ 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.

#### Properties

A generalization of the characterizations of the real intervals follows. For a non-empty subset $\displaystyle{ I }$ of a linear continuum $\displaystyle{ (L,\le), }$ the following conditions are equivalent.[16]:153, Theorem 24.1

• The set $\displaystyle{ I }$ is an interval.
• The set $\displaystyle{ I }$ is order-convex.
• The set $\displaystyle{ I }$ is a connected subset when $\displaystyle{ L }$ is endowed with the order topology.

For a subset $\displaystyle{ S }$ of a lattice $\displaystyle{ L, }$ the following conditions are equivalent.

• The set $\displaystyle{ S }$ is a sublattice and an (order-)convex set.
• There is an ideal $\displaystyle{ I\subseteq L }$ and a filter $\displaystyle{ F\subseteq L }$ such that $\displaystyle{ S=I\cap F. }$

## Applications

### In general topology

Every Tychonoff space is embeddable into a product space of the closed unit intervals $\displaystyle{ [0,1]. }$ Actually, every Tychonoff space that has a base of cardinality $\displaystyle{ \kappa }$ is embeddable into the product $\displaystyle{ [0,1]^\kappa }$ of $\displaystyle{ \kappa }$ copies of the intervals.[17]:p. 83, Theorem 2.3.23

The concepts of convex sets and convex components are used in a proof that every totally ordered set endowed with the order topology is completely normal[15] or moreover, monotonically normal.[14]

## Topological algebra

Intervals can be associated with points of the plane, and hence regions of intervals can be associated with regions of the plane. Generally, an interval in mathematics corresponds to an ordered pair (x, y) taken from the direct product $\displaystyle{ \R \times \R }$ of real numbers with itself, where it is often assumed that y > x. For purposes of mathematical structure, this restriction is discarded,[18] and "reversed intervals" where yx < 0 are allowed. Then, the collection of all intervals [x, y] can be identified with the topological ring formed by the direct sum of $\displaystyle{ \R }$ with itself, where addition and multiplication are defined component-wise.

The direct sum algebra $\displaystyle{ ( \R \oplus \R, +, \times) }$ has two ideals, { [x,0] : x ∈ R } and { [0,y] : y ∈ R }. The identity element of this algebra is the condensed interval [1, 1]. If interval [x, y] is not in one of the ideals, then it has multiplicative inverse [1/x, 1/y]. Endowed with the usual topology, the algebra of intervals forms a topological ring. The group of units of this ring consists of four quadrants determined by the axes, or ideals in this case. The identity component of this group is quadrant I.

Every interval can be considered a symmetric interval around its midpoint. In a reconfiguration published in 1956 by M Warmus, the axis of "balanced intervals" [x, −x] is used along with the axis of intervals [x, x] that reduce to a point. Instead of the direct sum $\displaystyle{ R \oplus R, }$ the ring of intervals has been identified[19] with the hyperbolic numbers by M. Warmus and D. H. Lehmer through the identification

$\displaystyle{ z = \tfrac12(x + y) + \tfrac12(x - y)j, }$

where $\displaystyle{ 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.

## References

1. Bertsekas, Dimitri P. (1998). Network Optimization: Continuous and Discrete Methods. Athena Scientific. p. 409. ISBN 1-886529-02-7.
2. Strichartz, Robert S. (2000). The Way of Analysis. Jones & Bartlett Publishers. p. 86. ISBN 0-7637-1497-6.
3. Weisstein, Eric W.. "Interval" (in en).
4. Hazewinkel, Michiel, ed. (2001), "Interval and segment", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4
5. Analysis I. Texts and Readings in Mathematics. 37 (3 ed.). Singapore: Springer. 2016. p. 212. doi:10.1007/978-981-10-1789-6. ISBN 978-981-10-1789-6.  See Definition 9.1.1.
6. Cramér, Harald (1999). Mathematical Methods of Statistics. Princeton University Press. p. 11. ISBN 0691005478.
7. Rudin, Walter (1976). Principles of Mathematical Analysis. New York: McGraw-Hill. pp. 31. ISBN 0-07-054235-X.
8. Tao (2016), p. 214, See Lemma 9.1.12.
9. Kozyrev, Sergey (2002). "Wavelet theory as p-adic spectral analysis". Izvestiya RAN. Ser. Mat. 66 (2): 149–158. doi:10.1070/IM2002v066n02ABEH000381. Bibcode2002IzMat..66..367K. Retrieved 2012-04-05.
10. Complex interval arithmetic and its applications, Miodrag Petković, Ljiljana Petković, Wiley-VCH, 1998, ISBN:978-3-527-40134-5
11. Vind, Karl (2003) (in en). Independence, additivity, uncertainty. Studies in Economic Theory. 14. Berlin: Springer. doi:10.1007/978-3-540-24757-9. ISBN 978-3-540-41683-8.
12. Heath, R. W.; Lutzer, David J.; Zenor, P. L. (1973). "Monotonically normal spaces" (in en). Transactions of the American Mathematical Society 178: 481–493. doi:10.2307/1996713. ISSN 0002-9947.
13. Steen, Lynn A. (1970). "A direct proof that a linearly ordered space is hereditarily collection-wise normal" (in en). Proceedings of the American Mathematical Society 24 (4): 727–728. doi:10.2307/2037311. ISSN 0002-9939.
14. Munkres, James R. (2000) (in en). Topology (2 ed.). Prentice Hall. ISBN 978-0-13-181629-9.
15. Engelking, Ryszard (1989) (in en). General topology. Sigma Series in Pure Mathematics. 6 (Revised and completed ed.). Berlin: Heldermann Verlag. ISBN 3-88538-006-4.
16. from Mathematical Reviews
17. from Mathematical Reviews