A Note on Deutsch s Quantum Theory of Probability and Decisions
|
|
- Thomas Morrison
- 7 years ago
- Views:
Transcription
1 A Note on Deutsch s Quantum Theory of Probability and Decisions Malcolm R. Forster University of Wisconsin-Madison Draft, June 12, 1999 ABSTRACT: David Deutsch has a forthcoming article called Quantum Theory of Probability and Decisions" in which he claims to derive the standard probabilistic interpretation of the wavefunction from non-probabilistic considerations. In this note, I try to develop his argument in a classical context, to see whether the same ideas can generate probabilistic conclusions from nonprobabilistic assumptions in a more general way. While my answer is negative, the attempt pinpoints the parts of Deutsch s quantum mechanical argument that must rely on special features of the formalism (assuming that his proof is correct). 1. No Probabilities In, No Probabilities Out? You cannot derive an ought from an is. And I believe that it was Popper (1959) who once said, in response to those who think that randomness can be defined nonprobabilistically, that one cannot derive a probabilistic conclusion from non-probabilistic premises. Yet this is exactly what Deutsch (to appear) claims for quantum mechanical probabilities. Historically in the development of quantum theory, the Schrödinger equation came first, and Born s probabilistic interpretation of the wave function came later, as an additional postulate. If Deutsch is right, then from a few reasonable axioms, that any rational agent must act as if Born s postulate is true. More specifically, Deutsch considers each wavefunction, together with a particular experimental setup (formally, an observable about to be measured), to characterize a game, whose payoff is be proportional to the value of the measured observable. Prior to the measurement, when the outcome is unknown, Deutsch postulates that every quantum mechanical game has a value, which determine a rational agent s preferences. His aim is to show from three non-probabilistic axioms, which characterize the rationality of a player in non-probabilistic terms, it follows that the value of a game is equal to the
2 expected value of outcomes as determined by Born s postulate. 1 According to Deutsch, previous attempts to do this (e.g. Everett (1957), Finkelstein (1963), Hartle (1968), DeWitt and Graham (1973), Ohkuwa (1993)) applied only to infinite sets of measurements (which do not occur in nature), and not to the outcomes of individual measurements (which do). If the argument works in quantum mechanics, why shouldn t it work more generally? That is, why not apply Deutsch s three axioms to any situation in which there is uncertainty about the outcome? What is so special about quantum mechanical uncertainty? Deutsch does not do this, but if it could be done, it seems to me that it would have important foundational implications for decision theory. For example, consider the game in which we toss a fair coin and received $1 if the coin lands heads up, and $0 if the coin lands heads down. Denote this game by G 0 (1, 0). This game is different from the game in which the coin is biased ¾ towards heads. Denote this game by G 1 (1, 0). Finally, consider the case when the coin is biased ¾ towards tails, again with the same payoffs for each outcome. Denote this by G 2 (1, 0). Then, under standard utility maximization theory, if we have choice of which game to play, then it is rational to choose G 1 (assuming that the dollar amounts reflect the true value of the payoffs) because it has an expected payoff of 75 cents, which is higher than the 50 cent and the 25 cent expected payoffs of the other games. A successful application of Deutsch s argument promises to reach the same conclusion from non-probabilistic assumptions. The idea would be to construe any action as a playing a game, and the choice amongst possible actions as a choice about which game to play. Every game has a value, and the fundamental decision rule is to choose to play the game with the highest value. If Deutsch s three axioms were to imply that the value of a game is its expected payoff, then we have an argument not only for expected utility maximization, but for determining the probabilistic weights of possible game outcomes from non-probabilistic assumptions. 1 Actually, his argument is restricted to the case in which there is no degeneracy that is, he assumes that all eigenvalues of the observable are different. 2
3 I plan to show that Deutsch s argument does not go through in this more general case. Nevertheless, my conclusion is not entirely negative. First of all, my argument does not impugn anything that Deutsch does in his original paper, since it is exclusively concerned with the quantum mechanical context. Second, if Deutsch s argument is correct, then my analysis will pinpoint the crucial points at which the quantum formalism is playing a role. More specifically, I will argue that with two additional axioms, which I call the Sure-Thing axiom and the Symmetry axiom, Deutsch s argument does generalize to a broad class of instances in the everyday contexts. Therefore, if Deutsch s argument is valid, it is because the quantum mechanical formalism somehow ensures the truth of these axioms. That promises to be helpful in understanding his analysis. The Sure-Thing axiom is relatively uncontroversial as a constraint on rationality. It just says that if all outcomes of a game lead to the same payoff, then the value of game is equal to that payoff. On the other hand, the Symmetry axiom is a probabilistic assumption, rather like an inverse to Laplace s principle of indifference. Laplace s principle of indifference says that if we are indifferent about two possible events, then they are equally probable, whereas Symmetry states the converse if two events are equally probable, then we are indifferent with respect to them (in a sense to be made precise). So in the general situation, Popper is still right no probabilities in, no probabilities out. Nevertheless, it might show how symmetry considerations help to determine probability values (see also Jaynes, 1971). 2. The Axioms and the Argument The project begins with the assumption that a rational agent, who has a choice of games to play, should choose the game with the highest value. The existence of these values ensure that preferences follows standard properties, such as transitivity: If game A has a higher value than B, and B has a higher value than C, the A has a higher value than C. However, it is not assumed that these values are equal to the expected payoffs of the games. That is to be proved from a set of axioms, which will be non-probabilistic as long as possible. 3
4 Let G(x 1, x 2,, x n ) be a game with n mutually exclusive and exhaustive payoffs x 1, x 2,, x n. The different outcomes need not be equally probable. The value of the game is denoted by V(G(x 1, x 2,, x n )). In the special case in which the payoffs are equally probable, then I will write: V(G(x 1, x 2,, x n )) = V(x 1, x 2,, x n ). So whenever you see the notation V(x 1, x 2,, x n ), you know that the outcomes are equally probable. A composite game is one in which one or more of the payoffs is a game. Thus, for example, G(G 1 (a, b), c) is a game in which the first outcome is to play game G 1 (with possible payoffs a and b) and the second outcome is to receive the payoff c unconditionally. Axiom 1: Additivity. If a constant payoff k is added to every outcome of a game, then the value of the game is the same as the original game with an unconditional payoff k added on. That is, V(G(a + k, b + k)) = k + V(G(a, b)). Axiom 2: Zero-Sum. Consider two games with the same number of outcomes, where for every outcome, the payoff in one game is the negative of the payoff in the other. Then the sum of the values of these games is zero. That is, V(G(a, b)) +(G( a, b)) = 0. Deutsch describes this axiom as concerning two-player zero-sum games. But his application has nothing to do with two players. The axiom is used only to justify a single players substitution of one game for another. Axiom 3: Substitutability. If two games have the same value, then substituting one game for the other in a composite game will not change the value of the composite game. So, for example, if V(G 1 (a, b)) = d, then G(G 1 (a, b), c) and G(d, c) have the same value. Note that we must, in general, preserve the ordering of the payoffs. We cannot substitute G(c, d) for G(d, c), except in special cases. Substitutability is the contentious axiom because, at the first sight, it appears to assume what we need to prove. In the proofs to follow, it sometimes appears to assume that two games are interchangeable because they have the same expected payoff. However, let it be clear at this point that Substitutability only sanctions substitution if the values of the games are equal. 4
5 For this reason, I believe that we need to add the following axiom, which does not appear in Deutsch s argument, either because of an omission, or because it is automatically true in the quantum mechanical argument. Axiom 4: Sure-Thing. If the payoffs for all possible outcomes of a game are the same, then value of the game is equal to that payoff. That is, V(G(a, a)) = a. The outcomes need not be equiprobable (the special case in which the outcomes are equiprobable does follow as a corollary to Theorem 1, below). Although Deutsch proceeds on the assumption that Axiom 4 follows from the previous assumptions, I don t see how to prove it. However, this is not an significant issue because the assumption is unproblematic whether it is redundant or not. The fifth axiom is one that I have added, not because Deutsch overlooked it, but because it is automatically taken care of in the quantum mechanical context. Axiom 5: Symmetry. If outcomes are equally probable, then the value of a game is preserved if we swap the payoffs around. That is, V(a, b) = V(b, a). For example, if we toss a fair coin, then the game in which you get $1 for heads up and $0 for heads down has the same value as a game in which you get $0 for heads up and $1 for tails down. This would not be true if the coin were biased. The point of the argument is to show how these axioms entail that the value of a game is its expected payoff. It is not obvious even in the simplest case. Consider a simple game in which there are two equally probable outcomes with payoffs a and b, respectively. In that case we know that the expected payoff is ½(a + b). The problem is to use the 5 axioms to show that the value of the game is exactly equal to this amount. Theorem 1: If axioms 1 to 5 are true, then V(a, b) = ½(a + b). Proof: From the Zero-Sum axiom, V(a, b) + V( a, b) = 0, But, V( a, b) = V(b (a + b), a (a + b)) By Additivity, V(b (a + b), a (a + b)) = (a + b) + V(b, a), and hence, V( a, b) = V(b, a) (a + b). By Symmetry, V(b, a) = V(a, b). 5
6 Therefore, 2V(a, b) = (a + b), from which the theorem easily follows. Notice that the use of Symmetry is crucial here, for otherwise the result would follow even when the outcomes were not equally probable, and that would give the wrong answer. We made no use of the Sure-Thing axiom in proving Theorem 1. The next task is to generalize this result to an arbitrary number of equally probable outcomes. Theorem 2: If Axioms 1 through 5 are true, then V(x 1, x 2,, x n ) = 1/n(x 1 + x x n ). Proof: The proof is in two parts. Part (a). First prove that the theorem is true for n = 2, 4, 8, 16, This part of the proof is by mathematical induction on the integers m, where n = 2 m. Case m = 1 is true by Theorem 1. Now assume that the proposition is true for m = k. We need to prove that it is true for m = k + 1. So, assume V(x 1, x 2,, x r ) = 1/r(x 1 + x x r ), where r = 2 k. We need to show that V(x 1, x 2,, x 2r ) = 1/2r(x 1 + x x 2r ). The key idea is to divide the game into two subgames: G 1 (x 1, x 2,, x r ) and G 2 (x r+1, x r+2,, x 2r ), and consider the composite game G(G 1 (x 1, x 2,, x r ), G 2 (x r+1, x r+2,, x 2r )). Because each subgame has the same number of equally probable outcomes, each subgame is equally probable. Let the subgames have values a and b respectively. Then Substitutability tells us that we may replace each subgame by a simple game in which one receives its value unconditionally. Therefore, V(x 1, x 2,, x 2r ) = V(a, b) = ½(a + b), where the last step follows from Theorem 1. We may now substitute for a and b using the inductive hypothesis to prove the result. Part (b). We need to prove the result for intermediate cases for which n 2 m. To do this it is sufficient to prove that if the result is true for n = k, then it is true for n = k 1. This is a kind of backwards induction, but given for any n, Part (a) establishes the theorem for some higher value of n, so this will work. 6
7 Consider any game with k 1 equally likely outcomes. We want to prove that V(x 1, x 2,, x k 1 ) = (1/k 1)(x 1 + x x k 1 ). Form the composite game G(G 1 (x 1, x 2,, x k 1 ), x k ), in which all k outcomes are equally probable. (This implies that G is a composite game in which G 1 has probability (k 1/k) and x k has probability 1/k.) The trick is that we are free to set the value of x k anything we want. Set it at V(x 1, x 2,, x k 1 ). This means that G(G 1 (x 1, x 2,, x k 1 ), x k ) can be replaced by the game G(x k, x k ) in which the two payoffs are the same (even though they are not equally likely). The Sure-Thing axiom implies that V(G(x k, x k )) = x k. From the way we defined G, it is also true that V(x 1, x 2,, x k ) = V(G(G 1 (x 1, x 2,, x k 1 ), x k )). Therefore, V(x 1, x 2,, x k ) = x k. In other words, for this particular choice of x k, V(x 1, x 2,, x k 1 ) = V(x 1, x 2,, x k ). The inductive hypothesis now tells us that, V(x 1, x 2,, x k ) = (1/k)(x 1 + x x k ), form which it follows that, V(x 1, x 2,, x k 1 ) = (1/k)(x 1 + x x k 1 + V(x 1, x 2,, x k 1 )). To obtain the final result, collect common terms and simplify. The proof of Theorem 2 illustrates the crucial role played by Substitutability. There is a natural suspicion here that probabilistic considerations play a role independently of the Symmetry axiom. The suspicion is that in order to know whether games can be substituted for one another you have to know the probabilities. However, its role in the proof of Theorem 2 does not go beyond a knowledge of equiprobability. For, it follows from the fact that x 1, x 2,, x k 1, x k are equally probable, that x 1, x 2,, x k 1 are equally probable. The part that goes beyond equiprobability is the step that appeals to the Sure-Thing axiom. Symmetry does not apply here. However, the idea that G(a, a) can be substituted for an unconditional payment of a does not depend on the relative probabilities of the outcomes in any way. 7
8 Nevertheless, in the next step, in the generalization from Theorems 1 and 2, Substitutability plays an even more critical role. (I will only sketch how the generalization from these theorems proceeds, and refer the reader to Deutsch (to appear) for the details.) The goal is to prove that V(G(a, b)) = Pr(a).a + Pr(b).b, for any values of the probabilities Pr(a) and Pr(b). The key idea is that we can substitute G(a, b) with a game G 0 (a, a,, a, b, b,, b), where the subscript 0 indicates that all the outcomes are equally probable. We substitute as many a s and b s as are needed so that their relative frequencies approximate Pr(a) and Pr(b) as closely as we desire. Then we apply Theorem 2 to G 0 (a, a,, a, b, b,, b). I think it is clear enough from this brief sketch that the crux of the proof is justifying the substitution of the right number of a s and b s without somehow assuming that they are substitutable because they yield the same expected payoffs. For me, this is the part of Deutsch s argument that I find the most suspicious. Why should G(a, b) have the same value as G 0 (a, a,, a, b, b,, b). Perhaps this is another special assumption that falls out of the quantum mechanical formalism? 3. Conclusion My attempt at extending Deutsch s argument to the classical domain has forced the addition of at least two axioms which I called the Sure-Thing axiom and the Symmetry axiom. From these, I am fairly confident that Deutsch s proof goes through at least as far as Theorem 2. However, beyond that, I suspect that additional axioms will be needed. None of this impugns Deutsch s argument in the quantum mechanical context. In fact, the analysis should deepen his argument by bringing out the points at which the quantum mechanical formalism is doing real work. It is only in this way that we will really understand how it is that one can get (effectively) probabilistic conclusions from nonprobabilistic premises. 8
9 References Deutsch, David (to appear). Quantum Theory of Probability and Decisions. Proc. R. Soc. Lond. A. The preprint is available at DeWitt, B.S. and Graham, N in The Many-Worlds Interpretation of Quantum Mechanics (Princeton University Press). Everett, H Rev. Mod. Phys Finkelstein, D Trans. N.Y. Acad. Sci Hartle, J.B Am. Jour. Phys. 36, Jaynes, E. T. (1971), The Well-Posed Problem. In V. P. Godambe and D. A. Sprott (eds.), Foundations of Statistics, Toronto, Holt, Rinehart and Winston, pp Ohkuwa, Y. Phys. Rev D Popper, Karl (1959): The Logic of Scientific Discovery. London: Hutchinson. 9
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationCHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
More informationMathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
More informationMath/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability
Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2015
ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2015 These notes have been used before. If you can still spot any errors or have any suggestions for improvement, please let me know. 1
More informationA Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationCosmological Arguments for the Existence of God S. Clarke
Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets
More informationCHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
More informationdef: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
More informationLecture 8 The Subjective Theory of Betting on Theories
Lecture 8 The Subjective Theory of Betting on Theories Patrick Maher Philosophy 517 Spring 2007 Introduction The subjective theory of probability holds that the laws of probability are laws that rational
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
More informationBinomial Sampling and the Binomial Distribution
Binomial Sampling and the Binomial Distribution Characterized by two mutually exclusive events." Examples: GENERAL: {success or failure} {on or off} {head or tail} {zero or one} BIOLOGY: {dead or alive}
More informationSchooling, Political Participation, and the Economy. (Online Supplementary Appendix: Not for Publication)
Schooling, Political Participation, and the Economy Online Supplementary Appendix: Not for Publication) Filipe R. Campante Davin Chor July 200 Abstract In this online appendix, we present the proofs for
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationChapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationThe result of the bayesian analysis is the probability distribution of every possible hypothesis H, given one real data set D. This prestatistical approach to our problem was the standard approach of Laplace
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationIndiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
More informationBasic Probability. Probability: The part of Mathematics devoted to quantify uncertainty
AMS 5 PROBABILITY Basic Probability Probability: The part of Mathematics devoted to quantify uncertainty Frequency Theory Bayesian Theory Game: Playing Backgammon. The chance of getting (6,6) is 1/36.
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMTH6120 Further Topics in Mathematical Finance Lesson 2
MTH6120 Further Topics in Mathematical Finance Lesson 2 Contents 1.2.3 Non-constant interest rates....................... 15 1.3 Arbitrage and Black-Scholes Theory....................... 16 1.3.1 Informal
More informationProblem of the Month: Fair Games
Problem of the Month: The Problems of the Month (POM) are used in a variety of ways to promote problem solving and to foster the first standard of mathematical practice from the Common Core State Standards:
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationPeople have thought about, and defined, probability in different ways. important to note the consequences of the definition:
PROBABILITY AND LIKELIHOOD, A BRIEF INTRODUCTION IN SUPPORT OF A COURSE ON MOLECULAR EVOLUTION (BIOL 3046) Probability The subject of PROBABILITY is a branch of mathematics dedicated to building models
More informationDecision Making under Uncertainty
6.825 Techniques in Artificial Intelligence Decision Making under Uncertainty How to make one decision in the face of uncertainty Lecture 19 1 In the next two lectures, we ll look at the question of how
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationChapter ML:IV. IV. Statistical Learning. Probability Basics Bayes Classification Maximum a-posteriori Hypotheses
Chapter ML:IV IV. Statistical Learning Probability Basics Bayes Classification Maximum a-posteriori Hypotheses ML:IV-1 Statistical Learning STEIN 2005-2015 Area Overview Mathematics Statistics...... Stochastics
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationThe Null Hypothesis. Geoffrey R. Loftus University of Washington
The Null Hypothesis Geoffrey R. Loftus University of Washington Send correspondence to: Geoffrey R. Loftus Department of Psychology, Box 351525 University of Washington Seattle, WA 98195-1525 gloftus@u.washington.edu
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationBinomial lattice model for stock prices
Copyright c 2007 by Karl Sigman Binomial lattice model for stock prices Here we model the price of a stock in discrete time by a Markov chain of the recursive form S n+ S n Y n+, n 0, where the {Y i }
More informationAN ANALYSIS OF A WAR-LIKE CARD GAME. Introduction
AN ANALYSIS OF A WAR-LIKE CARD GAME BORIS ALEXEEV AND JACOB TSIMERMAN Abstract. In his book Mathematical Mind-Benders, Peter Winkler poses the following open problem, originally due to the first author:
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationSet Theory Basic Concepts and Definitions
Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric
More information10 Evolutionarily Stable Strategies
10 Evolutionarily Stable Strategies There is but a step between the sublime and the ridiculous. Leo Tolstoy In 1973 the biologist John Maynard Smith and the mathematician G. R. Price wrote an article in
More informationOverview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model
Overview of Violations of the Basic Assumptions in the Classical Normal Linear Regression Model 1 September 004 A. Introduction and assumptions The classical normal linear regression model can be written
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem Evan Chen evanchen@mit.edu February 3, 2015 The Chinese Remainder Theorem is a theorem only in that it is useful and requires proof. When you ask a capable 15-year-old why
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
More informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationSection 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More information1 Introduction to Option Pricing
ESTM 60202: Financial Mathematics Alex Himonas 03 Lecture Notes 1 October 7, 2009 1 Introduction to Option Pricing We begin by defining the needed finance terms. Stock is a certificate of ownership of
More information25 Integers: Addition and Subtraction
25 Integers: Addition and Subtraction Whole numbers and their operations were developed as a direct result of people s need to count. But nowadays many quantitative needs aside from counting require numbers
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationThe last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
More informationStupid Divisibility Tricks
Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013
More information5.1 Radical Notation and Rational Exponents
Section 5.1 Radical Notation and Rational Exponents 1 5.1 Radical Notation and Rational Exponents We now review how exponents can be used to describe not only powers (such as 5 2 and 2 3 ), but also roots
More informationMath Workshop October 2010 Fractions and Repeating Decimals
Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationFull and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
More informationLab 11. Simulations. The Concept
Lab 11 Simulations In this lab you ll learn how to create simulations to provide approximate answers to probability questions. We ll make use of a particular kind of structure, called a box model, that
More informationReview D: Potential Energy and the Conservation of Mechanical Energy
MSSCHUSETTS INSTITUTE OF TECHNOLOGY Department of Physics 8.01 Fall 2005 Review D: Potential Energy and the Conservation of Mechanical Energy D.1 Conservative and Non-conservative Force... 2 D.1.1 Introduction...
More informationElementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationWe can express this in decimal notation (in contrast to the underline notation we have been using) as follows: 9081 + 900b + 90c = 9001 + 100c + 10b
In this session, we ll learn how to solve problems related to place value. This is one of the fundamental concepts in arithmetic, something every elementary and middle school mathematics teacher should
More informationVictor Shoup Avi Rubin. fshoup,rubing@bellcore.com. Abstract
Session Key Distribution Using Smart Cards Victor Shoup Avi Rubin Bellcore, 445 South St., Morristown, NJ 07960 fshoup,rubing@bellcore.com Abstract In this paper, we investigate a method by which smart
More information26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationMathematical Induction. Mary Barnes Sue Gordon
Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by
More information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More informationThe Binomial Distribution
The Binomial Distribution James H. Steiger November 10, 00 1 Topics for this Module 1. The Binomial Process. The Binomial Random Variable. The Binomial Distribution (a) Computing the Binomial pdf (b) Computing
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationProperties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationChristmas Gift Exchange Games
Christmas Gift Exchange Games Arpita Ghosh 1 and Mohammad Mahdian 1 Yahoo! Research Santa Clara, CA, USA. Email: arpita@yahoo-inc.com, mahdian@alum.mit.edu Abstract. The Christmas gift exchange is a popular
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationCHAPTER 2 Estimating Probabilities
CHAPTER 2 Estimating Probabilities Machine Learning Copyright c 2016. Tom M. Mitchell. All rights reserved. *DRAFT OF January 24, 2016* *PLEASE DO NOT DISTRIBUTE WITHOUT AUTHOR S PERMISSION* This is a
More informationThis unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.
Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationLecture 9 Maher on Inductive Probability
Lecture 9 Maher on Inductive Probability Patrick Maher Scientific Thought II Spring 2010 Two concepts of probability Example You know that a coin is either two-headed or two-tailed but you have no information
More information6.042/18.062J Mathematics for Computer Science. Expected Value I
6.42/8.62J Mathematics for Computer Science Srini Devadas and Eric Lehman May 3, 25 Lecture otes Expected Value I The expectation or expected value of a random variable is a single number that tells you
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More information5544 = 2 2772 = 2 2 1386 = 2 2 2 693. Now we have to find a divisor of 693. We can try 3, and 693 = 3 231,and we keep dividing by 3 to get: 1
MATH 13150: Freshman Seminar Unit 8 1. Prime numbers 1.1. Primes. A number bigger than 1 is called prime if its only divisors are 1 and itself. For example, 3 is prime because the only numbers dividing
More information