Darboux functions. Beniamin Bogoşel

Size: px
Start display at page:

Download "Darboux functions. Beniamin Bogoşel"

Transcription

1 Darboux functions Beniamin Bogoşel Abstract The article presents the construction of some real functions with surprising properties, including a discontinuous solution for the Cauchy functional equation having Darboux property. In the end, the notions are generalized in more dimensions. Key words: Darboux property, Cauchy functional equation 2000 MSC: 26A30, 39B22, 26B35, 03E75 In this article we construct some unusual and unintuitive functions which have interesting properties. We will concentrate our attention on the Darboux property. In the first part we prove the existence of functions which map any open real interval onto a certain subset of R. Next, we give a proof for Sierpinski s theorem, which states that every function f : R R can be written as the sum of two functions with the Darboux property, and a theorem related to this one. In the third section we give a very simple example of a function which is a discontinuous solution for the Cauchy functional equation and has the Darboux property. Finally, in the last section, we generalize the notion of Darboux property to the multidimensional case and give a Sierpinski-type theorem in this context. Definition 1. If f : I R is a function, and I R is an interval, f has the Darboux property if for any a, b I, a < b and for any λ (f(a), f(b)) (f(b), f(a)) there is c (a, b) such that f(c) = λ. In applications, the one of the following equivalent definitions is easier to use: f has the Darboux property if and only if f(j) is an interval for any interval J I. f has the Darboux property if and only if f([c, d]) is an interval for any c, d I, c < d. Definition 2. If f : I R is a function, and I R is an interval, f has the Intermediate Value property if f(i) is an interval. Definition 3. If f : I R is a function, and I R is an interval, f has the Weak-Darboux property if f(j) is an interval, for any interval J I. The notions defined above are different from another, the first being the strongest. Darboux property implies Weak-Darboux and Invermediate Value Preprint submitted to Elsevier October 6, 2009

2 properties. We begin by defining an equivalence relation which will be uset throughout the text. Define x y x y Q. This is obviously an equivalence relation and for any x R we will denote [x] = y R : y x} the equivalence class which contains x. It is obvious that R = x R[x] and y / [x] [x] [y] =. In the following, we will denote A = [x] : x R} the set of the equivalence classes, and we will find its cardinal number. The application µ : R A, µ(x) = [x], x R is onto, hence card A card R = ℵ. Lemma The dimension of R as vector space over Q is ℵ, where ℵ = card R. Proof: In [1], page 245 we find the next lemma: If V is a vector space over the field K, and dimv = b is infinite, then card V = b card K. The dimension of R over Q is infinite, otherwise R would be countable, which is not true. Therefore, we can use the lemma above for V = R, K = Q, and b being the cardinal of a basis of R over Q. We have ℵ = ℵ 0 b = b, where ℵ 0 = card N. Last equality holds because b b ℵ 0 b 2 = b, and b is an infinite cardinal number (b 2 = b). Hence, b = ℵ. Theorem 1. card A = card R. Proof: We choose a basis B of R over Q which contains 1 (this is possible because any linearly independent set can be extended to a basis and 1} is such set). If two different numbers, say x and y from B would be in the same equivalence class, then we have x y = q 1, q Q, so 1, x şi y are linear dependent. Contradiction. Therefore, any two different elements of B are in different equivalence classes, and we can define a one to one mapping φ : B A, φ(b) = [b], b B. This yields card B card A. From the proceeding lemma we know that card B = ℵ and also card A ℵ from an anterior remark. Hence, card A = ℵ. Some strange functions with Darboux property Theorem 2.1. There exist non-constant functions f : R R which map any open interval onto a closed one. Proof: We will prove more than this: there exist such functions which map any open interval into the same closed interval. Take a, b R, a < b. Then card [a, b] = ℵ = card A, so we can find a bijective function, g : A [a, b]. We define the function f : R [a, b], f(x) = g([x]). This function is well defined for any x R. We will prove now that the image or any interval (s, t), s, t R, s < t through f is exactly [a, b]. We notice that [x] = x + Q = x + q : q Q}. Because Q is dense R, any of its translations is also dense in R, meaning that any equivalence class from A has at least one element in common with any open interval, (s, t) being such an interval. Therefore f((s, t)) = g(a) = [a, b]. Remark. The function constructed in the prof of Theorem 2 has the Darboux property and it is not continuous at any point in R. 2

