CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 1. Abstract
|
|
- Griselda Lyons
- 5 years ago
- Views:
Transcription
1 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 1 Abstract The Collage Theorem was given by Michael F. Barnsley who wanted to show that it was possible to reconstruct images using a set of functions. This idea was to reduce the space needed on a computer to save an image or video. An image/video file can be quite large, while saving only a set of functions that can duplicate the original image/video frees up extra space and during the late 80'searly 90's when computers were still somewhat primitive, this was an important development. This paper introduces the idea of fractals with an emphasis on the Collage Theorem, using a special case of the Contraction Mapping Theorem. The Collage theorem says that we can approximate an image by using a set of iterated function systems with a specific attractor that will yield the desired image regardless of the initial set.
2 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 2 Fractal Geometry Contraction Mapping & The Collage Theorem Why am I learning this? Where am I ever going to use this outside of school? These are questions that every student of mathematics has asked at some point in his or her life. Often, this question is valid, because what we work with in the classroom, generally, are nice equations, graphs, problems, etc. Rarely in real life do we find ourselves presented with a perfect circle, a single-variable equation, or a straight line. For example, when we travel, we can find on a map roughly how many miles there are between where we are and our destination, but the question is Is there a perfectly straight road from here to there? Unless you're driving to the end of the block, generally the answer to will be no. We can translate this idea from the distance between two points to the perimeter of a shape. Let's use the example of measuring the coastline of Australia. Most maps have a key with a scale, so let's use a 500-kilometer measuring stick. By dividing the coastline into 500-kilometer chunks, we get a total of 13,000 kilometers. But what happens if we use, say, a 100-kilometer measuring stick? The length should not change very much, right? Well, with a that smaller interval, the coastline is now 15,500 kilometers, an almost 20% increase! Where did the extra 2,500 kilometers come from? What would happen with an even smaller measuring stick? The CIA World Factbook website gives the length of Australia's coastline as 25,760 kilometers which is a 66% increase from the second measurement. What happens is that as the intervals decrease in length, the length of the coastline will continue to increase to infinity because there are always going to be smaller crevices to be measured. This is called the Coastline Paradox, and it is an example of an application of fractals. The definition of the word fractal varies slightly depending on who gives it. The word, who we have thanks to Beniot B. Mandelbrot, comes from the Latin word frāct or frāctus, meaning broken or uneven. One of the more basic definitions of fractal is the roughness of an object or space. From the coastline example, we can see how these ideas apply. However, we are still missing one of the most important pieces of what it means to be a fractal and that word is self-similarity.
3 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 3 Wolfram MathWorld defines a fractal as an object that displays self-similarity, in a somewhat technical sense, on all scales. According to this definition, these objects do not need to match perfectly on every scale, but that similar structures are present on all scales. However, self-similarity, in and of itself, is not a sufficient definition. What makes a fractal is its dimension, a fractional (or fractal) dimension. We begin by recalling what our idea of dimension is from our middle-school/high-school years, which is that a point will have dimension 0, a line dimension 1, a circle/square/etc dimension 2, a sphere/cube/etc dimension 3, and so on. There is a formula that allows us to calculate the dimension of certain objects, which says: dimension= log(number of self similar pieces) log(magnification factor) (1) While we can show this for any shape, the 2-dimensional square, arguably, gives the best depiction of this formula. Figure 1: Defining Dimension # of self-similar pieces: 1 Magnification Factor: 1 # of self-similar pieces: 4 Magnification Factor: 2 # of self-similar pieces: 9 Magnification Factor 3
4 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 4 Following from the figure above, we see that when a square is divided into 1, 4, and 9 self-similar pieces we can reconstruct the original square by multiplying any one of those self-similar pieces by a magnification factor of 1, 2, and 3 (respectively). So using (1) we get log(1) 2 log(1) = 2log(1) log(1) = 2 log(4) log(2) = log(2)2 log(2) = 2 log(9) log(3) = log(3)2 log(3) = 2 We can now generalize this to a square divided into N 2 self-similar pieces with a magnification factor of N. From this example, we can imagine that a line divided into N self-similar pieces will have a magnification factor of N, so log(n ) log(n ) = 1. Also, a cube divided into N 3 self-similar pieces and magnification factor of N will have dimension log(n ) 3 log(n ) = 3 which confirms our knowledge of dimension. But this begs the question: What dimension does a fractal have? Intuition tells us that fractal (or fractional) dimension should be between integers. It is perhaps easier to see this in an example. The Classical Cantor Set, or Cantor Comb, is one such example of self-similarity and fractional dimension. The iterations of this set say to translate down the previous level and remove the middle third of each piece (See Figure 2 below). Figure 2: The Cantor Set I 0 I 1 I 2 I 3 I 4 I 5
5 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 5 With interval for I 0 being [0,1], we see that I 1 =[0, 1 3 ] [ 2 3, 3 3 ] I 2 =[0, 1 9 ] [ 2 9, 3 9 ] [ 6 9, 7 9 ] [ 8 9, 9 9 ] I N =take away the middle open third for each interval in I N 1 On this scale, after the fifth iteration there is no visual difference from the previous iteration; however, this process continues on to infinity. We see that if we magnify, say, the first piece of I 1 by a factor of 3 we will get the original line. The Cantor set is not the entire picture, but instead is the limit of this picture which, in this case, is C= n=1 I n. So as we continue to take the middle third out of each step above, we will get smaller and smaller pieces to the point where this fractal will contain no intervals, but will have infinitely many points around each point. This implies C is a perfect set, which means it is a closed subset of R where every point of the set is a limit point. Our intuition tells us that this particular fractal should have a dimension between that of a point (zero) and a line (one). Using formula (1) to calculate the dimension of the Cantor Set, we get and our intuition holds true. This is the basis of fractal geometry if you take any magnification of a section of the whole fractal, it will look very similar to, if not exactly like, the larger image, and its dimension is between positive integers. Before we get into the Contraction Mapping Theorem or the Collage Theorem, we need to look at several defninitions. Recall from Real Analysis, Definition 1. A metric space is a set S with a global distance funtion (the metric d) that, for every two points x,y in S, gives the distance between them as a nonnegative real number. A metric space must also satisfy: i. d(x,y) = 0 iff x=y log(2) log(3) 0.63
6 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 6 ii. d(x,y) = d(y,x) iii. The triangle inequality d(x,y) + d(y,z) d(x,z). (Wolfram Alpha). The idea of compactness, as well as completeness, will be vital to the rest of this paper, so we will give the definitions here. For completeness, we first need to define what it means for a sequence to be Cauchy. Definition 2. A sequence a 1, a 2, is a Cauchy sequence if the metric d(a m,a n ) satisfies lim min (m, n) [d (a m,a n )]=0. (Wolfram Alpha). See Figure 3 below for a visual example of a Cauchy and non-cauchy sequence. Figure 3: Cauchy vs non-cauchy Sequences Cauchy Sequence non-cauchy Sequence Images from: Definition 3. A metric space, X, is complete (or a complete metric space) if every Cauchy sequence is convergent. (Wolfram Alpha). Definition 4. A sequence S n converges to the limit S lim n S n =S if, for any ε > 0, there exists an N such that S n S < ε for n > N. If S n does not converge, it is said to diverge. (Wolfram Alpha). Definition 5. A metric space, X, is compact if every open cover of X has a finite subcover. (Wolfram Alpha). Another definition of compact spaces is that they are closed and bounded. [Note that every compact
7 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 7 metric space is complete, though complete metric spaces need not be compact.] Definition 6. Let ( X,d ) be a metric space. A mapping T : X X is a contraction mapping, or contraction, if there exists a constant c, with 0 c < 1, such that d(t(x),t(y)) cd(x,y) for all x, y X. (Hunter, Nachtergaele 2001 p 61) What a contraction mapping does is it takes points and brings them closer together. See Figure 4 on the next page for an example, which demonstrates that for every x X, and any r > 0, all points y in the ball B r (x) are mapped into a ball B s (Tx), with s < r. Figure 3: Contraction Mapping x Tx Image from: Hunter, Nachtergaele (2001) p 61 Definition 7. If T : X X, then the point x X such that T(x) = x is called a fixed point. (Hunter, Nachtergaele 2001 p 62). With these definitions, we can now give the Contraction Mapping Theorem. Theorem 1. If T : X X is a contraction mapping on a complete metric space ( X,d ), then there is exactly one solution x X that is the fixed point of the contraction. (Hunter, Nachtergaele 2001 p 62). Proof. The proof of this theorem is fairly simple and straightforward. Let x 0 be any point in X, and let the sequence (x n ) in X be defined as x n+1 = Tx n for n 0. Also define the n th iterate of T by T n so x n = T n x 0. In order to prove the Contraction Mapping Theorem, we will first show that (x n ) is Cauchy, then show that x is our fixed point, and finally show that the fixed point is unique. Using Definition 6, what
8 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 8 is outlined above, and the triangle inequality, for n m 1, we have d ( x n, x m )=d (T n x 0,T m x 0 ) c m d (T n m x 0, x 0 ) c m [d (T n m x 0,T n m 1 x 0 )+d (T n m 1 x 0,T n m 2 x 0 )+...+d (Tx 0, x 0 )] c m n m 1 [ k =0 c k ]d ( x 1, x 0 ) c m [ k =0 c k ] d (x 1, x 0 ) = cm 1 c d (x 1, x 0 ). This implies that (x n ) is Cauchy. Since X is complete, (x n ) converges to a limit x X. Following from the continuity of T, we have Tx=T lim n x n =lim n Tx n =lim n x n+1 =x. Thus, x is our fixed point. Now to show that x is unique, we suppose that x and y are two fixed points, then 0 d (x, y )=d (Tx,Ty ) cd ( x, y). However, c < 1 so we have d(x,y) = 0. Thus x = y and the fixed point is unique. This completes the proof. (Hunter, Nachtergaele 2001 pp 62-63). Here, it is necessary to give the definitions of an Iterated Function System, an attractor, and the metric space we will be working in. Definition 8. A[n] iterated function system (IFS) consists of a complete metric space ( X, d ) together with a finite set of contraction mappings w n : X X, with respective contractivity factors c n < 1, for n = 1, 2,, N. (Barnsley 1988 p 82). What an IFS does is scales, translates, and rotates a set using a finite set of functions, which is now possible with because of the Contraction Mapping Theorem. Recall our previous example of the Cantor Set (Figure 1), and consider the set of functions that generate it. We need two functions, one that scales down by a factor of three, and one that scales it and translates it by two-thirds the original length. So,
9 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 9 we get our IFS {f 1,f 2 } where f 1= 1 3 x and f 2= 1 3 x As we continue to iterate this function system, we will reach a point where we will not have any intervals, but there will be infinitely many points around a single point, which is the defining property of a Cantor Set. Using notation with IFS, we get Barnsley (p 86-87) gives his notation for an IFS of [affine] contraction maps as w i (x )=w i[ x 1 x 2] = [ a i c i Here are a few examples of IFS codes that generate different images. Barnsley also introduces a p element that stands for the probability for each contraction map to occur. Table 1: IFS code for a Sierpinski triangle I 1 = f 1 ( I 0 ) f 2 (I 0 ) I 2 = f 1 (I 1 ) f 2 (I 1 ) I n = f 1 ( I n 1 ) f 2 (I n 1 ) thus C= f 1 (C ) f 2 (C ). b i d i][ x 1 x 2] + [ e i f i] = A i x+t i w a b c d e f p Table 2: IFS code for a Fern w a b c d e f p We will be doing most of our remaning work in a metric space called H(X), so it is defined here, along with its metric, h. Definition 9. Let ( X,d ) be a complete metric space. Then H(X) denotes the space whose points are the compact subsets of X, other than the empty set. (Barnsley 1988 p 30).
10 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 10 Definition 9. The infimum (or inf) is the greatest lower bound (glb) of a set S, defined m such that no member of the set is less than m, but if ε is any positive quantity, however small, there is Figure 4: IFS Code Images Sierpinski Triangle Fern Images from: always one member that is less than m+ε. (Wolfram Alpha). Definition 10. The supremum (or sup) is the least upper bound (lub) of a set S, defined as a quantity M such that no member of the set exceeds M, but if ε is any positive quantity, however small, there is a member that exceeds M ε. (Wolfram Alpha). Definition 11. The Hausdorff Metric on a compact metric space H(X) is defined as h( A, B)=max {sup x A [inf y B d ( x, y)],sup x B [inf y A d ( x, y)]} for A, B subsets of X. (Barnsley, Ervin, Hardin, Lancaster 1986 p 1975). Proof. It is necessary to prove that h is a metric in our space H(X). (Recall the properties of a metric from Definition 1). Let A, B, C H ( X ) (by definition, they are compact). It is clear that h( A, A)=max {d (A, A),d (A, A)}=d (A, A)=max {d (x, A) x A}=0. Let x A, x B. Then d ( x, B)=inf y B {d (x, y)}>0. Similarly, for x B, x A. Then
11 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 11 d ( x, A)=inf y A {d (x, y)}>0. This implies h(a,b) > 0. This satisfies part (i) of Definition 1. To show the Triangle Inequality, h(a,b) h(a,c)+h(c,b), we first show it is true for d(a,b) d(a,c)+d(c,b). For any x A, d ( x, B)=min y B {d (x, y)} min y B {d (x,z)+d (z, y)}for all z in C =d (x, z)+min y B {d (z, y)}for all z in C,so d ( x, B) min x C {d (x, z)}+max z C {min y B {d (z, y)}} =d (x, C )+d (C, B)so d ( A, B) d (A,C )+d (C, B) Similarly, This implies h(a,b) h(b,c) + h(a,c), satisfying parts (ii) and (iii) of Definition 1. Thus h is a metric. (Barnsley 1988 p 33). What the Hausdorff Metric allows us to do is take into account the orientation of the two sets we are finding the distance between (as opposed to the usual metric which takes only the distance between two points in those sets). It takes the smallest distance (the inf) from some x in A to any y in B, then from those shortest distances (from every x to its closest y) it chooses the longest (the sup). It then does the same thing for x in B and y in A, and takes the greatest of the two. This metric requires that both A and B are compact. This allows us to say, Lemma 1. Let A,B H ( X ). Given any a A, there exists a b B, such that d(a,b) h(a,b). d ( B, A) d (B,C )+d (C, A)whence h( A, B)=sup {d ( A, B), D (B, A)} sup {d ( B,C ),d (C, B)}+sup {d (A,C ),d (C, A)} =h(b, C)+h( A, C) In other words, for h(a,b) ε, with ε > 0, A B+ε,and B A+ε. Proof. Suppose d(a,b) ε. Then max {d (a, B) a A} ε which implies that, for any a A, d(a,b) ε, and thus a B+ε. Hence A B+ε. A similar argument shows that B A+ε. Thus d(a,b) ε. To check this, in a small set one could calculate the distances by hand and draw a circle of radius h(a,b) around the furthest element of A to B and the furthest element of B to A. Figures 4 and 5
12 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 12 below perhaps better demonstrate this idea. Call the Red Triangle A, and the Blue Triangle B. What these figures show is that, though the metric d(a,b) stays the same Figure 4: Hausdorff Distance Between 2 Triangles (Position 1) between Figure 4 and Figure 5, the Hausdorff Distance changes, exemplifying the power of the Hausdorff Metric. It is able to take into account the orientation of the two sets, which will be very useful when we use the Collage Theorem to approximate an image. This way, we can make sure that the image generated by the IFS is close to the original. Image from: Figure 5: Hausdorff Distance Between 2 Triangles (Position 2) Image from: H(X) is also known as The Space of Fractals. Before we continue, it is necessary to mention that H(X) is, indeed, complete.
13 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 13 Theorem 2. (The Completeness of the Space of Fractals) Let ( X,d ) be a complete metric space. Then (H(X),h) is a complete metric space. Moreover, if { A n H ( X )} for n = 1, 2,,, is a Cauchy sequence then A=lim n A n H ( X ) can be characterized as follows A={x X there is a Cauchy sequence {x n A n }that converges to x }. (Barnsley 1988 pp 37-38). The proof of this theorem is rather extensive, and I do not possess concrete understanding of the finer details. However, Barnsley has given an elegant proof of the completeness of H(X) on pages 38 and 39 of his text. I will outline the main points that must be proved, given by Barnsley, and remark that he does indeed show what is desired. Proof. (Outline) Let {A n } be a Cauchy sequence in H(X) and let A be defined as in the statement of the theorem. The proof is outlined in the following sections: (a) A Ø; (b) A is closed and hence complete since X is complete; (c) for ε > 0 there is N sich that for n N, A is contained in A n + ε; (d) A is totally bounded and thus by (b) compact; (e) lim(a n ) = A. (Barnsley 1988 p 38). The following lemma, The Extension Lemma, is used throughout the proof, and is given here, along with the concept of a space being not just bounded, but totally bounded. Lemma 2. (The Extension Lemma) Let ( X,d ) be a metric space. Let {A n n = 1, 2,, } be a Cauchy sequence of points in (H(X),h). Let {n j j = 1, 2,, } be an infinite sequence of integers 0 < n 1 < n 2 < n 3 <. Suppose that we have a Cauchy sequence { x n j A n j j=1,2,3...}
14 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 14 in ( X,d ). Then there is a Cauchy sequence { { x n A n n=1,2,...} such that x n j =x n j for all j = 1, 2, 3,. (Barnsley 1988 p 36). Definition 12. Let S X be a subset of the metric space ( X,d ). S is bounded if there is a point a X and a number R > 0 so that d(a,x) < R for all x S. (Barnsley 1988 p 20). Definition 13. Let S X be a subset of the metric space ( X,d ). S is totally bounded if, for each ε > 0, there is a finite set of points {y 1, y 2,..., y n } S such that whenever x S, d(x,y i ) < ε for some y {y y..., y }. i 1, 2, n This set of points {y y..., y } 1, 2, n is called an e-net. (Barnsley 1988 p 20). Lemma 3. For all B, C, D,and E in H(X), h( B C, D E ) max {h (B, D),h(C,E )} where h is the Hausdorff metric. Lemma 4. Let ( X,d ) be a metric space. Let {w n : n = 1, 2,, N} be contraction mappings on (H(X), h). Let the contractivity facgtor for w n be deonted by c n for each n. Define W : H(X) H(X) by W (B) = w 1 (B) w 2 (B) w N (B) N = n=1 w n (B), for each B ϵ H ( X ). Then W is a contraction mapping with contractivity factor c = max{c n : n = 1, 2,, N}. Proof. Proving this inductively, we begin with the case N = 2. Let B,C H ( X ).. Then, h(w (B),W (C))=h(w 1 (B) w 2 (B), w 1 (C) w 2 (C )) max {h(w 1 (B),w 1 (C )),h(w 2 (B),w 2 (C))} max {c 1 h(b,c ), s 2 h(b,c)} ch(b,c) (by Lemma3) This completes the proof. (Barnsley 1988 p 81).
15 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 15 And now that we have shown that W is, indeed, a contraction mapping on H(X), we can define an attractor on H(X). Definition 14. An attractor is the unique fixed point A H ( X ). of W : H(X) H(X), which obeys N A=W ( A)= n=1 w n ( A) and is given by A=lim n W o n (B)for any B H ( X ), where W is the transformation W:H(X) H(X) defined by W (B)= N n=1 w n (B)for all B H ( X ). (Barnsley 1988 p 82). An attractor of an IFS is unique, meaning that under that IFS, it does not matter what the initial set looks like eventually the IFS will lead to its attractor. Some IFS's, such as the one for the Sierpinski Triangle, approach the attractor very quickly. Others are more complex and take some time to reach the attractor. There is an immediate, and important, consequence of the Contraction Mapping Theorem which will help us reach our ultimate goal of the Collage Theorem. Corollary of Theorem 1. Given an Iterated Function System, there exists a unique attractor A. Now that we have a solid background of information about contraction mapping and attractors, we can finally discuss the Collage Theorem. Theorem 3. Let ( X, d ) be a complete metric space. Let L eh(x) be given, and let ε 0 be given. Choose an Iterated Function System { X; (w 0 ), w 1, w 2,, w N } with contractivity factor 0 c < 1, so that where h(d) is the Hausdorff Metric. Then N h( L, n=1 w n (L)) ε
16 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 16 h( L, A) ε 1 c where A is the attractor of the IFS. Equivalently, h( L, A) (1 c) 1 N h(l, n=1 w n (L)) for all L e H( X ). The proof of the Collage Theorem is simply the proof of the following Lemma. (Barnsley 1988 pp 96-97). Lemma 5. Let ( X,d ) be a complete metric space. Let f : X X be a contraction mapping with contractivity factor 0 c < 1, and let the fixed point of f be x f X. Then, d (x, f (x)) d ( x, x f ) for all x X. 1 c Proof. The distance function d(a,b) for fixed a X is continuous in b X. Hence, for n m 1, d ( x, x f )=d ( x, lim n f o n ( x))=lim n d ( x, f o n (x)) lim n m=1 n d ( f o (m 1 ) (x), f o n (x)) lim n d (x, f ( x))(1+c+ +c n 1 ) d ( x, f (x)) 1 c This completes the proof. (Barnsley 1988 p 111). This theorem combines everything that has been outlined in the previous pages into one, allowing us to use IFS's to approximate images. In when computers were still young and primitive compared to the ones we have today, this idea of saving an image using functions was groundbreaking. While the items outlined here have only given us a way to approximate a still image, it is still possible to approximate a video by continuously varying the attractors. It appears, however, that approximating images by fractals is useful for only certain types, while more contemporary JPEG, JPEG 2000, Lossy/Lossless Wavelet image compression seems to be the new standard.
17 CONTRACTION MAPPING & THE COLLAGE THEOREM Porter 17 References Barnsley, Michael F. (1988). Fractals Everywhere. Specific pages used are referenced in text. Barnsley, M. F., Ervin, V., Hardin, D., Lancaster, J. (1986). Solutions of an Inverse Problem for Fractals and Other Sets. Proceedings of the National Academy of Sciences of the United States of America. Vol 83, No. 7. p Goodman, Noah. (1996). Iterated Function Systems. Hunter, John K., Nachtergaele, Bruno. (2001). Applied Analysis. pp Wolfram Alpha (2012). Compact Metric Space. Wolfram Alpha (2012). Complete Metric Space. Wolfram Alpha (2012). Infimum. Wolfram Alpha (2012). Supremum.
Fractals and Dimension
Chapter 7 Fractals and Dimension Dimension We say that a smooth curve has dimension 1, a plane has dimension 2 and so on, but it is not so obvious at first what dimension we should ascribe to the Sierpinski
More informationFractals. R. J. Renka 11/14/2016. Department of Computer Science & Engineering University of North Texas. R. J. Renka Fractals
Fractals R. J. Renka Department of Computer Science & Engineering University of North Texas 11/14/2016 Introduction In graphics, fractals are used to produce natural scenes with irregular shapes, such
More informationUSING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS
USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS UNIVERSITY OF MARYLAND DIRECTED READING PROGRAM FALL 205 BY ADAM ANDERSON THE SIERPINSKI GASKET 2 Stage 0: A 0 = 2 22 A 0 = Stage : A = 2 = 4 A
More informationCMSC 425: Lecture 12 Procedural Generation: Fractals
: Lecture 12 Procedural Generation: Fractals Reading: This material comes from classic computer-graphics books. Procedural Generation: One of the important issues in game development is how to generate
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationNOTES ON BARNSLEY FERN
NOTES ON BARNSLEY FERN ERIC MARTIN 1. Affine transformations An affine transformation on the plane is a mapping T that preserves collinearity and ratios of distances: given two points A and B, if C is
More informationNOTIONS OF DIMENSION
NOTIONS OF DIENSION BENJAIN A. STEINHURST A quick overview of some basic notions of dimension for a summer REU program run at UConn in 200 with a view towards using dimension as a tool in attempting to
More informationLecture 2: A crash course in Real Analysis
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is
More informationAnalytic Continuation of Analytic (Fractal) Functions
Analytic Continuation of Analytic (Fractal) Functions Michael F. Barnsley Andrew Vince (UFL) Australian National University 10 December 2012 Analytic continuations of fractals generalises analytic continuation
More informationFractals and iteration function systems II Complex systems simulation
Fractals and iteration function systems II Complex systems simulation Facultad de Informática (UPM) Sonia Sastre November 24, 2011 Sonia Sastre () Fractals and iteration function systems November 24, 2011
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationFractal Geometry Time Escape Algorithms and Fractal Dimension
NAVY Research Group Department of Computer Science Faculty of Electrical Engineering and Computer Science VŠB- TUO 17. listopadu 15 708 33 Ostrava- Poruba Czech Republic Basics of Modern Computer Science
More informationThe Order in Chaos. Jeremy Batterson. May 13, 2013
2 The Order in Chaos Jeremy Batterson May 13, 2013 Fractal geometry will make you see everything differently. There is a danger in reading further. You risk the loss of your childhood vision of clouds,
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationFractals list of fractals by Hausdoff dimension
from Wiipedia: Fractals list of fractals by Hausdoff dimension Sierpinsi Triangle D Cantor Dust Lorenz attractor Coastline of Great Britain Mandelbrot Set What maes a fractal? I m using references: Fractal
More informationDR.RUPNATHJI( DR.RUPAK NATH )
Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology
More informationFractals. Krzysztof Gdawiec.
Fractals Krzysztof Gdawiec kgdawiec@ux2.math.us.edu.pl 1 Introduction In the 1970 s Benoit Mandelbrot introduced to the world new field of mathematics. He named this field fractal geometry (fractus from
More informationWe are now going to go back to the concept of sequences, and look at some properties of sequences in R
4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly
More informationHausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016
Hausdorff Measure Jimmy Briggs and Tim Tyree December 3, 2016 1 1 Introduction In this report, we explore the the measurement of arbitrary subsets of the metric space (X, ρ), a topological space X along
More informationImportant Properties of R
Chapter 2 Important Properties of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference
More informationCMSC 425: Lecture 11 Procedural Generation: Fractals and L-Systems
CMSC 425: Lecture 11 Procedural Generation: ractals and L-Systems Reading: The material on fractals comes from classic computer-graphics books. The material on L-Systems comes from Chapter 1 of The Algorithmic
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationTHE CONTRACTION MAPPING THEOREM, II
THE CONTRACTION MAPPING THEOREM, II KEITH CONRAD 1. Introduction In part I, we met the contraction mapping theorem and an application of it to solving nonlinear differential equations. Here we will discuss
More informationExpectations over Fractal Sets
Expectations over Fractal Sets Michael Rose Jon Borwein, David Bailey, Richard Crandall, Nathan Clisby 21st June 2015 Synapse spatial distributions R.E. Crandall, On the fractal distribution of brain synapses.
More informationMAT 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 informationMath LM (24543) Lectures 01
Math 32300 LM (24543) Lectures 01 Ethan Akin Office: NAC 6/287 Phone: 650-5136 Email: ethanakin@earthlink.net Spring, 2018 Contents Introduction, Ross Chapter 1 and Appendix The Natural Numbers N and The
More informationTake a line segment of length one unit and divide it into N equal old length. Take a square (dimension 2) of area one square unit and divide
Fractal Geometr A Fractal is a geometric object whose dimension is fractional Most fractals are self similar, that is when an small part of a fractal is magnified the result resembles the original fractal
More informationSelf-Referentiality, Fractels, and Applications
Self-Referentiality, Fractels, and Applications Peter Massopust Center of Mathematics Research Unit M15 Technical University of Munich Germany 2nd IM-Workshop on Applied Approximation, Signals, and Images,
More informationINTRODUCTION TO FRACTAL GEOMETRY
Every mathematical theory, however abstract, is inspired by some idea coming in our mind from the observation of nature, and has some application to our world, even if very unexpected ones and lying centuries
More informationAnalysis 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 informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationLecture Notes DRE 7007 Mathematics, PhD
Eivind Eriksen Lecture Notes DRE 7007 Mathematics, PhD August 21, 2012 BI Norwegian Business School Contents 1 Basic Notions.................................................. 1 1.1 Sets......................................................
More informationMath 61CM - Solutions to homework 6
Math 61CM - Solutions to homework 6 Cédric De Groote November 5 th, 2018 Problem 1: (i) Give an example of a metric space X such that not all Cauchy sequences in X are convergent. (ii) Let X be a metric
More informationTHE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM
Bull. Aust. Math. Soc. 88 (2013), 267 279 doi:10.1017/s0004972713000348 THE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM MICHAEL F. BARNSLEY and ANDREW VINCE (Received 15 August 2012; accepted 21 February
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationFractals list of fractals - Hausdorff dimension
3//00 from Wiipedia: Fractals list of fractals - Hausdorff dimension Sierpinsi Triangle -.585 3D Cantor Dust -.898 Lorenz attractor -.06 Coastline of Great Britain -.5 Mandelbrot Set Boundary - - Regular
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More information2.4 The Extreme Value Theorem and Some of its Consequences
2.4 The Extreme Value Theorem and Some of its Consequences The Extreme Value Theorem deals with the question of when we can be sure that for a given function f, (1) the values f (x) don t get too big or
More informationFractals. Justin Stevens. Lecture 12. Justin Stevens Fractals (Lecture 12) 1 / 14
Fractals Lecture 12 Justin Stevens Justin Stevens Fractals (Lecture 12) 1 / 14 Outline 1 Fractals Koch Snowflake Hausdorff Dimension Sierpinski Triangle Mandelbrot Set Justin Stevens Fractals (Lecture
More informationChapter 7. Metric Spaces December 5, Metric spaces
Chapter 7 Metric Spaces December 5, 2011 7.1 Metric spaces Note: 1.5 lectures As mentioned in the introduction, the main idea in analysis is to take limits. In chapter 2 we learned to take limits of sequences
More informationAfter 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 information1. Continuous Functions between Euclidean spaces
Math 441 Topology Fall 2012 Metric Spaces by John M. Lee This handout should be read between Chapters 1 and 2 of the text. It incorporates material from notes originally prepared by Steve Mitchell and
More informationUpper and Lower Bounds
James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University August 30, 2017 Outline 1 2 s 3 Basic Results 4 Homework Let S be a set of real numbers. We
More informationITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationEcon Slides from Lecture 1
Econ 205 Sobel Econ 205 - Slides from Lecture 1 Joel Sobel August 23, 2010 Warning I can t start without assuming that something is common knowledge. You can find basic definitions of Sets and Set Operations
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationSolution. 1 Solution of Homework 7. Sangchul Lee. March 22, Problem 1.1
Solution Sangchul Lee March, 018 1 Solution of Homework 7 Problem 1.1 For a given k N, Consider two sequences (a n ) and (b n,k ) in R. Suppose that a n b n,k for all n,k N Show that limsup a n B k :=
More informationTopological 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 informationSequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.
Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We
More informationConsequences of the Completeness Property
Consequences of the Completeness Property Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of the Completeness Property Today 1 / 10 Introduction In this section, we use the fact that R
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationREAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE
REAL ANALYSIS LECTURE NOTES: 1.4 OUTER MEASURE CHRISTOPHER HEIL 1.4.1 Introduction We will expand on Section 1.4 of Folland s text, which covers abstract outer measures also called exterior measures).
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationAn Introduction to Fractals and Hausdorff Measures
An Introduction to Fractals and Hausdorff Measures by David C Seal A Senior Honors Thesis Submitted to the Faculty of The University of Utah In Partial Fulfillment of the Requirements for the Honors Degree
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationPart 2 Continuous functions and their properties
Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationNotes on uniform convergence
Notes on uniform convergence Erik Wahlén erik.wahlen@math.lu.se January 17, 2012 1 Numerical sequences We begin by recalling some properties of numerical sequences. By a numerical sequence we simply mean
More informationReal 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 informationNorth Carolina State University
North Carolina State University MA 141 Course Text Calculus I by Brenda Burns-Williams and Elizabeth Dempster August 7, 2014 Section1 Functions Introduction In this section, we will define the mathematical
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More information1 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 informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More informationGeneration of Fractals via Self-Similar Group of Kannan Iterated Function System
Appl. Math. Inf. Sci. 9, No. 6, 3245-3250 (2015) 3245 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/090652 Generation of Fractals via Self-Similar
More informationFractals: How long is a piece of string?
Parabola Volume 33, Issue 2 1997) Fractals: How long is a piece of string? Bruce Henry and Clio Cresswell And though the holes were rather small, they had to count them all. Now they know how many holes
More informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationLecture 4: Completion of a Metric Space
15 Lecture 4: Completion of a Metric Space Closure vs. Completeness. Recall the statement of Lemma??(b): A subspace M of a metric space X is closed if and only if every convergent sequence {x n } X satisfying
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
More informationWe have been going places in the car of calculus for years, but this analysis course is about how the car actually works.
Analysis I We have been going places in the car of calculus for years, but this analysis course is about how the car actually works. Copier s Message These notes may contain errors. In fact, they almost
More informationIterated Function Systems
1 Iterated Function Systems Section 1. Iterated Function Systems Definition. A transformation f:r m! R m is a contraction (or is a contraction map or is contractive) if there is a constant s with 0"s
More informationa) Let x,y be Cauchy sequences in some metric space. Define d(x, y) = lim n d (x n, y n ). Show that this function is well-defined.
Problem 3) Remark: for this problem, if I write the notation lim x n, it should always be assumed that I mean lim n x n, and similarly if I write the notation lim x nk it should always be assumed that
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationCLASS NOTES FOR APRIL 14, 2000
CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class
More informationThe Mandelbrot Set. Andrew Brown. April 14, 2008
The Mandelbrot Set Andrew Brown April 14, 2008 The Mandelbrot Set and other Fractals are Cool But What are They? To understand Fractals, we must first understand some things about iterated polynomials
More informationMath Precalculus I University of Hawai i at Mānoa Spring
Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationAn Introduction to Self Similar Structures
An Introduction to Self Similar Structures Christopher Hayes University of Connecticut April 6th, 2018 Christopher Hayes (University of Connecticut) An Introduction to Self Similar Structures April 6th,
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationShape Matching: A Metric Geometry Approach. Facundo Mémoli. CS 468, Stanford University, Fall 2008.
Shape Matching: A Metric Geometry Approach Facundo Mémoli. CS 468, Stanford University, Fall 2008. 1 General stuff: class attendance is mandatory will post possible projects soon a couple of days prior
More informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationCHAOS/FRACTAL
CHAOS/FRACTAL 8 6.8.6 4.4. 4 5..4.6.8.4 8...8 6.8.6 - - 4.6.4.4 -.. - -6-5 -4 - - -..95.955.96.965.97.975.98..4.6.8 Presentation in Dynamical System. By Fred Khoury Introduction This paper is divided into
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationIf one wants to study iterations of functions or mappings,
The Mandelbrot Set And Its Julia Sets If one wants to study iterations of functions or mappings, f n = f f, as n becomes arbitrarily large then Julia sets are an important tool. They show up as the boundaries
More informationWillmar Public Schools Curriculum Map
Note: Problem Solving Algebra Prep is an elective credit. It is not a math credit at the high school as its intent is to help students prepare for Algebra by providing students with the opportunity to
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationA UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS
A UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS STEVO TODORCEVIC Abstract. We show that for each positive integer k there is a sequence F n : R k R of continuous functions which represents via point-wise
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More information