Lecture: Conditional Expectation

Size: px
Start display at page:

Download "Lecture: Conditional Expectation"

Transcription

1 Lecture: Conditional Expectation Lutz Kruschwitz & Andreas Löffler Discounted Cash Flow, Section 1.2,

2 Outline 1.2 Conditional expectation Uncertainty and information Rules Application of the rules,

3 Uncertainty 1 Uncertainty is a distinguished feature of valuation usually modelled as different future states of nature ω with corresponding cash flows FCF t (ω). But: to the best of our knowledge particular states of nature play no role in the valuation equations [ ] of firms, instead one uses expectations E FCF t of cash flows. 1.2 Conditional expectation, Uncertainty and information

4 Information 2 Today is certain, the future is uncertain. Now: we always stay at time 0! And think about the future Simon Vouet: Fortune teller (1617) FCF s 0 t s today future later future 1.2 Conditional expectation, Uncertainty and information

5 A finite example There are three points in time in the future Different cash flow realizations can be observed. The movements up and down along the path occur with probability 0.5. t = 0 t = 1 t = 2 t = 3 time 1.2 Conditional expectation, Uncertainty and information

6 Actual and possible cash flow 4 What happens if actual cash flow at time t = 1 is neither 90 nor 110 (for example, 100)? Our model proved to be wrong... Nostradamus ( ), failed fortune-teller 1.2 Conditional expectation, Uncertainty and information

7 Expectations 5 Let us think about cash flow paid at time t = 3, i.e. FCF 3. What will its expectation be tomorrow? A.N. Kolmogorov ( ), This depends on the state we will have tomorrow. Two cases are possible: FCF 1 = 110 or FCF 1 = 90. founded theory of conditional expectation 1.2 Conditional expectation, Uncertainty and information