3 Proof: We can see that f(i) = [a, b] for any interval I R. Hence f has the Darboux property. If x 0 R and ε > 0, we know that f((x 0 ε, x 0 + ε)) = [a, b], so f cannot be continuous at x 0. Another surprising result is given in the following Theorem 2.2. There exist functions f : R R which have the Darboux property and take any real value in any neighborhood of any point in R. Proof: We proceed the same way we did in our previous proof, defining the bijection h : A R, and the function f : R R, f(x) = h([x]). We can see that f((s, t)) = R, for any interval (s, t), using a similar argument to the one above. f(i) = R for any interval I, hence f has the Darboux property. A slight generalization is the following Theorem 2.3. Given T R, there exists a function f : R R such that f maps any open interval onto T. Proof: Because card T card A, there exists a surjection φ : A T. Considering the function f : R R, f(x) = φ([x]) we have the requested function. An even more surprising result is the following, due to Waclaw Sierpinski (see [2]): Theorem 3. (Sierpinski) For any function f : R R there exist functions f 1, f 2 : R R having the Darboux property and being discontinuous at any point in R, such that f = f 1 + f 2. Proof: We take f : R R a function. We consider a bijection g : R A and we denote A 1 = g((, 0)), A 2 = g([0, )). Thus card A 1 = card A 2 = ℵ, and we can define the bijections m : R A 1 and n : R A 2. A 1 m R g R =(, 0) [0, ) g n A 2 R We define the functions: r, t m(r) f 1 (t) = f(t) r, t n(r) f 2 (t) = f(t) r r, t m(r), t n(r) It is clear from their definition that f 1 şi f 2 că f = f 1 + f 2. Let s prove that f 1 and f 2 have the Darboux property. We consider I R an interval. Because any equivalence class in A is dense in R, we find that I m(r), I n(r), r R. Therefore, looking at the definitions of f 1 and f 2 we see that r f 1 (I m(r)) f(i) and r f 2 (I n(r)) f(i), for all r R, 3

4 yielding f 1 (I) = f 2 (I) = R. We conclude that f 1 and f 2 have the Darboux property. We saw that f 1 (I) = f 2 (I) = R for any interval I so the functions f 1 and f 2 are not continuous at any point x 0 in R, because f((x 0 δ, x 0 + δ)) = R (f(x 0 ) ε, f(x 0 ) + ε), ε > 0, δ > 0, x 0 R. Next problem was proposed in a Romanian contest 1 in 2003: We define F = f : [0, 1] [0, 1] : A, B [0, 1], A B =, A B = [0, 1], f(a) B, f(b) A}. Study if F contains continuous functions, functions which have antiderivatives, and functions with Darboux property. The answer to the first two is obvious. If a function f F is continuous or has antiderivatives, then the function g(x) = f(x) x, x [0, 1] has antiderivatives. It is well known that any function which has antiderivatives necessarily has the Darboux property. Since g(0) g(1) 0 and g has the Darboux property we conclude that g has at least one zero in [0, 1]. This yields that f has a fixed point, which contradicts f F. The next theorem gives the answer to the third question. Theorem 4. There exist functions in f F having the Darboux property. Proof: We choose a bijection φ : A R and we denote Y = φ 1 ((-, 0]), Z = φ 1 ((0, )). Take A = x [0, 1] : [x] Y }, B = x [0, 1] : [x] Z}. A and B are disjoint and non void because Y and Z are disjoint and non void. We have Y Z = A, so A B = x [0, 1] : [x] A} = [0, 1]. Because A and B contain all the elements from [0, 1] which are in the same equivalence class, A and B are dense in [0, 1]. From their definitions, card Y = card Z = card A = card B = ℵ. Therefore, we can find the bijections µ : Y B şi ν : Z A. We define the function f : [0, 1] [0, 1] µ([x]), x A f(x) = ν([x]), x B A x [x] µ B B x [x] ν A From the definition of f and sets A, B, Y, Z we find that f(a) B and f(b) A. Let s prove that f has the Darboux property. We take I an interval from [0, 1]. Then I intersects all the classes from A (because any of these is dense in R), which means that I intersects all the classes from Y and Z. Hence f(i) = µ(y ) ν(z) = B A = [0, 1]. Therefore, f F and f has the Darboux property. From the theorem above we have the following 1 Traian Lalescu problem solving contest for university students, a contest held in the memory of the great Romanan mathematician. 4

