Bourbaki

1. Real number space Rn\mathbf{R}^n

1. The topology of Rn\mathbf{R}^n

Definition 1

The topological product of n spaces identical with the real line is called real number space of n dimensions, and is denoted by Rn\mathbf{R}^n.

Remark

The space R0\mathbf{R}^0 consists of a single point.

From Set Theory, Chapter III, § 6, no. 3, Theorem 2, Corollary I, we know that, if E is an infinite set, EnE^n is equipotent with E for all integers n>0n > 0; hence, if n>0n > 0, Rn\mathbf{R}^n is equipotent with R\mathbf{R}, that is, Rn\mathbf{R}^n has the power of the continuum (cf. Exercises 1 and 2).

Definition 2

Any subset of Rn\mathbf{R}^n which is the product of n open (resp. closed) intervals of R\mathbf{R} is called an open (resp. closed) box in Rn\mathbf{R}^n. [For n=2n = 2 it is called an open (resp. closed) rectangle.]

The open boxes in Rn\mathbf{R}^n form a base of the topology of Rn\mathbf{R}^n (Chapter I, § 4, no. 1); the open boxes which contain a point x=(xi)1≤i≤nx = (x_i)_{1 \leq i \leq n} of Rn\mathbf{R}^n form a fundamental system of neighbourhoods of xx, and so do the closed boxes of Rn\mathbf{R}^n for which xx is an interior point.

Every non-empty open box in Rn\mathbf{R}^n is homeomorphic to Rn\mathbf{R}^n (Chapter IV, § 4, no. 1, Proposition 1).

It follows that, when n≥1n \geq 1, every non-empty open set in Rn\mathbf{R}^n has the power of the continuum.

An open (resp. closed) cube of Rn\mathbf{R}^n is an open (resp. closed) box which is the product of nn bounded intervals of equal length [for n=2n = 2, it is called an open (resp. closed) square]; the common length of these intervals is called the side (or side-length) of the cube. The open cubes

Km=∏1≤i≤n[xi−1m,xi+1m] K_m = \prod_{1 \leq i \leq n} \left[ x_i - \frac{1}{m}, x_i + \frac{1}{m} \right]

form a countable fundamental system of neighbourhoods of the point x=(xi)x = (x_i), as mm runs through the set of all integers >0> 0 or through any sequence of integers increasing to infinity.

Every open (or closed) box in Rn\mathbf{R}^n is connected (Chapter I, § 11, no. 4, Proposition 8); in particular, Rn\mathbf{R}^n is connected and locally connected.

If AA is a non-empty open set in Rn\mathbf{R}^n, its components are therefore open sets (Chapter I, § 11, no. 6, Proposition 11); and the set of these components is countable, for Rn\mathbf{R}^n has a countable dense subset (for example Qn\mathbf{Q}^n).

Consider under what conditions a subset AA of Rn\mathbf{R}^n will be relatively compact. By Tychonoff’s theorem (Chapter I, § 9, no. 5, Theorem 3) it is necessary and sufficient that the projections of AA on the factors of Rn\mathbf{R}^n should be relatively compact; by the Borel-Lebesgue theorem (Chapter IV, § 2, no. 2, Theorem 2) this is equivalent to saying that these projections are bounded subsets of R\mathbf{R}. We say that a subset AA of Rn\mathbf{R}^n is bounded if all its projections are bounded subsets of R\mathbf{R}; thus we have proved:

Proposition 1

A subset AA of Rn\mathbf{R}^n is relatively compact if and only if it is bounded.

Corollary

The space Rn\mathbf{R}^n is locally compact, but is not compact if n≥1n \geq 1.

2. The additive group Rn\mathbf{R}^n

The set Rn\mathbf{R}^n, endowed with the group structure which is the product of the additive group structures of the nn factors of Rn\mathbf{R}^n, is an abelian group; we use the additive notation, the sum of x=(xi)x = (x_i) and y=(yi)y = (y_i) being therefore x+y=(xi+yi)x + y = (x_i + y_i). The topology of the number space is compatible with this group structure; endowed with these two structures, Rn\mathbf{R}^n is a topological group called the additive group of n-dimensional real number space. If n=0n = 0, we make the convention that R0\mathbf{R}^0 denotes a group consisting only of the identity element.

