(R1) R is nondecreasing. (R2) U Uniform(0, 1) = R(U) X.

Size: px
Start display at page:

Download "(R1) R is nondecreasing. (R2) U Uniform(0, 1) = R(U) X."

Transcription

1 9:3 //2 TOPIC Representing and quantile functions This section deals with the quantiles of a random variable We start by discussing how quantiles are related to the inverse df of the preceding section, and to the closely related notion of a representing function We then look at a useful parametric family of distributions, the so-called Tukey family, that are defined in terms of their quantiles Finally, we present a graphical technique for comparing two distributions, the so-called Q/Q-plot Representing functions Let X be a random variable with df F A mapping R from (, ) to R such that (R) R is nondecreasing and (R2) R(U) X whenever U Uniform(, ) is called a representing function for X According to the IPT Theorem (Theorem 5), the left-continuous inverse F to F is a representing function The motivating idea behind a representing function R is the use we put F to in proving Theorem 6, namely, if you want to prove something about X, it may be helpful to try representing X as R(U) for a standard uniform variable U Theorem Suppose R is a representing function for X and Y := T (X) is a transformation of X () If T is nondecreasing, then the mapping u T ( R(u) ) is a representing function for Y (2) If T is nonincreasing, then the mapping u T ( R( u) ) is a representing function for Y Proof () The mapping u T ( R(u) ) is nondecreasing in u and for U Uniform(, ), R(U) X = T ( R(U) ) T (X) = Y (2) In this case the mapping u T ( R( u) ) is nondecreasing in u for U Uniform(, ), U U = R( U) R(U) X = T ( R( U) ) T (X) = Y (R) R is nondecreasing (R2) U Uniform(, ) = R(U) X The theorem covers the important special case where T (x) = a+bx; this transformation is nondecreasing if b, and nonincreasing if b There is always at least one representing function for X, namely F Are there any others? That question is answered by: Theorem 2 Suppose X has df F and left-continuous inverse df F A mapping R from (, ) to R is a representing function for X if and only if F (u) R(u) F (u+) for all u (, ) F (u) F (u+) Consequently F is the only representing function iff F is strictly increasing over { x R : < F (x) < } (see Exercise ) Proof ( =) Suppose () holds (R) holds: Indeed, suppose < u < w < Then R(u) F (u+) (by () for u) F (w) R(w) (since F is nondecreasing) (by () for w) (R2) holds: Indeed, suppose U Uniform(, ) Then F (U) X I am going to show that P [ R(U) = F (U) ] = ; (2) by Exercise 2 this implies R(U) F (U) and hence R(U) X, as required To get (2), let J = {u (, ) : F (u) F (u+) } be the set of jumps of F Exercise 9 asserts that J is countable Thus P [ R(U) F (U) ] P [ U J ] (by ()) = P [ U = u ] = (since P [ U = u ] = for all u) u J u F () 2 2 2

