Solutions Homework 7 November 16, 2015

Size: px
Start display at page:

Download "Solutions Homework 7 November 16, 2015"

Transcription

1 Solutions Homework 7 November 6, 25 Solution to Exercise 2..5 If x and p < q, then x p x q. This follows since the exponential function is monotone increasing, so x p exp[p log x] exp[q log x] x q since p log x q log x when p < q and log x, i.e. x. Thus E[ X p ] E[ X p I [,] ( X )] + E[ X p I (, ) ( X )] E[ I [,] ( X )] + E[ X q I (, ) ( X )] P [ X ] + E[ X q ]. Clearly, E[ X q ] < implies E[ X p ] <. Solution to Exercise 2..4 (a) This problem seems to very difficult for students, but I claim it is quite easy if one proceeds by visualizing the distribution and the geometry of the transformations needed to satisfy the requirements. The distribution is concentrated on three points which determine a plane (they re obviously not collinear), and by Proposition the range space of the covariance matrix has to be this plane where the distribution lives. All we have to do to construct A is to find (firstly) a matrix which diagonalizes the covariance (which one can do by a rotation around the x-axis, as is clear from visualizing the distribution), then follow with a transformation (multiply on the left with a matrix) that rescales things. The distribution is shown in Figure. The requirement Cov[AX + b] diag(,, ) means that the support of the transformed distribution will be in a plane which is parallel to the xy plane (since the z-component has variance ). A simple rotation around the x-axis by 45 will bring the point at (,, ) down to the y-axis while leaving the other two points unchanged. The rotation matrix would be 2/2 2/2 2/2. 2/2 (How did I know this? I recall that cos and sin of 45 are 2/2, and I just fudged in the signs so the z component would disappear). In fact, we

2 2 don t need to use this one; the following will work: A /2 /2 /2 /2. Then we have A, and A (or more correctly, the linear transformation represented by the matrix A ) leaves (,, ) and (,, ) unchanged, so Law[A X] 3 { δ(,,) + δ (,,) + δ (,,) }. Now there is clearly correlation in these three points: the least squares fit is going to have a downward trend. We can get rid of the correlation by rotating in the xy-plane by 45 so that we go from an L shape to a V shape. Again, we don t actually have to do the rotation and keep track of the 2 s. It suffices to move (,, ) to (,, ) and (,, ) to (,, ). Thus, we use Then we have A 2. Law[A 2 A X] 3 { δ(,,) + δ (,,) + δ (,,) }. Thus, E[A 2 A X] /3 2/3, + +

3 3 and E[(A 2 A X)(A 2 A X) T ] /3 /3 /3 /3 [ ] + [ ] + [ ] 2/3 2/3, + /3 so Cov[A 2 A X] 2/3 2/3 2/3 2/9. 2/3 [ 2/3 ] We are almost there we have a diagonal covariance matrix but the diagonal entries are not (,, ). Ok, but this can be accomplished with a simple rescaling. Letting 3/2 A 3 3/ 2, then the desired matrix and translation vector are A A 3 A 2 A

4 4 b A 3 3/2 3/2 3/ /2 3/ 2 3/ /3 2/ 2 Note that the minus sign comes into b because adding b has to amount to subtracting the mean of AX. Let s check it all, in Splus: > Amatrix(c(,,,,.5,-.5,,.5,.5),ncol3) > A [,] [,2] [,3] [,].. [2,].5.5 [3,] > A2matrix(c(,,,-,,,,,),ncol3) > A2 [,] [,2] [,3] [,] - [2,] [3,] > A3diag(c(sqrt(3/2),3/sqrt(2),)) > A3 [,] [,2] [,3] [,] [2,] [3,].. > AA3%*%A2%*%A > A [,] [,2] [,3] [,] [2,] [3,]... > Xmatrix(c(,,,,,,,,),ncol3) > X.,