5 Corollary. If a, b R, a < b then we can find functions f : [a, b] [a, b] which have the Darboux property and have no fixed points. Proof: We do the same construction from previous theorem for [a, b]. If this function has a fixed point then we have a contradiction with the definitions of the sets A and B. Cauchy functional equation and Darboux property We will prove in the following that we can find nontrivial solutions to the Cauchy functional equation which have the Darboux property. For doing this, we need some preliminary results: 0) A function f : R R satisfies the Cauchy functional equation if f(x+y) = f(x) + f(y), x, y R (C). i) A function which satisfies (C) also satisfies f(qx) = qf(x), q Q, x R ii) Any function of the form f(x) = ax, a R, satisfies the equation (C). We will call these the trivial solutions of equation (C). It is well known that any continuous solution of the equation (C) is trivial. iii) If we consider R as vector space over Q, then, according to 0) and i), f is a linear map. This implies that f is well and uniquely defined if we know its values on a basis of R over Q. For proofs see [3], page 193. The next theorem allows us to speak of nontrivial solution of (C). Theorem 5. There exist nontrivial solution of the equation (C). Proof: Using iii), we take a basis B which contains 1 and consider f(1) = 1, f(b) = 0, b B\1}. Thus f(x) will be the coefficient of 1 in the representation of x in the basis B. Because f(r) = Q, f is not a trivial solution for (C). Once we established the existence of nontrivial solutions for (C), we can give the following theorem: Theorem 6. If f is a nontrivial solution for (C), then it s graph, G f = (x, y) R 2 : y = f(x)}, is everywhere dense in R 2. For a proof, see [3], page 200. Remark. We can see from the results discussed above that the solution of the equation (C) have a common property: If f is a solution for (C) then f has the Weak-Darboux property. Proof: If f is a trivial solution, it is continuous and has the Darboux property, so it has the Weak-Darboux property, also. Let s assume that f is a nontrivial solution for (C). We proved that G f is everywhere dense in R 2. Let I R be an interval. Then for all a, b R, a < b, G f I (a, b). Therefore exists t I such that f(t) (a, b), hence f(i) = R, which is an interval. Consequently, f has the Weak-Darboux property. We ask ourselves if a solution of (C) with Darboux property is necessary trivial. We will answer this question in the following theorem. First, we can see that there exist nontrivial solutions for (C) without Darboux property, because we have such an example in the proof of Theorem 5. Theorem 7. There exist nontrivial solutions for equation (C) which have the Darboux property. 5