8 Thinking about the future today 6 Case 1 ( FCF 1 = 110) = Expectation of FCF 3 = = Case 2 ( FCF 1 = 90) = Expectation of FCF 3 = = Hence, expectation of FCF 3 is [ ] E FCF 3 F 1 = { if the development at t = 1 is up, if the development at t = 1 is down. 1.2 Conditional expectation, Uncertainty and information

9 Conditional expectation 7 The expectation of FCF 3 depends on the state of nature at time t = 1. Hence, the expectation is conditional: conditional on the information at time t = 1 (abbreviated as F 1 ). A conditional expectation covers our ideas about future thoughts. This conditional expectation can be uncertain. 1.2 Conditional expectation, Uncertainty and information

10 Rules 8 How to use conditional expectations? We will not present proofs, but only rules for calculation. Arithmetic textbook of The first three rules will be well-known from classical expectations, two will be new. Adam Ries ( ) 1.2 Conditional expectation, Rules

11 Rule 1: Classical expectation 9 ] ] E [ X F0 = E [ X At t = 0 conditional expectation and classical expectation coincide. Or: conditional expectation generalizes classical expectation. 1.2 Conditional expectation, Rules

12 Rule 2: Linearity 10 [ E a X ] ] ] + bỹ F t = a E [ X Ft + b E [Ỹ Ft Business as usual Conditional expectation, Rules

13 Rule 3: Certain quantity 11 E [1 F t ] = 1 Safety first... From this and linearity for certain quantities X, E [X F t ] = E [X 1 F t ] = X E [1 F t ] = X 1.2 Conditional expectation, Rules

14 Rule 4: Iterated expectation 12 Let s t then [ ] ] ] E E [ X Ft F s = E [ X Fs When we think today about what we will know tomorrow about the day after tomorrow, we will only know what we today already believe to know tomorrow. 1.2 Conditional expectation, Rules

15 Rule 5: Known or realized quantities 13 If X is known at time t ] E [ X Ỹ F t = X ] E [Ỹ Ft We can take out from the expectation what is known. Or: known quantities are like certain quantities. 1.2 Conditional expectation, Rules

16 Using the rules 14 We want to check our rules by looking at the finite example and an infinite example. We start with the finite example: Remember that we had From this we get [ ] E FCF 3 F 1 = { if up at time t = 1, if down at time t = 1. [ [ ]] E E FCF 3 F 1 = = Conditional expectation, Application of the rules

17 Finite example 15 And indeed [ [ ]] E E FCF 3 F 1 [ [ ] ] = E E FCF 3 F 1 F 0 [ ] = E FCF 3 F 0 [ ] = E FCF 3 = 121! by rule 1 by rule 4 by rule 1 It seems purely by chance that [ ] E FCF 3 F 1 = FCF 1, but it is on purpose! This will become clear later Conditional expectation, Application of the rules

18 Infinite example 16 u 2g FCF t gfcf t u g FCF t ud g FCF t Again two factors up and down with probability p u and p d and 0 < d < u d g FCF t or d 2g FCF t gfcf t+1 =( ug FCF t up, dg FCF t down. t t+1 t+2 time 1.2 Conditional expectation, Application of the rules

19 Infinite example 17 Let us evaluate the conditional expectation [ ] E FCF t+1 F t = p u u FCF t + p d d FCF t where g is the expected growth rate. = (p u u + p d d) FCF }{{} t, :=1+g If g = 0 it is said that the cash flows form a martingal. In the infinite example we will later assume no growth (g = 0). 1.2 Conditional expectation, Application of the rules

20 Infinite example 18 Compare this if using only the rules [ [ ]] E E FCF t F s [ [ ] ] = E E FCF t F t 1 F s = E [(1 + g) FCF ] t 1 F s [ ] = (1 + g) E FCF t 1 F s by rule 4 see above by rule 2 = (1 + g) t s FCF s repeating argument. 1.2 Conditional expectation, Application of the rules

21 Summary 19 We always stay in the present. Conditional expectation handles our knowledge of the future. Five rules cover the necessary mathematics. 1.2 Conditional expectation, Application of the rules

Lecture: Conditional Expectation

Lecture: Conditional Expectation Discounted Cash Flow, Section 1.2 Outline 1.2 Conditional Expectation Uncertainty 1 Uncertainty is a distinguished feature of valuation usually modelled as different future states of nature ω with corresponding

More information

1 Lecture 25: Extreme values

1 Lecture 25: Extreme values 1 Lecture 25: Extreme values 1.1 Outline Absolute maximum and minimum. Existence on closed, bounded intervals. Local extrema, critical points, Fermat s theorem Extreme values on a closed interval Rolle

More information

STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS. Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept.

STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS. Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept. STOCHASTIC MODELS LECTURE 1 MARKOV CHAINS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (ShenZhen) Sept. 6, 2016 Outline 1. Introduction 2. Chapman-Kolmogrov Equations

More information

Types Negative Base & Positive Gradient

Types Negative Base & Positive Gradient 6: Trends Linear Constant amount Geometric Constant percentage 6.1 DAs of Linear Trends Basics Typically two components Base series First flow Arithmetic gradient Remainder B 50 + Base Series Linear Trend

More information

CS 124 Math Review Section January 29, 2018

CS 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 information

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras

Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we

More information

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction

Discrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these

More information

Part 3: Inferential Statistics

Part 3: Inferential Statistics - 1 - Part 3: Inferential Statistics Sampling and Sampling Distributions Sampling is widely used in business as a means of gathering information about a population. Reasons for Sampling There are several

More information

Section 2: Estimation, Confidence Intervals and Testing Hypothesis

Section 2: Estimation, Confidence Intervals and Testing Hypothesis Section 2: Estimation, Confidence Intervals and Testing Hypothesis Carlos M. Carvalho The University of Texas at Austin McCombs School of Business http://faculty.mccombs.utexas.edu/carlos.carvalho/teaching/

More information

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss

Lecture 1 Introduction to Probability and Set Theory Text: A Course in Probability by Weiss Lecture 1 to and Set Theory Text: A Course in by Weiss 1.2 2.3 STAT 225 to Models January 13, 2014 to and Whitney Huang Purdue University 1.1 Agenda to and 1 2 3 1.2 Motivation Uncertainty/Randomness in

More information

Lecture Notes on Compositional Reasoning

Lecture Notes on Compositional Reasoning 15-414: Bug Catching: Automated Program Verification Lecture Notes on Compositional Reasoning Matt Fredrikson Ruben Martins Carnegie Mellon University Lecture 4 1 Introduction This lecture will focus on

More information

Testing Series with Mixed Terms

Testing Series with Mixed Terms Testing Series with Mixed Terms Philippe B. Laval KSU Today Philippe B. Laval (KSU) Series with Mixed Terms Today 1 / 17 Outline 1 Introduction 2 Absolute v.s. Conditional Convergence 3 Alternating Series

More information

- there will be midterm extra credit available (described after 2 nd midterm)

- there will be midterm extra credit available (described after 2 nd midterm) Lecture 13: Energy & Work Today s Announcements: * Midterm # 1 still being graded. Stay tuned - there will be midterm extra credit available (described after 2 nd midterm) * Midterm # 1 solutions being

More information

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips

6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips 6.041SC Probabilistic Systems Analysis and Applied Probability, Fall 2013 Transcript Tutorial:A Random Number of Coin Flips Hey, everyone. Welcome back. Today, we're going to do another fun problem that

More information

2. Prime and Maximal Ideals

2. 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 information

Warm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet.

Warm-Up Problem. Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet. Warm-Up Problem Please fill out your Teaching Evaluation Survey! Please comment on the warm-up problems if you haven t filled in your survey yet Warm up: Given a program that accepts input, is there an

More information

Lesson 2: Put a Label on That Number!

Lesson 2: Put a Label on That Number! Lesson 2: Put a Label on That Number! What would you do if your mother approached you, and, in an earnest tone, said, Honey. Yes, you replied. One million. Excuse me? One million, she affirmed. One million

More information

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables.

z x = f x (x, y, a, b), z y = f y (x, y, a, b). F(x, y, z, z x, z y ) = 0. This is a PDE for the unknown function of two independent variables. Chapter 2 First order PDE 2.1 How and Why First order PDE appear? 2.1.1 Physical origins Conservation laws form one of the two fundamental parts of any mathematical model of Continuum Mechanics. These

More information

Mathematical Foundations of Programming. Nicolai Kraus. Draft of February 15, 2018

Mathematical Foundations of Programming. Nicolai Kraus. Draft of February 15, 2018 Very short lecture notes: Mathematical Foundations of Programming University of Nottingham, Computer Science, module code G54FOP, Spring 2018 Nicolai Kraus Draft of February 15, 2018 What is this? This

More information

Part 01 - Notes: Identifying Significant Figures

Part 01 - Notes: Identifying Significant Figures Part 01 - Notes: Identifying Significant Figures Objectives: Identify the number of significant figures in a measurement. Compare relative uncertainties of different measurements. Relate measurement precision

More information

Lecture: Corporate Income Tax

Lecture: Corporate Income Tax Lectre: Corporate Income Tax Ltz Krschwitz & Andreas Löffler Disconted Cash Flow, Section 2.1, Otline 2.1 Unlevered firms Similar companies Notation 2.1.1 Valation eqation 2.1.2 Weak atoregressive cash

More information

An analogy from Calculus: limits

An analogy from Calculus: limits COMP 250 Fall 2018 35 - big O Nov. 30, 2018 We have seen several algorithms in the course, and we have loosely characterized their runtimes in terms of the size n of the input. We say that the algorithm

More information

Lecture 02: Summations and Probability. Summations and Probability

Lecture 02: Summations and Probability. Summations and Probability Lecture 02: Overview In today s lecture, we shall cover two topics. 1 Technique to approximately sum sequences. We shall see how integration serves as a good approximation of summation of sequences. 2

More information

University of Regina. Lecture Notes. Michael Kozdron

University of Regina. Lecture Notes. Michael Kozdron University of Regina Statistics 252 Mathematical Statistics Lecture Notes Winter 2005 Michael Kozdron kozdron@math.uregina.ca www.math.uregina.ca/ kozdron Contents 1 The Basic Idea of Statistics: Estimating

More information

Chapter 2 Classical Probability Theories

Chapter 2 Classical Probability Theories Chapter 2 Classical Probability Theories In principle, those who are not interested in mathematical foundations of probability theory might jump directly to Part II. One should just know that, besides

More information

Math 480 The Vector Space of Differentiable Functions

Math 480 The Vector Space of Differentiable Functions Math 480 The Vector Space of Differentiable Functions The vector space of differentiable functions. Let C (R) denote the set of all infinitely differentiable functions f : R R. Then C (R) is a vector space,

More information

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0. For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.

More information

The problem of base rates

The problem of base rates Psychology 205: Research Methods in Psychology William Revelle Department of Psychology Northwestern University Evanston, Illinois USA October, 2015 1 / 14 Outline Inferential statistics 2 / 14 Hypothesis

More information

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com 1 School of Oriental and African Studies September 2015 Department of Economics Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com Gujarati D. Basic Econometrics, Appendix

More information

The Halfers are right, but many were anyway wrong: Sleeping Beauty Problem

The Halfers are right, but many were anyway wrong: Sleeping Beauty Problem 1 6 The Halfers are right, but many were anyway wrong: Sleeping Beauty Problem Minseong Kim Abstract. In this paper, I will examine the representative halfer and thirder solutions to the Sleeping Beauty

More information

6.262: Discrete Stochastic Processes 2/2/11. Lecture 1: Introduction and Probability review

6.262: Discrete Stochastic Processes 2/2/11. Lecture 1: Introduction and Probability review 6.262: Discrete Stochastic Processes 2/2/11 Lecture 1: Introduction and Probability review Outline: Probability in the real world Probability as a branch of mathematics Discrete stochastic processes Processes

More information

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

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

More information

211 Real Analysis. f (x) = x2 1. x 1. x 2 1

211 Real Analysis. f (x) = x2 1. x 1. x 2 1 Part. Limits of functions. Introduction 2 Real Analysis Eample. What happens to f : R \ {} R, given by f () = 2,, as gets close to? If we substitute = we get f () = 0 which is undefined. Instead we 0 might

More information

experiment3 Introduction to Data Analysis

experiment3 Introduction to Data Analysis 63 experiment3 Introduction to Data Analysis LECTURE AND LAB SKILLS EMPHASIZED Determining what information is needed to answer given questions. Developing a procedure which allows you to acquire the needed

More information

There are two types of electric charge

There are two types of electric charge Static Electricity! Electric Charge There are two types of electric charge Positive (+) Negative (-) Electric Charge - Like charges repel + + Electric Charge - Opposite charges attract + - Electric Charge

More information

Chapter 4.1 Introduction to Relations

Chapter 4.1 Introduction to Relations Chapter 4.1 Introduction to Relations The example at the top of page 94 describes a boy playing a computer game. In the game he has to get 3 or more shapes of the same color to be adjacent to each other.

More information

Topic 1: Propositional logic

Topic 1: Propositional logic Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements

More information

COMP6463: λ-calculus

COMP6463: λ-calculus COMP6463: λ-calculus 1. Basics Michael Norrish Michael.Norrish@nicta.com.au Canberra Research Lab., NICTA Semester 2, 2015 Outline Introduction Lambda Calculus Terms Alpha Equivalence Substitution Dynamics

More information

Special Theory of Relativity Prof. Dr. Shiva Prasad Department of Physics Indian Institute of Technology, Bombay

Special Theory of Relativity Prof. Dr. Shiva Prasad Department of Physics Indian Institute of Technology, Bombay (Refer Slide Time: 00:36) Special Theory of Relativity Prof. Dr. Shiva Prasad Department of Physics Indian Institute of Technology, Bombay Lecture - 7 Examples of Length Contraction and Time Dilation Hello,

More information

MATH 13100/58 Class 6

MATH 13100/58 Class 6 MATH 13100/58 Class 6 Minh-Tam Trinh Today and Friday, we cover the equivalent of Chapters 1.1-1.2 in Purcell Varberg Rigdon. 1. Calculus is about two kinds of operations on functions: differentiation

More information

Our first case consists of those sequences, which are obtained by adding a constant number d to obtain subsequent elements:

Our first case consists of those sequences, which are obtained by adding a constant number d to obtain subsequent elements: Week 13 Sequences and Series Many images below are excerpts from the multimedia textbook. You can find them there and in your textbook in sections 7.2 and 7.3. We have encountered the first sequences and

More information

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10

Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 EECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 10 Introduction to Basic Discrete Probability In the last note we considered the probabilistic experiment where we flipped

More information

Assume that you have made n different measurements of a quantity x. Usually the results of these measurements will vary; call them x 1

Assume that you have made n different measurements of a quantity x. Usually the results of these measurements will vary; call them x 1 #1 $ http://www.physics.fsu.edu/users/ng/courses/phy2048c/lab/appendixi/app1.htm Appendix I: Estimates for the Reliability of Measurements In any measurement there is always some error or uncertainty in

More information

CSE 21 Practice Exam for Midterm 2 Fall 2017

CSE 21 Practice Exam for Midterm 2 Fall 2017 CSE 1 Practice Exam for Midterm Fall 017 These practice problems should help prepare you for the second midterm, which is on monday, November 11 This is longer than the actual exam will be, but good practice

More information

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

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called

More information

Fuzzy Systems. Introduction

Fuzzy Systems. Introduction Fuzzy Systems Introduction Prof. Dr. Rudolf Kruse Christoph Doell {kruse,doell}@iws.cs.uni-magdeburg.de Otto-von-Guericke University of Magdeburg Faculty of Computer Science Department of Knowledge Processing

More information

Lecture 7: More Arithmetic and Fun With Primes

Lecture 7: More Arithmetic and Fun With Primes IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July

More information

MAT Mathematics in Today's World

MAT Mathematics in Today's World MAT 1000 Mathematics in Today's World Last Time We discussed the four rules that govern probabilities: 1. Probabilities are numbers between 0 and 1 2. The probability an event does not occur is 1 minus

More information

MITOCW ocw f99-lec01_300k

MITOCW ocw f99-lec01_300k MITOCW ocw-18.06-f99-lec01_300k Hi. This is the first lecture in MIT's course 18.06, linear algebra, and I'm Gilbert Strang. The text for the course is this book, Introduction to Linear Algebra. And the

More information

Solutions to Macro Final 2006

Solutions to Macro Final 2006 Solutions to Macro Final 6 th December 6 1 Problem 1 1.1 Part A Rewrite the utility function as U = ln(n) + ln (c) γ ln ( c) Notice that since the agent taes c as a constant, it will not factor into the

More information

Measurement and Significant Figures AP CHEMISTRY. Textbook: Chemistry by Zumdahl & Zumdahl, 9th edition, Instructor: Mrs.

Measurement and Significant Figures AP CHEMISTRY. Textbook: Chemistry by Zumdahl & Zumdahl, 9th edition, Instructor: Mrs. AP CHEMISTRY Textbook: Chemistry by Zumdahl & Zumdahl, 9th edition, 2014. Instructor: Mrs. Beth Smith Ch 1 Chemical Foundations Big Idea 1: The chemical elements are fundamental building materials of matter

More information

O.K. But what if the chicken didn t have access to a teleporter.

O.K. But what if the chicken didn t have access to a teleporter. The intermediate value theorem, and performing algebra on its. This is a dual topic lecture. : The Intermediate value theorem First we should remember what it means to be a continuous function: A function

More information

Tacoma Narrows Bridge

Tacoma Narrows Bridge Tacoma Narrows Bridge Matt Bates and Sean Donohoe May 2, 23 Abstract The exact reasons behind the failure of the Tacoma Narrows Bridge are still being debated. This paper explores the error in the mathematic

More information

Can Everettian Interpretation Survive Continuous Spectrum?

Can Everettian Interpretation Survive Continuous Spectrum? Can Everettian Interpretation Survive Continuous Spectrum? Bryce M. Kim 2016/02/21 Abstract This paper raises a simple continuous spectrum issue in many-worlds interpretation of quantum mechanics, or Everettian

More information

Uncertainty and Robustness for SISO Systems

Uncertainty and Robustness for SISO Systems Uncertainty and Robustness for SISO Systems ELEC 571L Robust Multivariable Control prepared by: Greg Stewart Outline Nature of uncertainty (models and signals). Physical sources of model uncertainty. Mathematical

More information

Last Update: March 1 2, 201 0

Last Update: March 1 2, 201 0 M ath 2 0 1 E S 1 W inter 2 0 1 0 Last Update: March 1 2, 201 0 S eries S olutions of Differential Equations Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections

More information

Decision Theory: Q-Learning

Decision Theory: Q-Learning Decision Theory: Q-Learning CPSC 322 Decision Theory 5 Textbook 12.5 Decision Theory: Q-Learning CPSC 322 Decision Theory 5, Slide 1 Lecture Overview 1 Recap 2 Asynchronous Value Iteration 3 Q-Learning

More information

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

HOW TO WRITE PROOFS. Dr. Min Ru, University of Houston HOW TO WRITE PROOFS Dr. Min Ru, University of Houston One of the most difficult things you will attempt in this course is to write proofs. A proof is to give a legal (logical) argument or justification

More information

MAS221 Analysis Semester Chapter 2 problems

MAS221 Analysis Semester Chapter 2 problems MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible

More information

DIFFERENTIAL EQUATIONS

DIFFERENTIAL EQUATIONS DIFFERENTIAL EQUATIONS Basic Concepts Paul Dawkins Table of Contents Preface... Basic Concepts... 1 Introduction... 1 Definitions... Direction Fields... 8 Final Thoughts...19 007 Paul Dawkins i http://tutorial.math.lamar.edu/terms.aspx

More information

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8

, 500, 250, 125, , 2, 4, 7, 11, 16, , 3, 9, 27, , 3, 2, 7, , 2 2, 4, 4 2, 8 Warm Up Look for a pattern and predict the next number or expression in the list. 1. 1000, 500, 250, 125, 62.5 2. 1, 2, 4, 7, 11, 16, 22 3. 1, 3, 9, 27, 81 4. 8, 3, 2, 7, -12 5. 2, 2 2, 4, 4 2, 8 6. 7a

More information

ECO 317 Economics of Uncertainty. Lectures: Tu-Th , Avinash Dixit. Precept: Fri , Andrei Rachkov. All in Fisher Hall B-01

ECO 317 Economics of Uncertainty. Lectures: Tu-Th , Avinash Dixit. Precept: Fri , Andrei Rachkov. All in Fisher Hall B-01 ECO 317 Economics of Uncertainty Lectures: Tu-Th 3.00-4.20, Avinash Dixit Precept: Fri 10.00-10.50, Andrei Rachkov All in Fisher Hall B-01 1 No.1 Thu. Sep. 17 ECO 317 Fall 09 RISK MARKETS Intrade: http://www.intrade.com

More information

Cycles Research Institute Definitions and Concepts Used in Cycle Study

Cycles Research Institute  Definitions and Concepts Used in Cycle Study Cycles Research Institute http://www.cyclesresearchinstitute.org/ Definitions and Concepts Used in Cycle Study by Edward R. Dewey This article originally appeared in the Foundation for the Study of Cycles

More information

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process

ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 6 Stochastic Process Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Definition of stochastic process (random

More information

Notes for Class Meeting 19: Uncertainty

Notes for Class Meeting 19: Uncertainty Notes for Class Meeting 19: Uncertainty Uncertainty in Momentum and Position In 1926, Werner Heisenberg formulated the uncertainty principle: It is impossible to determine both the momentum and position

More information

LECTURE 1. Logic and Proofs

LECTURE 1. Logic and Proofs LECTURE 1 Logic and Proofs The primary purpose of this course is to introduce you, most of whom are mathematics majors, to the most fundamental skills of a mathematician; the ability to read, write, and

More information

Math 131, Lecture 20: The Chain Rule, continued

Math 131, Lecture 20: The Chain Rule, continued Math 131, Lecture 20: The Chain Rule, continued Charles Staats Friday, 11 November 2011 1 A couple notes on quizzes I have a couple more notes inspired by the quizzes. 1.1 Concerning δ-ε proofs First,

More information

This process was named creative destruction by Joseph Schumpeter.

This process was named creative destruction by Joseph Schumpeter. This process was named creative destruction by Joseph Schumpeter. Aghion and Howitt (1992) formalized Schumpeter s ideas in a growth model of the type we have been studying. A simple version of their model

More information

Important Properties of R

Important 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 information

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

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

8. Reductio ad absurdum

8. Reductio ad absurdum 8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual infinities

More information

Testing Series With Mixed Terms

Testing Series With Mixed Terms Testing Series With Mixed Terms Philippe B. Laval Series with Mixed Terms 1. Introduction 2. Absolute v.s. Conditional Convergence 3. Alternating Series 4. The Ratio and Root Tests 5. Conclusion 1 Introduction

More information

Iterative solvers for linear equations

Iterative solvers for linear equations Spectral Graph Theory Lecture 17 Iterative solvers for linear equations Daniel A. Spielman October 31, 2012 17.1 About these notes These notes are not necessarily an accurate representation of what happened

More information

Lecture 4 An Introduction to Stochastic Processes

Lecture 4 An Introduction to Stochastic Processes Lecture 4 An Introduction to Stochastic Processes Prof. Massimo Guidolin Prep Course in Quantitative Methods for Finance August-September 2017 Plan of the lecture Motivation and definitions Filtrations

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

Lesson 3-1: Solving Linear Systems by Graphing

Lesson 3-1: Solving Linear Systems by Graphing For the past several weeks we ve been working with linear equations. We ve learned how to graph them and the three main forms they can take. Today we re going to begin considering what happens when we

More information

5 Major Areas of Chemistry

5 Major Areas of Chemistry Chapter 1 What is Chemistry? Chemistry is the study of the composition of matter (matter is anything with mass and occupies space), its composition, properties, and the changes it undergoes. Has a definite

More information

Sampling distributions and the Central Limit. Theorem. 17 October 2016

Sampling distributions and the Central Limit. Theorem. 17 October 2016 distributions and the Johan A. Elkink School of Politics & International Relations University College Dublin 17 October 2016 1 2 3 Outline 1 2 3 (or inductive statistics) concerns drawing conclusions regarding

More information

Uncertainty in numbers

Uncertainty in numbers 1.03 Accuracy, Precision and Significant Figures Uncertainty in numbers Story: Taxi driver (13 years experience) points to a pyramid "...this here pyramid is exactly 4511 years old". After a quick calculation,

More information

Intermediate Logic. Natural Deduction for TFL

Intermediate Logic. Natural Deduction for TFL Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #10: Sequences and Summations Based on materials developed by Dr. Adam Lee Today s Topics Sequences

More information

Econometrics III: Problem Set # 2 Single Agent Dynamic Discrete Choice

Econometrics III: Problem Set # 2 Single Agent Dynamic Discrete Choice Holger Sieg Carnegie Mellon University Econometrics III: Problem Set # 2 Single Agent Dynamic Discrete Choice INSTRUCTIONS: This problem set was originally created by Ron Goettler. The objective of this

More information

Transition Density Function and Partial Di erential Equations

Transition Density Function and Partial Di erential Equations Transition Density Function and Partial Di erential Equations In this lecture Generalised Functions - Dirac delta and heaviside Transition Density Function - Forward and Backward Kolmogorov Equation Similarity

More information

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

THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE by Miles Mathis miles@mileswmathis.com Abstract Here I solve Goldbach's Conjecture by the simplest method possible. I do this by first calculating probabilites

More information

Computability Crib Sheet

Computability Crib Sheet Computer Science and Engineering, UCSD Winter 10 CSE 200: Computability and Complexity Instructor: Mihir Bellare Computability Crib Sheet January 3, 2010 Computability Crib Sheet This is a quick reference

More information

Reasoning Under Uncertainty: Introduction to Probability

Reasoning Under Uncertainty: Introduction to Probability Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23 March 12, 2007 Textbook 9 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Lecture 23, Slide 1 Lecture Overview

More information

What Is Classical Physics?

What Is Classical Physics? Lecture : The Nature of Classical Physics Somewhere in Steinbeck country two tired men sit down at the side of the road. Lenny combs his beard with his fingers and says, Tell me about the laws of physics,

More information

Lecture 6: Recursive Preferences

Lecture 6: Recursive Preferences Lecture 6: Recursive Preferences Simon Gilchrist Boston Univerity and NBER EC 745 Fall, 2013 Basics Epstein and Zin (1989 JPE, 1991 Ecta) following work by Kreps and Porteus introduced a class of preferences

More information

Math 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes!

Math 31 Lesson Plan. Day 16: Review; Start Section 8. Elizabeth Gillaspy. October 18, Supplies needed: homework. Colored chalk. Quizzes! Math 31 Lesson Plan Day 16: Review; Start Section 8 Elizabeth Gillaspy October 18, 2011 Supplies needed: homework Colored chalk Quizzes! Goals for students: Students will: improve their understanding of

More information

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let f : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation

More information

Fundamentals of Probability CE 311S

Fundamentals of Probability CE 311S Fundamentals of Probability CE 311S OUTLINE Review Elementary set theory Probability fundamentals: outcomes, sample spaces, events Outline ELEMENTARY SET THEORY Basic probability concepts can be cast in

More information

* 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields. * 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

More information

Basic notions of probability theory

Basic notions of probability theory Basic notions of probability theory Contents o Boolean Logic o Definitions of probability o Probability laws Why a Lecture on Probability? Lecture 1, Slide 22: Basic Definitions Definitions: experiment,

More information

1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations

1. Algebraic and geometric treatments Consider an LP problem in the standard form. x 0. Solutions to the system of linear equations The Simplex Method Most textbooks in mathematical optimization, especially linear programming, deal with the simplex method. In this note we study the simplex method. It requires basically elementary linear

More information

8. Reductio ad absurdum

8. Reductio ad absurdum 8. Reductio ad absurdum 8.1 A historical example In his book, The Two New Sciences, 10 Galileo Galilea (1564-1642) gives several arguments meant to demonstrate that there can be no such thing as actual

More information

Solving with Absolute Value

Solving with Absolute Value Solving with Absolute Value Who knew two little lines could cause so much trouble? Ask someone to solve the equation 3x 2 = 7 and they ll say No problem! Add just two little lines, and ask them to solve

More information

Probability Exercises. Problem 1.

Probability Exercises. Problem 1. Probability Exercises. Ma 162 Spring 2010 Ma 162 Spring 2010 April 21, 2010 Problem 1. ˆ Conditional Probability: It is known that a student who does his online homework on a regular basis has a chance

More information

Dynamic merge of discrete goods flow Impact on throughput and efficiency

Dynamic merge of discrete goods flow Impact on throughput and efficiency Dynamic merge of discrete goods flow Impact on throughput and efficiency Simon Gasperin Dirk Jodin Institute of Logistics Engineering Graz University of Technology, Austria C ontinuous conveyors with a

More information

Questions Q1. * A circuit is set up as shown in the diagram. The battery has negligible internal resistance.

Questions Q1. * A circuit is set up as shown in the diagram. The battery has negligible internal resistance. Questions Q1. * A circuit is set up as shown in the diagram. The battery has negligible internal resistance. (a) Calculate the potential difference across the 40 Ω resistor. (2) Potential difference =...

More information

Notes 07 largely plagiarized by %khc

Notes 07 largely plagiarized by %khc Notes 07 largely plagiarized by %khc Warning This set of notes covers the Fourier transform. However, i probably won t talk about everything here in section; instead i will highlight important properties

More information