Properties of Sequences

Similar documents
3: Linear Systems. Examples. [1.] Solve. The first equation is in blue; the second is in red. Here's the graph: The solution is ( 0.8,3.4 ).

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Tutorial on Mathematical Induction

Line Integrals and Path Independence

Solving with Absolute Value

Topic 1: Propositional logic

Chapter 1 Review of Equations and Inequalities

Since the two-sided limits exist, so do all one-sided limits. In particular:

Root test. Root test Consider the limit L = lim n a n, suppose it exists. L < 1. L > 1 (including L = ) L = 1 the test is inconclusive.

Mathematical Logic Part One

Series with positive and negative terms

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis

Final Exam Theory Quiz Answer Page

MITOCW ocw f99-lec01_300k

Algebra 8.6 Simple Equations

- measures the center of our distribution. In the case of a sample, it s given by: y i. y = where n = sample size.

Dialog on Simple Derivatives

MITOCW watch?v=y6ma-zn4olk

Math 300: Foundations of Higher Mathematics Northwestern University, Lecture Notes

Calculus (Math 1A) Lecture 5

1 Some Statistical Basics.

MITOCW 6. Standing Waves Part I

LIMITS AND DERIVATIVES

Notes 11: OLS Theorems ECO 231W - Undergraduate Econometrics

AQA Level 2 Further mathematics Further algebra. Section 4: Proof and sequences

Written by Rachel Singh, last updated Oct 1, Functions

FORMAL PROOFS DONU ARAPURA

Alex s Guide to Word Problems and Linear Equations Following Glencoe Algebra 1

Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)

Replay argument. Abstract. Tanasije Gjorgoski Posted on on 03 April 2006

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices

CS 124 Math Review Section January 29, 2018

The Cycloid. and the Kinematic Circumference. by Miles Mathis

= 5 2 and = 13 2 and = (1) = 10 2 and = 15 2 and = 25 2

Sums of Squares (FNS 195-S) Fall 2014

0 Real Analysis - MATH20111

The Conjunction and Disjunction Theses

Exam Question 10: Differential Equations. June 19, Applied Mathematics: Lecture 6. Brendan Williamson. Introduction.

1. Introduction to commutative rings and fields

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.

Introducing Proof 1. hsn.uk.net. Contents

But, there is always a certain amount of mystery that hangs around it. People scratch their heads and can't figure

(Infinite) Series Series a n = a 1 + a 2 + a a n +...

A Conundrum concerning the area of a sphere

Modern Algebra Prof. Manindra Agrawal Department of Computer Science and Engineering Indian Institute of Technology, Kanpur

Area. A(2) = sin(0) π 2 + sin(π/2)π 2 = π For 3 subintervals we will find

2.1 Convergence of Sequences

MITOCW ocw f99-lec09_300k

Mathematical induction

Ask. Don t Tell. Annotated Examples

Lesson 3-1: Solving Linear Systems by Graphing

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston

Conceptual Explanations: Simultaneous Equations Distance, rate, and time

MITOCW watch?v=0usje5vtiks

e π i 1 = 0 Proofs and Mathematical Induction Carlos Moreno uwaterloo.ca EIT-4103 e x2 log k a+b a + b

2 Analogies between addition and multiplication

SYDE 112, LECTURE 7: Integration by Parts

Natural Deduction in Sentential Logic

EQ: How do I convert between standard form and scientific notation?

Calculus (Real Analysis I)

Choosing Logical Connectives

What is proof? Lesson 1

Entropy as a measure of surprise

PHYSICS 107. Lecture 8 Conservation Laws. For every action there is an equal and opposite reaction.

Mathematical Logic Part One

MITOCW 5. Quantum Mechanics: Free Particle and Particle in 1D Box

A REVIEW OF RESIDUES AND INTEGRATION A PROCEDURAL APPROACH

(Refer Slide Time: 0:21)

The Inductive Proof Template

CONSTRUCTION OF THE REAL NUMBERS.

1 Lecture 25: Extreme values

Math 144 Summer 2012 (UCR) Pro-Notes June 24, / 15

Nondeterministic finite automata

PHIL12A Section answers, 28 Feb 2011

Reading and Writing. Mathematical Proofs. Slides by Arthur van Goetham

Section 11.1: Sequences

Epsilon Delta proofs

Superposition - World of Color and Hardness

Introduction to Proofs