2 (R) R is nondecreasing (R2) U Uniform(, ) = R(U) X (): F (u) R(u) F (u+) (5): u F (x) F (u) x (R) R is nondecreasing (R2) U Uniform(, ) = R(U) X (): F (u) R(u) F (u+) (= ) Let R be a representing function for X, and let U Uniform(, ) F (u) R(u) for all u (, ): Indeed, let u (, ) be given By the switching formula (5), F (u) R(u) u F ( R(u) ) Now use F ( R(u) ) = P [ X R(u) ] (since X has df F ) = P [ R(U) R(u) ] (by (R2)) P [ U u ] (by (R)) = u (since U is uniform) R(u) F (u+) for all u (, ): Indeed, let u (, ) be given By Exercise 8, F (u+) R(u) u F ( ((R(u)) ) Now use F ( (R(u)) ) = P [ X < R(u) ] = P [ R(U) < R(u) ] P [U < u] = u As the proof pointed out, there can be at most countably many values of u such that F (u) < F (u+) Example Suppose X takes the values, /2, and with probabilities /3 each We have seen that F has the following graph: F (u) u Consequently R: (, ) R is a representing function for X if and only if, if < u < /3, r, if u = /3, R(u) = /2, if /3 < u < 2/3, r 2, if u = 2/3,, if 2/3 < u < for some numbers r [, /2] and r 2 [/2, ] Suppose R is a representing function for a random variable X with df F Let n be a positive integer and let U, U 2,, U n be independent random variables, each uniformly distributed over (, ) Then X := R(U ), X 2 := R(U 2 ),, X n := R(U n ) are independent and each distributed like X; in brief, X,, X n is a random sample of size n from F Now let X (), X (2),, X (n) be the random variables resulting from arranging the X i s in increasing order; these are called the order statistics for the X i s Similarly, let U () U (2) U (n) be the order statistics for the U i s Since R is nondecreasing we have X () := R(U () ), X (2) := R(U (2) ),, X (n) := R(U (n) ) Consequently to study properties of order statistics, it often suffices to first work out the uniform case (ie, for X U) and then transform the result through R This is a standard technique 2 4

3 9:3 //2 Quantiles We turn now to the quantiles of a random variable X Here are a couple of examples to motivate the general definition given below Case A: X N(, ) Area u x Area u Case B: X Uniform on, 2, 3 /3 /3 /3 2 In case A, X has a density For u (, ), the u th -quantile of X is defined to be the number x such that the area under the density to the left of x equals u, or, equivalently, the area to the right of x equals u This is the same as requiring P [ X x ] = u and P [ X x ] = u (3) In case B, X has a probability mass function For u = 5, the u th -quantile, or median, of X should clearly be taken to be x = However, (3) doesn t hold for this u and x, rather we have P [ X x ] u and P [ X x ] u (4) We make this the general definition For any random variable X, be it continuous, discrete, or whatever, a u th -quantile of X is defined to be a number x such that (4) holds According to the following theorem, there is always at least one such x; in some situations (as in Case B above, with u = /3 or u = 2/3) there may be more than one Obviously (3) always implies (4) However, (4) implies (3) only when P [ X = x ] = ; (5) see Exercise 3 A mapping Q from (, ) is called a quantile function for X if Q(u) is a u th -quantile for X, for all u (, ) 2 5 Theorem 2: R: (, ) R is a representing function for a random variable X with df F iff F (u) R(u) F (u+) for all u (, ) x is a u th -quantile for X iff P [ X x ] u and P [ X x ] u Q: (, ) R is a quantile function for X iff Q(u) is a u th -quantile for each u (, ) Theorem 3 Let X be a random variable A mapping Q from (, ) to R is a quantile function for X if and only if Q is a representing function for X Proof Let F be the df of X and F the left-continuous inverse to F A number x is a u th quantile for X if and only and u P [ X x] = F (x) F (u) x (6) u P [ X x] = P [ X < x ] = F (x ) u F (x ) F (u+) x; (7) here (6) used the switching formula (5) and (7) used the alternate switching formula given in Exercise 8 Consequently, Q is a quantile function for X F (u) Q(u) F (u+) for all u (, ) Q is a representing function for X, the last step following from Theorem 2 Theorems and 3 imply Theorem 4 Suppose Q is a quantile function for X and Y = T (X) () If T is nondecreasing, then the mapping u T ( Q(u) ) is a quantile function for Y (2) If T is nonincreasing, then the mapping u T ( Q( u) ) is a quantile function for Y 2 6

4 The Tukey family For λ (, ) let R λ : (, ) R be defined by u λ ( u) λ, if λ R λ (u) := λ ( u ) (8) log, if λ = u for < u < Note that d du R λ(u) = u λ + ( u) λ > for each u, so R λ is continuous and strictly increasing Consequently if U Uniform(, ), then X λ := R λ (U) is a random variable having R λ as its (unique) representing (= quantile) function The distribution of X λ is called the Tukey distribution T(λ) with shape parameter λ (and scale parameter ) The Tukey family is { T(λ) : < λ < } This family has a number of interesting/useful properties It is very easy to simulate a draw from T(λ): you just take a uniform variate u and compute R λ (u) The Tukey family is therefore well-suited for empirical robustness studies, and that is why Tukey introduced it 2 The distributions vary smoothly with λ This is clear for λ Moreover lim R u λ ( u) λ λ(u) = lim λ λ λ = lim λ d dλ (uλ ( u) λ ) d dλ λ u λ log u ( u) λ log( u) = lim λ ( u ) = log = R (u) u In statistics, R is known as logit transformation 2 7 (by l Hospital s rule) R λ (u) = ( u λ ( u) λ) /λ for λ R (u) = log ( u/( u) ) 3 The Tukey family contains (or almost contains) some common distributions For λ =, we have R (u) = u ( u) = 2u for each u Thus X = R (U) Uniform(, ) R (u) T(4) is very close to N(, 2); see Figure 4 below u For any λ, the df F λ of X λ is just the ordinary mathematical inverse R λ to the continuous strictly increasing function R λ, so F λ (x) is the u such that x = R λ (u) For λ = we can get a closed form expression for F (x), as follows: ( u ) x = R (u) = log = u u u = ex = u = ex + e x ; thus F (x) = + e x (9) for < x < Since F (x) is continuously differentiable in x, the distribution has a density which we can find by differentiating the df: f (x) := d dx F (x) = e x ( + e x ) 2 = F (x) ( F (x) ), () again for < x < This distribution is called the (standard) logistic distribution T( ) is very close to the distribution of πt, where T has a t-distribution with degree of freedom; see Figure 5 below 4 As λ goes from to (and the distribution goes (modulo scaling) from uniform, to almost normal, to logistic, to almost t ), the tails of the T(λ) distribution go from very light to very heavy This is another reason why the family is good for robustness studies 2 8

5 9:3 //2 Q/Q-plots The distributions of two random variables are often compared by making a simultaneous plot of their dfs, or densities, or probability mass functions This section talks about another way to make the comparison, the so-called Q/Q-plot, in which the quantiles of one of the variables are ploted against the corresponding quantiles of the other variable To simplify the discussion, suppose that all quantile functions involved are unique, so we can talk about the u th -quantile, instead of just a u th -quantile Let then X be a random variable with df F and quantile function Q = F, and, similarly, let X 2 be a random variable with df F 2 and quantile function Q 2 = F2 A plot of the points ( Q (u), Q 2 (u) ) for u in (some subinterval) of (, ) is called a Q/Q-plot of X 2 against X, or, equivalently, of F 2 against F, or of Q 2 against Q As in the illustration below, it is good practice to include a probability axis showing the range and spacing of the u s covered by the plot Quantiles of X Probabilities Figure Q/Q-plot of X 2 χ 2 3 versus X N(, ) (Q (5), Q 2 (5)) (Q (25), Q 2 (25)) Quantiles of X (Q (75), Q 2 (75)) Two special cases are worth noting (A) if X 2 is standard uniform, then the plot displays ( Q (u), u ) for u (, ); this is essentially just a plot of the df of X (B) if X is standard uniform, then the plot displays ( u, Q 2 (u) ) for u (, ); this is a graph of the inverse df F Interpreting Q/Q-plots Suppose X and X 2 are two random variables such that X 2 a + bx ( for some constants a and b with b > ; this says that the distribution of X 2 is obtained from that of X by a change of scale (multiplication by b) and a change in location (addition of a) Let Q be the quantile function for X Since the transformation x a + bx is increasing, Theorem 4 implies that the quantile function for X 2 is given by Q 2 (u) = a + bq (u) (2 Consequently a Q/Q-plot of X 2 against X is simply a straight line with Q 2 -intercept a and slope b: Quantiles of X2 Figure 2: Q/Q-plot of X 2 a + bx against X slope b Q 2 -intercept a Quantiles of X This is one of the primary reasons why Q/Q-plots are of interest The Q/Q-plot in Figure is not a straight line However, at least over the range of probabilities covered in that figure, the plot is not too far from a straight line with intercept a and slope b (for what values of a and b?); that means that the so-called χ 2 3 distribution is approximately the same as that of a + bz for a standard normal random variable Z 2

6 We have seen that linearity in a Q/Q-plot means that the distributions of the two variables involved are related by a change in location and scale, in the sense that (2) and, equivalently, () hold What does curvature mean? Consider the following three Q/Q-plots; in each plot the quantiles of some random variable X 2 are plotted against the quantiles of some X Figure 4 Q-Q plot of Tukey (4) vs Standard normal Probabilities (A) Figure 3: Three Q/Q-plots (B) In case (A), the quantiles of X 2 grow ever more rapidly than do those of X as u tends to and to ; this means that X 2 has heavier tails than does X In case (B), X 2 has lighter tails than X In case (C), the right tail of X 2 is heavier than that of X, but the left tail is lighter Looking back at Figure, you can see that the right tail of the χ 2 3 is somewhat heavier than normal, and the left tail is somewhat lighter The Tukey family, revisited The next three pages exhibit Q/Qplots for various members of the Tukey family In each case you should think about what the plots say about the Tukey distributions In Figure 4 the solid, nearly-diagonal line is the Q/Q-plot of T(4) versus standard normal The dotted line is the least squares linear fit to the solid line; the slope of the least squares line is almost 2 In Figure 5 the solid line is the Q/Q-plot of T( ) versus the t distribution with degree of freedom The dotted line is the straight line with Q 2 -intercept and slope π Figure 6 is a simultaneous Q/Q-plot of the Tukey distributions for λ = to by 2, each against standard normal (C) Tukey (4) quantiles Normal quantiles 2 2 2

7 9:3 //2 Figure 5 Q-Q plot of Tukey (-) vs t with df Probabilities Figure 6 Q-Q plot of Tukey vs Standard Normal Probabilities Tukey quantiles Tukey quantiles la= 2 la= 4 la= 6 la= 8 la= t quantiles -2-2 Normal quantiles

8 Exercise Prove the claim made after the statement of Theorem 2, namely, that F (u) = F (u+) for all u (, ) F is strictly increasing over { x R : < F (x) < } [Hint For =, suppose x = F (u) satisfies F (x) < Argue that F (u+) y for each y > x] For two random variables Y and Z, the notation Y Z means P [ Y B ] = P [ Z B ] for each subset B of R (3) (technically, B needs to be a so-called Borel measurable set, but we ll ignore that in this course) It is sufficient that (3) hold for sets B of the form (, x] for x R, ie, that Y and Z have the same df Exercise 2 (a) Suppose Y and Z are two random variables such that Y Z Show that T (Y ) T (Z) for any transformation T (b) Suppose Y and Z are defined on the same probability space Show that if P [ Y = Z ] =, then Y Z Exercise 3 Show that (3) holds if and only if both (4) and (5) hold Exercise 4 The standard exponential distribution has density { e x, for x, f(x) =, for x < What are its quantiles? Exercise 5 Suppose Z is a standard normal random variable, with density φ(z) = exp( z 2 /2)/ 2π for < z < (a) Show that P [Z z] = ( + o())φ(z)/z as z ; here o() denotes a quantity that tends to as z [Hint: integrate by parts] (b) Let q α be the ( α) th -quantile of Z Show that q α = 2 log(/α) log(log(/α)) log(4π) + o() (4) as α ; here o() denotes a quantity that tends to as α 2 5 Exercise 6 The text pointed out several reasons why the Tukey family is good for robustness studies Give at least one reason why it is not good Exercise 7 Show that T() and T(2) are the same distribution, up to a change in scale Is there a generalization of this fact? Exercise 8 Below Figure, the text states that a plot of (Q (u), u) for u (, ) is essentially just a plot of the df of X The term essentially just was used because the two plots can in fact be slightly different Explain how Exercise 9 Figure 3 shows the Q/Q-plots for three random variables, X, X 2, and X 3, each plotted against Z N(, ) The plots are drawn to different scales In scrambled order, the distributions of the X i s are: (i) standard uniform, (ii) standard exponential, and (iii) t with degree of freedom Match the plots with the distributions Exercise Let X be a standard exponential random variable (see Exercise 4) and let X 2 be a random variable distributed like X (i) Draw a Q/Q-plot of X 2 against X, by plotting Q 2 (u) against Q (u) (ii) Now plot Q 2 ( u) versus Q (u) What is the general lesson to be learned from (i) and (ii)? Exercise Let Q be the quantile function of the t-distribution with degree of freedom, with density / ( π(+x 2 ) ) for < x <, and let Q 2 be the quantile function of the Tukey distribution T( ) with parameter λ = (a) Show that r(u) := Q 2 (u)/q (u) is a nondecreasing function of u for /2 < u < (this is hard to do analytically, but easy to demonstrate by a graph) with r(/2+) = 8/π and r( ) = π (this is not difficult) (b) Use the result of part (a) to explain why the Q/Q-plot in Figure 5 looks like a straight line with Q 2 -intercept and slope π 2 6

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

More information

Microeconomic Theory: Basic Math Concepts

Microeconomic Theory: Basic Math Concepts Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts

More information

2.2 Derivative as a Function

2.2 Derivative as a Function 2.2 Derivative as a Function Recall that we defined the derivative as f (a) = lim h 0 f(a + h) f(a) h But since a is really just an arbitrary number that represents an x-value, why don t we just use x

More information

Review of Fundamental Mathematics

Review of Fundamental Mathematics Review of Fundamental Mathematics As explained in the Preface and in Chapter 1 of your textbook, managerial economics applies microeconomic theory to business decision making. The decision-making tools

More information

Random variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8.

Random variables P(X = 3) = P(X = 3) = 1 8, P(X = 1) = P(X = 1) = 3 8. Random variables Remark on Notations 1. When X is a number chosen uniformly from a data set, What I call P(X = k) is called Freq[k, X] in the courseware. 2. When X is a random variable, what I call F ()

More information

Simple linear regression

Simple linear regression Simple linear regression Introduction Simple linear regression is a statistical method for obtaining a formula to predict values of one variable from another where there is a causal relationship between

More information

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a 88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

More information

A Primer on Mathematical Statistics and Univariate Distributions; The Normal Distribution; The GLM with the Normal Distribution

A Primer on Mathematical Statistics and Univariate Distributions; The Normal Distribution; The GLM with the Normal Distribution A Primer on Mathematical Statistics and Univariate Distributions; The Normal Distribution; The GLM with the Normal Distribution PSYC 943 (930): Fundamentals of Multivariate Modeling Lecture 4: September

More information

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

More information

Lecture 7: Continuous Random Variables

Lecture 7: Continuous Random Variables Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider

More information

1 if 1 x 0 1 if 0 x 1

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

1 Sufficient statistics

1 Sufficient statistics 1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =

More information

3 Some Integer Functions

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

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL

FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint

More information

Lecture Notes on Elasticity of Substitution

Lecture Notes on Elasticity of Substitution Lecture Notes on Elasticity of Substitution Ted Bergstrom, UCSB Economics 210A March 3, 2011 Today s featured guest is the elasticity of substitution. Elasticity of a function of a single variable Before

More information

BNG 202 Biomechanics Lab. Descriptive statistics and probability distributions I

BNG 202 Biomechanics Lab. Descriptive statistics and probability distributions I BNG 202 Biomechanics Lab Descriptive statistics and probability distributions I Overview The overall goal of this short course in statistics is to provide an introduction to descriptive and inferential

More information

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur

Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce

More information

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

More information

Scalar Valued Functions of Several Variables; the Gradient Vector

Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,

More information

1.7 Graphs of Functions

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

Chapter 3 RANDOM VARIATE GENERATION

Chapter 3 RANDOM VARIATE GENERATION Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.

More information

Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS

Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS DUSP 11.203 Frank Levy Microeconomics Sept. 16, 2010 NOTES ON CALCULUS AND UTILITY FUNCTIONS These notes have three purposes: 1) To explain why some simple calculus formulae are useful in understanding

More information

Summary of Formulas and Concepts. Descriptive Statistics (Ch. 1-4)

Summary of Formulas and Concepts. Descriptive Statistics (Ch. 1-4) Summary of Formulas and Concepts Descriptive Statistics (Ch. 1-4) Definitions Population: The complete set of numerical information on a particular quantity in which an investigator is interested. We assume

More information

36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?

36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous? 36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this

More information

LOGNORMAL MODEL FOR STOCK PRICES

LOGNORMAL MODEL FOR STOCK PRICES LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as

More information

Exploratory Data Analysis

Exploratory Data Analysis Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction

More information

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].

The sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1]. Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real

More information

Note on growth and growth accounting

Note on growth and growth accounting CHAPTER 0 Note on growth and growth accounting 1. Growth and the growth rate In this section aspects of the mathematical concept of the rate of growth used in growth models and in the empirical analysis

More information

Mathematical Induction

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

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

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

E3: PROBABILITY AND STATISTICS lecture notes

E3: 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 information

Physics Lab Report Guidelines

Physics Lab Report Guidelines Physics Lab Report Guidelines Summary The following is an outline of the requirements for a physics lab report. A. Experimental Description 1. Provide a statement of the physical theory or principle observed

More information

Chapter 4 Lecture Notes

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

Unified Lecture # 4 Vectors

Unified Lecture # 4 Vectors Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,

More information

Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

More information

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

More information

CHAPTER 7 INTRODUCTION TO SAMPLING DISTRIBUTIONS

CHAPTER 7 INTRODUCTION TO SAMPLING DISTRIBUTIONS CHAPTER 7 INTRODUCTION TO SAMPLING DISTRIBUTIONS CENTRAL LIMIT THEOREM (SECTION 7.2 OF UNDERSTANDABLE STATISTICS) The Central Limit Theorem says that if x is a random variable with any distribution having

More information

or, put slightly differently, the profit maximizing condition is for marginal revenue to equal marginal cost:

or, put slightly differently, the profit maximizing condition is for marginal revenue to equal marginal cost: Chapter 9 Lecture Notes 1 Economics 35: Intermediate Microeconomics Notes and Sample Questions Chapter 9: Profit Maximization Profit Maximization The basic assumption here is that firms are profit maximizing.

More information

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization

Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization Lecture 2. Marginal Functions, Average Functions, Elasticity, the Marginal Principle, and Constrained Optimization 2.1. Introduction Suppose that an economic relationship can be described by a real-valued

More information

Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way

Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

More information

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.

Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015. Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x

More information

1 The Brownian bridge construction

1 The Brownian bridge construction The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof

More information

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS

NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document

More information

Handout #1: Mathematical Reasoning

Handout #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 information

5 Numerical Differentiation

5 Numerical Differentiation D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

LS.6 Solution Matrices

LS.6 Solution Matrices LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

More information

Chapter 27: Taxation. 27.1: Introduction. 27.2: The Two Prices with a Tax. 27.2: The Pre-Tax Position

Chapter 27: Taxation. 27.1: Introduction. 27.2: The Two Prices with a Tax. 27.2: The Pre-Tax Position Chapter 27: Taxation 27.1: Introduction We consider the effect of taxation on some good on the market for that good. We ask the questions: who pays the tax? what effect does it have on the equilibrium