5 [,] [,2] [,3] [,] [2,] [3,] > \#note that the points where the distibution lives form > \#the columns of X > YA%*%X > b-apply(y,,mean) > YY+matrix(b,nrow3,ncol3) > Y point point point [,] [2,] [3,]... > \# we know Y is centered, so just compute average of outer products > \# of the columns to get the covariance. By the way, the outer > \# product of 2 vectors x and y is x%*%t(y) (in Splus-ese), or just > \# outer(x,y). > covymatrix(,nrow3,ncol3) > for(j in :3) covycovy+outer(y[,j],y[,j]) > covycovy/3 > covy > \# Voila! (b) Now, we suppose A is any 3 3 matrix and b and 3-dimensional vector such that if Y AX +b satisfies (i) E[Y ] and (ii) Cov[Y ] diag(,, ). We are supposed to show that the components of Y are uncorrelated but not independent. The uncorratedness is immediate since the covariance matrix is diagonal. To show it they are not independent, consider that the support of the distribution of X is 3 points. Assuming that the matrix A is nonsingular (so the linear transformation it represents is bijective or one to one and onto), then the support of Y is 3 points. Now if a probability measure is a product measure we would look at the marginal distributions which must be discrete and have as their support, 2, or 3 points, and then the product 5

6 6 measure would be supported on some number of points which is obtained by multiplying the number of points of support together. Since Law[Y ] is supported on 3 points and 3 is a prime, then two of the marginals must be supported on point and the other on 3 points. Then the two marginals supported on point are degenerate and have variance, but we see that two of the marginals have positive variance (since Cov[Y ] diag(,, )) which is a contradiction. Thus, Law[Y ] is not a product measure. Solution to Exercise 2..2: (a) The claim is that ψ(t) t log t t, which we should verify. The figure shows a plot of ψ(t) and t and it appears that the following are true: (i) t is tangent to ψ(t) at t ; (ii) ψ(t) is a strictly convex function; (iii) it is always above its tangent. Let s verify these three claims. We claim that the function ψ(t) t log t is strictly convex. The first and second derivatives are ψ (t) log t +, ψ (t) /t. As the second derivative is strictly positive, the claim (ii) follows. Also, ψ() and ψ (), so the line y t is the tangent at t (since the values and slopes agree). Claim (iii) is a general property of convex functions, but it is clear in case the function is differentiable (as it is here) since then we know the first derivative is increasing, so ζ(t) ψ(t) (t ) satisfies ζ (), ζ (t) < for t <, and ζ (t) > for t >, so ζ has a unique minimum at t. To show the integral defining K(Q, P ) exists, we will show that the integral of the negative part is finite. Now we can t do anything with log ( ) dq dq until we know it exists because none of our theorems apply. As mentioned in class, we can show the integral of the negative part is finite. There are a couple of trivial little facts about negative parts we need: Trivial Fact #. f g then f g. Trivial Fact #2. if f then (fg) fg.

7 7 So, we have ( [ ]) dq log dq. ( [ ]) dq dq log by Proposition.4.2 (a) ( [ ] ) dq dq log using Trivial Fact #2 since dq ( ) dq using Trivial Fact # and the inequality on t log t ( ) since dq (b) Now we can apply the usual results on integration as in Proposition.2.5 since we have shown the integral is well defined. ( ) dq ( ) dq dq log dq log ( ) dq by the inequality proved above dq dq. (c) Suppose K(Q, P ), and we will show P Q. Since ψ is strictly convex, by Jensen s inequality ( ) ( dq ) dq ψ ψ ψ(), with strict inequality if and only if dq is constant, P -a.s. One observes that the l.h.s. of the displayed inequality is K(Q, P ), and the r.h.s. is ψ ( dq)

8 8 log. Also, if dq is constant, P -a.s., then the constant must be because that s the integral of dq dq w.r.t. P. But, P -a.s., means Q P. Solution to Exercise 2.2. For any complex number z z +iz 2 it is clear that the modulus z z where z (z, z 2 ) is a 2-D vector. Therefore, the result will follow if we show that for any f : (Ω, F) (IR d, B d ), we have fdµ f dµ. It will be useful to have this more general result. If µ is a probability measure, then the result follows easily from Jensen s inequality. Note that the map ψ(x) x is convex since if t [, ], ψ (tx + ( t)y) tx + ( t)y tx + ( t)y t x + ( t) y tψ(x) + ( t)ψ(y). Thus, writing E[ ] in place of dµ and X in place of f we have ψ(e[x]) E[X] E[ψ(X)] E[ X ]. However, if µ is not a probability measure, this argument doesn t apply, and we are asked to prove the more general result. I have tried to find a simple proof, but it doesn t seem to exist. When you are stumped on some general result about integrals, think of simple functions. Let φ be a vector valued simple function, i.e. φ (φ,... φ d ) where each component function φ j is a simple function. For convenience, we can assume the sets A i in the representations of each φ j are the same: φ j i a ij I Ai. In a vector notation: φ i a i I Ai. Now by the triangle inequality, φdµ a i µ (A i ) i a i µ (A i ) i φ dµ,