6 Proof: We use iii) and choose a basis B of R over Q which contains 1. We take f(1) = 0 and we establish a bijection φ : B \ 1} R. We define f(b) = φ(b), b B \ 1}. It is clear that f(q) = 0, q Q. Considering the equivalence relation defined we have x [y] f(x) = f(y) + f(x y) = f(y). Let y R be a real number. Then we can find b B such that f(b) = φ(b) = y. We take b 0 [b] I which is non void. We have f(b 0 ) = f(b) = y, so y f(i), and because y was chosen randomly, it follows that f(i) = R. Therefore, f has the Darboux property. We see that f(q) = 0} and f(r 0}, which proves that f is a nontrivial solution for (C). The multi dimensional case In the one dimensional case we saw that a function has Darboux property if and only if f(j) is an interval whenever J is an interval. In R the intervals are the only connected or closed sets. We say that A R p, p > 1 is a region if it is open and connected. If A is also convex, then we say that A is a convex region. We wish to extend the Darboux property in the multi dimensional case in the following way: Definition. 4 If f : R p R q, p, q > 1, we say that f has the Darboux property if f maps any region of R p onto a region of R q. Furthermore, we say that f has the Convex-Darboux property if f maps any convex region in R p onto a convex region of R q. In the following, we wish to prove an analogue to the Sierpinski theorem in the one dimensional case. Theorem 8. If f : R p R q p, q > 1 is an arbitrary function, then we can write f as the sum of two functions with the Darboux property, and also, we can write f as the sum of two functions with Convex-Darboux property. Proof: We define the relation p on R p by x p y x y Q p. This turns out to be an equivalence relation, so we denote [x] the equivalence class containing x and A p the set of all equivalence classes. If x p y then any two of their corresponding coordinates are in the same equivalence class in A. This yields A p = A p, so card A p = ℵ p = ℵ. This holds for any p. We can establish a bijection g : R p A p. Set A 1 = g((, 0) R p 1 ) and A 2 = g([0, ) R p 1 ). We can see that A 1 A 2 = A p, A 1 A 2 = and card A 1 = card A 2 = ℵ. Therefore we can find the bijections m : R q A 1 and n : R q A 2. Given the function f, we define f 1 (t) = r f(t) r, t m(r), t n(r) f 2 (t) = f(t) r r, t m(r), t n(r), functions which satisfy f 1 + f 2 = f and have the desired properties. To prove this, we take a region (convex region) A R p. Then A contains an open disk D. Since every equivalence class in A p is a translation of Q p, every one of them is dense in R p. Now, taking y R p we see that m(y) D and n(y) D. 6

7 Therefore y f 1 (D) f 2 (D) f 1 (A) f 2 (A). This yields f 1 (A) = f 2 (A) = R q, which is a connected and convex region of R q. Thus f 1 and f 2 have the Darboux and Convex-Darboux properties. Moreover, f 1 and f 2 are not continuous at any point in R p. 7

8 References [1] Nathan Jacobson, Lectures in Abstract Algebra, vol II, Linear Algebra, D. Van Nostrand Company, Inc., 1953 [2] Waclaw Sierpinski, Sur la représentation d une function arbitraire par des fonctions jouissant de la propriété de Darboux, Transactions of the American Mathematical Society, 1960, 95, 3, [3] A. B. Kharazishvili, Strange Functions in Real Analysis, Chapman & Hall/CRC 2006 student Faculty of Mathematics and Informatics West University, Timişoara, Romania beni22sof@yahoo.com 8

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality. Some harder problems on cardinality. These are two series of problems with specific goals: the first goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second

More information

van Rooij, Schikhof: A Second Course on Real Functions

van Rooij, Schikhof: A Second Course on Real Functions vanrooijschikhofproblems.tex December 5, 2017 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/pozn/books/ van Rooij, Schikhof: A Second Course on Real Functions Some notes made when reading [vrs].

More information

van Rooij, Schikhof: A Second Course on Real Functions

van Rooij, Schikhof: A Second Course on Real Functions vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.

More information

The ideal of Sierpiński-Zygmund sets on the plane

The ideal of Sierpiński-Zygmund sets on the plane The ideal of Sierpiński-Zygmund sets on the plane Krzysztof P lotka Department of Mathematics, West Virginia University Morgantown, WV 26506-6310, USA kplotka@math.wvu.edu and Institute of Mathematics,

More information

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if

More information

CHAPTER 7. Connectedness

CHAPTER 7. Connectedness CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set

More information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

More information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit

More information

A Primer on the Functional Equation

A Primer on the Functional Equation A Primer on the Functional Equation f (x + y) = f (x) + f (y) Kaushal Verma Let f : R R be a function satisfying f (x + y) = f (x) + f (y), (0.1) for all x, y R. Historical records at the École Polytechnique

More information

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

More information

Extension of continuous functions in digital spaces with the Khalimsky topology

Extension of continuous functions in digital spaces with the Khalimsky topology Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin

More information

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved. Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124

More information

ON THE MEASURABILITY OF FUNCTIONS WITH RESPECT TO CERTAIN CLASSES OF MEASURES

ON THE MEASURABILITY OF FUNCTIONS WITH RESPECT TO CERTAIN CLASSES OF MEASURES Georgian Mathematical Journal Volume 11 (2004), Number 3, 489 494 ON THE MEASURABILITY OF FUNCTIONS WITH RESPECT TO CERTAIN CLASSES OF MEASURES A. KHARAZISHVILI AND A. KIRTADZE Abstract. The concept of

More information

(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff

(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ

More information

Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases

Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases November 18, 2013 1 Spanning and linear independence I will outline a slightly different approach to the material in Chapter 2 of Axler

More information

Dynamical Systems 2, MA 761

Dynamical Systems 2, MA 761 Dynamical Systems 2, MA 761 Topological Dynamics This material is based upon work supported by the National Science Foundation under Grant No. 9970363 1 Periodic Points 1 The main objects studied in the

More information

Finite and Infinite Sets

Finite and Infinite Sets Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following

More information

Bounded Derivatives Which Are Not Riemann Integrable. Elliot M. Granath. A thesis submitted in partial fulfillment of the requirements

Bounded Derivatives Which Are Not Riemann Integrable. Elliot M. Granath. A thesis submitted in partial fulfillment of the requirements Bounded Derivatives Which Are Not Riemann Integrable by Elliot M. Granath A thesis submitted in partial fulfillment of the requirements for graduation with Honors in Mathematics. Whitman College 2017 Certificate

More information

ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS

ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS KRZYSZTOF P LOTKA Abstract. We say that a function h: R R is a Hamel function (h HF) if h, considered as a subset of R 2, is a Hamel basis for R 2. We prove that

More information

After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.

After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain. Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric

More information

3 COUNTABILITY AND CONNECTEDNESS AXIOMS

3 COUNTABILITY AND CONNECTEDNESS AXIOMS 3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first

More information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989), Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

More information

The Fundamental Group and Covering Spaces

The Fundamental Group and Covering Spaces Chapter 8 The Fundamental Group and Covering Spaces In the first seven chapters we have dealt with point-set topology. This chapter provides an introduction to algebraic topology. Algebraic topology may

More information

CARDINALITY OF THE SET OF REAL FUNCTIONS WITH A GIVEN CONTINUITY SET

CARDINALITY OF THE SET OF REAL FUNCTIONS WITH A GIVEN CONTINUITY SET CARDINALITY OF THE SET OF REAL FUNCTIONS WITH A GIVEN CONTINUITY SET JIAMING CHEN AND SAM SMITH Abstract. Expanding on an old result of W. H. Young, we determine the cardinality of the set of functions

More information

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA  address: Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework

More information

On sums of Darboux and nowhere constant continuous functions

On sums of Darboux and nowhere constant continuous functions On sums of Darboux and nowhere constant continuous functions Krzysztof Ciesielski Department of Mathematics, West Virginia University, Morgantown, WV 26506-6310, USA e-mail: K Cies@math.wvu.edu; web page:

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ). Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.

More information

Solutions to Tutorial 8 (Week 9)

Solutions to Tutorial 8 (Week 9) The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/

More information

S. Mrówka introduced a topological space ψ whose underlying set is the. natural numbers together with an infinite maximal almost disjoint family(madf)

S. Mrówka introduced a topological space ψ whose underlying set is the. natural numbers together with an infinite maximal almost disjoint family(madf) PAYNE, CATHERINE ANN, M.A. On ψ (κ, M) spaces with κ = ω 1. (2010) Directed by Dr. Jerry Vaughan. 30pp. S. Mrówka introduced a topological space ψ whose underlying set is the natural numbers together with

More information

1 The Local-to-Global Lemma

1 The Local-to-Global Lemma Point-Set Topology Connectedness: Lecture 2 1 The Local-to-Global Lemma In the world of advanced mathematics, we are often interested in comparing the local properties of a space to its global properties.

