Professional Documents
Culture Documents
, we have ww, there exists y>w such that y? w there exists Z>w such that z w such that z2t such that u%" < x. Let us now introduce the following assumption : (GRyy) (“ Archimedes’ axiom ”). For all xeI and ye such that x >, there exists an integer n> such that x" is defined and x" > y. is defined and belongs ‘pe If we take E to be a set of real numbers >o0 which contains o and arbitrarily small numbers >, I to be the intersection of E with an interval of R_ which has 0 as its left-hand end-point and contains at least one other number, the law of composition to be addition of elements of I, and if we suppose that x | ye@E whenever xeI and yel then it is clear that the axioms (GR), (GRq), (GR) and (GRyy) are satisfied (*). (#) In the sets of magnitudes ” which arise in the experimental sciences, the axioms (GR,) and (GRj) are in general capable of experimental verification, at any rate approximately. On the other hand, axiom (GRyy), which postulates the existence of magnitudes “ as small as we please ”, clearly cannot be established in the same way; it is a purely @ priori assumption. As to axiom (GRyy), it can be considered as an “ extrapolation ” of a fact which can be verified by experi- ment for magnitudes which are not “ too small ”. 13v ONE-PARAMETER GROUPS Conversely : Prorosrrion 1. Let E be a linearly ordered set with a smallest clement w; let I be a subset of E such that wel and such that the relations xel, y ay be a law of composition on E, defined for xe1 and ye. Then, if the axioms (GRy), (GRy), (GRyx) and (GRyy) are satisfied, there exists a strictly increasing mapping f of 1 into the set Ry of real numbers > 0, such that f (x9) =F (#) +£(9) whenever x1, yeI and xve1; moreover, the intersection of f (I) with every interval [0, f (b)] of R is dense in this interval, where b denotes any element of I. Given any two elements x,y of I such that yw, let us denote by (x+y) the largest integer n>o such that y" is defined and x. If xelyel and ael, wehave (1) (#32) + (yt) < (xyz) < (eta) + (gta) be For let (x: 2) =p, (y: 2) = 4; then we have 2? xy because z+? >x and zit? > y. Next we establish the inequalities (2) (#29) (yz) < (#22), (iy) +1) (viz) +1) eid tn. Let («:y) —p and (y:z) —4q; then »? x, because y*4>x and z!*4> y; hence the second inequality. Let § denote the filter of sections of the ordered set of elements > w in I, with respect to the relation >; the intervals Jw, z], where z runs through the set of all elements >, form a base of %. Given two elements a and x of I such that a>, we shall show that the ratio (+ 2) (a: 2) » which is defined for zo0, (*) When E—I is the set of natural integers, the law of composition being addition, (x: y) is the integral part of +/y. 14MEASUREMENT OF MAGNITUDES §2 is a function of z which has a limit with respect to §. This is obvious if x=, forthen (x:z) =o forall z If x>w, we shall show that the image @ of § under the mapping z—> fd (restricted to the set a: of those z > which are 0. Note first that, u >w being given, (u: z) has limit +00 with respect to §: for there exists z>w such that 2" 2">2n. Now take a number <> arbitrarily; there exists #> such that (¥:#)>1/e and (a:#) >1/e. Consider the double inequality (wit) _(ti2)_ (wid) (wit) +1 (tid) +1) (@:t)+1 (t:2)+1 (@:2) (a:8) (#2) which follows immediately from the inequalities (2). There exists z) > 0 such that z< Z% implies (¢: 2) 2 1/e, so that 1 (x:t) (2 og a(*it) ), Fe 8(a:t) <(aiz) © +)" erty’ which shows that @ is a Cauchy filter base for the multiplicative uniform- ity. Fix once and for all the element a>w (the “ unit of measure "’) and for each xeI put From what has already been proved, we have f(w) =0, f(x) >0 for x>w, and f(a) = If we divide the inequality (1) throughout by (a:z) and pass to the limit with respect to %, we see that FS (#9) =f (#) +f(0) whenever xcI,yeI and xyeI. Likewise, the relation x w such that xz 0, so that indeed f(x) 0, there exists x > such that f(x) <2-" (take x such that x® 0, we have (p+1)f(x) >f (0) and qf (*) 2" contains at least one point of the form qf (x) =f (x) f(I). The proof of Proposition 1 is therefore complete. Remarks, 1) The relations xel, yel, ayel, »xeI imply SD) =F) +f (9) =F (9%), and hence yx = xy since f is strictly increasing; in other words, the law induced by the law of composition of Eon an interval [o, 6] suitably chosen (e.g., such that b* < a) is commutative. 2) Every mapping g of I into Ry which satisfies the same conditions as f is of the form x—>2f(x) where 4>0. For if = g(a) > 0 the relations z? < x < z?+}, 27 < a < z+! imply, by hypothesis, pale) < a(x) < (b+ sale), — ge) < a(a) < (9 + Hale), whence a wae w in I is not empty and has no smallest element, and given any two elements x, y, of I such that x <_y, there exists ze1 such that xz = y (‘subtraction ” of magnitudes). (GRyya) Every increasing sequence of elements of 1, which is bounded above by an element of 1 has a least upper bound in I. We shall show that these conditions are also sufficient, and moreover that they allow us to dispense with axiom (GRyy) (Archimedes’ axiom). To be precise, we shall prove the following proposition : ProposiTion 2. If a linearly ordered set E anda subset I of E satisfy the axioms (GRy), (CR), (GRyya) and (GRyy 4), there exists a strictly increasing mapping f of 1 onto an interval of R, with o as its left-hand end-point, such that f(w) =o and f(xy) =f (x) +f (9) whenever x,» and xy belong to I. Let us first show that axiom (GRyy) is satisfied. We argue by contradic- tion : suppose that there exist x, ye¢I such that x > w, x" is defined and x" 0. The increasing sequence (x") has a 16TOPOLOGICAL CHARACTERIZATION OF THE GROUPS R AND T § 3 least upper bound beI by (GRyy,). Since x w. Now, for every n, we have x™1w) is any element of f(I), and if 6 is any real number such that o< $<, there exists 6¢1 such that f(b) = (Chapter IV, § 2, no. 4, Proposition 1). Since the intersection of f (I) and [o, y] is dense in [o, y], there exists an increasing sequence (x,) of elements of I such that f(x,) has @ as limit. Let 4 be the least upper bound of the sequence (x,) in I; we have f(b) >f(x,) forall n, hence f (8) >; but f(b) > is impossible, otherwise there would exist yeI such that 6< f(y) (6), and since 6 is the least upper bound of the sequence (f(%,)), we should have f(x) < f(s) < f(b) for all n, whence *, , then 6" isdefined for all n, and therefore n. f(b) belongs to f(E) for all n; this implies that f(E) is not bounded above, because f(b) > 0. 3. TOPOLOGICAL CHARACTERIZATION OF THE GROUPS R AND T Tueorem 1. A topological group G in which there exists a neighbourhood of the identity element homeomorphic to an open interval of R_ is locally isomorphic to R. The significance of this theorem is that it allows us to deduce, from a purely topological property of a group G, a property of the group structure of G. We are concerned here with a phenomenon which is peculiar to the group R and has no analogue for the groups R" when n>1 (ch. Chapter VIII, § 1, no. 4). Groups locally isomorphic to R are sometimes called one-parameter groups. To prove Theorem 1 we shall reduce it to Proposition 2 of § 2. By hypo- thesis, there is a homeomorphism 9 of an open neighbourhood U of the identity element ¢ of G onto an open interval in R. By means of the inverse of the mapping 9 we can transport to U_ the linear order structure of the interval 9(U); the topology of U (induced by that of G) then has a base consisting of all the open intervals of U (Chapter 7v ONE-PARAMETER GROUPS IV, § 1, no. 4, Proposition 5). We can find a symmetric neighbourhood V of e such that V.VcU and such that V is an open interval; for there exists an open interval V’ containing ¢ such that V'.V’cU n U-1, V'i.V'-1cU and V'-'.V’'cU; taking V = V'u V'-1, V is open and symmetric, satisfies V.VcU and is connected, hence is an interval (Chapter IV, § 2, no. 5, Theorem 4). We show that, if x,y, z belong to V, the relation x o for z= and donot vanish in V [e.g., ifwe had 9(yz) = 9(xz), we should have yz—=xz and therefore y=]. Since f\(V) and f,(V) are connected (Chapter I, § 11, no. 2, Proposition 4) and are therefore intervals in R (Chapter IV, § 2, no. 5, Theorem 4), and since these intervals each contain a number >o and do not contain o, they are contained in Rt: that is, we have f(z) >o and f,(z) >o forall zeV. if x and y are two elements of V such that x>e and y2e, then in particular we have xy >e. Let E denote the (linearly ordered) set of elements of U which are >, and let I denote the set of elements of V which are >e; then the axioms (GR,), (GRq), (GRuy.) and (GRyy.) of § 2 are satisfied (taking w to be the element e, and the law of composition to be that of the group G). This is clear for (GR,), (GRy) and (GRyy,), from what precedes. As to (GRya), it is enough to remark that, if e e; consequently we can extend f to a. strictly increasing mapping f of V onto an interval of R by putting F(x) = —f(x-) for all x 0 is a topological group isomorphic to the additive group R of real numbers. For R* = Jo, + oo[ is an open interval of R and is therefore homea- morphic to R (Chapter IV, § 4, no. 1, Proposition 1). By Theorem 2 of § 3, it is therefore a topological group isomorphic to R. From the Corollary to Proposition 5 of § 1, no. 3, for every number a@>o there is a unique continuous homomorphism f, of R into Rt such that f,(1) = 4. Hence, for all xe R andall ye R we have fet) fl, f(—) = ay, Fla) and hence, in particular, for all ne Z, Sa(n) = a". For this reason we denote f,(x) by a® for all xeR; the functions a (for all values of a>o) are called exponential functions. We have w=1 forall eR; if aA 1, x a* is an isomorphism of the group R onto the group Rt. If a1, the isomorphism of R* onto R which is the inverse of x—>a® is called the logarithm to base a, and its value at xe Rf is denoted 19v ONE-PARAMETER GROUPS by log, x. Thus, with this notation, we have (1) arty = atqr (xeR,yeR,a>0); (2) wat (xeR,a>0); (3) log, 1 =0, logga =1 (a>0,a41); (4) loga (4) = loga * + logay (> 0, 9 > 0)5 (3) tos.( *) = log, («> 0)s (6) (x > 0); (7) (x eR). By Proposition 5 of § 1, no. 3, every continuous homomorphism of R into Rt is of the form y->a%, where xeR; since its value when y =1 is a*, we have identically (8) (@)"=a% (xeR, yER, a>0), or, changing the notation, (9) 27 = a7" qr (x>0,yeR,a>0,a41). ‘The formula (8) shows that, for every integer n> 0, we have (a¥")" = a, which justifies the notation a¥/* introduced for the nth root V/a, defined in Chapter IV, § 3, no. 3. Formulas (7) and (9) show that (10) logs (#) =J-loge® — (# > 0, R), or, changing the notation, (11) logy * = log, b.logyx (4 >0,a>0,6>0,a41, 641), which is the formula for “ change of base ”. Finally, let us obtain all the continuous homomorphisms of the topological group R® into itself; if g is such a continuous homomorphism, log, (g(2*)) is a continuous homomorphism of R into R, therefore (§ 1, no. 3, Proposi- tion 5) there exists aeR such that log,(g(a*)) = ax for all xeR; hence, by (8), g(x) = #* for all x>0. Hence we have identically (12) (x9)* = x*y* for all x > 0, y>0 and aeR. 20BEHAVIOUR OF THE FUNCTIONS @* AND LOG, * § 4.2 By reason of formula (4), which reduces every multiplication to an addition (the only operation to which the customary system of numeration is well adapted), logarithms have long been an indispensable instrument in numerical calculations (ser. the Historical Note to this Chapter). When used for this purpose, the base chosen is a = 10; and there are tables giving the values of the function logy. x (to a certain approximation). In analysis, one is led to choose a different base (denoted by ¢) which is such that lim 108 * — 1 (cf, Exercise 1). ot, 21 (¥— 1) 2, BEHAVIOUR OF THE FUNCTIONS a AND log, x By Theorem 5 of Chapter IV, § 2,no. 6, if a # 1, xa? is a strictly monotone mapping of R onto the interval R¥ =]o, | o[. If a@>1, we have at'=a>1=a% hence a® is strictly increasing; moreover, since Rt is not bounded above, a* is not bounded above in R, so that (13) jim @=+o (a>) and, by (2), (14) lim =o (a>). On the other hand, if @<1, the function a® is strictly decreasing, tendsto o as x tendsto + oo, and tends to + o as x tends to— oo (Fig. 1). yo0* (a>) Yaloggxla>') eat (act) = yalogaxe(a 0, and at >6 for x<0} for (2) > 1 : b\e , a if x >0, and ) <1 ifs 1, the function log, « is strictly increasing, tends to — o as x tends to o, and tends to + 0 as x tends to + 0; if a<1, the function log, * is strictly decreasing, tends to + 0 as x tends to 0, and to — o as x tendsto + o (Fig. 2). The function a* (resp. log, x), considered as defined on a subset of the extended line R and taking its values in R, can be extended by continuity to R (resp. to the interval [o, + 20] of R) by assigning to it its limiting values at the points + 0 and —o (resp. o and +). More generally, formula (9) shows that the function x7 is continuous on the subspace R* x R of R® and tends to a limit when (x, y) tends to any point (a, 6) of R® which lics in the closure of R* x R, with the exception of the points (0, 0), (+ 0, 0); (1, + ©), (1, —). We can therefore extend x” by continuity to those points of R* at which the limit exists; by the principle of extension of identities (Chapter I, § 8, no. 1, Proposition 2, Corollary 1), formulas (1), (4) and (8) remain valid whenever both sides have a meaning. Note that the extension by continuity of x” docs not allow us to obtain the formula o° = 1. Note also that the definition of the exponential allows us to extend to R the function n—> a" defined on Z, for all a> 0; but we do not obtain in this way any extension of this function when a O ‘The isomorphism of the topological groups R and R* shows immediately that for a family (x) of finite real numbers > 0 to he multipliable (Chap- ter IV, § 7, no. 4) it is necessary and sufficient that the family (log, ~,) should be summable (a being any number >o0 and ~1); and we have Droge, a : (15) Likewise, an infinite product defined by a sequence (1+ 4,) of finite numbers >0 is convergent (Chapter IV, § 7, no. 6) if and only if 22MULTIPLIABLE FAMILIES OF NUMBERS > O § 4.3 the series whose general term is log, (1 +,) is convergent, and then we have S tora (t+) 20 . (16) Po + Up) ‘The study of infinite products of real numbers > is thus reduced to that of infinite series of real numbers whose terms appear in the form of logarithms; we shall see later how sums of this nature can be easily studied by means of the differential properties of the logarithm. 23EXERCISES §r 1) * a) Let f be a homomorphism of the additive group R_ into itself. Show that, if the graph of f is not dense in R*, f is of the form x — ax [consider the closure in R® of the graph of f, and use the structure theo- rem for closed subgroups of R? (Chapter VII, § 1, no. 2, Theorem 2)]. [Compare with Chapter VI, § 1, Exercise 126) and Chapter IV, § 6, Exercise 2.] 6) If the graph of f is dense in R*, the inverse image of the topology of R® under the mapping x — (x, f(x)) is compatible with the group structure of R_ and is strictly finer than the usual topology of R. If moreover f is injective, the inverse image under f of the usual topology of R is compatible with the group structure of R and is not comparable with the usual topology of R. §[ 2) Let G be a Hausdorff topology on R, compatible with the group structure of R and strictly coarser than thc usual topology Gp. a) Show that every open neighbourhood of 0 with respect to © is unbounded in R (note that a Hausdorff topology which is coarser than the topology of a compact space must coincide with the latter). 6) Let V#R_ be a symmetric open neighbourhood of o with respect to G, andlet W be asymmetric open neighbourhood of 0 with respect to G such that W+WcV. Show thatif a is the length of the compo- nent of V (with respect to 6) which contains 0, then every component (with respect to Gp) of W has length 2, give examples of continuous injective homomorphisms f of R into I” such that f(R) is dense in T" (cf. Chapter VII, § 1, no. 4, Corollary 1 of Proposition 7). 3) Show that the group T is algebraically isomorphic to the product R x (Q/Z) (take a suitable Hamel base in R). Deduce that there exists a Hausdorff topology on R, compatible with its group structure, not comparable with the usual topology, and with respect to which Ris precompact. §2 1) Let E be a linearly ordered set with a smallest element w, and let I be an interval of E, containing w, with w as its left-hand end-point. Suppose that E and I satisfy axioms (GR,), (GRy), (GRiy) and the following axiom : (GRuy) The set of elements x>w in I is not empty, and if x is any element >w in I, there exists y>w in I such that y? 0 and y is any element of G. Define a law of composition on E by the rule (x, )(x‘, »') = (x + x’, yy’), and order E lexico- graphically [i.e. (x, y) < (x',9') if x (the identity element of G) satisfies axiom (GRyy) of §2. Show that a linearly ordered group G is isomorphic to a subgroup of the additive group R if and only G is Archimedean (distinguish two cases according as the set of elements >¢ in G has or has not a smallest element, and use Proposition 1 of § 2). 25v ONE-PARAMETER GROUPS 2) Let G be a linearly ordered group (not necessarily commutative), with more than one element. Then the topology G,(G) (Chapter I, § 2, Excrcise 5) is compatible with the group structure of G. If G is connected in this topology, show that G is isomorphic to the additive group R (use Exercise 7 of Ghapter IV, § 2, and Proposition 2 of § 2). 3) Let G be a (not necessarily commutative) linearly ordered group. If G, endowed with the topology G)(G),_ is locally compact and not discrete, then G is locally isomorphic to R, and the identity component of G is an open subgroup isomorphic to R (use Exercise 6 of Chapter IV, § 2, and Proposition 2 of § 2). § 4) Let G bea topological group which satisfies the following conditions: (Ry) G is connected. (Ry) The complement G* of the identity element ¢ of G is not connected. Then there exists a continuous bijective homomorphism of G onto R (in other words, G is algebraically isomorphic to Rand its topology is finer than that of R). The proof is in several steps : a) Let (U;): 2). Show that each U; is open in G, that ¢ lies in each U;, and that G is Hausdorff. Deduce that the closures U; = U;u fet in G are connected (Chapter I, § 11, Exercise 4). 4) Let A bea connected component of U;. Show that for cach index j#i, we have A*U;=A™ (observe that AU) is connected and contains A-!, and that A-1U,cG* if j#i). c) Show that n must be equal to 2 [for each index i= 1, 2,...,2 take a component A; of U,; if ji we have, by 6), ArtA,c Az}, AptAje Aptc Uz}, whence AricUy]. Deduce that G* has exactly two components A and B, that B= A-? and A = ((A~). d) The relation yx-1¢A is an order relation, which makes G into a linearly ordered group (show that A? =A and that xAx-! = A for all x ¢ of V.] 7) Let G be a non-discrete locally compact group with a countable base of open sets, and let Vy be a compact neighbourhood of the identity element ¢ of G which contains no subgroup of G other than {et}. a) Let (x,) be a sequence of points of V, which converges to e. For each n, there exists an integer p(n) >o such that xfeV, whenever k< pln) and x2™1¢Vy, and we have lim p(n) = +o. Show that there exists a subsequence (x,.) of (x,) such that, for every rational number r with |r| <1, the sequence (xf?!) has a limit f(r) in V, (use the diagonal technique); and that if r, r’ are rational numbers such that |r| <1, |r| <1 and |r+r'| <1 we have Ft") =fOF(). 4) Show that f is continuous in a neighbourhood of o in Q. [Argue by contradiction: if there were a sequence (r,) of rational numbers tending to o and such that f(r,) tended toan element y #e in Vo, show that we should have y"« V, for allintegers m.] c) Deduce from 4) that there exists a non-trivial continuous homomor- phism of R into G (usc Proposition 6 of § 1). d) Let H_ be a closed normal subgroup of G other than G_ itself, and suppose that there is a neighbourhood of the identity element in G/H_ which contains no non-trivial subgroup. Show that there exists a continuous homomorphism f: R ->G such that the composition R2G3G/H is non-trivial. 8) Let G be a topological group and let H_be a closed subgroup of G, contained in the centre of G, and such that there is a continuous 27v ONE-PARAMETER GROUPS surjective homomorphism 9: R->G/H. Show that G is abelian [if a, is an element of G which is not in H, observe that there exists a sequence (a,) of clements of G anda scquence (¢,) of clements of H such that a, = ¢yd,4, and that the subgroup of G generated by H and the a, is dense in G]. §4 1) a) Let (%nJ,)nez be a family of points of R? such that for all ne Z we have x <%q4qand Dnt In Int — Ins, *nt1 — *n *nta— *nt Show that, for all integers ne Z,m> 0, p > 0, we have Jntm—In < Intmep —In, Xntm Xn Xntmtp— Xn 8) If a>o and x0, put fle) =F. z Show that, if x , the function f,(x), defined for x70, has a limit on the right and a limit on the left as x —>0; show that these two limits have a common value 9(a), and that 9(a)#o if a¥1. Show that if a1, the function log, x/x—1, defined for x 4 1, tends to the limit 1/9(a) as x1. d) Show that, for all a>o and 6>0, we have 9(b) = ¢(a) logyd (if @%1). Deduce that there exists a number ¢ between 2 and 4 such that 9(e) =1, and that 9(a) =log,a forall a>o. 2) Show, by induction on n, that for all integers n > 0 we have 2">+ n(n +1). 2 Deduce that, if @>1 and a>0, lim £=+ 0, lim loget _ were x were x (begin by proving the first of these relations for a= 2 and @ = 1). 28HISTORICAL NOTE (Numbers in brackets refer to the bibliography at the end of this note.) The history of the theory of the multiplicative group R* of real numbers > is closely related to that of the development of the notion of powers of a number >o and the notations employed to denote them. The idea of the “ geometric progression ” formed by successive powers of the same number goes back to the Egyptians and the Babylonians; the Greek mathematicians were familiar with it, and as early as Euclid [1] we find a general statement equivalent to the rule aa" = a™+* for integral exponents m,n>o. In the Middle Ages, the French mathe- matician N. Oresme (14th century) rediscovered this rule. He was the first to have the idea of a fractional exponent > 0, with a notation similar to our own and to our relevant rules of calculation, stated in gencral terms; for cxamplc, he uscd the two rules which we should write as (ab) = atmbum, (am) = (a) *4 [a]. But the ideas of Oresme were too far ahead of the mathematics of his time to exercise an influence on his contemporaries, and his treatise soon sank into oblivion. A century later, N. Chuquet stated Euclid’s rule anew; furthermore, he introduced an exponential notation for the powers of unknowns in his equations, and did not hesitate to use the exponent o and integral exponents 0; hence, if 2 > 0, R" is equipotent with R, that is, R" has the power of the continuum (cf. Exercises 1 and 2). DEFINITION 2. Any subset of R" which is the product of n open (resp. closed) intervals of R is called an open (resp. closed) box in R". [For n=2 itis called an open (resp. closed) rectangle. ‘The open boxes in R" form a base of the topology of R"® (Chapter I, § 4, no. 1); the open boxes which contain a point x = (x;),cic, of R" form a fundamental system of neighbourhoods of x, and so do the closed boxes of R" for which x is an interior point. Every non-empty open box in R" is homeomorphic to R" (Chapter IV, § 4, no. 1, Proposition 1). It follows that, when 2 1, every non-empty open set in R* has the power of the continuum. An open (resp. closed) cube of R® is an open (resp. closed) box which is the product of n bounded intervals of equal length [for n= 2, it is called an 3tvI REAL NUMBER SPACES AND PROJECTIVE SPACES open (resp. closed) square]; the common length of these intervals is called the side (or side-length) of the cube. The open cubes K, = 1; —-L, x; al J] motte form a countable fundamental system of neighbourhoods of the point x= (x,), as m runs through the set of all integers >o or through any sequence of integers increasing to infinity. Every open (or closed) box in R" is connected (Chapter I, § 11, no. 4, Proposition 8); in particular, R” is connected and locally connected. If A is a non-empty open set in R", its components are therefore open sets (Chapter I, § 11, no. 6, Proposition 11); and the set of these components is countable, for R* has a countable dense subset (for example Q*). Consider under what conditions a subsct A of R" will be relatively compact. By Tychonoff’s theorem (Chapter I, § 9, no. 5, Theorem 3) it is necessary and sufficient that the projections of A on the factors of R" 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. We say that a subset A of R" is bounded if all its projections are hounded subsets of R; thus we have proved : Proposition 1. A subset A of RY is relatively compact if and only if it is bounded, Corotiary. The space R® is locally compact, but is not compact if n> 1. 2. THE ADDITIVE GROUP R" The set R", endowed with the group structure which is the product of the additive group structures of the 2 factors of R*, is an abelian group; we use the additive notation, the sum of x = (x) and y = (y;) being therefore. x + y = (x;+ ;)- The topology of the number space is compatible with this group structure; endowed with these two structures, R® is a topological group called the additive group of n-dimensional real number space. If n= 0, we make the convention that R° denotes a group consisting only of the identity element. The uniform structure of this group, called the additive uniformity of R’, is the product of the uniformities of the factors of R® (Chapter ITT, §3, no. 2). If, for each integer p > 0, Vp denotes the set of pairs (x, y) of R* such that max |x; — yi <1/p, the scts V, form a fundamental ign 32THE VECTOR SPACE R” § 1.3 system of entourages of this uniformity. Whenever we consider R" as a uniform space we shall always have in mind the additive uniformity just defined, unless the contrary is expressly stated. Endowed with this uni- form structure, R” is a complete uniform space (Chapter II, § 3, no. 5, Proposition 10). 3. THE VECTOR SPACE R" Since R is a field, we can define on R" a vector space structure over the field R, the product tx of a scalar teR and a point (or vector) x = (x;) of R" being the point (x;). Note that the homothety (, x) > tx is continuous on RXR". If e; denotes the vector of R? all of whose coordinates are zero, except for that of index i, which is equal to 1, then the e; form a basis of the vector space R®, called the canonical basis of this space. Every vector x =(x)¢R" can be written as x = 3) xe;, and the relation 3) t;e;=0 implies that 4; = 0 i & for r0). If we put g(x) =f (x) —f(0), g is a linear mapping of R" into R™. Let aj (1 ua; i= such that —1, the affine linear varieties of n—1 dimensions of R® are called hyperplanes (loc. cit.). The n one-dimensional coordinate varictics, that is to say the r lines passing through o and the n points ¢, respectively, are called the coordinate axes. For n= 2 the axis through ¢, is sometimes called the axis of abscissas and the axis through ¢; is called the axis of ordinates; the first coordinate of a point x€R? is called its abscissa, the second coordinate its ordinate. Every line D passing through a point a has a parametric representation t-—>a-+tb, where ¢ runs through R and bo; this mapping is a homeomorphism of R onto D. The vector b is called a direction 34AFFINE LINEAR VARIETIES IN R” § 14 vector of D, and its components 6; (1 , is called the closed ray (or simply ray, or half-line) with origin a and direction vector b (or with direction ratios 5;). It is a closed subset of R"*, homeomorphic to the interval [o, + oof of R, and therefore connected. The line D_ is the union of the two rays with origin a and direction vectors and — b respectively; these rays are said to be opposite. By abuse of language, the set of points a+ tb, where ¢ runs through the set of real numbers > 0, is called the open ray with origin @ and direction vector 5; it is homeomorphic to the interval Jo, + «[ (and therefore homeomorphic to R), but is not open in R® if n > 1, although it is open in the line which contains it. Aline passing through two distinct points x and y also has a parametric representation (u, 2) > ux + ay, where (u, 2) runs through the set of pairs of real numbers such that u + v0—1. Given any two points x, y (distinct or not) the set of points ux + uy, where (uw, ) runs through the set of pairs of real numbers such that u2>0,v20 and u+o—=—1, is called the closed segment (or simply segment) with end-points x, y. A closed segment is compact and connected, for if its end-points are distinct it is homeomorphic to the interval [0, 1] of R. If xy, theset of points ux +p such that u>0,v>0 and u-o=1 is called (by abuse of language) the open segment with end-points x, y; it is homeomorphic to the open interval Jo, 1[ (and hence also homeomor- phic to R). Finally the union of {y} and the open segment with end- points x, y is sometimes called the segment open at x and closed at y; it is homeomorphic to the interval [o, 1[. All the segments with x and y 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 (x Xa, -.-5 %n) be a polynomial with real coefficients, not identically zero, defined on R*. ‘Then the complement of the set F (0) is dense in R" Let x be any point of R* and let yeR" be such that f(y) 403 9(t) =f (x +4(y—-x)) is a polynomial in the real variable ¢, not identically zero; hence there exist arbitrarily small values of ¢ such that a(t) #0. This shows that x lies in the closure of the complement of Fo). Corottary. The complement of an affine linear variety of dimension p 1) the complement of every hyperplane has two connected components. Let g(x) =0 bean equation ofa hyperplane H in R*, g being a linear polynomial. The set fH is the union of the set E, of all points x such that g(x) >o and the set E, of all points x such that g(x) o and g(y)>o we have g(ux + vy) = ug(x) + og(y) > 0 whenever u>o0, v >o and u-|-v = 1}; in other words, the segment with end-points x and y is contained in E,. Similarly for Ey. On the other hand, §H is not connected, because its image in R under g is the union of the intervals Jo, + oof and J— oo, of. The components E,, E, of the complement of a hyperplane H are called the open half-spaces determined by H. ‘The closures of Ey and E, which are respectively E, UHI and E,uH, arc called the closed half-spaces determined by H. Observe that an affine mapping of R* onto itself which transforms H. into a “ coordinate ’? hyperplane, e.g., the hyperplane whose equation is x, — 0, also transforms the open halfspaces detcrmined by H_ into the open half-spaces defined respectively by the relations x,> 0 and % <0; the latter are open boxes and therefore homeomorphic to 'R®. 5. TOPOLOGY OF VECTOR SPACES AND ALGEBRAS OVER THE FIELD R Let E be a vector space of dimension 2 over the field R; if (@i)1 3 a; is therefore a bijective linear mapping of R" onto E. If we transport to E the topology of R" by this mapping, E is endowed with a topology compatible with its additive group structure, and the mapping (f, x) tx of R x E into E is continuous with respect to this topology. This topology is indspendent of the basis chosen in E; for a 2 if (a’) is another basis of E, and if x = 3 xa! = 3) xa;, the mapping & (x) = (x!) of R* onto itself is linear and therefore a homeomorphism. 36TOPOLOGY OF MATRIX SPACES OVER R § 1.6 ‘This fact leads one to suspect that the topology so defined on E. should be capable of characterization without the help of a basis of E. In fact, we shall see later that this is the only Hausdorff topology on E. for which the functions x—y (on EXE) and tx (on RX E) are conti- nuous. If now A is an algebra of finite rank n over the field R, the above topology on A (considered as an n-dimensional vector space over R) is compatible not only with the additive group structure of A, but also with its ring structure. This is a consequence of the following more general It: Proposrrion 5. Let E, F, G be three finite-dimensional vector spaces over the field R. Then every bilinear mapping (*) f of Ex F into G is continuous. We may suppose that E = R", F = R*, G = RP; it is enough to show that the coordinates in R? of f(x, y) are continuous functions of (x, y)¢E xX F (Chapter I, § 4, no. 1, Proposition 1). In other words, it is enough to show that every bilinear form g is continuous on E x F; and this is immediate, since g(x,y) is a polynomial in the coordinates of x and y. 6. TOPOLOGY OF MATRIX SPACES OVER R An important example of a vector space over R is the space M,,,(R) of matrices with m rows and n columns whose elements belong to R; this is a space of dimension mn over R, hence is homeomorphic to R™. By Proposition 5 of § 5, the product X.Y of two matrices XeM,,,(R), TeM,, ,(R) is a continuous function of (X, 1). In particular, the topol- ogy of the space M,(R) of|square matrices of order n is compatible with the ring structure on M,(R). Furthermore: PRopostrion 6, In the ring M,(R), the group GL,(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, G are three vector spaces over a field K, a mapping f of E x F into G is said to be bilinear if we have identically SF + #59) =f (69) $F (HI) FHIFY) =F) +L (HID SF (9) =F (#29) =F (9) for all x,x’eE, all »,»’eF andall }eK. 37VI REAL NUMBER SPACES AND PROJECTIVE SPACES If X is a nonsingular square matrix, the elements of X-! are rational functions of the elements of X; these functions are therefore defined and continuous in a neighbourhood of X, so that every matrix Y in this neighbourhood is non-singular, and the mapping 7’ 1-" is continuous at the point X; hence GL,(R) is open in M,(R) and the topology of GL,(R) is compatible with its group structure. Finally, GL,(R) is the complement of the set of square matrices X whose determinant is zero; since the determinant of X is a polynomial in the elements of X, Proposition 3 of no. 4 shows that GL,(R) is dense in M,(R). 2. EUCLIDEAN DISTANCE; BALLS AND SPHERES 1, EUCLIDEAN DISTANCE IN R* In conformity with the general definitions the Euclidean distance between two points x = (x;) and y =(.;) is the number V Sev" (x; —9)* > We recall its principal properties. The relation d(x, y) —o is equi- valent to x = y. We have d(x, y) =d(y, x); for all scalars te R, Utx, ty) =|t\d(x, y); for all zeR", dx +z y +z) = d(x, y); in other words, the distance between two points is invariant under translation. The distance d(o, x) from the origin o to a point x is denoted also by |[x|| and is called the Euclidean norm of x (or simply the norm of x, when there is no likelihood of confusion; cf. Chapter IX, § 3, no. 3). Then d(x, y) =lly—=ll- For n= 1, the Euclidean distance between the points x,y of R reduces to thelength | y— x| of the intervals with x and y as end-points. For any n, we say that d(x, y) =||y —x|| is the length of the segments with x and y as end-points. a(x, y) ‘The Euclidean distance satisfies the triangle inequality (2) d(x, y) < d(x, z) + d(z, ») for all x,y,z in R". We recall that the proof of (1) reduces to that of the inequality 38DISPLACEMENTS § 22 this in turn is equivalent to the Cauchy-Schwarz inequality (2) «(3 9)(2a) which is an immediate consequence of Lagrange’s identity s a 1 \a (3 #)( > *) -(3 +3) =F Y G45)". is. ist ist ij ‘This proof shows at the same time that the two sides of (1) can be equal only if z isa point of the segment with x and y as end-points. From (1) we deduce the inequality (2) A(x, y) > |d(x, 2) — d(y, 2)]- Finally, if x = (x), y = (yj), we have (3) sup |a;—Ji| x;9; of the bilinear form associated t= with the quadratic form — 7 43; it is denoted by (x|y), or simply by xy if there is no likelihood of confusion. Every orthogonal transfor- mation leaves invariant the scalar product of any two vectors. Two vectors x, y are said to be orthogonal if (x|y) = 0; two vector subspaces V, V’ of R® are said to be orthogonal if each xeV is orthogonal to each ye V’; and two affine linear varieties P, P’ are said to be orthogonal if the vector subspaces parallel respectively to P and P! are orthogonal. 3. EUCLIDEAN BALLS AND SPHERES For each integer >0, let U, denote the set of all pairs (x,y) of points of R" such that d(x, y)<1/p; the inequalities (3) show that the sets U, form a fundamental system of entourages of the uniformity of R® (cf. Chapter rx, § 2). From this fact and from the incquality Id(x, ») — d(x’, »)| < d(x, x’) + dy, ¥), which is a consequence of (1), we infer that d(x, y) is uniformly continuous on R" x R% consequently the norm ||x||=d(0, x) is uniformly continuous on R®. Dermrmion 1. Given a point xg@R" and a real number 1 >0, the open (resp. closed) Euclidean ball of n dimensions with centre xq and radius r is the set of all points xR" such that d(x x) ) form a fundamental system of neighbourhoods of the point x9. 40EUCLIDEAN BALLS AND SPHERES § 2.3 Proposition 1. Every open (resp. closed) ball of R” is an open (resp. compact) set. The closure of an open ball is the closed ball with the same centre and the same radius; the interior of a closed ball is the open ball with the same centre and the same radius. The open (resp. closed) ball with centre x) and radius r is the inverse image of the interval ]— 0, r[ (resp. J— <0, r]) under the continuous function d(x, x); it is therefore open (resp. closed and bounded, hence compact). If d(xo, x) = 7, andif y = x9 + t(x— xX) (0 0) is a point of the open ray with origin x and direction vector x — x , we have d(x9.z) = (1 +¢)r>r, and d(x, z) = ¢ is as small as we please; hence x is not an interior point of the closed ball with centre x, and radius r. Corotrary. Every Euclidean sphere is a compact set and is the frontier of the open and closed balls with the same centre and the same radius. The mapping x-—+—-(x — x9) transforms the sphere (resp. open 7 ball, closed ball) with centre xy and radius r into ‘the sphere (resp. open ball, closed ball) with centre o and radius 1; this sphere is denoted by S,-1 and is called the unit sphere in RY. Likewise, the closed ball with centre o and radius 1 is denoted by B, and is called the unit bail in R". The topological study of a sphere of (n—1) dimensions (resp. aclosed ball of n dimensions) is thus reduced to that of S,, (resp. B,). For the open balls, we have the following proposition : Prorosrrion 2. Every n-dimensional open ball is homeomorphic to R". For the mapping aera is continuous on R" and maps R" 1+ [lal onto the open ball with centre o and radius 1; moreover, from yr we deduce x so that the mapping is —*__ -_I_, 1 + [lx] 1 —|I>1] bijective and bicontinuous. Let R#* denote the complement of o in R". Proposition 3. The space R¥ is homeomorphic to the product of S,-, and the space R* of real numbers >. 41