9 which is the desired result. Now we consider a general vector valued function f. Writing f (f,..., f d ), we can find simple functions φ jn f j as n for each j, j d, and φ jn f j for all j and n. This latter inequality implies φ n f where φ n (φ n,..., φ dn ) is a vector valued simple function. Note that we can assume f dµ <, since otherwise the inequality we are trying to prove is trivial (assuming fdµ is defined; which for vector valued functions would require all components are finite, which would imply f dµ < anyway). Thus by DCT we have φ jn dµ f j dµ for j d, hence φ n dµ fdµ, and since ψ(x) x is a continuous function, we have 9 φ n dµ fdµ. Now it is easy to see that φ n is a simple function and φ n f, so by DCT φ n dµ f dµ. By the result we just proved for simple functions, we have φ n dµ φn dµ, so by the limiting results above we conclude fdµ f dµ. Solution to Exercise φ Y (v) E [ exp ( iv T Y )] E [ exp ( iv T (AX + b) )] E [ exp { i ( v T AX + v T b })] [ E exp {i ( A T v ) } T X exp { iv T b }] exp { iv T b } [ E exp {i ( A T v ) }] T X e ivt b φ X ( A T v ). The proof for the m.g.f. is basically the same - just take away the i in the derivation above.

10 Figure : Plot of the three points where the distribution in Exercise 2..4 lives. Note that the origin appears in the lower center of the diagram, the x-axis goes off to the right and the y-axis to the left.

11 x*log(x) x Figure 2: Plot of y x log(x) with line y x overlaid.

If g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get

If g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get 18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in

More information

Solutions Homework 6