More information

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding

More information

What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of y = mx + b.

What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of y = mx + b. PRIMARY CONTENT MODULE Algebra - Linear Equations & Inequalities T-37/H-37 What does the number m in y = mx + b measure? To find out, suppose (x 1, y 1 ) and (x 2, y 2 ) are two points on the graph of

More information

The Taxman Game. Robert K. Moniot September 5, 2003

The Taxman Game. Robert K. Moniot September 5, 2003 The Taxman Game Robert K. Moniot September 5, 2003 1 Introduction Want to know how to beat the taxman? Legally, that is? Read on, and we will explore this cute little mathematical game. The taxman game

More information

Practice with Proofs

Practice with Proofs Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

More information

Mathematics for Econometrics, Fourth Edition

Mathematics for Econometrics, Fourth Edition Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents

More information

Math 1B, lecture 5: area and volume

Math 1B, lecture 5: area and volume Math B, lecture 5: area and volume Nathan Pflueger 6 September 2 Introduction This lecture and the next will be concerned with the computation of areas of regions in the plane, and volumes of regions in

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

Lecture 16 : Relations and Functions DRAFT

Lecture 16 : Relations and Functions DRAFT CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

More information

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

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

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.

Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S. Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a

More information

This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.

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

Fixed Point Theorems

Fixed Point Theorems Fixed Point Theorems Definition: Let X be a set and let T : 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

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

