Homework 1 Solutions ECEn 670, Fall 2013
|
|
- Harriet Caroline Reynolds
- 5 years ago
- Views:
Transcription
1 Homework Solutions ECEn 670, Fall 03 A.. Use the rst seven relations to prove relations (A.0, (A.3, and (A.6. Prove (F G c F c G c (A.0. (F G c ((F c G c c c by A.6. (F G c F c G c by A.4 Prove F (F G F F (F G (A.3. F (F G (F F (F G by A.3. F (F G F (F G by A.0 (proved in book Now let's look at: F F X F F (F G F X F F (F G F BecauseF (F G F (F G, F F (F G and F (F G F F F (F G F (F G F F (F G. Prove F G F (F c G F (G F (A.6. F G (F G Ω by A.7. (F G Ω (F G (F F c by A.0. (F G (F F c F (G F c by A.7. F (G F c F (F c G by A.8. G F G F c F (G F c F (G F F G F (F c G F (G F A.4 Show that F G implies that F G F, F G G, and G c F c. F G F G F F G means that ω F ω G. ω F G ω F and ω G ω F F G F and F G F F G F F G F G G ω F G ω F or ω G ω G or ω G because F G. ω G F G G. ω G ω G Ω ω G (F F c ω (G F (G F c ω F or ω (G F c ω F or ω G ω F G G F G F G G F G G c F c ω G c ω / G ω / F ω F c G c F c
2 A.8 Prove the countably innite version of demorgan's laws. For example, given a sequence of sets F i ; i,,..., then ( c F i Fi c. i i To do this, we start by proving two subset relationships ω i F i ω F i for all i. ω / Fi c for any i. ω / i F c i ω ( i F c i c i F i ( i F c i c ω ( i F c i c ω / i F c i ω / F c i for any i. ω F i for all i. ω i F i ( i F i cc i F i Because these two are subsets of each other, i F i ( i F i cc A. Show that inverse images preserve set theoretic operations, that is, given f : Ω A and sets F and G in A, then f (F c ( f (F c, f (F G f (F f (G, and f (F G f (F f (G. If {F i, i I} is an indexed family of subsets of A that partitions A, show that { f (F i, i I } is a partition of Ω. Do images preserve set theoretic operations in general? (Prove that they do or provide a counterexample. For f (F c ( f (F c, ω f (F c f (ω F c f (ω / F ω / f (F ω [ f (ω ] c For f (F G f (F f (G, ω f (F G f (ω F G f (ω F or f (ω G ω f (F or ω f (G ω f (F f (G For f (F G f (F f (G, ω f (F G f (ω F G f (ω F and f (ω G ω f (F and ω f (G ω f (F f (G Take {F i, i I}. If it is an indexed family of subests of A that partitions A, this means that F i F j ; all i, j I, i j and that i I F i A We now need to show the same for the inverse image { f (F i, i I }. Our proofs above show that set theoretic operations are preserved for inverse images. f (F i f (F j f ( ; all i, j I, i j We now need to show that i I f (F i Ω. This is true because i I f (F i f ( i I F i f (A Ω.
3 Images do not preserve set theoretic operations in general. This is particularly well-illustrated for the case of non one-to-one mappings. Let Ω {a, b, c}, A {d, e} with f (a f (b d and f (c e. Let F {a}, F c {b, c}. f (F {d} f (F c f ({b, c} {d, e} [f (F ] c {e}.3 Describe the sigma-eld of subsets of R generated by the points or singleton sets. Does this sigma-eld contain interals of the form (a, b for b > a? The sigma-eld S generated by the points must have all countable unions of distinct points of the form i {a i } together with the complements of such sets of the form ( i {b i } c i {b i } c, which are intersections of the sample space minus an individual point. Since S is a eld, it must contain simple unions of the form F i {a i } j {b j } c. The sigma-eld does not contain intervals since intervals do not have the form of F..7 Let Ω [0, be a sample space and let F be the sigma-eld of subsets of Ω generated by all sets of the form (n, n + for n 0,,,... (a Are the following subsets of Ω in F? (i [0,, (ii Z + {0,,,... }, (iii [0, k] [k +, for any positive integer k, (iv {k} for any positive integer k, (v [0, k] for any positive integer k, (vi (/3,. (b Dene the following set function on subsets of Ω: P (F c 3 i. i Z +:i+/ F (If there is no i for which i + / F, then the sum is taken as zero. Is P a probability measure on (Ω, F for an appropriate choice of c? If so, what is c? (c Repeat part (b with B, the Borel eld, replacing F as the event space. (d Repeat part (b with the power set of [0, replacing F as the event space. (e Find P (F for the sets F considered in part (a. (a i Yes, because Ω is always in F. ii Yes, because this is the set that is formed by the complement of all of the subsets (n, n + for all n 0,,,... This can be written ( c Z + (n, n + F n0 iii [0, k] [k +, (k, k + c F iv {k} / F since the set cannot be constructed as a countable combination of set theoretic operations on generating sets. v [0, k] / F since the set cannot be constructed as a countable combination of set theoretic operations on generating sets. vi (/3, since the set cannot be constructed as a countable combination of set theoretic operations on generating sets. b This is a suitable probability measure if P (Ω. It also satisies the properties of nonnegativity and countable additivity. P (Ω c 3 i c /3 3c k0 This means that c /3. c This is going to be the same as in part (b, so P is a valid probability measure with c /3. d This is going to be the same as in part (b since P was dened for all sets and is thus a probability measure on the power set. 3
4 e This problem is somewhat problematic because we shouldn't really take probability measures of sets that are not elements of the sigma-eld. i Ω [0, and thus P (F. ii P (Z + 0 as there are no i for which i + / Z +. iii P ([0, k] [k +, P ((k, k + c ( P ((k, k k. iv P ({k} 0 as there are no k for which k + / Z +. v P ([0, k] k i0 c3 i 3 (k vi P ((/3, c ( ( Consider the measurable space ([0, ], B ([0, ].Dene a set function P on this space as follows: / if 0 F or F but not both P (F if 0 F and F 0 otherwise Is P a probability measure? Yes. P is a probability measure if it satisifes the three axioms for probability measures. It satises the property of nonnegativity and the property P (Ω. We need to demonstrate countable additivity: (a 0 / F i and 0 / F i for all i. Then P ( i F i 0 i P (F i. (b 0 F i for some i and 0 / F i for all i, or F i for some i and / F i for all i. Then P ( i F i / i P (F i. (c 0 F i for some i and 0 F j for some j k. Then P ( i F i i P (F i. (d 0 F i and 0 F k for some k. Then P ( i F i i P (F i. Thus P is a probability measure..0 Let S be a sphere in R 3 : S { (x, y, z : x + y + z r }, where r is a xed radius. In the sphere are xed N molecules of gas, each molecule being considered as an innitesimal volume (that is, it occupies only a point in space. Dene for any subset F of S the function # (F {the number of molecules in F } Show that P (F # (F /N is a probability measure on the measurable space consisting of S and its power set. We need to demonstrate that this measure saties the three axioms for probability measures. # (F 0 P (F P (F # (F /N 0 Nonnegativity # (S N P (Ω N/N Normalization Now we need to prove countable additivity. For disjoint sets described by {F i ; i 0,,..., k }, we can say that any particle in F i is not in F j ( k for i j. Then # i0 F i ( k i0 # (F k i and this implies P i0 F i k i0 P (F i Suppose now that the disjoint sets are a countable collection {F i ; i 0,,... }, let M be the largest integer i such that # (F > 0 (there must be such a nite integer since there are only N particles. Then # ( im+ F i 0 and # ( ( i0 F M i # i0 F i + # ( im+ F i # ( M i0 F i M i0 # (F i i0 # (F i This implies that P ( i0 F i i0 P (F i and hence P is a probability measure..6 Prove that P (F G P (F + P (G. Prove more generally that for any sequence (i.e., countable collection of events F i, ( P F i P (F i. i 4 i
5 This inequality is called the union bound or the Bonferroni inequality. (Hint: use Problem A. or Problem.. We know from. that in general, P (F G P (F + P (G P (F G From non-negativity, we know that P (F G 0 and thus P (F G P (F + P (G. Let G i F i j<i F j which makes these sets of G disjoint. P ( i F i P ( i G i i P (G i i (F P i j<i F j ( We know that P F i j<i F j P (F i i P (F i.3 Answer true or false for each of the following statements. Answers must be justied. (a The following is a valid probability measure on the sample space Ω {,, 3, 4, 5, 6} with event space F all subsets of Ω. P (F i; all F F True. To prove this, we have to show that the probability measure satisies the dierent axioms. P (F 0 so nonnegativity is satisifed. P (Ω so normalization is satised. Now countable additivity needs to be proved. If F and G are disjoint, then P (F G P (F + P (G P (F P (G P (F G i F i / G i / F i G i i i (F G i i F i / G i F i + i / F i G i P (F + P (G (b The following is a valid probaility measure on the sample space Ω {,, 3, 4, 5, 6} with event space F all subsets of Ω: { if F or 6 F P (F 0 otherwise False. This is not a valid probability measure because countable additivity is not satised. P ({}. P ({6}. P ({, 6}. P ({, 6} P ({} + P ({6} (c If P (G F P (F + P (G, then F and G are independent. False. If F and G are independent, then P (F G P (F P (G By denition, P (G F P (F + P (G P (F G. Because P (F > 0 and P (G > 0, then if F and G are independent, P (F G > 0 and P (G F P (F + P (G 5
6 (d P (F G P (G for all events F and G. False. Just pick two disjoint events F and G with nonzero probability for P (G. Then, P (F G 0 and P (G > 0. (e Muturally exclusive (disjoint events with nonzero probability cannot be independent. True. Suppose that F and G have nonzero probability so that P (F P (G > 0. Since the events are disjoint, P (F G 0 and thus P (F G P (F G /P (G 0 P (F. Thus, the events cannot be independent. (f For any nite collection of events F i; i,,..., N P ( N N if i P (F i True. Dene G n F n j<i F j. Then G n F n and the G n are disjoint so that i P ( N ( N N if i P N i G i P (G i P (F i i i.6 Given a sample space Ω {0,,,... } dene p (k γ ; k 0,,,... k (a What must γ be in order for p(k to be a pmf? To be a valid pmf, it must be positive for all values of k and satisfy The innite sum of a geometric progression with ratio a, a < is Thus, we can write: ( k0 γ k / γ and our pmf is p(k k+. k0 a k a. k0 p (k. (b Find the probabilities P ({0,, 4, 6,... }, P ({, 3, 5, 7,... }, and P ({,, 3, 4,..., 0}. Even outcomes: P ({0,, 4, 6,... } p (0 + p ( + p (4 + i0 p(i i0 i+ i0 ( i i i0 4 /4 3. Odd outcomes: P ({, 3, 5, 6,... } P ({0,, 4, 5,... } 3 3. Finite outcomes: Formula for nite sum of N + successive terms of geometric progression with ratio a: N+n kn a k a n an+ a P ({,, 3, 4,..., 0} 0 k0 p (k 0 k0 0 ( k k+ k0 (/ / (
7 (c Suppose that K is a xed integer. Find P ({0, K, K, 3K,... }. This is very similar to computing the even outcomes case above: P ({0, K, K, 3K,... } p (0 + p (K + p (K + i0 p(ki i0 ( i Ki i0 K K (/ K K. i0 Ki+ (d Find the mean, second moment, and variance of this pmf. We know from a geometric pmf that p(k ( p k p; k,,..., where p (0, is a parameter that the mean is /p and the variance is ( p /p. Suppose that p /. This means that p(/ (/ (/ k (/ k. This is useful because this dene the following sums: m k0 k ( k /p k p p / σ k0 (k ( m m ( σ + m /4 ( k0 k k The pmf of this problem can then be considered in relation to the geometric pmf m k0 kp(k k k0 k+ k0 k ( k k0 k ( k m ( k0 k p(k k0 k k+ k0 k k k0 k k 6 3 σ m ( m 3 7
Statistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More informationSTAT 7032 Probability Spring Wlodek Bryc
STAT 7032 Probability Spring 2018 Wlodek Bryc Created: Friday, Jan 2, 2014 Revised for Spring 2018 Printed: January 9, 2018 File: Grad-Prob-2018.TEX Department of Mathematical Sciences, University of Cincinnati,
More informationx 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus
Homework 3 Solutions, Real Analysis I, Fall, 2010. (9) Let f : (, ) [, ] be a function whose restriction to (, 0) (0, ) is continuous. Assume the one-sided limits p = lim x 0 f(x), q = lim x 0 + f(x) exist
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationWhy study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables
ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationProblem set 1, Real Analysis I, Spring, 2015.
Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n
More informationNotes on Iterated Expectations Stephen Morris February 2002
Notes on Iterated Expectations Stephen Morris February 2002 1. Introduction Consider the following sequence of numbers. Individual 1's expectation of random variable X; individual 2's expectation of individual
More informationHomework 11. Solutions
Homework 11. Solutions Problem 2.3.2. Let f n : R R be 1/n times the characteristic function of the interval (0, n). Show that f n 0 uniformly and f n µ L = 1. Why isn t it a counterexample to the Lebesgue
More informationMid Term-1 : Practice problems
Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More information2. AXIOMATIC PROBABILITY
IA Probability Lent Term 2. AXIOMATIC PROBABILITY 2. The axioms The formulation for classical probability in which all outcomes or points in the sample space are equally likely is too restrictive to develop
More informationStat 451: Solutions to Assignment #1
Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are
More informationThe Inclusion Exclusion Principle and Its More General Version
The Inclusion Exclusion Principle and Its More General Version Stewart Weiss June 28, 2009 1 Introduction The Inclusion-Exclusion Principle is typically seen in the context of combinatorics or probability
More information9/6. Grades. Exam. Card Game. Homework/quizzes: 15% (two lowest scores dropped) Midterms: 25% each Final Exam: 35%
9/6 Wednesday, September 06, 2017 Grades Homework/quizzes: 15% (two lowest scores dropped) Midterms: 25% each Final Exam: 35% Exam Midterm exam 1 Wednesday, October 18 8:50AM - 9:40AM Midterm exam 2 Final
More informationCombinations. April 12, 2006
Combinations April 12, 2006 Combinations, April 12, 2006 Binomial Coecients Denition. The number of distinct subsets with j elements that can be chosen from a set with n elements is denoted by ( n j).
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
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 informationSTAT 302 Introduction to Probability Learning Outcomes. Textbook: A First Course in Probability by Sheldon Ross, 8 th ed.
STAT 302 Introduction to Probability Learning Outcomes Textbook: A First Course in Probability by Sheldon Ross, 8 th ed. Chapter 1: Combinatorial Analysis Demonstrate the ability to solve combinatorial
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationLecture 1: An introduction to probability theory
Econ 514: Probability and Statistics Lecture 1: An introduction to probability theory Random Experiments Random experiment: Experiment/phenomenon/action/mechanism with outcome that is not (fully) predictable.
More informationCHAPTER 1 SETS AND EVENTS
CHPTER 1 SETS ND EVENTS 1.1 Universal Set and Subsets DEFINITION: set is a well-defined collection of distinct elements in the universal set. This is denoted by capital latin letters, B, C, If an element
More informationProblem Set 1 Sept, 14
EE6: Random Processes in Systems Lecturer: Jean C. Walrand Problem Set Sept, 4 Fall 06 GSI: Assane Gueye This problem set essentially reviews notions of conditional expectation, conditional distribution,
More informationIntroduction to Real Analysis
Introduction to Real Analysis Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Sets Sets are the basic objects of mathematics. In fact, they are so basic that
More informationLecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability
Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More information18.175: Lecture 2 Extension theorems, random variables, distributions
18.175: Lecture 2 Extension theorems, random variables, distributions Scott Sheffield MIT Outline Extension theorems Characterizing measures on R d Random variables Outline Extension theorems Characterizing
More informationMath 42, Discrete Mathematics
c Fall 2018 last updated 10/10/2018 at 23:28:03 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationCMPSCI 240: Reasoning about Uncertainty
CMPSCI 240: Reasoning about Uncertainty Lecture 2: Sets and Events Andrew McGregor University of Massachusetts Last Compiled: January 27, 2017 Outline 1 Recap 2 Experiments and Events 3 Probabilistic Models
More informationECE353: Probability and Random Processes. Lecture 2 - Set Theory
ECE353: Probability and Random Processes Lecture 2 - Set Theory Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu January 10, 2018 Set
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationMATH 556: PROBABILITY PRIMER
MATH 6: PROBABILITY PRIMER 1 DEFINITIONS, TERMINOLOGY, NOTATION 1.1 EVENTS AND THE SAMPLE SPACE Definition 1.1 An experiment is a one-off or repeatable process or procedure for which (a there is a well-defined
More informationRecitation 2: Probability
Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions
More informationBasic Proof Techniques
Basic Proof Techniques Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Basic Notation The following is standard notation for proofs: A B. A implies B. A B.
More informationStatistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006
Statistics for Financial Engineering Session 2: Basic Set Theory March 19 th, 2006 Topics What is a set? Notations for sets Empty set Inclusion/containment and subsets Sample spaces and events Operations
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationINDEPENDENCE OF THE CONTINUUM HYPOTHESIS
INDEPENDENCE OF THE CONTINUUM HYPOTHESIS CAPSTONE MATT LUTHER 1 INDEPENDENCE OF THE CONTINUUM HYPOTHESIS 2 1. Introduction This paper will summarize many of the ideas from logic and set theory that are
More informationSummary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016
8. For any two events E and F, P (E) = P (E F ) + P (E F c ). Summary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016 Sample space. A sample space consists of a underlying
More informationCompatible probability measures
Coin tossing space Think of a coin toss as a random choice from the two element set {0,1}. Thus the set {0,1} n represents the set of possible outcomes of n coin tosses, and Ω := {0,1} N, consisting of
More informationProblems for Putnam Training
Problems for Putnam Training 1 Number theory Problem 1.1. Prove that for each positive integer n, the number is not prime. 10 1010n + 10 10n + 10 n 1 Problem 1.2. Show that for any positive integer n,
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationIBM Almaden Research Center, 650 Harry Road, School of Mathematical Sciences, Tel Aviv University, TelAviv, Israel
On the Complexity of Some Geometric Problems in Unbounded Dimension NIMROD MEGIDDO IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120-6099, and School of Mathematical Sciences, Tel
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 informationMath 42, Discrete Mathematics
c Fall 2018 last updated 12/05/2018 at 15:47:21 For use by students in this class only; all rights reserved. Note: some prose & some tables are taken directly from Kenneth R. Rosen, and Its Applications,
More informationWARDROP EQUILIBRIA IN AN INFINITE NETWORK
LE MATEMATICHE Vol. LV (2000) Fasc. I, pp. 1728 WARDROP EQUILIBRIA IN AN INFINITE NETWORK BRUCE CALVERT In a nite network, there is a classical theory of trafc ow, which gives existence of a Wardrop equilibrium
More informationA primer on basic probability and Markov chains
A primer on basic probability and Markov chains David Aristo January 26, 2018 Contents 1 Basic probability 2 1.1 Informal ideas and random variables.................... 2 1.2 Probability spaces...............................
More informationModule 1. Probability
Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive
More information3.1 Basic properties of real numbers - continuation Inmum and supremum of a set of real numbers
Chapter 3 Real numbers The notion of real number was introduced in section 1.3 where the axiomatic denition of the set of all real numbers was done and some basic properties of the set of all real numbers
More informationProbability Review I
Probability Review I Harvard Math Camp - Econometrics Ashesh Rambachan Summer 2018 Outline Random Experiments The sample space and events σ-algebra and measures Basic probability rules Conditional Probability
More informationExhaustive Classication of Finite Classical Probability Spaces with Regard to the Notion of Causal Up-to-n-closedness
Exhaustive Classication of Finite Classical Probability Spaces with Regard to the Notion of Causal Up-to-n-closedness Michaª Marczyk, Leszek Wro«ski Jagiellonian University, Kraków 16 June 2009 Abstract
More informationChapter 1. Sets and probability. 1.3 Probability space
Random processes - Chapter 1. Sets and probability 1 Random processes Chapter 1. Sets and probability 1.3 Probability space 1.3 Probability space Random processes - Chapter 1. Sets and probability 2 Probability
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMAT 271E Probability and Statistics
MAT 71E Probability and Statistics Spring 013 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 1.30, Wednesday EEB 5303 10.00 1.00, Wednesday
More informationRandom experiments may consist of stages that are performed. Example: Roll a die two times. Consider the events E 1 = 1 or 2 on first roll
Econ 514: Probability and Statistics Lecture 4: Independence Stochastic independence Random experiments may consist of stages that are performed independently. Example: Roll a die two times. Consider the
More informationTheorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension. n=1
Chapter 2 Probability measures 1. Existence Theorem 2.1 (Caratheodory). A (countably additive) probability measure on a field has an extension to the generated σ-field Proof of Theorem 2.1. Let F 0 be
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationFRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS
FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS MIDTERM SOLUTIONS. Let f : R R be the map on the line generated by the function f(x) = x 3. Find all the fixed points of f and determine the type of their
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 informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE
ADDENDUM B: CONSTRUCTION OF R AND THE COMPLETION OF A METRIC SPACE ANDREAS LEOPOLD KNUTSEN Abstract. These notes are written as supplementary notes for the course MAT11- Real Analysis, taught at the University
More informationNets Hawk Katz Theorem. There existsaconstant C>so that for any number >, whenever E [ ] [ ] is a set which does not contain the vertices of any axis
New York Journal of Mathematics New York J. Math. 5 999) {3. On the Self Crossing Six Sided Figure Problem Nets Hawk Katz Abstract. It was shown by Carbery, Christ, and Wright that any measurable set E
More information16 Chapter 3. Separation Properties, Principal Pivot Transforms, Classes... for all j 2 J is said to be a subcomplementary vector of variables for (3.
Chapter 3 SEPARATION PROPERTIES, PRINCIPAL PIVOT TRANSFORMS, CLASSES OF MATRICES In this chapter we present the basic mathematical results on the LCP. Many of these results are used in later chapters to
More information18.175: Lecture 3 Integration
18.175: Lecture 3 Scott Sheffield MIT Outline Outline Recall definitions Probability space is triple (Ω, F, P) where Ω is sample space, F is set of events (the σ-algebra) and P : F [0, 1] is the probability
More informationProbabilistic models
Kolmogorov (Andrei Nikolaevich, 1903 1987) put forward an axiomatic system for probability theory. Foundations of the Calculus of Probabilities, published in 1933, immediately became the definitive formulation
More informationHOMEWORK #2 - MA 504
HOMEWORK #2 - MA 504 PAULINHO TCHATCHATCHA Chapter 1, problem 6. Fix b > 1. (a) If m, n, p, q are integers, n > 0, q > 0, and r = m/n = p/q, prove that (b m ) 1/n = (b p ) 1/q. Hence it makes sense to
More informationINTRODUCTION TO NETS. limits to coincide, since it can be deduced: i.e. x
INTRODUCTION TO NETS TOMMASO RUSSO 1. Sequences do not describe the topology The goal of this rst part is to justify via some examples the fact that sequences are not sucient to describe a topological
More informationProbability and distributions. Francesco Corona
Probability Probability and distributions Francesco Corona Department of Computer Science Federal University of Ceará, Fortaleza Probability Many kinds of studies can be characterised as (repeated) experiments
More information5 and A,1 = B = is obtained by interchanging the rst two rows of A. Write down the inverse of B.
EE { QUESTION LIST EE KUMAR Spring (we will use the abbreviation QL to refer to problems on this list the list includes questions from prior midterm and nal exams) VECTORS AND MATRICES. Pages - of the
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationIntro to Contemporary Math
Intro to Contemporary Math Unions and Intersections of Intervals Department of Mathematics UK Announcement You have a homework assignment due next Monday. Mini-exam 2 is next Wednesday. Unions and Intersections
More informationLecture 4: Probability and Discrete Random Variables
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 4: Probability and Discrete Random Variables Wednesday, January 21, 2009 Lecturer: Atri Rudra Scribe: Anonymous 1
More informationStatistics 1 - Lecture Notes Chapter 1
Statistics 1 - Lecture Notes Chapter 1 Caio Ibsen Graduate School of Economics - Getulio Vargas Foundation April 28, 2009 We want to establish a formal mathematic theory to work with results of experiments
More informationand 1 P (w i)=1. n i N N = P (w i) lim
Chapter 1 Probability 1.1 Introduction Consider an experiment, result of which is random, and is one of the nite number of outcomes. Example 1. Examples of experiments and possible outcomes: Experiment
More informationReal Division Algebras
Real Division Algebras Let me rst put up some properties for an algebra: Denition (Algebra over R) together with a multiplication An algebra over R is a vector space A over R A A R which satises Bilinearly:
More informationand e 2 ~ e 2 iff e 1
Section 4. Equivalence Relations A binary relation is an equivalence relation if it has the three properties reflexive, symmetric, and transitive (RST). Examples. a. Equality on any set. b. x ~ y iff x
More informationSet theoretic properties of Loeb measure 2. Abstract. In this paper we ask the question: to what extent do basic set
Set theoretic properties of Loeb measure Arnold W. Miller 1 University of Wisconsin Madison, WI 53706 miller@math.wisc.edu Abstract In this paper we ask the question: to what extent do basic set theoretic
More information2 Garrett: `A Good Spectral Theorem' 1. von Neumann algebras, density theorem The commutant of a subring S of a ring R is S 0 = fr 2 R : rs = sr; 8s 2
1 A Good Spectral Theorem c1996, Paul Garrett, garrett@math.umn.edu version February 12, 1996 1 Measurable Hilbert bundles Measurable Banach bundles Direct integrals of Hilbert spaces Trivializing Hilbert
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More informationÖvningar i FUNKTIONALANALYS
Matematiska vetenskaper 1. Consider the space X = C 1 [0, 1] of continuously dierentiable functions on [0, 1] with one-sided derivatives at the endpoints. Show that X is not a Banach spaces if it is given
More informationLesson 12.7: Sequences and Series
Lesson 12.7: Sequences and Series May 30 7:11 AM Sequences Definition: A sequence is a set of numbers in a specific order. 2, 5, 8,. is an example of a sequence. Note: A sequence may have either a finite
More informationAbstract The Axiom of Choice (AC) is undeniably the most (well, the only) controversial axiom of Set Theory, the foundation of modern mathematics. In
The Good & Evil of the Axiom of Choice Kenneth Chu Department of Mathematics University of Utah Undergraduate Colloquium April 9, 2002 Abstract The Axiom of Choice (AC) is undeniably the most (well, the
More informationEE 178 Lecture Notes 0 Course Introduction. About EE178. About Probability. Course Goals. Course Topics. Lecture Notes EE 178
EE 178 Lecture Notes 0 Course Introduction About EE178 About Probability Course Goals Course Topics Lecture Notes EE 178: Course Introduction Page 0 1 EE 178 EE 178 provides an introduction to probabilistic
More informationRecap. The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY INFERENTIAL STATISTICS
Recap. Probability (section 1.1) The study of randomness and uncertainty Chances, odds, likelihood, expected, probably, on average,... PROBABILITY Population Sample INFERENTIAL STATISTICS Today. Formulation
More informationSo in the abstract setting dene the following: f n converges to f with respect to I i every subsequence ff n : n 2 Ag has a subsequence B A such that
Souslin's Hypothesis and Convergence in Category by Arnold W. Miller 1 Abstract: A sequence of functions f n : X! R from a Baire space X to the reals R is said to converge in category i every subsequence
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 informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
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 informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More informationLecture Notes: Mathematical/Discrete Structures
Lecture Notes: Mathematical/Discrete Structures Rashid Bin Muhammad, PhD. This booklet includes lecture notes, homework problems, and exam problems from discrete structures course I taught in Fall 2006
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationRS Chapter 1 Random Variables 6/5/2017. Chapter 1. Probability Theory: Introduction
Chapter 1 Probability Theory: Introduction Basic Probability General In a probability space (Ω, Σ, P), the set Ω is the set of all possible outcomes of a probability experiment. Mathematically, Ω is just
More informationLECTURE 1. 1 Introduction. 1.1 Sample spaces and events
LECTURE 1 1 Introduction The first part of our adventure is a highly selective review of probability theory, focusing especially on things that are most useful in statistics. 1.1 Sample spaces and events
More informationProbability. Carlo Tomasi Duke University
Probability Carlo Tomasi Due University Introductory concepts about probability are first explained for outcomes that tae values in discrete sets, and then extended to outcomes on the real line 1 Discrete
More informationIMC 2015, Blagoevgrad, Bulgaria
IMC 05, Blagoevgrad, Bulgaria Day, July 9, 05 Problem. For any integer n and two n n matrices with real entries, B that satisfy the equation + B ( + B prove that det( det(b. Does the same conclusion follow
More informationIntroduction to Proofs
Real Analysis Preview May 2014 Properties of R n Recall Oftentimes in multivariable calculus, we looked at properties of vectors in R n. If we were given vectors x =< x 1, x 2,, x n > and y =< y1, y 2,,
More information