The uniform structure of this group, called the additive uniformity of Rn\mathbf{R}^n, is the product of the uniformities of the factors of Rn\mathbf{R}^n (Chapter III, § 3, no. 2). If, for each integer p>0p > 0, VpV_p denotes the set of pairs (x,y)(x, y) of Rn\mathbf{R}^n such that max⁡1≤i≤n∣xi−yi∣≤1/p\max_{1 \leq i \leq n} |x_i - y_i| \leq 1/p, the sets VpV_p form a fundamental system of entourages of this uniformity. Whenever we consider Rn\mathbf{R}^n as a uniform space we shall always have in mind the additive uniformity just defined, unless the contrary is expressly stated. Endowed with this uniform structure, Rn\mathbf{R}^n is a complete uniform space (Chapter II, , no. 5, Proposition 10)

3. The vector space Rn\mathbf{R}^n

Since R\mathbf{R} is a field, we can define on Rn\mathbf{R}^n a vector space structure over the field R\mathbf{R}, the product txt x of a scalar t∈Rt \in \mathbf{R} and a point (or vector) x=(xi)x = (x_i) of Rn\mathbf{R}^n being the point (txi)(t x_i). Note that the homothety (t,x)→tx(t, x) \to t x is continuous on R×Rn\mathbf{R} \times \mathbf{R}^n. If eie_i denotes the vector of Rn\mathbf{R}^n all of whose coordinates are zero, except for that of index ii, which is equal to 1, then the eie_i form a basis of the vector space Rn\mathbf{R}^n, called the canonical basis of this space. Every vector x=(xi)∈Rnx = (x_i) \in \mathbf{R}^n can be written as x=∑i=1nxieix = \sum_{i=1}^n x_i e_i, and the relation ∑i=1ntiei=0\sum_{i=1}^n t_i e_i = 0 implies that ti=0t_i = 0 for 1≤i≤n1 \leq i \leq n.

The vector space Rn\mathbf{R}^n is therefore of dimension nn over the field R\mathbf{R}, in the sense of algebra (Algebra, Chapter II, § 7, no. 2); hence its name of nn-dimensional real number space.

Let ff be an affine mapping of the vector space Rn\mathbf{R}^n into the vector space Rm\mathbf{R}^m (mm and nn being integers > 0). If we put g(x)=f(x)−f(0)g(x) = f(x) - f(0), gg is a linear mapping of Rn\mathbf{R}^n into Rm\mathbf{R}^m. Let aija_{ij} (1≤j≤m1 \leq j \leq m) be the coordinates of g(ei)g(e_i) in Rm\mathbf{R}^m and let bjb_j (1≤j≤m1 \leq j \leq m) be those of f(0)f(0); if xix_i (1≤i≤n1 \leq i \leq n) is the iith coordinate of x∈Rnx \in \mathbf{R}^n and if yjy_j is the jjth coordinate of y=f(x)y = f(x), we have

yj=∑i=1naijxi+bj(1≤j≤m). y_j = \sum_{i=1}^n a_{ij} x_i + b_j \quad (1 \leq j \leq m).

Since every linear polynomial in x1,x2,…,xnx_1, x_2, \ldots, x_n is uniformly continuous on Rn\mathbf{R}^n, it follows that every affine mapping of Rn\mathbf{R}^n into Rm\mathbf{R}^m is uniformly continuous on Rn\mathbf{R}^n (Chapter II, § 2, no. 6, Proposition 7).

In particular, we know that every affine mapping of Rn\mathbf{R}^n onto itself is bijective and that its inverse is again an affine mapping; hence every affine mapping of Rn\mathbf{R}^n onto itself is a homeomorphism (and an automorphism of the uniform structure of Rn\mathbf{R}^n).

Let (ai)1≤i≤n(a_i)_{1 \leq i \leq n} be a free system of nn vectors of Rn\mathbf{R}^n [in other words a basis of the vector space Rn\mathbf{R}^n]; if bb is any point of Rn\mathbf{R}^n, the set P of points x=b+∑i=1nuiaix = b + \sum_{i=1}^{n} u_i a_i such that −1≤ui≤1-1 \leq u_i \leq 1 for 1≤i≤n1 \leq i \leq n is a compact neighbourhood of bb; for there exists a bijective affine mapping ff of Rn\mathbf{R}^n onto itself such that f(b)=0,f(b+ai)=eif(b) = 0, f(b + a_i) = e_i for 1≤i≤n1 \leq i \leq n; and f(P)f(P) is the cube which is the product of the nn intervals [−1,+1][ -1, +1 ] in the nn factor spaces. PP is called the closed parallelootope with centre bb and basis vectors aia_i. The interior of PP consists of the points b+∑i=1nuiaib + \sum_{i=1}^{n} u_i a_i such that −1<ui<1-1 < u_i < 1 for 1≤i≤n1 \leq i \leq n; it is called the open parallelootope with centre bb and basis vectors aia_i.