Solutions Homework 6 1 Solutions Homework 6 October 26, 2015 Solution to Exercise 1.5.9: Part (a) is easy: we know E[X Y ] = k if X = k, a.s. The function φ(y) k is Borel measurable from the range space of Y to, and E[X Y

More information

Lines, parabolas, distances and inequalities an enrichment class

Lines, parabolas, distances and inequalities an enrichment class Lines, parabolas, distances and inequalities an enrichment class Finbarr Holland 1. Lines in the plane A line is a particular kind of subset of the plane R 2 = R R, and can be described as the set of ordered

More information

IEOR 4701: Stochastic Models in Financial Engineering. Summer 2007, Professor Whitt. SOLUTIONS to Homework Assignment 9: Brownian motion

IEOR 4701: Stochastic Models in Financial Engineering. Summer 2007, Professor Whitt. SOLUTIONS to Homework Assignment 9: Brownian motion IEOR 471: Stochastic Models in Financial Engineering Summer 27, Professor Whitt SOLUTIONS to Homework Assignment 9: Brownian motion In Ross, read Sections 1.1-1.3 and 1.6. (The total required reading there

More information

4 Expectation & the Lebesgue Theorems

4 Expectation & the Lebesgue Theorems STA 205: Probability & Measure Theory Robert L. Wolpert 4 Expectation & the Lebesgue Theorems Let X and {X n : n N} be random variables on a probability space (Ω,F,P). If X n (ω) X(ω) for each ω Ω, does

More information

4 Elementary matrices, continued

4 Elementary matrices, continued 4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. To repeat the recipe: These matrices are constructed by performing the given row

More information

Equations and Inequalities

Equations and Inequalities Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:

More information

(y 1, y 2 ) = 12 y3 1e y 1 y 2 /2, y 1 > 0, y 2 > 0 0, otherwise.

(y 1, y 2 ) = 12 y3 1e y 1 y 2 /2, y 1 > 0, y 2 > 0 0, otherwise. 54 We are given the marginal pdfs of Y and Y You should note that Y gamma(4, Y exponential( E(Y = 4, V (Y = 4, E(Y =, and V (Y = 4 (a With U = Y Y, we have E(U = E(Y Y = E(Y E(Y = 4 = (b Because Y and

More information

Jointly Distributed Random Variables

Jointly Distributed Random Variables Jointly Distributed Random Variables CE 311S What if there is more than one random variable we are interested in? How should you invest the extra money from your summer internship? To simplify matters,

More information

3 Integration and Expectation

3 Integration and Expectation 3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ

More information

4 Elementary matrices, continued

4 Elementary matrices, continued 4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed

More information

MATH 115, SUMMER 2012 LECTURE 12

MATH 115, SUMMER 2012 LECTURE 12 MATH 115, SUMMER 2012 LECTURE 12 JAMES MCIVOR - last time - we used hensel s lemma to go from roots of polynomial equations mod p to roots mod p 2, mod p 3, etc. - from there we can use CRT to construct

More information

Chapter 5. Chapter 5 sections

Chapter 5. Chapter 5 sections 1 / 43 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions

More information

CHAPTER 1 LINEAR EQUATIONS

CHAPTER 1 LINEAR EQUATIONS CHAPTER 1 LINEAR EQUATIONS Sec 1. Solving Linear Equations Kids began solving simple equations when they worked missing addends problems in first and second grades. They were given problems such as 4 +

More information

Review Solutions, Exam 2, Operations Research

Review Solutions, Exam 2, Operations Research Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To

More information

Expectation is a positive linear operator

Expectation is a positive linear operator Department of Mathematics Ma 3/103 KC Border Introduction to Probability and Statistics Winter 2017 Lecture 6: Expectation is a positive linear operator Relevant textbook passages: Pitman [3]: Chapter

More information

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers

ALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some

More information

OPTIMISATION /09 EXAM PREPARATION GUIDELINES

OPTIMISATION /09 EXAM PREPARATION GUIDELINES General: OPTIMISATION 2 2008/09 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and

More information

OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES

OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES General: OPTIMISATION 2007/8 EXAM PREPARATION GUIDELINES This points out some important directions for your revision. The exam is fully based on what was taught in class: lecture notes, handouts and homework.

More information

L p Spaces and Convexity

L p Spaces and Convexity L p Spaces and Convexity These notes largely follow the treatments in Royden, Real Analysis, and Rudin, Real & Complex Analysis. 1. Convex functions Let I R be an interval. For I open, we say a function

More information

Elementary Linear Algebra

Elementary Linear Algebra Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We

More information

Math Circles Intro to Complex Numbers Solutions Wednesday, March 21, Rich Dlin. Rich Dlin Math Circles / 27

Math Circles Intro to Complex Numbers Solutions Wednesday, March 21, Rich Dlin. Rich Dlin Math Circles / 27 Math Circles 2018 Intro to Complex Numbers Solutions Wednesday, March 21, 2018 Rich Dlin Rich Dlin Math Circles 2018 1 / 27 Today Today s Adventure Who is Rich Dlin? What do I need to know before we start?

More information

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015

Introductory Analysis 2 Spring 2010 Exam 1 February 11, 2015 Introductory Analysis 2 Spring 21 Exam 1 February 11, 215 Instructions: You may use any result from Chapter 2 of Royden s textbook, or from the first four chapters of Pugh s textbook, or anything seen

More information

MAT2342 : Introduction to Applied Linear Algebra Mike Newman, fall Projections. introduction

MAT2342 : Introduction to Applied Linear Algebra Mike Newman, fall Projections. introduction MAT4 : Introduction to Applied Linear Algebra Mike Newman fall 7 9. Projections introduction One reason to consider projections is to understand approximate solutions to linear systems. A common example

More information

The Multivariate Gaussian Distribution [DRAFT]

The Multivariate Gaussian Distribution [DRAFT] The Multivariate Gaussian Distribution DRAFT David S. Rosenberg Abstract This is a collection of a few key and standard results about multivariate Gaussian distributions. I have not included many proofs,

More information

Winter Camp 2009 Number Theory Tips and Tricks

Winter Camp 2009 Number Theory Tips and Tricks Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

Linear Algebra, Summer 2011, pt. 2

Linear Algebra, Summer 2011, pt. 2 Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................

More information

Basic Linear Algebra in MATLAB

Basic Linear Algebra in MATLAB Basic Linear Algebra in MATLAB 9.29 Optional Lecture 2 In the last optional lecture we learned the the basic type in MATLAB is a matrix of double precision floating point numbers. You learned a number

More information

Introduction to Matrices

Introduction to Matrices POLS 704 Introduction to Matrices Introduction to Matrices. The Cast of Characters A matrix is a rectangular array (i.e., a table) of numbers. For example, 2 3 X 4 5 6 (4 3) 7 8 9 0 0 0 Thismatrix,with4rowsand3columns,isoforder

More information

ISOMORPHISMS KEITH CONRAD

ISOMORPHISMS KEITH CONRAD ISOMORPHISMS KEITH CONRAD 1. Introduction Groups that are not literally the same may be structurally the same. An example of this idea from high school math is the relation between multiplication and addition

More information

The Multivariate Gaussian Distribution

The Multivariate Gaussian Distribution The Multivariate Gaussian Distribution Chuong B. Do October, 8 A vector-valued random variable X = T X X n is said to have a multivariate normal or Gaussian) distribution with mean µ R n and covariance

More information

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed

Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 18.466 Notes, March 4, 2013, R. Dudley Maximum likelihood estimation: actual or supposed 1. MLEs in exponential families Let f(x,θ) for x X and θ Θ be a likelihood function, that is, for present purposes,

More information

f( x) f( y). Functions which are not one-to-one are often called many-to-one. Take the domain and the range to both be all the real numbers:

f( x) f( y). Functions which are not one-to-one are often called many-to-one. Take the domain and the range to both be all the real numbers: I. UNIVARIATE CALCULUS Given two sets X and Y, a function is a rule that associates each member of X with exactly one member of Y. That is, some x goes in, and some y comes out. These notations are used

More information

Vectors. A vector is usually denoted in bold, like vector a, or sometimes it is denoted a, or many other deviations exist in various text books.

Vectors. A vector is usually denoted in bold, like vector a, or sometimes it is denoted a, or many other deviations exist in various text books. Vectors A Vector has Two properties Magnitude and Direction. That s a weirder concept than you think. A Vector does not necessarily start at a given point, but can float about, but still be the SAME vector.

More information

Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan. Section: NetID: Multiple Choice Question (30 questions in total, 4 points each)

Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan. Section: NetID: Multiple Choice Question (30 questions in total, 4 points each) Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan Section: NetID: Name: Multiple Choice Question (30 questions in total, 4 points each) 1 Consider the following propositions: f: The student got

More information

1 Last time: determinants

1 Last time: determinants 1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)

More information

18.440: Lecture 28 Lectures Review

18.440: Lecture 28 Lectures Review 18.440: Lecture 28 Lectures 18-27 Review Scott Sheffield MIT Outline Outline It s the coins, stupid Much of what we have done in this course can be motivated by the i.i.d. sequence X i where each X i is

More information

Lecture 22: Variance and Covariance

Lecture 22: Variance and Covariance EE5110 : Probability Foundations for Electrical Engineers July-November 2015 Lecture 22: Variance and Covariance Lecturer: Dr. Krishna Jagannathan Scribes: R.Ravi Kiran In this lecture we will introduce

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

Vector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture

Vector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture Week9 Vector Spaces 9. Opening Remarks 9.. Solvable or not solvable, that s the question Consider the picture (,) (,) p(χ) = γ + γ χ + γ χ (, ) depicting three points in R and a quadratic polynomial (polynomial

More information

Lecture 2: Isometries of R 2

Lecture 2: Isometries of R 2 Chapter 1 Lecture 2: Isometries of R 2 1.1 The synthetic vs. analytic approach; axiomatics We discussed briefly what an axiomatic system is: a collection of undefined terms related by axioms. Further terms

More information

Definitions and Properties of R N

Definitions and Properties of R N Definitions and Properties of R N R N as a set As a set R n is simply the set of all ordered n-tuples (x 1,, x N ), called vectors. We usually denote the vector (x 1,, x N ), (y 1,, y N ), by x, y, or

More information

Probability inequalities 11

Probability inequalities 11 Paninski, Intro. Math. Stats., October 5, 2005 29 Probability inequalities 11 There is an adage in probability that says that behind every limit theorem lies a probability inequality (i.e., a bound on

More information

Chapter 5 continued. Chapter 5 sections

Chapter 5 continued. Chapter 5 sections Chapter 5 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions

More information

can only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4

can only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4 .. Conditions for Injectivity and Surjectivity In this section, we discuss what we can say about linear maps T : R n R m given only m and n. We motivate this problem by looking at maps f : {,..., n} {,...,

More information

1.2 Functions What is a Function? 1.2. FUNCTIONS 11

1.2 Functions What is a Function? 1.2. FUNCTIONS 11 1.2. FUNCTIONS 11 1.2 Functions 1.2.1 What is a Function? In this section, we only consider functions of one variable. Loosely speaking, a function is a special relation which exists between two variables.

More information

Chapter 8. P-adic numbers. 8.1 Absolute values

Chapter 8. P-adic numbers. 8.1 Absolute values Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.

More information

Mathematical Methods wk 2: Linear Operators

Mathematical Methods wk 2: Linear Operators John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm

More information

12. Perturbed Matrices

12. Perturbed Matrices MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,

More information

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample

More information

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

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S. 1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for

More information

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

More information

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44

Chapter 13. Convex and Concave. Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Chapter 13 Convex and Concave Josef Leydold Mathematical Methods WS 2018/19 13 Convex and Concave 1 / 44 Monotone Function Function f is called monotonically increasing, if x 1 x 2 f (x 1 ) f (x 2 ) It

More information

Lecture 2: Vector Spaces, Metric Spaces

Lecture 2: Vector Spaces, Metric Spaces CCS Discrete II Professor: Padraic Bartlett Lecture 2: Vector Spaces, Metric Spaces Week 2 UCSB 2015 1 Vector Spaces, Informally The two vector spaces 1 you re probably the most used to working with, from

More information

Modern Geometry Homework.

Modern Geometry Homework. Modern Geometry Homework 1 Cramer s rule We now wish to become experts in solving two linear equations in two unknowns over our field F We first recall that a 2 2 matrix a b A = c b its determinant is

More information

RMT 2013 Power Round Solutions February 2, 2013

RMT 2013 Power Round Solutions February 2, 2013 RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated

More information

The Multivariate Normal Distribution 1

The Multivariate Normal Distribution 1 The Multivariate Normal Distribution 1 STA 302 Fall 2017 1 See last slide for copyright information. 1 / 40 Overview 1 Moment-generating Functions 2 Definition 3 Properties 4 χ 2 and t distributions 2

More information

Joint Probability Distributions and Random Samples (Devore Chapter Five)

Joint Probability Distributions and Random Samples (Devore Chapter Five) Joint Probability Distributions and Random Samples (Devore Chapter Five) 1016-345-01: Probability and Statistics for Engineers Spring 2013 Contents 1 Joint Probability Distributions 2 1.1 Two Discrete

More information

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),

1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989), Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer

More information

3.2 Constructible Numbers

3.2 Constructible Numbers 102 CHAPTER 3. SYMMETRIES 3.2 Constructible Numbers Armed with a straightedge, a compass and two points 0 and 1 marked on an otherwise blank number-plane, the game is to see which complex numbers you can

More information

Lectures 22-23: Conditional Expectations

Lectures 22-23: Conditional Expectations Lectures 22-23: Conditional Expectations 1.) Definitions Let X be an integrable random variable defined on a probability space (Ω, F 0, P ) and let F be a sub-σ-algebra of F 0. Then the conditional expectation

More information

Math 138: Introduction to solving systems of equations with matrices. The Concept of Balance for Systems of Equations

Math 138: Introduction to solving systems of equations with matrices. The Concept of Balance for Systems of Equations Math 138: Introduction to solving systems of equations with matrices. Pedagogy focus: Concept of equation balance, integer arithmetic, quadratic equations. The Concept of Balance for Systems of Equations

More information

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)

Name (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets) MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question

More information

Introductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19

Introductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19 Introductory Analysis I Fall 204 Homework #9 Due: Wednesday, November 9 Here is an easy one, to serve as warmup Assume M is a compact metric space and N is a metric space Assume that f n : M N for each

More information

Math Precalculus I University of Hawai i at Mānoa Spring

Math Precalculus I University of Hawai i at Mānoa Spring Math 135 - Precalculus I University of Hawai i at Mānoa Spring - 2013 Created for Math 135, Spring 2008 by Lukasz Grabarek and Michael Joyce Send comments and corrections to lukasz@math.hawaii.edu Contents

More information

Math 54 Homework 3 Solutions 9/

Math 54 Homework 3 Solutions 9/ Math 54 Homework 3 Solutions 9/4.8.8.2 0 0 3 3 0 0 3 6 2 9 3 0 0 3 0 0 3 a a/3 0 0 3 b b/3. c c/3 0 0 3.8.8 The number of rows of a matrix is the size (dimension) of the space it maps to; the number of

More information

22 Approximations - the method of least squares (1)

22 Approximations - the method of least squares (1) 22 Approximations - the method of least squares () Suppose that for some y, the equation Ax = y has no solutions It may happpen that this is an important problem and we can t just forget about it If we

More information

36-752: Lecture 1. We will use measures to say how large sets are. First, we have to decide which sets we will measure.

36-752: Lecture 1. We will use measures to say how large sets are. First, we have to decide which sets we will measure. 0 0 0 -: Lecture How is this course different from your earlier probability courses? There are some problems that simply can t be handled with finite-dimensional sample spaces and random variables that

More information

Regression Analysis. Ordinary Least Squares. The Linear Model

Regression Analysis. Ordinary Least Squares. The Linear Model Regression Analysis Linear regression is one of the most widely used tools in statistics. Suppose we were jobless college students interested in finding out how big (or small) our salaries would be 20

More information

Lecture 3: Latent Variables Models and Learning with the EM Algorithm. Sam Roweis. Tuesday July25, 2006 Machine Learning Summer School, Taiwan

Lecture 3: Latent Variables Models and Learning with the EM Algorithm. Sam Roweis. Tuesday July25, 2006 Machine Learning Summer School, Taiwan Lecture 3: Latent Variables Models and Learning with the EM Algorithm Sam Roweis Tuesday July25, 2006 Machine Learning Summer School, Taiwan Latent Variable Models What to do when a variable z is always

More information

1 Basic continuous random variable problems

1 Basic continuous random variable problems Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and

More information

Chapter 1 Review of Equations and Inequalities

Chapter 1 Review of Equations and Inequalities Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve

More information

MITOCW ocw f99-lec23_300k

MITOCW ocw f99-lec23_300k MITOCW ocw-18.06-f99-lec23_300k -- and lift-off on differential equations. So, this section is about how to solve a system of first order, first derivative, constant coefficient linear equations. And if

More information

Twitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:

More information

x n -2.5 Definition A list is a list of objects, where multiplicity is allowed, and order matters. For example, as lists

x n -2.5 Definition A list is a list of objects, where multiplicity is allowed, and order matters. For example, as lists Vectors, Linear Combinations, and Matrix-Vector Mulitiplication In this section, we introduce vectors, linear combinations, and matrix-vector multiplication The rest of the class will involve vectors,

More information

Monotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2

Monotone Function. Function f is called monotonically increasing, if. x 1 x 2 f (x 1 ) f (x 2 ) x 1 < x 2 f (x 1 ) < f (x 2 ) x 1 x 2 Monotone Function Function f is called monotonically increasing, if Chapter 3 x x 2 f (x ) f (x 2 ) It is called strictly monotonically increasing, if f (x 2) f (x ) Convex and Concave x < x 2 f (x )

More information

8. TRANSFORMING TOOL #1 (the Addition Property of Equality)

8. TRANSFORMING TOOL #1 (the Addition Property of Equality) 8 TRANSFORMING TOOL #1 (the Addition Property of Equality) sentences that look different, but always have the same truth values What can you DO to a sentence that will make it LOOK different, but not change

More information

MAT389 Fall 2016, Problem Set 4

MAT389 Fall 2016, Problem Set 4 MAT389 Fall 2016, Problem Set 4 Harmonic conjugates 4.1 Check that each of the functions u(x, y) below is harmonic at every (x, y) R 2, and find the unique harmonic conjugate, v(x, y), satisfying v(0,

More information

1 Complete Statistics

1 Complete Statistics Complete Statistics February 4, 2016 Debdeep Pati 1 Complete Statistics Suppose X P θ, θ Θ. Let (X (1),..., X (n) ) denote the order statistics. Definition 1. A statistic T = T (X) is complete if E θ g(t

More information

Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009

Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009 Notes on Blackwell s Comparison of Experiments Tilman Börgers, June 29, 2009 These notes are based on Chapter 12 of David Blackwell and M. A.Girshick, Theory of Games and Statistical Decisions, John Wiley

More information

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.

Theorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u. 5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field

More information

Large Deviations for Weakly Dependent Sequences: The Gärtner-Ellis Theorem

Large Deviations for Weakly Dependent Sequences: The Gärtner-Ellis Theorem Chapter 34 Large Deviations for Weakly Dependent Sequences: The Gärtner-Ellis Theorem This chapter proves the Gärtner-Ellis theorem, establishing an LDP for not-too-dependent processes taking values in

More information

SMT 2013 Power Round Solutions February 2, 2013

SMT 2013 Power Round Solutions February 2, 2013 Introduction This Power Round is an exploration of numerical semigroups, mathematical structures which appear very naturally out of answers to simple questions. For example, suppose McDonald s sells Chicken

More information

Lecture 6: Finite Fields

Lecture 6: Finite Fields CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively 6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise

More information

Differential Equations

Differential Equations This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is

More information

5.6 The Normal Distributions

5.6 The Normal Distributions STAT 41 Lecture Notes 13 5.6 The Normal Distributions Definition 5.6.1. A (continuous) random variable X has a normal distribution with mean µ R and variance < R if the p.d.f. of X is f(x µ, ) ( π ) 1/

More information

There are two main properties that we use when solving linear equations. Property #1: Additive Property of Equality

There are two main properties that we use when solving linear equations. Property #1: Additive Property of Equality Chapter 1.1: Solving Linear and Literal Equations Linear Equations Linear equations are equations of the form ax + b = c, where a, b and c are constants, and a zero. A hint that an equation is linear is

More information

Number Systems III MA1S1. Tristan McLoughlin. December 4, 2013

Number Systems III MA1S1. Tristan McLoughlin. December 4, 2013 Number Systems III MA1S1 Tristan McLoughlin December 4, 2013 http://en.wikipedia.org/wiki/binary numeral system http://accu.org/index.php/articles/1558 http://www.binaryconvert.com http://en.wikipedia.org/wiki/ascii

More information

Commutative Banach algebras 79

Commutative Banach algebras 79 8. Commutative Banach algebras In this chapter, we analyze commutative Banach algebras in greater detail. So we always assume that xy = yx for all x, y A here. Definition 8.1. Let A be a (commutative)

More information

A Quick Introduction to Row Reduction

A Quick Introduction to Row Reduction A Quick Introduction to Row Reduction Gaussian Elimination Suppose we are asked to solve the system of equations 4x + 5x 2 + 6x 3 = 7 6x + 7x 2 + 8x 3 = 9. That is, we want to find all values of x, x 2

More information

The Derivative of a Function Measuring Rates of Change of a function. Secant line. f(x) f(x 0 ) Average rate of change of with respect to over,

The Derivative of a Function Measuring Rates of Change of a function. Secant line. f(x) f(x 0 ) Average rate of change of with respect to over, The Derivative of a Function Measuring Rates of Change of a function y f(x) f(x 0 ) P Q Secant line x 0 x x Average rate of change of with respect to over, " " " " - Slope of secant line through, and,

More information

Random Vectors 1. STA442/2101 Fall See last slide for copyright information. 1 / 30

Random Vectors 1. STA442/2101 Fall See last slide for copyright information. 1 / 30 Random Vectors 1 STA442/2101 Fall 2017 1 See last slide for copyright information. 1 / 30 Background Reading: Renscher and Schaalje s Linear models in statistics Chapter 3 on Random Vectors and Matrices

More information

Linear and non-linear programming

Linear and non-linear programming Linear and non-linear programming Benjamin Recht March 11, 2005 The Gameplan Constrained Optimization Convexity Duality Applications/Taxonomy 1 Constrained Optimization minimize f(x) subject to g j (x)

More information

What if the characteristic equation has a double root?

What if the characteristic equation has a double root? MA 360 Lecture 17 - Summary of Recurrence Relations Friday, November 30, 018. Objectives: Prove basic facts about basic recurrence relations. Last time, we looked at the relational formula for a sequence

More information

OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1

OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1 OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1 (37) If a bug walks on the sphere x 2 + y 2 + z 2 + 2x 2y 4z 3 = 0 how close and how far can it get from the origin? Solution: Complete

More information

Lecture 4: Constructing the Integers, Rationals and Reals

Lecture 4: Constructing the Integers, Rationals and Reals Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define

More information

LAMC Advanced Circle May 21, Jason O Neill and Brad Dirks

LAMC Advanced Circle May 21, Jason O Neill and Brad Dirks LAMC Advanced Circle May 21, 2017 Jason O Neill and Brad Dirks jasonmoneill9@g.ucla.edu, bdirks@ucla.edu Definition 1. Let σ S n be a permutation. We say i is a fixed point of σ if σ(i) = i. In other words,

More information

3d scatterplots. You can also make 3d scatterplots, although these are less common than scatterplot matrices.

3d scatterplots. You can also make 3d scatterplots, although these are less common than scatterplot matrices. 3d scatterplots You can also make 3d scatterplots, although these are less common than scatterplot matrices. > library(scatterplot3d) > y par(mfrow=c(2,2)) > scatterplot3d(y,highlight.3d=t,angle=20)

More information