More information

HOMEWORK ASSIGNMENT 6

HOMEWORK ASSIGNMENT 6 HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly

More information

Axioms for Set Theory

Axioms for Set Theory Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:

More information

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable

More information

A Readable Introduction to Real Mathematics

A Readable Introduction to Real Mathematics Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 10: Sizes of Infinite Sets 1. Show that the set of all polynomials

More information

Lebesgue Measure. Dung Le 1

Lebesgue Measure. Dung Le 1 Lebesgue Measure Dung Le 1 1 Introduction How do we measure the size of a set in IR? Let s start with the simplest ones: intervals. Obviously, the natural candidate for a measure of an interval is its

More information

Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a

Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1:

More information

ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II

ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II To the memory of my Mother ON FUNCTIONS WHOSE GRAPH IS A HAMEL BASIS II KRZYSZTOF P LOTKA Abstract. We say that a function h: R R is a Hamel function (h HF) if h, considered as a subset of R 2, is a Hamel

More information

SOME ADDITIVE DARBOUX LIKE FUNCTIONS

SOME ADDITIVE DARBOUX LIKE FUNCTIONS Journal of Applied Analysis Vol. 4, No. 1 (1998), pp. 43 51 SOME ADDITIVE DARBOUX LIKE FUNCTIONS K. CIESIELSKI Received June 11, 1997 and, in revised form, September 16, 1997 Abstract. In this note we

More information

Measurable functions are approximately nice, even if look terrible.

Measurable functions are approximately nice, even if look terrible. Tel Aviv University, 2015 Functions of real variables 74 7 Approximation 7a A terrible integrable function........... 74 7b Approximation of sets................ 76 7c Approximation of functions............

More information

ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES

ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES Georgian Mathematical Journal Volume 9 (2002), Number 1, 75 82 ON THE UNIQUENESS PROPERTY FOR PRODUCTS OF SYMMETRIC INVARIANT PROBABILITY MEASURES A. KHARAZISHVILI Abstract. Two symmetric invariant probability

More information

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. 2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is

More information

CHODOUNSKY, DAVID, M.A. Relative Topological Properties. (2006) Directed by Dr. Jerry Vaughan. 48pp.

CHODOUNSKY, DAVID, M.A. Relative Topological Properties. (2006) Directed by Dr. Jerry Vaughan. 48pp. CHODOUNSKY, DAVID, M.A. Relative Topological Properties. (2006) Directed by Dr. Jerry Vaughan. 48pp. In this thesis we study the concepts of relative topological properties and give some basic facts and

More information

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall

3 FUNCTIONS. 3.1 Definition and Basic Properties. c Dr Oksana Shatalov, Fall c Dr Oksana Shatalov, Fall 2014 1 3 FUNCTIONS 3.1 Definition and Basic Properties DEFINITION 1. Let A and B be nonempty sets. A function f from A to B is a rule that assigns to each element in the set

More information

5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting 5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

Functional Equations

Functional Equations Functional Equations Henry Liu, 22 December 2004 henryliu@memphis.edu Introduction This is a brief set of notes on functional equations. It is one of the harder and less popular areas among Olympiad problems,

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

More information

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

g 2 (x) (1/3)M 1 = (1/3)(2/3)M. COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

More information

MA651 Topology. Lecture 10. Metric Spaces.

MA651 Topology. Lecture 10. Metric Spaces. MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky

More information

P-adic Functions - Part 1

P-adic Functions - Part 1 P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant

More information

ON SOME PROPERTIES OF ESSENTIAL DARBOUX RINGS OF REAL FUNCTIONS DEFINED ON TOPOLOGICAL SPACES

ON SOME PROPERTIES OF ESSENTIAL DARBOUX RINGS OF REAL FUNCTIONS DEFINED ON TOPOLOGICAL SPACES Real Analysis Exchange Vol. 30(2), 2004/2005, pp. 495 506 Ryszard J. Pawlak and Ewa Korczak, Faculty of Mathematics, Lódź University, Banacha 22, 90-238 Lódź, Poland. email: rpawlak@imul.uni.lodz.pl and