4. Affine linear varieties in Rn\mathbf{R}^n

Given a pp-dimensional affine linear variety VV in Rn\mathbf{R}^n, there exists an affine mapping ff of Rn\mathbf{R}^n onto itself which transforms VV into a pp-dimensional coordinate variety, that is to say a vector subspace V′V' generated by pp of the vectors of the canonical basis (ei)(e_i) of Rn\mathbf{R}^n. There exists a mapping of V′V' onto Rp\mathbf{R}^p which is an isomorphism of the vector space structure and the topology of V′V' onto the corresponding structures of Rp\mathbf{R}^p (it is moreover often convenient to identify Rp\mathbf{R}^p with such a coordinate variety V′V', e.g., with the vector subspace generated by e1,e2,…,epe_1, e_2, \ldots, e_p). In addition, V′V' is a closed subset of Rn\mathbf{R}^n (Chapter I, § 4, no. 3, Corollary to Proposition 7); hence:

Proposition 2

Every pp-dimensional linear affine variety in Rn\mathbf{R}^n is a closed subset of Rn\mathbf{R}^n, homeomorphic to Rp\mathbf{R}^p.

It is this result which is the origin of the names line and plane given to affine linear varieties of one and two dimensions in a vector space over an arbitrary division ring. We recall also that, for n≥1n \geq 1, the affine linear varieties of n−1n - 1 dimensions of Rn\mathbf{R}^n are called hyperplanes (loc. cit.).

The nn one-dimensional coordinate varieties, that is to say the nn lines passing through 00 and the nn points eie_i respectively, are called the coordinate axes. For n=2n = 2 the axis through e1e_1 is sometimes called the axis of abscissas and the axis through e2e_2 is called the axis of ordinates; the first coordinate of a point x∈R2x \in \mathbf{R}^2 is called its abscissa, the second coordinate its ordinate.

Every line DD passing through a point aa has a parametric representation t→a+tbt \to a + tb, where tt runs through R\mathbf{R} and b≠0b \neq 0; this mapping is a homeomorphism of R\mathbf{R} onto DD. The vector bb is called a direction vector of D, and its components bi(1≤i≤n)b_i (1 \leq i \leq n) are called direction ratios of D. If b′b' is another direction vector of D, there exists h≠0h \neq 0 in R\mathbf{R} such that b′=hbb' = hb.