More information

Gamma Distribution Fitting

Gamma Distribution Fitting Chapter 552 Gamma Distribution Fitting Introduction This module fits the gamma probability distributions to a complete or censored set of individual or grouped data values. It outputs various statistics

More information

Session 7 Bivariate Data and Analysis

Session 7 Bivariate Data and Analysis Session 7 Bivariate Data and Analysis Key Terms for This Session Previously Introduced mean standard deviation New in This Session association bivariate analysis contingency table co-variation least squares

More information

CA200 Quantitative Analysis for Business Decisions. File name: CA200_Section_04A_StatisticsIntroduction

CA200 Quantitative Analysis for Business Decisions. File name: CA200_Section_04A_StatisticsIntroduction CA200 Quantitative Analysis for Business Decisions File name: CA200_Section_04A_StatisticsIntroduction Table of Contents 4. Introduction to Statistics... 1 4.1 Overview... 3 4.2 Discrete or continuous

More information

Math 4310 Handout - Quotient Vector Spaces

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

3. Mathematical Induction

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 information

Math 181 Handout 16. Rich Schwartz. March 9, 2010

Math 181 Handout 16. Rich Schwartz. March 9, 2010 Math 8 Handout 6 Rich Schwartz March 9, 200 The purpose of this handout is to describe continued fractions and their connection to hyperbolic geometry. The Gauss Map Given any x (0, ) we define γ(x) =