Section 1.x: The Variety of Asymptotic Experiences

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Directed Reading B. Section: Tools and Models in Science TOOLS IN SCIENCE MAKING MEASUREMENTS. is also know as the metric system.

4.2: What Derivatives Tell Us

MITOCW MITRES6_012S18_L22-10_300k

1. Introduction to commutative rings and fields

Physics 509: Bootstrap and Robust Parameter Estimation

Aristotle on Space. Physics, Book IV

[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

The paradox of knowability, the knower, and the believer

/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16

Mathematical Logic Part One

DR.RUPNATHJI( DR.RUPAK NATH )

Time-bounded computations

Arguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)

Solving Equations with Addition and Subtraction

5.4 Continuity: Preliminary Notions

Math 291-1: Lecture Notes Northwestern University, Fall 2015

MI 4 Mathematical Induction Name. Mathematical Induction

Transcription:

Properties of Sequences Here is a FITB proof arguing that a sequence cannot converge to two different numbers. The basic idea is to argue that if we assume this can happen, we deduce that something contradictory to something we already know. This is a valid form of argument, though perhaps strange when you see it first. It's not unlike Sherlock's 'when you have eliminated the impossible, whatever remains, however improbable, must be the truth'. The purpose here is to strenghten mathematical understanding and use of the definition of convergence. Theorem 0.1: (Uniqueness of Limits) If a sequence convergences, it must converge to a unique (just one!) value. Proof: Suppose a sequence S converges to two different numbers L and M, with L > M. Choose a number e to be e = L M, which is a particular e value with e > 0. Since S 4 converges to L, the number of terms of the sequence NOT in the interval (L e, L + e) is finite, and this means that there must be an infinite number of terms of the sequence inside the interval (L e, L + e). But none of THESE infinite number of terms are also inside the interval (M e, M + e), because M + e < L e (because of the way we chose e -- specificially e = L M. Easy to see this visually.) But this means that the 4 number of terms of the sequence not in the interval (M e, M + e) is INFINITE, which isn't supposed to happen because the sequence converges to M! Thus our original assumption must be wrong, namely that we cannot have a sequence converging to two different values. Using the same kinds of arguments we can prove the following facts about combining convergent sequences. We use the same notation as we did for limits of functions of real numbers, because the same properties work for limits and the idea is very similar. (However technically there is a difference -- here we are talking about limits of sequences which is really quite a different thing than the limit like. The basic theme here is that combining CONVERGENT sequence in various ways results in a convergent sequence that also converges, to the value you would expect. Note that this theorem says NOTHING about what happens when you combine sequences that are not convergent (DIVERGENT), and in general all kinds of crazy things can happen. Theorem 0.2: (Combining convergent sequences) If sequence ( a n ) converges to α and sequence ( ) converges to β, then 1. sequence ( a n + b n ) converges to α + β, and 2. sequence ( a n b n ) converges to α β, and 3. sequence ( a n b n ) converges to α β, and 4. if also, then seqence a β 0 ( n ) converges to α. b n β 5. For any real number C 0 (C ) converges to Cα. a n lim x 3 First ask yourself what the notation means -- how do you get each of the terms of the b n

sequence described by the notation ( + )? Normally we use limit notation when working with sequences, because the ideas of convergence of a sequence to a limit and the limiting value of a function as x a are similar and many properties are the same. For example the first property would be written: If lim n a n = α and lim n b n = β then lim n a n + b n = α + β. a n b n An intuitive way to think about the first property is as follows: Given two convergent sequences ( a n ) α and ( b n ) β. Since the sequences converge the terms a n get closer and closer (as close as we want!) to α, and the terms b n get closer and closer (as close as we want!) to β. Adding a number very close to α to a number very close to β will result in a number very close to α + β. Thus we expect the sequence ( a n + b n ) to converge to α + β, which it does!. Example: ( 1 0 and so the above theorem (second bullet) tells us that n ) (3 3 n=1 ) n=1 ( 1 3 0 3 n ) n=1 Suppose sequence ( a 1, a 2, a 3,... ) = ( a n ) converges to α. So intuitively the terms n=1 a n get closer and closer to α as n gets larger and larger. What happens if we drop the first few terms of the sequence? What does ( = (,,,... ) a n ) n=100 a 100 a 101 a 102 converge to, if anything? Clearly it still converges to α. In other words, what happens at the 'beginning' of a sequence doesn't matter -- it's the behaviour 'at the end' that matters. For this reason we sometimes do not write where a sequence starts: for example or (a n ). ( 1 3+n )