• Nie Znaleziono Wyników

Rigid graphs of maps

N/A
N/A
Protected

Academic year: 2022

Share "Rigid graphs of maps"

Copied!
4
0
0

Pełen tekst

(1)

W Ł A D Y S Ł A W K U L P A *

RIGID GRAPHS OF MAPS

Abstract. In this note we construct maps between metric separable connected spaces X and Y such that the graphs are connected, dense and rigid subspaces o f the Cartesian product X x Y . From this result it follows that there is no maximal topology among metric separable connected topologies on a given set X.

In this note we shall construct m aps between m etric separable connect spaces X and Ysuch th at the graphs are connected, dense and rigid subspaces o f the C artesian product X x Y . The first construction o f a m ap f : R - * R w ith th e connected and dense graph in the plane and satisfying the Cauchy equation f ( x ) + f ( y ) = f ( x + y ) was given by F.B. Jones [3] in 1942. M ore general construction one can find in [4].

In order to obtain the existence o f rigid graphs o f maps, we shall utilize, in the proof, an idea o f W. Sierpiński from [5]. A similar m ethod is also used in de G roo t’s paper [2].

Spaces considered here are assumed to be separable and metric, i.e. we assume th at they are subspaces o f the H ilbert’s cube I0’.

A continuous m ap / : X -» Y, I , 7 c / “, is called a continuous displacement [2], iff there exists a subset V<=X such that

\ f ( V) \ = T and F n / ( F ) = 0 ,

Let us notice th at each hom eom orphism f : X -*■ X different from the identity m ap, and where A' is a connected subspace of I 03, ia a continuous displacement.

Indeed, s i n c e i d * , there exists a point x e X such th at f ( x ) ^ x . Choose disjoint open sets V, W<= X such th a t x e V and f ( x ) e f ( V ) c. W. Since X is a connected metric space hence \ V \ = 2 C0. Thus, 1 /(1 0 1 = 2 " and V n f ( V ) = 0 .

F o r m ore exhaustive inform ation on continuous displacements, the reader can refer to de G ro o t’s paper [2].

Received April 04, 1983.

AMS (MOS) subject classification (1980). Primary 54C08.

* Instytut Matematyki Uniwersytetu Śląskiego, Katowice, ul. Bankowa 14, Poland

92

(2)

A space is said to be rigid if it adm its between itself no hom eom orphsim different from the identity m ap. A n abound inform ation on rigid spaces can be found in C haratonik’s paper [1].

F or each m ap f : X -» Y, let G ( /) denotes the graph o f the m ap / : G ( f ) = { ( x , y ) e X x Y : y = f ( x ) } .

Let n: X x Y -> X means the projection an d let the symbols Int, Bd mean respectively interior and boundary operations.

Let us start from a

LEM M A . I f f : X -* Y is a map between connected metric separable spaces such that fo r each non-empty open set G c X x Y with non-empty boundary

G ( / ) n B d X x rG # 0 , then the graph is connected and dense in X x Y .

P r o o f . It is obvious th at the graph m ust be dense in X x Y , because the sets o f the form U x V , U open in X and V open in Y, create a base for the topology o f the space X x Y .

In order to see th a t the graph m ust be connected we shall utilize tw o results from [4]. I t was proved in ([4, Lemma 1]) th a t if X and Y are connected spaces and G is a non-em pty subset o f X x Y then one o f the following conditions is satisfied:

(a) In tx Ji(BdX xrG )?£0,

(b) there exists an x e X such th at 7t_1(x) c B d*x y G, (c) G is dense in X x Y .

Secondly ([4, Lemma 2]), if D is a dense subset o f a connected space Z such th at for each non-em pty open set G c Z with Z )<£G,

D n B d z 0

then D is a connected set.

P ut D = G ( f ) and Z = X x Y . Let us verify th a t the condition D n B d z G ^ 0 is satisfied for each non-em pty open set G c Z fo r th a t D <fc G.

(1) I f In tx 7i(Bdz G ) # 0 then according to the assum ption D r*B dz G ^ 0 . (2) I f there exists an x e X such th a t n _1(x)c=Bdz G then it is clear th at D n B d z G ^ 0 .

(3) I f G $ D is dense in Z then

D n B d z G = D n ( Z \ G ) = D \ G ^ 0 . Thus, the lemma is proved.

TH E O R E M . L et X and Y be metric separable and connected spaces. Then there exists a fam ily ^ a M ap(X , Y ), \<ś\ = 2C, c = 2®, such that:

(1) each graph G( f ), fe <%, is a connected, dense and rigid subspace o f the product X x Y ,

(2) no two distinct graphs G ( f ) and G(g), f , g e are homoemorphic.

93

(3)

P r o o f . Assume th a t the product 1 x 7 is a subspace of the H ilbert cube r°, X x Y c 7®. Consider the family