More information

The Graphical Method: An Example

The Graphical Method: An Example The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,

More information

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem

IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have

More information

Logo Symmetry Learning Task. Unit 5

Logo Symmetry Learning Task. Unit 5 Logo Symmetry Learning Task Unit 5 Course Mathematics I: Algebra, Geometry, Statistics Overview The Logo Symmetry Learning Task explores graph symmetry and odd and even functions. Students are asked to

More information

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?

9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? 9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.

More information

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

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

the points are called control points approximating curve

the points are called control points approximating curve Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.

More information

Maximum Likelihood Estimation

Maximum Likelihood Estimation Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for

More information

3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

3.2. Solving quadratic equations. Introduction. Prerequisites. Learning Outcomes. Learning Style Solving quadratic equations 3.2 Introduction A quadratic equation is one which can be written in the form ax 2 + bx + c = 0 where a, b and c are numbers and x is the unknown whose value(s) we wish to find.

More information

Continued Fractions and the Euclidean Algorithm

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

Section 1.4. Difference Equations

Section 1.4. Difference Equations Difference Equations to Differential Equations Section 1.4 Difference Equations At this point almost all of our sequences have had explicit formulas for their terms. That is, we have looked mainly at sequences

More information

Notes on Continuous Random Variables

Notes on Continuous Random Variables Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes

More information

In order to describe motion you need to describe the following properties.

In order to describe motion you need to describe the following properties. Chapter 2 One Dimensional Kinematics How would you describe the following motion? Ex: random 1-D path speeding up and slowing down In order to describe motion you need to describe the following properties.

More information

