Probability spaces and random variables Exercises
|
|
- Coleen Stone
- 5 years ago
- Views:
Transcription
1 Probability spaces and random variables Exercises Exercise 1.1. This exercise refers to the random variables described in the slides from the course. n o = 1 ; 2 ; 3 ; 4 ; 5 ; 6. We already established that it is not possible to build a probability measure on the sample space such that both random variables X and W have a uniform distribution. Is it possible to build a probability measure on the sample space such that both random variables X and W have the same distribution? Exercice 1.2. Let Card() < 1. Show that if X :! R and Y :! R are F measurable then min fx; Y g, max fx; Y g and XY are also F measurable. In addition, show that if 8! 2, Y (!) 6= 0 then X=Y is F measurable. Exercice 1.3. The indicator functiof an event C is de ned as I C :! f0; 1g 1 if! 2 C! 7! I C (!) = 0 if! =2 C Show that (I1) If A belongs to the -algebra G then I A is G measurable. (I2) I A\B = I A I B : (I3) I A[B = I A + I B I A\B : Now, let A 1 ; :::; A n be a nite partitiof the sample space. Show that (I4) P n i=1 I A i (!) = 1 for every! 2 : Exercise 1.4. Consider the following sample space and function X :! R: X! 1 0! 2 0! 3 1! 4 1! 5 1! 6 2! 7 2 1
2 a) What is the smallest -algebra F such that X is a random variable? b) What is the smallest -algebra G such that jxj is a random variable? c) Is jxj a F random variable? Justify your answer. d) Is X a G random variable? Justify your answer. Exercise 1.5. Let = f1; :::; 6g ; A = ff1; 3; 5g ; f1; 2; 3gg and B = ff2; 4; 6g ; f4; 5; 6gg : a) Describe F = (A), the -algebra generated by A. b) List the atoms of F. c) Describe G = (B), the -algebra generated by B. d) List the atoms of G: Exercise 1.6. Let X be a random variable de ned on a probability space (; F; P) and Y (!) = exp [X (!)] ;! 2 a) Show that Y is also a random variable, and express its cumulative distribution function F Y as a functiof F X. b) Assume X has a continuous distribution. Then, Y is continuous too. Express f Y, the density functiof Y, as a functiof f X, the density functiof X. c) Assume X N(0; 1). Calculate f Y and P(Y 1). d) What is the name of the distributiof Y? 2
3 1 Exercise 1.1 Solutions Yes, it is possible. Indeed, let p i = P i. We are looking for values of p 1 ; :::; p 6 such that : rstly, P is a probability measure, meaning (i) 0 p i 1 (ii) p 1 + p 2 + p 3 + p 4 + p 5 + p 6 = 1 ; secondly, the distributiof the random variable X is arbitrary, meaning that (X1) P fx = 0g = P 1 ; 2 = p 1 + p 2 = q 0 (X2) P fx = 5g = P 3 ; 4 = p 3 + p 4 = q 5 (X3) P fx = 10g = P 5 ; 6 = p 5 + p 6 = q 10 and nally, the distributiof the random variable W is the same as X, meaning (W 1) P fw = 0g = P 5 = p 5 = q 0 n o (W 2) P fw = 5g = P 1 ; 2 ; 3 ; 4 = p 1 + p 2 + p 3 + p 4 = q 5 (W 3) P fw = 10g = P 6 = p 6 = q 10 The constraints (X3) and (W 3) imply that p 5 = 0 and p 6 = q 10. Then, from (W 1) we obtain that q 0 = p 5 = 0. This implies q 5 = 1 q 0 q 10 = 1 q 10. Since p 1 and p 2 are non negative and because their sum is 0 (see X1), we conclude that p 1 = p 2 = 0. The constraint (X2) yields p 3 = q 5 p 4 = 1 q 10 p 4. Hence the solution is x P fx = xg = P fw = xg q q 10 2 [0; 1] :! P (!)! P (!) p 4 2 [0; 1 q 10 ] q 10 p 4 6 q 10 3
4 2 Exercise 1.2 Since Card() < 1, the random variables X and Y canly take a nite number of values, say x 1 < ::: < x m and y 1 < ::: < y n respectively. Let us show that min fx; Y g is F measurable : 8z 2 R, f! 2 jmin fx (!) ; Y (!)g z g = f! 2 jx (!) z or Y (!) z g = f! 2 jx (!) z g [ f! 2 jy (!) z g 2 F. Let us show that max fx; Y g is F measurable : 8z 2 R, f! 2 jmax fx (!) ; Y (!)g z g = f! 2 jx (!) z and Y (!) z g = f! 2 jx (!) z g Let us show that XY is F measurable : 8z 2 R, \ f! 2 jy (!) z g 2 F. f! 2 jx (!) Y (!) z g f! 2 jx (!) = x i and Y (!) = y j g x i y j z x i y j z f! 2 jx (!) = x i g \ f! 2 jy (!) = y j g 2 F. {z } Let us show that if Y 6= 0; X=Y is F measurable : 8z 2 R,! 2 X (!) Y (!) z f! 2 jx (!) = x i and Y (!) = y j g x i y j z x i z y j f! 2 jx (!) = x i g \ f! 2 jy (!) = y j g 2 F. 4
5 3 Exercise 1.3 Proof of (I1): To show : If A belongs to the -algebra G then I A is G We must show that 8x 2 R, f! 2 : I A (!) = xg 2 G. However, and 8x =2 f0; 1g, Proof of (I2): To show : I A\B = I A I B : On the other hand, f! 2 : I A (!) = 1g = A 2 G, f! 2 : I A (!) = 0g = A c 2 G f! 2 : I A (!) = xg =? 2 G. 1! 2 A \ B I A\B (!) = 0! =2 A \ B I A (!) I B (!) = 1, I A (!) = 1 and I B (!) = 1,! 2 A and! 2 B,! 2 A \ B. Proof of (I3): To show : I A[B = I A + I B I A\B : Let us consider four cases : if! 2 A \ B then if! 2 A \ B c then if! 2 A c \ B then if! 2 A c \ B c then I A[B (!) = 1 and I A[B (!) = 1 and I A[B (!) = 1 and I A[B (!) = 0 and measurable. = = 1 = = 1 = = 1 = = 0 Proof of (I4). To show : Let A 1 ; :::; A n be a nite partitiof the sample space. Show that P n i=1 I A i (!) = 1 for every! 2 : Let! 2 A j be an arbitrary element from the sample space. Since A 1 ; :::; A n is a partition we have! 2 A j and! =2 A i for every i 6= j: Then, Therefore, I Aj (!) = 1 and I Ai (!) = 0 for every i 6= j: nx I Ai (!) = 1: i=1 5
6 4 Exercise 1.4 a) What is the smallest -algebra F such that X is a random variable? 8 9?; ; f! 1 ;! 2 g ; f! 3 g ; f! 4 ;! 5 g ; f! 6 g ; f! 7 g f! 1 ;! 2 ;! 3 g ; f! 1 ;! 2 ;! 4 ;! 5 g ; f! 1 ;! 2 ;! 6 g ; f! 1 ;! 2 ;! 7 g f! 3 ;! 4 ;! 5 g ; f! 3 ;! 6 g ; f! 3 ;! 7 g ; f! 4 ;! 5 ;! 6 g ; f! 4 ;! 5 ;! 7 g ; f! 6 ;! 7 g >< >= f! 1 ;! 2 ;! 3 ;! 4 ;! 5 g ; f! 1 ;! 2 ;! 3 ;! 6 g ; f! 1 ;! 2 ;! 3 ;! 7 g f! 1 ;! 2 ;! 4 ;! 5 ;! 6 g ; f! 1 ;! 2 ;! 4 ;! 5 ;! 7 g ; f! 1 ;! 2 ;! 6 ;! 7 g f! 3 ;! 4 ;! 5 ;! 6 g ; f! 3 ;! 4 ;! 5 ;! 7 g ; f! 3 ;! 6 ;! 7 g ; f! 4 ;! 5 ;! 6 ;! 7 g f! >: 1 ;! 2 ;! 3 ;! 4 ;! 5 ;! 6 g ; f! 1 ;! 2 ;! 3 ;! 4 ;! 5 ;! 7 g ; f! 1 ;! 2 ;! 3 ;! 6 ;! 7 g >; f! 1 ;! 2 ;! 4 ;! 5 ;! 6 ;! 7 g ; f! 3 ;! 4 ;! 5 ;! 6 ;! 7 g b) What is the smallest -algebra G such that jxj is a random variable??; ; f! 1 ;! 2 g ; f! 3 ;! 4 ;! 5 g ; f! 6 ;! 7 g f! 1 ;! 2 ;! 3 ;! 4 ;! 5 g ; f! 1 ;! 2 ;! 6 ;! 7 g ; f! 3 ;! 4 ;! 5 ;! 6 ;! 7 g c) Is jxj a F random variable? Justify your answer. Yes since 8? 2 F if x < 0 >< f! f! 2 : jx (!)j xg = 1 ;! 2 g 2 F if 0 x < 1 f! 1 ;! 2 ;! 3 ;! 4 ;! 5 g 2 F if 1 x < 2 >: 2 F if x 2 d) Is X a G random variable? Justify your answer. No since f! 2 : X (!) 2g = f! 7 g =2 G: 6
1 The Well Ordering Principle, Induction, and Equivalence Relations
1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number
More informationStochastic processes and stopping time Exercises
Stochastic processes and stopping time Exercises Exercise 2.1. Today is Monday and you have one dollar in your piggy bank. Starting tomorrow, every morning until Friday (inclusively), you toss a coin.
More informationAssignment 8. Section 3: 20, 24, 25, 30, Show that the sum and product of two simple functions are simple. Show that A\B = A B
Andrew van Herick Math 710 Dr. Alex Schuster Nov. 2, 2005 Assignment 8 Section 3: 20, 24, 25, 30, 31 20. Show that the sum and product of two simple functions are simple. Show that A\B = A B A[B = A +
More information1 Selected Homework Solutions
Selected Homework Solutions Mathematics 4600 A. Bathi Kasturiarachi September 2006. Selected Solutions to HW # HW #: (.) 5, 7, 8, 0; (.2):, 2 ; (.4): ; (.5): 3 (.): #0 For each of the following subsets
More information1 Which sets have volume 0?
Math 540 Spring 0 Notes #0 More on integration Which sets have volume 0? The theorem at the end of the last section makes this an important question. (Measure theory would supersede it, however.) Theorem
More informationMeasure-theoretic probability
Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is
More informationA L T O SOLO LOWCLL. MICHIGAN, THURSDAY. DECEMBER 10,1931. ritt. Mich., to T h e Heights. Bos" l u T H I S COMMl'NiTY IN Wilcox
G 093 < 87 G 9 G 4 4 / - G G 3 -!! - # -G G G : 49 q» - 43 8 40 - q - z 4 >» «9 0-9 - - q 00! - - q q!! ) 5 / : \ 0 5 - Z : 9 [ -?! : ) 5 - - > - 8 70 / q - - - X!! - [ 48 - -!
More informationECE 673-Random signal analysis I Final
ECE 673-Random signal analysis I Final Q ( point) Comment on the following statement "If cov(x ; X 2 ) 0; then the best predictor (without limitation on the type of predictor) of the random variable X
More informationTesting for Regime Switching: A Comment
Testing for Regime Switching: A Comment Andrew V. Carter Department of Statistics University of California, Santa Barbara Douglas G. Steigerwald Department of Economics University of California Santa Barbara
More informationSection 4.4 Functions. CS 130 Discrete Structures
Section 4.4 Functions CS 130 Discrete Structures Function Definitions Let S and T be sets. A function f from S to T, f: S T, is a subset of S x T where each member of S appears exactly once as the first
More informationAssignment 3. Section 10.3: 6, 7ab, 8, 9, : 2, 3
Andrew van Herick Math 710 Dr. Alex Schuster Sept. 21, 2005 Assignment 3 Section 10.3: 6, 7ab, 8, 9, 10 10.4: 2, 3 10.3.6. Prove (3) : Let E X: Then x =2 E if and only if B r (x) \ E c 6= ; for all all
More informationGALOIS THEORY I (Supplement to Chapter 4)
GALOIS THEORY I (Supplement to Chapter 4) 1 Automorphisms of Fields Lemma 1 Let F be a eld. The set of automorphisms of F; Aut (F ) ; forms a group (under composition of functions). De nition 2 Let F be
More informationT k b p M r will so ordered by Ike one who quits squuv. fe2m per year, or year, jo ad vaoce. Pleaie and THE ALTO SOLO
q q P XXX F Y > F P Y ~ Y P Y P F q > ##- F F - 5 F F?? 5 7? F P P?? - - F - F F - P 7 - F P - F F % P - % % > P F 9 P 86 F F F F F > X7 F?? F P Y? F F F P F F
More informationLOWELL WEEKLY JOURNAL
: Y J G V $ 5 V V G Y 2 25 Y 2» 5 X # VG q q q 6 6 X J 6 $3 ( 6 2 6 2 6 25 3 2 6 Y q 2 25: JJ JJ < X Q V J J Y J Q V (» Y V X Y? G # V Y J J J G J»Y ) J J / J Y Y X ({ G #? J Y ~» 9? ) < ( J VY Y J G (
More informationMidterm Preparation Problems
Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then
More informationMax-Min Problems in R n Matrix
Max-Min Problems in R n Matrix 1 and the essian Prerequisite: Section 6., Orthogonal Diagonalization n this section, we study the problem of nding local maxima and minima for realvalued functions on R
More informationMarkov processes Course note 2. Martingale problems, recurrence properties of discrete time chains.
Institute for Applied Mathematics WS17/18 Massimiliano Gubinelli Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains. [version 1, 2017.11.1] We introduce
More informationPRINCIPLE OF MATHEMATICAL INDUCTION
Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of
More informationReal Analysis: Homework # 12 Fall Professor: Sinan Gunturk Fall Term 2008
Eduardo Corona eal Analysis: Homework # 2 Fall 2008 Professor: Sinan Gunturk Fall Term 2008 #3 (p.298) Let X be the set of rational numbers and A the algebra of nite unions of intervals of the form (a;
More informationAlgebra I - Study Guide for Final
Name: Date: Period: Algebra I - Study Guide for Final Multiple Choice Identify the choice that best completes the statement or answers the question. To truly study for this final, EXPLAIN why the answer
More informationTUCBOR. is feaiherinp hit nest. The day before Thanks, as to reflect great discredit upon that paper. Clocks and Jewelry repaired and warranted.
W B J G Bk 85 X W G WY B 7 B 4 & B k F G? * Bk P j?) G j B k k 4 P & B J B PB Y B * k W Y) WY G G B B Wk J W P W k k J J P -B- W J W J W J k G j F W Wk P j W 8 B Bk B J B P k F BP - W F j $ W & B P & P
More informationThe main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market model.
1 2. Option pricing in a nite market model (February 14, 2012) 1 Introduction The main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market
More information1 Fundamental Concepts From Algebra & Precalculus
Fundamental Concepts From Algebra & Precalculus. Review Exercises.. Simplify eac expression.. 5 7) [ 5)) ]. ) 5) 7) 9 + 8 5. 8 [ 5) 8 6)] [9 + 8 5 ]. 9 + 8 5 ) 8) + 5. 5 + [ )6)] 7) 7 + 6 5 6. 8 5 ) 6
More informationExtremal Cases of the Ahlswede-Cai Inequality. A. J. Radclie and Zs. Szaniszlo. University of Nebraska-Lincoln. Department of Mathematics
Extremal Cases of the Ahlswede-Cai Inequality A J Radclie and Zs Szaniszlo University of Nebraska{Lincoln Department of Mathematics 810 Oldfather Hall University of Nebraska-Lincoln Lincoln, NE 68588 1
More informationHonors Advanced Algebra Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions
Honors Advanced Algebra Name Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions MGSE9 12.F.IF.7 Graph functions expressed symbolically and show key features
More informationStochastic Processes
Introduction and Techniques Lecture 4 in Financial Mathematics UiO-STK4510 Autumn 2015 Teacher: S. Ortiz-Latorre Stochastic Processes 1 Stochastic Processes De nition 1 Let (E; E) be a measurable space
More informationMA 8101 Stokastiske metoder i systemteori
MA 811 Stokastiske metoder i systemteori AUTUMN TRM 3 Suggested solution with some extra comments The exam had a list of useful formulae attached. This list has been added here as well. 1 Problem In this
More informationJUST THE MATHS UNIT NUMBER ORDINARY DIFFERENTIAL EQUATIONS 1 (First order equations (A)) A.J.Hobson
JUST THE MATHS UNIT NUMBER 5. ORDINARY DIFFERENTIAL EQUATIONS (First order equations (A)) by A.J.Hobson 5.. Introduction and definitions 5..2 Exact equations 5..3 The method of separation of the variables
More informationAbstract Algebra Part I: Group Theory
Abstract Algebra Part I: Group Theory From last time: Let G be a set. A binary operation on G is a function m : G G G Some examples: Some non-examples Addition and multiplication Dot and scalar products
More information( ) = 0. ( ) does not exist. 4.1 Maximum and Minimum Values Assigned videos: , , , DEFINITION Critical number
4.1 Maximum and Minimum Values Assigned videos: 4.1.001, 4.1.005, 4.1.035, 4.1.039 DEFINITION Critical number A critical number of a function f is a number c in the domain of f such that f c or f c ( )
More informationIntroduction to linear programming
Chapter 2 Introduction to linear programming 2.1 Single-objective optimization problem We study problems of the following form: Given a set S and a function f : S R, find, if possible, an element x S that
More informationxy xyy 1 = ey 1 = y 1 i.e.
Homework 2 solutions. Problem 4.4. Let g be an element of the group G. Keep g fixed and let x vary through G. Prove that the products gx are all distinct and fill out G. Do the same for the products xg.
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationName: Date: Block: Algebra 1 Function/Solving for a Variable STUDY GUIDE
Algebra Functions Test STUDY GUIDE Name: Date: Block: SOLs: A.7, A. Algebra Function/Solving for a Variable STUDY GUIDE Know how to Plot points on a Cartesian coordinate plane. Find the (x, y) coordinates
More informationFinite fields: some applications Michel Waldschmidt 1
Ho Chi Minh University of Science HCMUS Update: 16/09/2013 Finite fields: some applications Michel Waldschmidt 1 Exercises We fix an algebraic closure F p of the prime field F p of characteristic p. When
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationRough Sets, Rough Relations and Rough Functions. Zdzislaw Pawlak. Warsaw University of Technology. ul. Nowowiejska 15/19, Warsaw, Poland.
Rough Sets, Rough Relations and Rough Functions Zdzislaw Pawlak Institute of Computer Science Warsaw University of Technology ul. Nowowiejska 15/19, 00 665 Warsaw, Poland and Institute of Theoretical and
More informationLineaire algebra 1 najaar Oefenopgaven. Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra
Lineaire algebra 1 najaar 2008 ontleend aan: Oefenopgaven Stephen H. Friedberg, Arnold J. Insel, Lawrence E. Spence, Linear Algebra Charles W. Curtis, Linear Algebra: An Introductory Approach Exercise
More informationStochastic Processes Calcul stochastique. Geneviève Gauthier. HEC Montréal. Stochastic processes. Stochastic processes.
Processes 80-646-08 Calcul stochastique Geneviève Gauthier HEC Montréal Let (Ω, F) be a measurable space. A stochastic process X = fx t : t 2 T g is a family of random variables, all built on the same
More informationSection 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series
Section 9.7 and 9.10: Taylor Polynomials and Approximations/Taylor and Maclaurin Series Power Series for Functions We can create a Power Series (or polynomial series) that can approximate a function around
More informationLEBESGUE INTEGRATION. Introduction
LEBESGUE INTEGATION EYE SJAMAA Supplementary notes Math 414, Spring 25 Introduction The following heuristic argument is at the basis of the denition of the Lebesgue integral. This argument will be imprecise,
More informationFactoring and Algebraic Fractions
Worksheet. Algebraic Fractions Section Factoring and Algebraic Fractions As pointed out in worksheet., we can use factoring to simplify algebraic expressions, and in particular we can use it to simplify
More informationPreface These notes were prepared on the occasion of giving a guest lecture in David Harel's class on Advanced Topics in Computability. David's reques
Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Spring 2002 Abstract This text consists
More informationWritten Homework # 1 Solution
Math 516 Fall 2006 Radford Written Homework # 1 Solution 10/11/06 Remark: Most of the proofs on this problem set are just a few steps from definitions and were intended to be a good warm up for the course.
More information[Read Ch. 5] [Recommended exercises: 5.2, 5.3, 5.4]
Evaluating Hypotheses [Read Ch. 5] [Recommended exercises: 5.2, 5.3, 5.4] Sample error, true error Condence intervals for observed hypothesis error Estimators Binomial distribution, Normal distribution,
More informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 26 June 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More informationRemarks on the embedding of spaces of distributions into spaces of Colombeau generalized functions
Remarks on the embedding of spaces of distributions into spaces of Colombeau generalized functions Antoine Delcroix To cite this version: Antoine Delcroix. Remarks on the embedding of spaces of distributions
More informationRobust Solutions to Multi-Objective Linear Programs with Uncertain Data
Robust Solutions to Multi-Objective Linear Programs with Uncertain Data M.A. Goberna yz V. Jeyakumar x G. Li x J. Vicente-Pérez x Revised Version: October 1, 2014 Abstract In this paper we examine multi-objective
More informationGaussian processes and Feynman diagrams
Gaussian processes and Feynman diagrams William G. Faris April 25, 203 Introduction These talks are about expectations of non-linear functions of Gaussian random variables. The first talk presents the
More informationA function relate an input to output
Functions: Definition A function relate an input to output In mathematics, a function is a relation between a set of outputs and a set of output with the property that each input is related to exactly
More informationx 3 2x = (x 2) (x 2 2x + 1) + (x 2) x 2 2x + 1 = (x 4) (x + 2) + 9 (x + 2) = ( 1 9 x ) (9) + 0
1. (a) i. State and prove Wilson's Theorem. ii. Show that, if p is a prime number congruent to 1 modulo 4, then there exists a solution to the congruence x 2 1 mod p. (b) i. Let p(x), q(x) be polynomials
More informationConditional Expectation and Independence Exercises
Conditional Expectation and Independence Exercises Exercise 3.1. Show the four following properties : for any random variables and Y and for any real numbers a and b, (E1) E P [a + by ] = ae P [] + be
More informationStochastic integral. Introduction. Ito integral. References. Appendices Stochastic Calculus I. Geneviève Gauthier.
Ito 8-646-8 Calculus I Geneviève Gauthier HEC Montréal Riemann Ito The Ito The theories of stochastic and stochastic di erential equations have initially been developed by Kiyosi Ito around 194 (one of
More informationStochastic Processes
Stochastic Processes A very simple introduction Péter Medvegyev 2009, January Medvegyev (CEU) Stochastic Processes 2009, January 1 / 54 Summary from measure theory De nition (X, A) is a measurable space
More informationSOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker CHAPTER 2. UNIVARIATE DISTRIBUTIONS
SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker CHAPTER. UNIVARIATE DISTRIBUTIONS. Random Variables and Distribution Functions. This chapter deals with the notion of random variable, the distribution
More informationSequences and Series
CHAPTER Sequences and Series.. Convergence of Sequences.. Sequences Definition. Suppose that fa n g n= is a sequence. We say that lim a n = L; if for every ">0 there is an N>0 so that whenever n>n;ja n
More information.1 "patedl-righl" timti tame.nto our oai.c iii C. W.Fiak&Co. She ftowtt outnal,
J 2 X Y J Y 3 : > Y 6? ) Q Y x J Y Y // 6 : : \ x J 2 J Q J Z 3 Y 7 2 > 3 [6 2 : x z (7 :J 7 > J : 7 (J 2 J < ( q / 3 6 q J $3 2 6:J : 3 q 2 6 3 2 2 J > 2 :2 : J J 2 2 J 7 J 7 J \ : q 2 J J Y q x ( ) 3:
More information1 FUNCTIONS _ 5 _ 1.0 RELATIONS
1 FUNCTIONS 1.0 RELATIONS Notes : (i) Four types of relations : one-to-one many-to-one one-to-many many-to-many. (ii) Three ways to represent relations : arrowed diagram set of ordered pairs graph. (iii)
More informationRings, Integral Domains, and Fields
Rings, Integral Domains, and Fields S. F. Ellermeyer September 26, 2006 Suppose that A is a set of objects endowed with two binary operations called addition (and denoted by + ) and multiplication (denoted
More informationBEE1024 Mathematics for Economists
BEE1024 Mathematics for Economists Dieter and Jack Rogers and Juliette Stephenson Department of Economics, University of Exeter February 1st 2007 1 Objective 2 Isoquants 3 Objective. The lecture should
More informationLecture Notes on Game Theory
Lecture Notes on Game Theory Levent Koçkesen Strategic Form Games In this part we will analyze games in which the players choose their actions simultaneously (or without the knowledge of other players
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
More informationChapter 4: Higher-Order Differential Equations Part 1
Chapter 4: Higher-Order Differential Equations Part 1 王奕翔 Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 8, 2013 Higher-Order Differential Equations Most of this
More informationHomework sheet 4: EIGENVALUES AND EIGENVECTORS. DIAGONALIZATION (with solutions) Year ? Why or why not? 6 9
Bachelor in Statistics and Business Universidad Carlos III de Madrid Mathematical Methods II María Barbero Liñán Homework sheet 4: EIGENVALUES AND EIGENVECTORS DIAGONALIZATION (with solutions) Year - Is
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationLOWELL WEEKLY JOURNAL
G $ G 2 G ««2 ««q ) q «\ { q «««/ 6 «««««q «] «q 6 ««Z q «««Q \ Q «q «X ««G X G ««? G Q / Q Q X ««/«X X «««Q X\ «q «X \ / X G XX «««X «x «X «x X G X 29 2 ««Q G G «) 22 G XXX GG G G G G G X «x G Q «) «G
More informationLecture 11. Probability Theory: an Overveiw
Math 408 - Mathematical Statistics Lecture 11. Probability Theory: an Overveiw February 11, 2013 Konstantin Zuev (USC) Math 408, Lecture 11 February 11, 2013 1 / 24 The starting point in developing the
More informationCommon Core Algebra 2 Review Session 1
Common Core Algebra 2 Review Session 1 NAME Date 1. Which of the following is algebraically equivalent to the sum of 4x 2 8x + 7 and 3x 2 2x 5? (1) 7x 2 10x + 2 (2) 7x 2 6x 12 (3) 7x 4 10x 2 + 2 (4) 12x
More informationCLASSICAL PROBABILITY MODES OF CONVERGENCE AND INEQUALITIES
CLASSICAL PROBABILITY 2008 2. MODES OF CONVERGENCE AND INEQUALITIES JOHN MORIARTY In many interesting and important situations, the object of interest is influenced by many random factors. If we can construct
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationFunction: exactly Functions as equations:
Function: - a connection between sets in which each element of the first set corresponds with exactly one element of the second set o the reverse is not necessarily true, but if it is, the function is
More informationELECTRIC SUN NEW JERSEY'S OLDEST WEEKLY NEWSPAPER EST :30-5:30 DAILY SAT. 10>00-5:30 OPEN TILL 9:00 P.M. THURS. "A Unisex Boutique*'
G Y Y 9 ] v- j $ G - v $ F v F v v - v G / $ v z - -! v - )v - v ( -! - - j---- - - - v v- - - - -! / j v - v G -
More informationUNIT Define joint distribution and joint probability density function for the two random variables X and Y.
UNIT 4 1. Define joint distribution and joint probability density function for the two random variables X and Y. Let and represent the probability distribution functions of two random variables X and Y
More informationChapter 2. First-Order Differential Equations
Chapter 2 First-Order Differential Equations i Let M(x, y) + N(x, y) = 0 Some equations can be written in the form A(x) + B(y) = 0 DEFINITION 2.2. (Separable Equation) A first-order differential equation
More informationSample Exam for On the answer booklet write your Name, Registration number, Test Code, Number of the booklet etc. in the appropriate places.
Sample Exam for 2012 Booklet No. TEST CODE: REI Forenoon Questions: 9 Time: 2 hours On the answer booklet write your Name, Registration number, Test Code, Number of the booklet etc. in the appropriate
More informationTopics in Algorithms. 1 Generation of Basic Combinatorial Objects. Exercises. 1.1 Generation of Subsets. 1. Consider the sum:
Topics in Algorithms Exercises 1 Generation of Basic Combinatorial Objects 1.1 Generation of Subsets 1. Consider the sum: (ε 1,...,ε n) {0,1} n f(ε 1,..., ε n ) (a) Show that it may be calculated in O(n)
More informationCrash course Verification of Finite Automata Binary Decision Diagrams
Crash course Verification of Finite Automata Binary Decision Diagrams Exercise session 10 Xiaoxi He 1 Equivalence of representations E Sets A B A B Set algebra,, ψψ EE = 1 ψψ AA = ff ψψ BB = gg ψψ AA BB
More informationLecture 12: Multiple Random Variables and Independence
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 12: Multiple Random Variables and Independence Instructor: Dr. Krishna Jagannathan Scribes: Debayani Ghosh, Gopal Krishna
More informationl(y j ) = 0 for all y j (1)
Problem 1. The closed linear span of a subset {y j } of a normed vector space is defined as the intersection of all closed subspaces containing all y j and thus the smallest such subspace. 1 Show that
More informationSnell envelope and the pricing of American-style contingent claims
Snell envelope and the pricing of -style contingent claims 80-646-08 Stochastic calculus I Geneviève Gauthier HEC Montréal Notation The The riskless security Market model The following text draws heavily
More information3. The Multivariate Hypergeometric Distribution
1 of 6 7/16/2009 6:47 AM Virtual Laboratories > 12. Finite Sampling Models > 1 2 3 4 5 6 7 8 9 3. The Multivariate Hypergeometric Distribution Basic Theory As in the basic sampling model, we start with
More informationArrovian Social Choice with Non -Welfare Attributes
Arrovian Social Choice with Non -Welfare Attributes Ryo-Ichi Nagahisa y Kansai University Koichi Suga z Waseda University November 14, 2017 Abstract A social state is assumed to be chracterized by welfare
More informationTaylor series - Solutions
Taylor series - Solutions. f(x) sin(x) sin(0) + x cos(0) + x x ( sin(0)) +!! ( cos(0)) + + x4 x5 (sin(0)) + 4! 5! 0 + x + 0 x x! + x5 5! x! + 0 + x5 (cos(0)) + x6 6! ( sin(0)) + x 7 7! + x9 9! 5! + 0 +
More informationEQUIVALENT SYSTEMS, RESULTANTS OF FORCE AND COUPLE SYSTEM, & FURTHER REDUCTION OF A FORCE AND COUPLE SYSTEM
EQUIVALENT SYSTEMS, RESULTANTS OF FORCE AND COUPLE SYSTEM, & FURTHER REDUCTION OF A FORCE AND COUPLE SYSTEM Today s Objectives: Students will be able to: c) Determine the effect of moving a force. b) Find
More informationz = f (x; y) = x 3 3x 2 y x 2 3
BEE Mathematics for Economists Week, ecture Thursday..7 Functions in two variables Dieter Balkenborg Department of Economics University of Exeter Objective This lecture has the purpose to make you familiar
More informationLOWELL WEEKLY JOURNAL. ^Jberxy and (Jmott Oao M d Ccmsparftble. %m >ai ruv GEEAT INDUSTRIES
? (») /»» 9 F ( ) / ) /»F»»»»»# F??»»» Q ( ( »»» < 3»» /» > > } > Q ( Q > Z F 5
More informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 25 November 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More informationChapter 5 - Integration
Chapter 5 - Integration 5.1 Approximating the Area under a Curve 5.2 Definite Integrals 5.3 Fundamental Theorem of Calculus 5.4 Working with Integrals 5.5 Substitution Rule for Integrals 1 Q. Is the area
More informationCrew of25 Men Start Monday On Showboat. Many Permanent Improvements To Be Made;Project Under WPA
U G G G U 2 93 YX Y q 25 3 < : z? 0 (? 8 0 G 936 x z x z? \ 9 7500 00? 5 q 938 27? 60 & 69? 937 q? G x? 937 69 58 } x? 88 G # x 8 > x G 0 G 0 x 8 x 0 U 93 6 ( 2 x : X 7 8 G G G q x U> x 0 > x < x G U 5
More informationApproximation Algorithms (Load Balancing)
July 6, 204 Problem Definition : We are given a set of n jobs {J, J 2,..., J n }. Each job J i has a processing time t i 0. We are given m identical machines. Problem Definition : We are given a set of
More informationBaire measures on uncountable product spaces 1. Abstract. We show that assuming the continuum hypothesis there exists a
Baire measures on uncountable product spaces 1 by Arnold W. Miller 2 Abstract We show that assuming the continuum hypothesis there exists a nontrivial countably additive measure on the Baire subsets of
More informationTest 2 Review Math 1111 College Algebra
Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.
More informationThe Table of Integrals (pages of the text) and the Formula Page may be used. They will be attached to the nal exam.
The Table of Integrals (pages 558-559 of the text) and the Formula Page may be used. They will be attached to the nal exam. 1. If f(x; y) =(xy +1) 2 p y 2 x 2,evaluatef( 2; 1). A. 1 B. 1 p 5 C. Not de
More informationMATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS
MATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS 1. We have one theorem whose conclusion says an alternating series converges. We have another theorem whose conclusion says an alternating series diverges.
More information13. Examples of measure-preserving tranformations: rotations of a torus, the doubling map
3. Examples of measure-preserving tranformations: rotations of a torus, the doubling map 3. Rotations of a torus, the doubling map In this lecture we give two methods by which one can show that a given
More informationWORLD MATH DAY ACTIVITY PACK. Ages worldmathsday.com UNICEF WORLD MATH DAY Lesson Plans Age 4 10 ACTIVITY RESOURCE
UNICEF AND WORLD MATH DAY Hp qy WORLD MATH DAY ACTIVITY PACK A 4-10 UNICEF WORLD MATH DAY 2018 L P A 4 10 ACTIVITY RESOURCE APPENDIX 1 APPENDIX 2 G S---Bx Sy E f y UNICEF WORLD MATH DAY 2018 L P A 4-10
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationOn the Permutation Products of Manifolds
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 42 (2001), No. 2, 547-555. On the Permutation Products of Manifolds Samet Kera Institute of Mathematics, P.O.Box 162, 1000
More informationDiscretization Methods Exercise # 5
Discretization Methods Exercise # 5 Static calculation of a planar truss structure: a a F Six steps: 1. Discretization 2. Element matrices 3. Transformation 4. Assembly 5. Boundary conditions 6. Solution
More information