More information

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005

POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005 POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1

More information

SETS AND FUNCTIONS JOSHUA BALLEW

SETS AND FUNCTIONS JOSHUA BALLEW SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,

More information

MORE ON CONTINUOUS FUNCTIONS AND SETS

MORE ON CONTINUOUS FUNCTIONS AND SETS Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly

More information

Linear Algebra Lecture Notes-I

Linear Algebra Lecture Notes-I Linear Algebra Lecture Notes-I Vikas Bist Department of Mathematics Panjab University, Chandigarh-6004 email: bistvikas@gmail.com Last revised on February 9, 208 This text is based on the lectures delivered

More information

Logical Connectives and Quantifiers

Logical Connectives and Quantifiers Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then

More information

REAL ANALYSIS II: PROBLEM SET 2

REAL ANALYSIS II: PROBLEM SET 2 REAL ANALYSIS II: PROBLEM SET 2 21st Feb, 2016 Exercise 1. State and prove the Inverse Function Theorem. Theorem Inverse Function Theorem). Let f be a continuous one to one function defined on an interval,

More information

Smarandachely Precontinuous maps. and Preopen Sets in Topological Vector Spaces

Smarandachely Precontinuous maps. and Preopen Sets in Topological Vector Spaces International J.Math. Combin. Vol.2 (2009), 21-26 Smarandachely Precontinuous maps and Preopen Sets in Topological Vector Spaces Sayed Elagan Department of Mathematics and Statistics Faculty of Science,

More information

Topological properties

Topological properties CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

More information

STRONGLY CONNECTED SPACES

STRONGLY CONNECTED SPACES Undergraduate Research Opportunity Programme in Science STRONGLY CONNECTED SPACES Submitted by Dai Bo Supervised by Dr. Wong Yan-loi Department of Mathematics National University of Singapore Academic

More information

Axioms of separation

Axioms of separation Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically

More information

Econ Lecture 2. Outline

Econ Lecture 2. Outline Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality

More information

Real Analysis. Joe Patten August 12, 2018

Real Analysis. Joe Patten August 12, 2018 Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.

More information

Chapter 1. Sets and Mappings

Chapter 1. Sets and Mappings Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write

More information

REAL AND COMPLEX ANALYSIS

REAL AND COMPLEX ANALYSIS REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any

More information

Analysis Comprehensive Exam Questions Fall 2008

Analysis Comprehensive Exam Questions Fall 2008 Analysis Comprehensive xam Questions Fall 28. (a) Let R be measurable with finite Lebesgue measure. Suppose that {f n } n N is a bounded sequence in L 2 () and there exists a function f such that f n (x)

More information

MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.

MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions. MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions. Uniform continuity Definition. A function f : E R defined on a set E R is called uniformly continuous on E if for every

More information

Convex Optimization Notes

Convex Optimization Notes Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =

More information

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

More information

6 CARDINALITY OF SETS

6 CARDINALITY OF SETS 6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means

More information

arxiv:math/ v1 [math.ho] 2 Feb 2005

arxiv:math/ v1 [math.ho] 2 Feb 2005 arxiv:math/0502049v [math.ho] 2 Feb 2005 Looking through newly to the amazing irrationals Pratip Chakraborty University of Kaiserslautern Kaiserslautern, DE 67663 chakrabo@mathematik.uni-kl.de 4/2/2004.