8 Divisibility and prime numbers

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

4. Continuous Random Variables, the Pareto and Normal Distributions

4. Continuous Random Variables, the Pareto and Normal Distributions 4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random

More information

Math 461 Fall 2006 Test 2 Solutions

Math 461 Fall 2006 Test 2 Solutions Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two

More information

A Determination of g, the Acceleration Due to Gravity, from Newton's Laws of Motion

A Determination of g, the Acceleration Due to Gravity, from Newton's Laws of Motion A Determination of g, the Acceleration Due to Gravity, from Newton's Laws of Motion Objective In the experiment you will determine the cart acceleration, a, and the friction force, f, experimentally for

More information

Binomial lattice model for stock prices

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

Math 319 Problem Set #3 Solution 21 February 2002

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

Math 120 Final Exam Practice Problems, Form: A

Math 120 Final Exam Practice Problems, Form: A Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,

More information

Year 9 set 1 Mathematics notes, to accompany the 9H book.

Year 9 set 1 Mathematics notes, to accompany the 9H book. Part 1: Year 9 set 1 Mathematics notes, to accompany the 9H book. equations 1. (p.1), 1.6 (p. 44), 4.6 (p.196) sequences 3. (p.115) Pupils use the Elmwood Press Essential Maths book by David Raymer (9H

More information

LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL

LINEAR INEQUALITIES. Mathematics is the art of saying many things in many different ways. MAXWELL Chapter 6 LINEAR INEQUALITIES 6.1 Introduction Mathematics is the art of saying many things in many different ways. MAXWELL In earlier classes, we have studied equations in one variable and two variables

More information

Slope and Rate of Change

Slope and Rate of Change Chapter 1 Slope and Rate of Change Chapter Summary and Goal This chapter will start with a discussion of slopes and the tangent line. This will rapidly lead to heuristic developments of limits and the

More information

Correlation key concepts:

Correlation key concepts: CORRELATION Correlation key concepts: Types of correlation Methods of studying correlation a) Scatter diagram b) Karl pearson s coefficient of correlation c) Spearman s Rank correlation coefficient d)

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

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

2.2. Instantaneous Velocity

2.2. Instantaneous Velocity 2.2. Instantaneous Velocity toc Assuming that your are not familiar with the technical aspects of this section, when you think about it, your knowledge of velocity is limited. In terms of your own mathematical

More information

PLOTTING DATA AND INTERPRETING GRAPHS

PLOTTING DATA AND INTERPRETING GRAPHS PLOTTING DATA AND INTERPRETING GRAPHS Fundamentals of Graphing One of the most important sets of skills in science and mathematics is the ability to construct graphs and to interpret the information they

More information

The last three chapters introduced three major proof techniques: direct,

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

MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables

MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables MATH 10: Elementary Statistics and Probability Chapter 5: Continuous Random Variables Tony Pourmohamad Department of Mathematics De Anza College Spring 2015 Objectives By the end of this set of slides,

More information

Week 4: Standard Error and Confidence Intervals

Week 4: Standard Error and Confidence Intervals Health Sciences M.Sc. Programme Applied Biostatistics Week 4: Standard Error and Confidence Intervals Sampling Most research data come from subjects we think of as samples drawn from a larger population.

More information

Nonparametric adaptive age replacement with a one-cycle criterion

Nonparametric adaptive age replacement with a one-cycle criterion Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk

More information

9. Momentum and Collisions in One Dimension*

9. Momentum and Collisions in One Dimension* 9. Momentum and Collisions in One Dimension* The motion of objects in collision is difficult to analyze with force concepts or conservation of energy alone. When two objects collide, Newton s third law

More information

You know from calculus that functions play a fundamental role in mathematics.

You know from calculus that functions play a fundamental role in mathematics. CHPTER 12 Functions You know from calculus that functions play a fundamental role in mathematics. You likely view a function as a kind of formula that describes a relationship between two (or more) quantities.

More information

Introduction to Probability

Introduction to Probability Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence

More information