An Introduction to Non-Standard Analysis and its Applications
|
|
- Maximillian Oliver Montgomery
- 6 years ago
- Views:
Transcription
1 An Introduction to Non-Standard Analysis and its Applications Kevin O Neill March 6, Basic Tools 1.1 A Shortest Possible History of Analysis When Newton and Leibnitz practiced calculus, they used infinitesimals, which were supposed to be like real numbers, yet of smaller magnitude than any other type of postive real number. In the 19th century, mathematicians realized they could not justify the use of infinitesimals according to their sense of rigor, so they began using definitions involving ɛ s and δ s. Then, in the early 1960 s, the logician Abraham Robinson figured out a way to rigorously define infinitesimals, creating a subject now known as nonstandard analysis. 1.2 The Hyperreals To motivate our construction of the hyperreals, consider the following sequence: 1, 1 2, 1 3, 1 4,... Under the standard definitions of analysis, we say this sequence has limit 0. But nowhere is any entry of the sequence 0, so rather than defining what it means to take a limit, we want it to represent it by an infinitesimal. This makes sense because given any real number r, the sequence eventually becomes less than r. Now, let R N be the set of infinite sequences of real numbers, and identifying r R with (r, r, r,...) R N, let us try to turn R N into a field that respects the operations of R. Doing so, we will add infinitesimals to the reals (and infinite numbers through division). However, we quickly see that this becomes an issue when we compute the product: (1, 0, 1, 0, 1, 0,...) (0, 1, 0, 1, 0, 1,...) = (0, 0, 0, 0,...). If R N is to become a field, then it must have no zero divisors, so one of the two sequences on the left should be equal to zero. The idea now is to set up an equivalence relation on R N that is large enough to make a sequence with half nonzero entries equal 1
2 to 0, yet small enough that we may still perform basic operations in a coordinate-wise manner. The introduction of ultrafilters makes this possible. Definition 1. Let I be a nonempty set. Then, F P(I) is an filter if the following hold: 1. If A, B F, then A B F 2. If A F and A B I, then B F We say F is an ultrafilter if for any A I, either A F or A c F. Additionally, an ultrafilter is principal if it is of the form {A I : i A} for some i I and nonprincipal otherwise. We will particularly be interested in nonprincipal ultrafilters, though we have introduced partial definitions since those objects do appear elsewhere in mathematics. The idea behind these definitions is that we want to equate two sequences that agree on a large subset of N. To make this an equivalence relation, we require that intersection of two large sets to be large and obviously, any set containing a large set should be large as well. Thus the collection of large subsets should form a filter. One of the two sequences above whose product is 0 must be zero itself, so we need either the odd or even numbers to be large, so we use an ultrafilter. And lastly, we don t want sequences to be equivalent if and only if they agree on, say, the first coordinate, so we require the ultrafilter to be nonprincipal. Another way of thinking about nonprincipal ultrafilters is as a counterexample to Arrow s Impossibility Theorem for an infinite voting set. Proposition 2. Every infinite set has a nonprincipal ultrafilter on it. Proof. Use Zorn s Lemma on the filter of cofinite sets. Now we are finally ready to define the hypperreals. Definition 3. Let F be a nonprincipal ultrafilter on N. Define the hyperreals to be the set *R = R N /, where (r n ) (s n ) if {n : r n = s n } F. We denote the equivalence classes of these sequences by [r n ]. You may notice that we have only specified one nonprincipal ultrafilter out of many and be wondering what happens if we choose a different filter. It turns out not to matter for our purposes, since we will mostly be transferring results back to R anyway, but now would be a good time to mention the following fact: Fun Fact 4. Under the Continuum Hypothesis, all possible constructions of *R as above are isomorphic as ordered fields. From here on, we will assume the contruction of a single *R. As an exercise, one may check that the operations +,, and < are well-defined in *R. 2
3 1.3 More * s In our study of *R, it will be helpful to be able to repeat the above construction to transfer more objects from the standard setting to the non-standard. Definition 5. Let A n be a sequence of subsets of R. Then define [A n ] *R by [r n ] [A n ] if and only if {n : r n A n } F. Any set obtained in this manner is said to be internal. As a special case of this construction, *A = [A]. In particular, *N will be called the hypernaturals. When each of the A n is finite, we call [A n ] hyperfinite. [A n ] is said to have hyperfinite cardinality [ A n ] *N, where A n is the usual cardinality of A n. Hypernaturals will be useful in defining integrals as limits of finite sums, which we interpret in the nonstandard setting as a hyperfinite sum. Another useful property of the hypernaturals is called Internal Induction, which states that any internal subset of *N that is closed under the succesor function must be equal to *N. In this article, we will not make use of this principle or frequently refer to internal sets, but the reader may like to know that both are very useful in the nonstandard setting. Also, it is worth noting that infinite hypernaturals can be useful in physical modelling. Rather than approximate a very large number of particles with continuum many, it may be beneficial to model a hypernatural number of them, since hypernaturals manage to retain certain properties of finite numbers that the continuum doesn t. Lastly, we will also want to transfer functions and relations from R to *R. To transfer a function f : A R, we let *f([r n ]) = [f(r n )] where *f : *A *R and claim that a relation *R([r 1n ],..., [r kn ]) holds if and only if {n : R(r 1n,..., r kn )} F. 1.4 Infinitesimal Arithmetic In this section, we will show that infinitesimals behave in the ways we would intuitively expect them to, as well as make a couple definitions that will be useful later in this article. Definition 6. A hyperreal b is an infinitesimal if b < r for all r R +. b is limited if b < M for some M R. Example 7. Let ɛ R +. Then, [1/n] = (1, 1/2, 1/3, 1/4,...) < (ɛ, ɛ,...) = [ɛ] because there exists N N such that n > N implies 1/n < ɛ. Thus, [1/n] is less than [ɛ] on the tail of the sequence. The tail is a large set in our ultrafilter F, so [1/n] < [ɛ]. ɛ > 0 was an arbitrary real, so [1/n] is an infinitesimal. Proposition 8. Define b c for b, c *R if b c is infinitesimal. Then is an equivalence relation. Additionally, every limited hyperreal b is equivalent to some real number, which we call the shadow of b, denoted sh(b). Proof. The relation is clearly symmetric, so suppose b c and c d, and let r R +. Then, b d b c + c d < d/2 + d/2 = d, so is also transitive, hence an equivalence relation. 3
4 If b is a limited hyperreal, then the set A = {r R : r < b} is bounded, so by the completeness of R, A has a least upper bound c R. We claim b c. Let ɛ > 0. Then, since c is an upper bound of A, we have c + ɛ / A, so b c + ɛ. Also, if b c ɛ, then c ɛ would be an upper bound for A, so b c ɛ, meaning b c ɛ. Since ɛ was arbitrary, b c. 1.5 Transfer Principle To motivate the Transfer Principle on the level of first-order logic, let us observe the following. In the standard setting, the rationals are dense in the reals, which may be expressed x, y R(x < y q Q(x < q < y)). If we put a * by each set above, we get the following statement x, y *R(x < y q *Q(x < q < y)), which is also true. (To see this, consider [x n ] < [y n ], taking x n < y n without loss of generality via our ultrafilter construction. By the density of rationals in the reals, choose q n with x n < q n < y n for each n and take [q n ].) It turns out this is not just a coincidence, but holds more generally, provided we take the appropriate setup. To do this, we work in the setting of the language of a relational structure. Rather than go into a complete description of what this means, let s just say for now that we will use logical sentences constructed from sets, their elements, relations, functions, and logical connectives. Given a sentence φ, we may take its *-transform by replacing a function f with *f replacing a relation R with *R, and replacing any bound P occuring in x P by x *P. The Transfer Principle states that if we are working over the language of R, then, a sentence φ is true if and only if *φ is true. The proof of this principle is via Loś s Theorem, which essentially is a proof by induction which builds up any transfer of a sentence from each of its components. We will not prove Loś s Theorem, but hopefully the reader can get a sense of why it is true from example. To see another example, let us look at the Archimidean property of the reals: The transfer of this statement is x R + ( n N)(nx > 1). x *R + ( n *N)(nx > *1). 4
5 This second statement is true, yet it is not equivalent to the Archimidean property. In fact, *R is not Archimidean in the standard sense. No repeated addition of [1/n] will ever bring it above 1. The lesson here is that while some properties transfer very naturally between R and *R, there are cases where the non-standard analogue may not be intuitive and/or useful. However, the Transfer Principle still says that it doesn t really matter which setting we work in, the standard or non-standard. Either is a suitable setting for analysis to be done. Since standard analysis is what people have been using for recent history, we often interpret the Transfer Principle as a tool for proving standard results in a non-standard setting. We will see examples of this in later sections. Our last remark on the Transfer Principle is that we have only stated it for firstorder languages, which means that we may only consider elements as variables and certain results about sets will not transfer. There is a stronger version of the Transfer Principle which allows us to make some transfers of higher-order objects, but its use still requires a lot of caution. 2 Working in the Non-Standard Setting 2.1 Non-Standard Definitions Since non-standard analysis is essentially equivalent to standard analysis, then we should be able to find non-standard definitions of standard concepts. The following lemma provides an example: Theorem 9. The function f : (a, b) R is continuous at a point c R if and only if x c implies *f(x) *f(c) for all x *R. Proof. First suppose f is continuous at c and let ɛ > 0. Then, there is a positive δ R such that ( x R)( x c < δ f(x) f(c) < ɛ), which by the Transfer Principle means ( x *R)( x c < δ *f(x) *f(c) < ɛ). If x c, then x c < δ, so *f(x) *f(c) < ɛ. Since ɛ > 0 was arbitrary, *f(x) *f(c). Now suppose x c implies *f(x) *f(c) and let ɛ > 0. Then, in particular, we may choose δ *R + such that x c < δ implies *f(x) *f(c), which in turn implies *f(x) *f(c) < ɛ. Thus, we have the following statement: ( δ *R + )( x *R)( x c < δ *f(x) *f(c) < ɛ), which under the Transfer Principle implies 5
6 so f is continuous at c. ( δ R + )( x R)( x c < δ f(x) f(c) < ɛ), Rather than prove the following equivalences, we simply leave the reader with the definitions. Definition 10. n *N \ N. 1. A real-valued sequence (s n ) converges to L R if s n L for all 2. L R is a cluster point of (s n ) if s N L for some n *N \ N. 3. If A R, then f is uniformly continuous on A if x y implies f(x) f(y) for all x, y *A. 4. The derivative of f at x is L if f(x+ɛ) f(x) ɛ L for all nonzero infinitesimals ɛ. 2.2 Integration via Hyperfinite Sums Suppose f : [a, b] R is an integrable function, in the standard sense. Then, classically, we know that b a fdx may be computed as the limit of sums over partitions. In particular, if we let {a = x 0, x 1, x 2,..., x n 1, x n = b} be a uniform parition of [a, b] and define S n = n k=1 f(x i) x, where x = (b a)/n, then lim n S n = b a fdx. We may view S n as a function from N to R (i.e., a sequence), so S N is defined for any hypernatural N. By the non-standard definition of sequence convergence, S N b a fdx for all N *N\N, or b a fdx = sh(s N) for any such N. We give S N the name hyperfinite sum as though we were summing over the partition {a, a + (b a)/n,..., b (b a)/n}. This is just a formality, but writing S N = N *f(x i )(b a)/n i=1 in some sense still describes what we are doing, and soon we will use this notation to describe more complicated phenomena. 2.3 Peano s Theorem To see hyperfinite summation take a greater role, let us now prove Peano s Existence Theorem, a fundamental result establishing the existence of a solution to particular differential equations. Theorem 11. Let f : R [0, 1] R be a bounded, continuous function. Then, there is a solution to the initial value problem y (t) = f(y(t), t) with y(0) = y 0 for any y 0 R. 6
7 Proof. Let N = [N n ] be an unlimited hypernatural and let T = {0, 1/N, 2/N,..., 1}. Define each Y n inductively on the points of {0, 1/N n,..., 1} as follows: k 1 Y n (k/n n ) = y 0 + f(y n (i/n n ), i/n n ) 1. N n i=0 This allows us to define a function Y on T by Y (K/N) = [Y k (K k /N k )], where K = [K k ]. As a hyperfinite sum, we write: K 1 Y (K/N) = y 0 + *f(y (i/n), i/n) 1 N. i=0 Now let y(t) = sh(y ( t)), where t is the member of T to the immediate left of t. Since f is bounded by some M R, Y (t) Y (s) M t s for all s, t T, so Y is continuous, and therefore, so is y. By this continuity, we may write N t y(t) y 0 + *f(*y(i/n), i/n) 1 N. i=0 But the right hand side is just y 0 + t 0 f(y(s), s)ds by our description of integration as a hyperfinite sum, and differentiating both sides of y(t) = y 0 + t 0 f(y(s), s)ds shows that y(t) is a solution to the initial-value problem. 3 Bigger Applications 3.1 Loeb Measure In Section 1.2, we defined internal sets, which essentially are those arising from a sequence A n of subsets of R. While we will not prove much here, internal sets turn out to be the nice sets of non-standard analysis and allow us to define measures on certain subsets of *R and any thorough introduction to the subject will mention internal sets much more frequently. We skip to the following result: Proposition 12. The collection of internal subsets of *R form an algebra (meaning it is closed under finite intersections, finite unions, and complements). The proof of this is rather straightforward and actually follows from the fact that for general sequences A n, B n of subsets of R, we have [A n ] [B n ] = [A n B n ], [A n ] [B n ] = [A n B n ], and [A n ] c = [A c n]. However, the next result, which relates to the concept of countable saturation, is a little less obvious: Theorem 13. If n N X n is internal, then it is equal to n k X n for some k N. In particular, this says that the collection of internal subsets of *R is not a σ-algebra, meaning it is not closed under infinite unions. Those of you familiar with measure theory 7
8 will remember that σ-algebras are the key to creating measures. However, there is a possible fix which actually makes use of this fact to help us construct a measure. Let S be a hyperfinite set and let P I (S) be the collection of internal subsets of S. As noted above, P I (S) is an algebra, yet not a σ-algebra. For A P I (S), let µ(a) = A S, where refers to hyperfinite cardinality. Showing that µ is finitely additive is fairly straightforward, but we claim that µ is actually countably additive, hence it forms a measure. To see this, recall that a countable additive function ν : M *R only has to satisfy ν( n N A n ) = n=1 ν(a n) for disjoint A n when n N A n M. But for internal sets, this only holds when n N A n is a finite union, and this case is already taken care of by finite additivity. Next, we modify our funtion to have real image, since our goal is to construct a measure, which by definition takes on real values. So let { sh(µ(a)) : if µ(a) is limited µ L (A) = : if µ(a) is unlimited or This gives us a premeasure on P I (S), which under standard constructions give us a measure on the σ-algebra of all µ L -measurable subsets of S (some of which will not be internal). The final result is known as Loeb measure. It can be shown that in special cases, Loeb measure reduces to Lebesgue measure, and that µ L is regular in the sense that any µ L -measurable set may be approximated arbitrarily closely by internal sets. 3.2 Brownian Motion Following Lindstrom, we make the following definition: Definition 14. A one-dimensional Brownian motion is a stochastic process b : Ω [0, ) R such that b(ω, 0) = 0 for all ω and (i) If s 1 < t 1 s 2 < t 2... s n < t n, then the random variables b(, t 1 ) b(, s 1 ),..., b(, t n ) b(, s n ) are independent. (ii) It s < t, the random variable b(, t) b(, s) is Gaussian distributed with mean zero and variance t s. (iii) For almost all ω, the path t b(ω, t) is continuous. Intuitively, Brownian motion can be described as an infinitesimal random walk. This expression has mostly been used in a colloquial manner, yet non-standard analysis allows us to give this rigorous meaning. Fix an unlimited hypernatural N and let T = {0, 1/N,..., N 2 1 N, N}. Let Ω be the collection of internal maps from T to { 1, 1}, where by an internal map, we mean a function *f = [f n ] for some standard functions f n. This 8
9 makes Ω a set of hyperfinite cardinality 2 N Now define a probability measure P on Ω by setting P (A) = A 2 N 2 +1 on internal sets A. Intuitively, this is like saying that every coin has a 1/2 chance of coming up heads (think of the finite case). This induces a well-defined probability measure P in the same way as in the previous section. Doing this, it can be shown that if B : Ω T *R by Then, b : Ω [0, ) R by B(ω, k k 1 N ) = j=0 ω(j/n) N, b(ω, t) = sh(b(ω, t)) is a Brownian motion (where t is the element of T immediately to the right of t). 3.3 An Application to Hilbert Spaces Shortly after Robinson published his foundations of non-standard analysis, he and Allen R. Bernstein published a paper in which they used non-standard analysis to prove the following result, quoted verbatim: Theorem 15. Let T be a bounded linear operator on an infinite-dimensional Hilbert space H over the complex numbers and let p(z) 0 be a polynomial with complex coefficients such that p(t ) is completely continuous (compact). then T leave invariant at least one closed linear subspace of H other than H or {0}. This was a big deal for two reasons. One, the invariant subspace problem is of great importance in functional analysis. Two, this was a result that had not ever been proven using standard methods. At this time, mathematicians began to think of non-standard analysis as more of a useful tool than an interesting side note. It is worth noting that shortly after their paper was published, Paul R. Halmos translated the non-standard proof into a standard proof, yet it is still significant that people would first think of the proof in a non-standard setting. 4 References [1] Bernstein, Allen R. and Robinson, Abraham. Solution of an Invariant Subspace Problem of K. T. Smith and P. R. Halmos. Pacific Journal of Mathematics, Vol. 16, No.3: [2] Cutland, Nigel. Non-Standard Analysis and its Applications. Cambridge University Press, Cambridge:
10 [3] Goldblatt, Robert. Lectures on the Hyperreals: An Introduction to Non-Standard Analysis. Springer, New York:
Hyperreal Calculus MAT2000 Project in Mathematics. Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen
Hyperreal Calculus MAT2000 Project in Mathematics Arne Tobias Malkenes Ødegaard Supervisor: Nikolai Bjørnestøl Hansen Abstract This project deals with doing calculus not by using epsilons and deltas, but
More informationHyperreal Numbers: An Elementary Inquiry-Based Introduction. Handouts for a course from Canada/USA Mathcamp Don Laackman
Hyperreal Numbers: An Elementary Inquiry-Based Introduction Handouts for a course from Canada/USA Mathcamp 2017 Don Laackman MATHCAMP, WEEK 3: HYPERREAL NUMBERS DAY 1: BIG AND LITTLE DON & TIM! Problem
More informationConnectedness. 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 informationSequence convergence, the weak T-axioms, and first countability
Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
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 informationIntroduction to Logic and Axiomatic Set Theory
Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some
More informationHyperreals and a Brief Introduction to Non-Standard Analysis Math 336
Hyperreals and a Brief Introduction to Non-Standard Analysis Math 336 Gianni Krakoff June 8, 2015 Abstract The hyperreals are a number system extension of the real number system. With this number system
More informationNotes 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 informationConstruction of a general measure structure
Chapter 4 Construction of a general measure structure We turn to the development of general measure theory. The ingredients are a set describing the universe of points, a class of measurable subsets along
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More informationMeasure and Integration: Concepts, Examples and Exercises. INDER K. RANA Indian Institute of Technology Bombay India
Measure and Integration: Concepts, Examples and Exercises INDER K. RANA Indian Institute of Technology Bombay India Department of Mathematics, Indian Institute of Technology, Bombay, Powai, Mumbai 400076,
More informationLebesgue measure and integration
Chapter 4 Lebesgue measure and integration If you look back at what you have learned in your earlier mathematics courses, you will definitely recall a lot about area and volume from the simple formulas
More informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
More information5 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 informationNets and filters (are better than sequences)
Nets and filters (are better than sequences) Contents 1 Motivation 2 2 More implications we wish would reverse 2 3 Nets 4 4 Subnets 6 5 Filters 9 6 The connection between nets and filters 12 7 The payoff
More informationON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM
ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem
More information(1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define
Homework, Real Analysis I, Fall, 2010. (1) Consider the space S consisting of all continuous real-valued functions on the closed interval [0, 1]. For f, g S, define ρ(f, g) = 1 0 f(x) g(x) dx. Show that
More informationOn The Model Of Hyperrational Numbers With Selective Ultrafilter
MSC 03H05 On The Model Of Hyperrational Numbers With Selective Ultrafilter A. Grigoryants Moscow State University Yerevan Branch February 27, 2019 Abstract In standard construction of hyperrational numbers
More informationNotions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy
Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.
More informationMeasure and integration
Chapter 5 Measure and integration In calculus you have learned how to calculate the size of different kinds of sets: the length of a curve, the area of a region or a surface, the volume or mass of a solid.
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationMeasures. Chapter Some prerequisites. 1.2 Introduction
Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationStatistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006
Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Topics What is a set? Notations for sets Empty set Inclusion/containment and subsets Sample spaces and events Operations
More informationCONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Definition 1.
CONSTRUCTION OF R 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3.14159... to mean that π is a real number which, accurate to 5 decimal places,
More informationHandout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1
22M:132 Fall 07 J. Simon Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 Chapter 1 contains material on sets, functions, relations, and cardinality that
More informationI. ANALYSIS; PROBABILITY
ma414l1.tex Lecture 1. 12.1.2012 I. NLYSIS; PROBBILITY 1. Lebesgue Measure and Integral We recall Lebesgue measure (M411 Probability and Measure) λ: defined on intervals (a, b] by λ((a, b]) := b a (so
More informationREAL ANALYSIS I Spring 2016 Product Measures
REAL ANALSIS I Spring 216 Product Measures We assume that (, M, µ), (, N, ν) are σ- finite measure spaces. We want to provide the Cartesian product with a measure space structure in which all sets of the
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More information1 Measurable Functions
36-752 Advanced Probability Overview Spring 2018 2. Measurable Functions, Random Variables, and Integration Instructor: Alessandro Rinaldo Associated reading: Sec 1.5 of Ash and Doléans-Dade; Sec 1.3 and
More informationHOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS
HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS DIEGO ANDRES BEJARANO RAYO Abstract. We expand on and further explain the work by Malliaris and Shelah on the cofinality spectrum by doing
More informationUltraproducts of Finite Groups
Ultraproducts of Finite Groups Ben Reid May 11, 010 1 Background 1.1 Ultrafilters Let S be any set, and let P (S) denote the power set of S. We then call ψ P (S) a filter over S if the following conditions
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationWriting proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases
Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof
More informationVector Spaces. Chapter 1
Chapter 1 Vector Spaces Linear algebra is the study of linear maps on finite-dimensional vector spaces. Eventually we will learn what all these terms mean. In this chapter we will define vector spaces
More informationNONSTANDARD ANALYSIS AND AN APPLICATION TO THE SYMMETRIC GROUP ON NATURAL NUMBERS
NONSTANDARD ANALYSIS AND AN APPLICATION TO THE SYMMETRIC GROUP ON NATURAL NUMBERS MAURO DI NASSO AND YI ZHANG Abstract. An introduction of nonstandard analysis in purely algebraic terms is presented. As
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationSpanning, linear dependence, dimension
Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationContinuum Probability and Sets of Measure Zero
Chapter 3 Continuum Probability and Sets of Measure Zero In this chapter, we provide a motivation for using measure theory as a foundation for probability. It uses the example of random coin tossing to
More informationUltraproducts and the Foundations of Higher Order Fourier Analysis
Ultraproducts and the Foundations of Higher Order Fourier Analysis Evan Warner Advisor: Nicolas Templier Submitted in partial fulfillment of the requirements for the degree of Bachelor of Arts Department
More informationthe time it takes until a radioactive substance undergoes a decay
1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete
More informationUSING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE
USING ULTRAPOWERS TO CHARACTERIZE ELEMENTARY EQUIVALENCE MIKAYLA KELLEY Abstract. This paper will establish that ultrapowers can be used to determine whether or not two models have the same theory. More
More informationOn the Converse Law of Large Numbers
On the Converse Law of Large Numbers H. Jerome Keisler Yeneng Sun This version: March 15, 2018 Abstract Given a triangular array of random variables and a growth rate without a full upper asymptotic density,
More informationTOPICS IN LOGIC AND APPLICATIONS
TOPICS IN LOGIC AND APPLICATIONS ANUSH TSERUNYAN These lecture notes encompass the author s three-day course given at the 2016 Undergraduate Summer School on Model Theory at University of Notre Dame. Section
More informationA Short Journey Through the Riemann Integral
A Short Journey Through the Riemann Integral Jesse Keyton April 23, 2014 Abstract An introductory-level theory of integration was studied, focusing primarily on the well-known Riemann integral and ending
More informationµ (X) := inf l(i k ) where X k=1 I k, I k an open interval Notice that is a map from subsets of R to non-negative number together with infinity
A crash course in Lebesgue measure theory, Math 317, Intro to Analysis II These lecture notes are inspired by the third edition of Royden s Real analysis. The Jordan content is an attempt to extend the
More informationarxiv: v1 [math.fa] 14 Jul 2018
Construction of Regular Non-Atomic arxiv:180705437v1 [mathfa] 14 Jul 2018 Strictly-Positive Measures in Second-Countable Locally Compact Non-Atomic Hausdorff Spaces Abstract Jason Bentley Department of
More informationSets, Models and Proofs. I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University
Sets, Models and Proofs I. Moerdijk and J. van Oosten Department of Mathematics Utrecht University 2000; revised, 2006 Contents 1 Sets 1 1.1 Cardinal Numbers........................ 2 1.1.1 The Continuum
More informationStatistics 1 - Lecture Notes Chapter 1
Statistics 1 - Lecture Notes Chapter 1 Caio Ibsen Graduate School of Economics - Getulio Vargas Foundation April 28, 2009 We want to establish a formal mathematic theory to work with results of experiments
More informationHINDMAN S THEOREM AND IDEMPOTENT TYPES. 1. Introduction
HINDMAN S THEOREM AND IDEMPOTENT TYPES URI ANDREWS AND ISAAC GOLDBRING Abstract. Motivated by a question of Di Nasso, we show that Hindman s Theorem is equivalent to the existence of idempotent types in
More informationA BRIEF INTRODUCTION TO ZFC. Contents. 1. Motivation and Russel s Paradox
A BRIEF INTRODUCTION TO ZFC CHRISTOPHER WILSON Abstract. We present a basic axiomatic development of Zermelo-Fraenkel and Choice set theory, commonly abbreviated ZFC. This paper is aimed in particular
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 informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More information6c Lecture 14: May 14, 2014
6c Lecture 14: May 14, 2014 11 Compactness We begin with a consequence of the completeness theorem. Suppose T is a theory. Recall that T is satisfiable if there is a model M T of T. Recall that T is consistent
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More informationSequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.
Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence
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 informationREU 2007 Transfinite Combinatorics Lecture 9
REU 2007 Transfinite Combinatorics Lecture 9 Instructor: László Babai Scribe: Travis Schedler August 10, 2007. Revised by instructor. Last updated August 11, 3:40pm Note: All (0, 1)-measures will be assumed
More informationMore Model Theory Notes
More Model Theory Notes Miscellaneous information, loosely organized. 1. Kinds of Models A countable homogeneous model M is one such that, for any partial elementary map f : A M with A M finite, and any
More informationMeasurable 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 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 informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationABSTRACT INTEGRATION CHAPTER ONE
CHAPTER ONE ABSTRACT INTEGRATION Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Suggestions and errors are invited and can be mailed
More informationThe Caratheodory Construction of Measures
Chapter 5 The Caratheodory Construction of Measures Recall how our construction of Lebesgue measure in Chapter 2 proceeded from an initial notion of the size of a very restricted class of subsets of R,
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationMeasures and Measure Spaces
Chapter 2 Measures and Measure Spaces In summarizing the flaws of the Riemann integral we can focus on two main points: 1) Many nice functions are not Riemann integrable. 2) The Riemann integral does not
More informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationBuilding Infinite Processes from Finite-Dimensional Distributions
Chapter 2 Building Infinite Processes from Finite-Dimensional Distributions Section 2.1 introduces the finite-dimensional distributions of a stochastic process, and shows how they determine its infinite-dimensional
More informationA generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationchapter 12 MORE MATRIX ALGEBRA 12.1 Systems of Linear Equations GOALS
chapter MORE MATRIX ALGEBRA GOALS In Chapter we studied matrix operations and the algebra of sets and logic. We also made note of the strong resemblance of matrix algebra to elementary algebra. The reader
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationClassifying classes of structures in model theory
Classifying classes of structures in model theory Saharon Shelah The Hebrew University of Jerusalem, Israel, and Rutgers University, NJ, USA ECM 2012 Saharon Shelah (HUJI and Rutgers) Classifying classes
More informationCoin tossing space. 0,1 consisting of all sequences (t n ) n N, represents the set of possible outcomes of tossing a coin infinitely many times.
Coin tossing space Think of a coin toss as a random choice from the two element set }. Thus the set } n represents the set of possible outcomes of n coin tosses, and Ω := } N, consisting of all sequences
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More informationn [ F (b j ) F (a j ) ], n j=1(a j, b j ] E (4.1)
1.4. CONSTRUCTION OF LEBESGUE-STIELTJES MEASURES In this section we shall put to use the Carathéodory-Hahn theory, in order to construct measures with certain desirable properties first on the real line
More informationThe Adjoint Functor Theorem.
The Adjoint Functor Theorem. Kevin Buzzard February 7, 2012 Last modified 17/06/2002. 1 Introduction. The existence of free groups is immediate from the Adjoint Functor Theorem. Whilst I ve long believed
More informationNonstandard Methods in Combinatorics of Numbers: a few examples
Nonstandard Methods in Combinatorics of Numbers: a few examples Università di Pisa, Italy RaTLoCC 2011 Bertinoro, May 27, 2011 In combinatorics of numbers one can find deep and fruitful interactions among
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationREAL 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 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 informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
More informationChapter 0. Introduction: Prerequisites and Preliminaries
Chapter 0. Sections 0.1 to 0.5 1 Chapter 0. Introduction: Prerequisites and Preliminaries Note. The content of Sections 0.1 through 0.6 should be very familiar to you. However, in order to keep these notes
More informationABOUT THE CLASS AND NOTES ON SET THEORY
ABOUT THE CLASS AND NOTES ON SET THEORY About the Class Evaluation. Final grade will be based 25%, 25%, 25%, 25%, on homework, midterm 1, midterm 2, final exam. Exam dates. Midterm 1: Oct 4. Midterm 2:
More informationCS 124 Math Review Section January 29, 2018
CS 124 Math Review Section CS 124 is more math intensive than most of the introductory courses in the department. You re going to need to be able to do two things: 1. Perform some clever calculations to
More information3 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 informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationLecture 9: Conditional Probability and Independence
EE5110: Probability Foundations July-November 2015 Lecture 9: Conditional Probability and Independence Lecturer: Dr. Krishna Jagannathan Scribe: Vishakh Hegde 9.1 Conditional Probability Definition 9.1
More informationPOL502: 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 informationMATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field.
MATH 423 Linear Algebra II Lecture 3: Subspaces of vector spaces. Review of complex numbers. Vector space over a field. Vector space A vector space is a set V equipped with two operations, addition V V
More informationUltrafilters maximal for finite embeddability
1 16 ISSN 1759-9008 1 Ultrafilters maximal for finite embeddability LORENZO LUPERI BAGLINI Abstract: In this paper we study a notion of preorder that arises in combinatorial number theory, namely the finite
More informationMeta-logic derivation rules
Meta-logic derivation rules Hans Halvorson February 19, 2013 Recall that the goal of this course is to learn how to prove things about (as opposed to by means of ) classical first-order logic. So, we will
More information2 Metric Spaces Definitions Exotic Examples... 3
Contents 1 Vector Spaces and Norms 1 2 Metric Spaces 2 2.1 Definitions.......................................... 2 2.2 Exotic Examples...................................... 3 3 Topologies 4 3.1 Open Sets..........................................
More informationModern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 02 Groups: Subgroups and homomorphism (Refer Slide Time: 00:13) We looked
More information2 Measure Theory. 2.1 Measures
2 Measure Theory 2.1 Measures A lot of this exposition is motivated by Folland s wonderful text, Real Analysis: Modern Techniques and Their Applications. Perhaps the most ubiquitous measure in our lives
More information