Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.

Slides:



Advertisements
Similar presentations
Partial Orderings Section 8.6.
Advertisements

Mathematical Induction
Chapter 3 Elementary Number Theory and Methods of Proof.
Equivalence Relations
Lecture 7 Surreal Numbers. Lecture 7 Surreal Numbers.
(CSC 102) Discrete Structures Lecture 14.
MAT 3749 Introduction to Analysis Section 1.1 The Real Numbers
Calculus and Elementary Analysis 1.2 Supremum and Infimum Integers, Rational Numbers and Real Numbers Completeness of Real Numbers Supremum and Infimum.
Supremum and Infimum Mika Seppälä.
Basic properties of the integers
EE1J2 - Slide 1 EE1J2 – Discrete Maths Lecture 10 Cardinality Uncountability of the real numbers.
Fuzzy Sets and Fuzzy Logic Theory and Applications
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
TCSS 342 AVL Trees v1.01 AVL Trees Motivation: we want to guarantee O(log n) running time on the find/insert/remove operations. Idea: keep the tree balanced.
CSCE 411 Design and Analysis of Algorithms Andreas Klappenecker TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAA.
1 More Applications of the Pumping Lemma. 2 The Pumping Lemma: Given a infinite regular language there exists an integer for any string with length we.
Theorem 1-a Let be a sequence: L L a) converges to a real number L iff every subsequence of converge to L Illustrations 0 0.
1 Set Theory. Notation S={a, b, c} refers to the set whose elements are a, b and c. a  S means “a is an element of set S”. d  S means “d is not an element.
Cardinality of a Set “The number of elements in a set.” Let A be a set. a.If A =  (the empty set), then the cardinality of A is 0. b. If A has exactly.
Partially Ordered Sets (POSets)
Lecture 9 Illustrations Lattices. Fixpoints Abstract Interpretation.
Equivalence Relations MSU CSE 260. Outline Introduction Equivalence Relations –Definition, Examples Equivalence Classes –Definition Equivalence Classes.
Lecture 4.5: POSets and Hasse Diagrams CS 250, Discrete Structures, Fall 2011 Nitesh Saxena *Adopted from previous lectures by Cinda Heeren.
Example We can also evaluate a definite integral by interpretation of definite integral. Ex. Find by interpretation of definite integral. Sol. By the interpretation.
Chapter 6 Mathematical Induction
Numbers, Operations, and Quantitative Reasoning.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
2.6 Equivalence Relation §1.Equivalence relation §Definition 2.18: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric,
MA4266 Topology Wayne Lawton Department of Mathematics S ,
In this section, we will introduce the definite integral and begin looking at what it represents and how to calculate its value.
FUNCTIONS.
CPSC 411 Design and Analysis of Algorithms
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 9/18/2008.
Sets and Subsets Set A set is a collection of well-defined objects (elements/members). The elements of the set are said to belong to (or be contained in)
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 10/7/2008.
2.1 Functions.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Introduction to Graph Theory
Chapter Three SEQUENCES
Department of Statistics University of Rajshahi, Bangladesh
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 9/3/2009.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 11/11/2008.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
CS 173, Lecture B August 27, 2015 Tandy Warnow. Proofs You want to prove that some statement A is true. You can try to prove it directly, or you can prove.
Properties of Integrals. Mika Seppälä: Properties of Integrals Basic Properties of Integrals Through this section we assume that all functions are continuous.
Infinite sets We say that a set A is infinite if a proper subset B exists of A such that there is a bijection It is easy to see that no set with a finite.
Partial Orderings: Selected Exercises
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
Relations and Functions
Department of Mathematics
Unit-III Algebraic Structures
Eigenvalues and Eigenvectors
Chapter 3 The Real Numbers.
Chapter 3 The Real Numbers.
Set Topology MTH 251 Lecture # 8.
Introduction to Real Analysis
Sequences (9.1) February 23rd, 2017.
Introduction to Real Analysis
Lecture 43 Section 10.1 Wed, Apr 6, 2005
Field.
2.1 Functions.
Rounded Off Values Upper and Lower Bounds.
2.1 Functions.
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Introduction to Analysis
THE WELL ORDERING PROPERTY
Introduction to Analysis
Presentation transcript:

Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008

Upper Bound of a set Definition of upper bound of a set: A subset E of R is bounded above if there exists β in R such that for each x in E, x β. Such a β is called an upper bound of E. How should you define “bounded below” and “lower bound”? A set E is bounded if E is bounded both above and below. Examples: A = {0, ½, 2/3, ¾, …}. Is A bounded below? Is A bounded above? Is A bounded? N = {1, 2, 3, …}. Is N bounded below? Is N bounded above? Is N bounded? B = {r belongs to Q: 0 < r and r²<2}. Is B bounded below? Is B bounded above? Is B bounded? Does B have the maximum element?

Least upper bound of a set Definition of the least upper bound or supremum: Let E be a nonempty subset of R that is bounded above. An element α of R is called the least upper bound or supremum of E if (i) α is an upper bound of E, and (ii) if a real number β < α, then β is not an upper bound of E. If E has the least upper bound, then the least upper bound is denoted by α=sup E.

Greatest lower bound or infimum Definition of the greatest lower bound or infimum: Let E be a nonempty subset of R that is bounded below. An element α of R is called the greatest lower bound or infimum of E if (i) α is a lower bound of E, and (ii) if a real number β > α, then β is not a lower bound of E. If E has the greatest lower bound, then the greatest lower bound is denoted by α=inf E.

Theorem Let A be a nonempty subset of R that is bounded above. An upper bound α of A is the supremum of A if and only if for every β < α, there exists an element x of A such that β<x α. Proof: “=>”: Suppose α=sup A. If β β. Since α is an upper bound of A, therefore, x α. “<=”: if α is an upper bound of A such that every β < α is not an upper bound of A, then it follows from the definition that α is the least upper bound of A, that is, α = sup A.

New definition of the least upper bound of a set It follows from the theorem that we might define the least upper bound of a set as follows: Let E be a nonempty subset of R that is bounded above. An element α of R is called the least upper bound or supremum of E if (i) α is an upper bound of E, and (ii) for every ε>0, there exists an element x of E such that α - ε <x α.

Examples A = {0, ½, 2/3, ¾, …}. Find the inf A and sup A. N = {1, 2, 3, …}. Find the inf N and sup N. B = {r belongs to Q: 0 < r and r²<2}. Find inf B and sup B.

Least Upper Bound Property of R (Cantor and Dedekind) Property 1.4.6: Supremum or Least Upper Bound Property of R: Every nonempty subset of R that is bounded above has a supremum in R. Property 1.4.7: Infimum or Greatest Lower Bound Property of R: Every nonempty subset of R that is bounded below has an infimum in R.

Example Show that for every positive real number y>1, there exists a unique positive square root of y, that is, Proof: Existence: Consider the set Is S nonempty? Is S bounded above? Let α=sup S. Show α² = y.

Use contradiction to show α²=y Define the real number β by Then If α² α, and by (2), β² y, then by (1), β y. Thus if x is a positive real number and x≥β,then x²≥ β²>y. Therefore, β is an upper bound of S. This contradicts that α is the least upper bound of S. Thus it must be true that α²=y.

New definitions If E is a nonempty subset of R and E is not bounded above, we set sup E =∞ If E is a nonempty subset of R and E is not bounded below, we set inf E = -∞