The set of points a+tba + tb, where tt runs through the set of real numbers ≥0\geq 0, is called the closed ray (or simply ray, or half-line) with origin aa and direction vector bb (or with direction ratios bib_i). It is a closed subset of Rn\mathbf{R}^n, homeomorphic to the interval [0,+∞[[0, +\infty[ of R\mathbf{R}, and therefore connected. The line D is the union of the two rays with origin aa and direction vectors bb and −b-b respectively; these rays are said to be opposite.

By abuse of language, the set of points a+tba + tb, where tt runs through the set of real numbers >0> 0, is called the open ray with origin aa and direction vector bb; it is homeomorphic to the interval ]0,+∞[0, +\infty[ (and therefore homeomorphic to R\mathbf{R}), but is not open in Rn\mathbf{R}^n if n>1n > 1, although it is open in the line which contains it.

A line passing through two distinct points xx and yy also has a parametric representation (u,v)→ux+vy(u, v) \to ux + vy, where (u,v)(u, v) runs through the set of pairs of real numbers such that u+v=1u + v = 1. Given any two points x,yx, y (distinct or not) the set of points ux+uyux + uy, where (u,v)(u, v) runs through the set of pairs of real numbers such that u≥0,v≥0u \geq 0, v \geq 0 and u+v=1u + v = 1, is called the closed segment (or simply segment) with end-points x,yx, y. A closed segment is compact and connected, for if its end-points are distinct it is homeomorphic to the interval [0,1][0, 1] of R\mathbf{R}.

If x≠yx \neq y, the set of points ux+vyux + vy such that u>0,v>0u > 0, v > 0 and u+v=1u + v = 1 is called (by abuse of language) the open segment with end-points x,yx, y; it is homeomorphic to the open interval ]0,1[0, 1[ (and hence also homeomorphic to R\mathbf{R}). Finally the union of {y}\{y\} and the open segment with end-points x,yx, y is sometimes called the segment open at xx and closed at yy; it is homeomorphic to the interval [0,1[[0, 1[. All the segments with xx and yy as end-points are connected, and the closure of each of them is the closed segment with the same end-points.

Proposition 3

Let f(x)=f(x1,x2,…,xn)f(x) = f(x_1, x_2, \ldots, x_n) be a polynomial with real coefficients, not identically zero, defined on Rn\mathbf{R}^n. Then the complement of the set f‾(0)\overline{f}(0) is dense in Rn\mathbf{R}^n.

Let xx be any point of Rn\mathbf{R}^n and let y∈Rny \in \mathbf{R}^n be such that f(y)≠0f(y) \neq 0; φ(t)=f(x+t(y−x))\varphi(t) = f(x + t(y - x)) is a polynomial in the real variable tt, not identically zero; hence there exist arbitrarily small values of tt such that φ(t)≠0\varphi(t) \neq 0. This shows that xx lies in the closure of the complement of f‾(0)\overline{f}(0).

Corollary

The complement of an affine linear variety of dimension p<np < n is dense in Rn\mathbf{R}^n.

Since every affine linear variety of dimension p<np < n is contained in a hyperplane, it is enough to prove the corollary for a hyperplane; but a hyperplane is defined by an equation g(x)=0g(x) = 0, where gg is a linear polynomial not identically zero.

Proposition 4

In Rn\mathbf{R}^n (n≥1n \geq 1) the complement of every hyperplane has two connected components.

Let g(x)=0g(x) = 0 be an equation of a hyperplane HH in Rn\mathbf{R}^n, gg being a linear polynomial. The set CHCH is the union of the set E1E_1 of all points xx such that g(x)>0g(x) > 0 and the set E2E_2 of all points xx such that g(x)<0g(x) < 0. E1E_1 and E2E_2 are connected, for if g(x)>0g(x) > 0 and g(y)>0g(y) > 0 we have g(ux+vy)=ug(x)+vg(y)>0g(ux + vy) = ug(x) + vg(y) > 0 whenever u≥0,v≥0u \geq 0, v \geq 0 and u+v=1u + v = 1; in other words, the segment with end-points xx and yy is contained in E1E_1. Similarly for E2E_2. On the other hand, CHCH is not connected, because its image in R\mathbf{R} under gg is the union of the intervals ]0,+∞0, +\infty [ and ]−∞,0-\infty, 0 [.

The components E1,E2E_1, E_2 of the complement of a hyperplane HH are called the open half-spaces determined by HH.

The closures of E1E_1 and E2E_2, which are respectively E1∪HE_1 \cup H and E2∪HE_2 \cup H, are called the closed half-spaces determined by HH.

Observe that an affine mapping of Rn\mathbf{R}^n onto itself which transforms HH into a "coordinate" hyperplane, e.g., the hyperplane whose equation is xn=0x_n = 0, also transforms the open half-spaces determined by HH into the open half-spaces defined respectively by the relations xn>0x_n > 0 and xn<0x_n < 0; the latter are open boxes and therefore homeomorphic to Rn\mathbf{R}^n.

5. Topology of vector spaces and algebras over the field R\mathbf{R}

Let EE be a vector space of dimension nn over the field R\mathbf{R}; if (ai)1≤i≤n(a_i)_{1 \leq i \leq n} is a basis of EE, then every point x∈Ex \in E can be written uniquely in the form x=∑i=1nxiaix = \sum_{i=1}^n x_i a_i, where the xix_i are real numbers; the mapping (xi)→∑i=1nxiai(x_i) \to \sum_{i=1}^n x_i a_i is therefore a bijective linear mapping of Rn\mathbf{R}^n onto EE.

If we transport to EE the topology of Rn\mathbf{R}^n by this mapping, EE is endowed with a topology compatible with its additive group structure, and the mapping (t,x)→tx(t, x) \to tx of R×E\mathbf{R} \times E into EE is continuous with respect to this topology. This topology is independent of the basis chosen in EE; for if (a′)(a') is another basis of EE, and if x=∑i=1nxi′ai′=∑i=1nxiaix = \sum_{i=1}^n x'_i a'_i = \sum_{i=1}^n x_i a_i, the mapping (xi)→(xi′)(x_i) \to (x'_i) of Rn\mathbf{R}^n onto itself is linear and therefore a homeomorphism.

This fact leads one to suspect that the topology so defined on EE should be capable of characterization without the help of a basis of EE. In fact, we shall see later that this is the only Hausdorff topology on EE for which the functions x−yx - y (on E×EE \times E) and txtx (on R×E\mathbf{R} \times E) are continuous.

If now AA is an algebra of finite rank nn over the field R\mathbf{R}, the above topology on AA (considered as an nn-dimensional vector space over R\mathbf{R}) is compatible not only with the additive group structure of AA, but also with its ring structure. This is a consequence of the following more general result:

Proposition 5

Let E,F,GE, F, G be three finite-dimensional vector spaces over the field R\mathbf{R}. Then every bilinear mapping (*) ff of E×FE \times F into GG is continuous.

We may suppose that E=Rm,F=Rn,G=RpE = \mathbf{R}^m, F = \mathbf{R}^n, G = \mathbf{R}^p; it is enough to show that the coordinates in Rp\mathbf{R}^p of f(x,y)f(x, y) are continuous functions of (x,y)∈E×F(x, y) \in E \times F (Chapter I, § 4, no. 1, Proposition 1). In other words, it is enough to show that every bilinear form gg is continuous on E×FE \times F; and this is immediate, since g(x,y)g(x, y) is a polynomial in the coordinates of xx and yy.

6. Topology of matrix spaces over R\mathbf{R}

An important example of a vector space over R\mathbf{R} is the space Mm,n(R)\mathbf{M}_{m,n}(\mathbf{R}) of matrices with m rows and n columns whose elements belong to R\mathbf{R}; this is a space of dimension mnmn over R\mathbf{R}, hence is homeomorphic to Rmn\mathbf{R}^{mn}. By Proposition 5 of § 5, the product X.YX.Y of two matrices X∈Mm,n(R),Y∈Mn,p(R)X \in \mathbf{M}_{m,n}(\mathbf{R}), Y \in \mathbf{M}_{n,p}(\mathbf{R}) is a continuous function of (X,Y)(X, Y). In particular, the topology of the space Mn(R)\mathbf{M}_n(\mathbf{R}) of square matrices of order nn is compatible with the ring structure on Mn(R)\mathbf{M}_n(\mathbf{R}). Furthermore:

Proposition 6

In the ring Mn(R)\mathbf{M}_n(\mathbf{R}), the group GLn(R)\mathbf{GL}_n(\mathbf{R}) of non-singular matrices is a dense open subset, and the topology induced on this set is compatible with its group structure.

(*) If E,F,GE, F, G are three vector spaces over a field KK, a mapping ff of E×FE \times F into GG is said to be bilinear if we have identically

f(x+x′,y)=f(x,y)+f(x′,y),f(x,y+y′)=f(x,y)+f(x,y′), f(x + x', y) = f(x, y) + f(x', y), \quad f(x, y + y') = f(x, y) + f(x, y'),
f(λx,y)=f(x,λy)=λf(x,y) f(\lambda x, y) = f(x, \lambda y) = \lambda f(x, y)
for all x,x′∈Ex, x' \in E, all y,y′∈Fy, y' \in F and all λ∈K\lambda \in K.

If XX is a nonsingular square matrix, the elements of X−1X^{-1} are rational functions of the elements of XX; these functions are therefore defined and continuous in a neighbourhood of XX, so that every matrix YY in this neighbourhood is non-singular, and the mapping Y→Y−1Y \to Y^{-1} is continuous at the point XX; hence GLn(R)\mathbf{GL}_n(\mathbf{R}) is open in Mn(R)\mathbf{M}_n(\mathbf{R}) and the topology of GLn(R)\mathbf{GL}_n(\mathbf{R}) is compatible with its group structure.

Finally, GLn(R)\mathbf{GL}_n(\mathbf{R}) is the complement of the set of square matrices XX whose determinant is zero; since the determinant of XX is a polynomial in the elements of XX, Proposition 3 of no. 4 shows that GLn(R)\mathbf{GL}_n(\mathbf{R}) is dense in Mn(R)\mathbf{M}_n(\mathbf{R}).

Exercises

See the exercises for § 1.

Transcribed from the printed volume. Not translated.