{ ( £ : $ , - > n : « < 2*}

o f all the continuous d isp la c e m e n t/,: S x -» 7“, where S x is a subset o f / " , such that n [ S , n ( I x y ) ] = 2“

where ti : A'x Y -* Z is the projection. Let us well order the set X;

X = {xa : a < 2“}

and let us put, for each a < 2m, Qx = { x j x Y. Let [Px : a < 2“ } be a well-ordering o f the family

{ B d ^ y G : G is open in X x Y and Int*jr(B d*x y G ) # 0 } . We shall define by induction sets

A = {pa, q j rx , s x , t x} C X x Y , a < 2“ , satisfying the following conditions:

( 1) Pa ^ Qa ^ Qy.’ *^a £ $ a o ( ^ f x Y ), sa7^ and 7t(*ya) = (2) if x , >> e (J {Aa\ { ^ } : a < 2®} and then 7t ( x ) # 7t 0 >),‘

(3) for each a < 2“ /*(/•*) ^ U {^l/j: /? < 2"}.

Suppose th a t the sets A fi have been choosen for each p < a. Put Z* = U { A, : P < a } .

W e have |Z a| < 2“ .

(a) Let us choose a p x e P x such that

Pa 6 -P « \{/^ 0>) : P < a} and tc (/>a) i n (Zx) . (b) Choose a qx s Q x such that

qx= q0 whenever Q* n (Za u {/>*}) # 0 or

<7« £ Q ^ \ { f p ( rfi) ■ P < a} whenever n (Za u {/>J) = 0 . (c) Let Vx c S , be a set such th at

\ / M \ = 2"‘ and Vx n f x(Vx) = 0 . Choose points rx, sx e Sx n ( X x Y) such that

rx , sa e f x 1 I f x (Vx) \ { Z x u {px , « , } ) ] \ { /,(/> ) : P < a}, n( r x) ¥= n (sa) and n ( r x) , n ( s x) $ n ( Z x \ j { p a, qa}).

(d) Finally, choose tx e X x Y such that

W s J } x Y \ { f p(rfi) : P < a} .

One can verify th a t the conditions (a )—(d) imply the conditions (1)—(3).

Let us p u t S = { s x : a < 2®}. The set S can be represented as the union S = u {By :y < 2 C},c = 2“

such th a t . „ , „

y =ty implies B. # B y .

(4)

Define for each y < 2C the set

K y = U {{px , qa, rx , dl } : a < 2“}, where

dl fs«> if

| f a , if sx$ B y . Let gy : X -* Y be such th at G(g) = K y.

Since each set K contains the set (J {px, qx} : a < 2“ } hence according to Lemma each of the sets, K y < 2C, is dense and connected in the product X x Y .

Now, suppose that there exists a continuous displacement f : K y - +K y. , y , y ' < 2C.

Since K y. c: XxY<=: / “, we can consider the m ap / as a continuous displacement / : Ky -> r .

By Lavrientieff’s Theorem there exists a continuous extension o f/ , / * : K* -*

where K *zs K y is a subspace o f l w. According to the construction there exists an a < 2“ such th at

/ * = /« and S X = K*.

Consider the point rx e S x. By the construction we get

rxe S x n K y and f x(rx) £ K f , for each y' <

2

C.

f ( r a) = f * ( r x) = f x(rx) t K y , h at contradicts with f ( r x) e K 'y.

COROLLARY. There exist 2C non-homeomorphic, connected rigid subspaces o f the Hilbert cube / “ .

I f we p u t in Theorem X = Y = R then we get

CO ROLLARY. On the set o f reals, there exist 2C non-homeomorphic metric connected separable and rigid topologies which are finer than the natural topology o f the space R o f reals.

C O ROLLARY. There is no maximal topology among metric separable con­

nected topologies on the set X.

P r o o f . Suppose th a t X is a maximal connected metric separable space. Let f : X ~ * Y be a m ap such th at the graph G ( f ) c X x Y is a rigid connected and dense subspace of the product X x Y . The projection n : G (J ) — X induces a topology on the set X which is finer than the previous topology.

REFERENCES

[1] J .J. CHARATON1K, On chaotic curves, Colloq. Math. 41 (1979), 219—227.

[2], J. D E GROOTj Groups represented by homeomorphism groups I, Math. Ann. 138 (1959), 80— 102.

[3] F. B. JONES, Connected and disconnected plane sets and the functional equation f(x ) + f( y ) =

= f ( x + y ) , Bull. Amer. Math. Soc. 48 (1942), 115— 120.

[4] W. K U LPA , On the existence o f maps having graphs connected and dense, Fund. Math. 76 (1972), 207—211.

[5] W. SIERPIŃSKI, Sur les types d'ordre des ensembles lineaires, Fund. Math. 37 (1950), 253— 264.

Cytaty

Powiązane dokumenty

In this section we shall present some considerations concerning convergence of recurrence sequences, and their applications to solving equations in Banach

[r]

Universidad Nacional Aut´ onoma de M´ exico Ciudad Universitaria, M´ exico

The nullity of graphs is of interest in chemistry since the occurrence of a zero eigenvalue of a bipartite graph (corresponding to an alternant hydrocarbon) indicates the

WCRDF Weakly connected Roman dominating function 3SAT The three-satisfiability problem.. CNF Conjunctive normal

In the last ten years, much of the study has been focused upon finding conditions to ensure the existence of a solution in the case where T need not be upper semicontinuous, since

If we restrict our attention to all-unoriented mixed graphs, then by the results of [6] we have found two graphs respectively with the largest and the second largest spectral

Other graphs with one vertex of valency four, one isolated vertex and with- out any pendent vertices are obtained by adding one or more cycle compo- nents to F 1 or to graph