More information

Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 21, Tree Topology. A. R. Aliabad

Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 21, Tree Topology. A. R. Aliabad Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 21, 1045-1054 Tree Topology A. R. Aliabad Department of Mathematics Chamran University, Ahvaz, Iran aliabady r@scu.ac.ir Abstract. In this paper, we introduce

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 1 Fall 2014 I. Foundational material I.1 : Basic set theory Problems from Munkres, 9, p. 64 2. (a (c For each of the first three parts, choose a 1 1 correspondence

More information

ON THE RELATIONSHIP BETWEEN SETS AND GROUPS

ON THE RELATIONSHIP BETWEEN SETS AND GROUPS ON THE RELATIONSHIP BETWEEN SETS AND GROUPS ROSE DONG Abstract. This paper is an introduction to basic properties of sets and groups. After introducing the notion of cardinal arithmetic, it proves the

More information

Immerse Metric Space Homework

Immerse Metric Space Homework Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps

More information

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011

Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure

More information

Cardinality and ordinal numbers

Cardinality and ordinal numbers Cardinality and ordinal numbers The cardinality A of a finite set A is simply the number of elements in it. When it comes to infinite sets, we no longer can speak of the number of elements in such a set.

More information

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015

Walker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015 Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of

More information

Integral Jensen inequality

Integral Jensen inequality Integral Jensen inequality Let us consider a convex set R d, and a convex function f : (, + ]. For any x,..., x n and λ,..., λ n with n λ i =, we have () f( n λ ix i ) n λ if(x i ). For a R d, let δ a

More information

LECTURE 15: COMPLETENESS AND CONVEXITY

LECTURE 15: COMPLETENESS AND CONVEXITY LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other

More information

Functions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2

Functions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2 Functions 4-3-2008 Definition. A function f from a set X to a set Y is a subset S of the product X Y such that if (, y 1 ), (, y 2 ) S, then y 1 = y 2. Instead of writing (, y) S, you usually write f()

More information

On the Countable Dense Homogeneity of Euclidean Spaces. Randall Gay

On the Countable Dense Homogeneity of Euclidean Spaces. Randall Gay On the Countable Dense Homogeneity of Euclidean Spaces by Randall Gay A thesis submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Master

More information

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u. 5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

More information

Exam 2 extra practice problems

Exam 2 extra practice problems Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either

More information

Algebraic Cryptography Exam 2 Review

Algebraic Cryptography Exam 2 Review Algebraic Cryptography Exam 2 Review You should be able to do the problems assigned as homework, as well as problems from Chapter 3 2 and 3. You should also be able to complete the following exercises:

More information

Q-LINEAR FUNCTIONS, FUNCTIONS WITH DENSE GRAPH, AND EVERYWHERE SURJECTIVITY

Q-LINEAR FUNCTIONS, FUNCTIONS WITH DENSE GRAPH, AND EVERYWHERE SURJECTIVITY MATH. SCAND. 102 (2008), 156 160 Q-LINEAR FUNCTIONS, FUNCTIONS WITH DENSE GRAPH, AND EVERYWHERE SURJECTIVITY F. J. GARCÍA-PACHECO, F. RAMBLA-BARRENO, J. B. SEOANE-SEPÚLVEDA Abstract Let L, S and D denote,

More information

Summary of Real Analysis by Royden

Summary of Real Analysis by Royden Summary of Real Analysis by Royden Dan Hathaway May 2010 This document is a summary of the theorems and definitions and theorems from Part 1 of the book Real Analysis by Royden. In some areas, such as

More information

Notes on ordinals and cardinals

Notes on ordinals and cardinals Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}

More information

3. Abstract Boolean Algebras

3. Abstract Boolean Algebras 3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,

More information

1. Bounded linear maps. A linear map T : E F of real Banach

1. Bounded linear maps. A linear map T : E F of real Banach DIFFERENTIABLE MAPS 1. Bounded linear maps. A linear map T : E F of real Banach spaces E, F is bounded if M > 0 so that for all v E: T v M v. If v r T v C for some positive constants r, C, then T is bounded:

More information

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3 Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

More information

MA651 Topology. Lecture 9. Compactness 2.

MA651 Topology. Lecture 9. Compactness 2. MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology

More information

1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0

1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0 1. Classification of 1-manifolds Theorem 1.1. Let M be a connected 1 manifold. Then M is diffeomorphic either to [0, 1], [0, 1), (0, 1), or S 1. We know that none of these four manifolds are not diffeomorphic

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

More information

LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS

LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS ANALYSIS FOR HIGH SCHOOL TEACHERS LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS ROTHSCHILD CAESARIA COURSE, 2011/2 1. The idea of approximation revisited When discussing the notion of the

More information

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

More information