Sigma Field Notes for Economics 770 : Econometric Theory
|
|
- Dwight Fox
- 7 years ago
- Views:
Transcription
1 1 Sigma Field Notes for Economics 770 : Econometric Theory Jonathan B. Hill Dept. of Economics, University of North Carolina 0. DEFINITIONS AND CONVENTIONS The following is a small list of repeatedly used symbols and terms with de nitions. Consult any probability text book, including Davidson (1994) and Fristedt and Gray (1997), or any listed on the syllabus, for larger lists. 0.1 Notation/Symbol Conventions F is an algebra (in this document, it is almost always a -algebra/ eld) N = f1; 2; :::g the space of positive integers Q is the space of rational numbers Z = f::: 2; 1:0; 1; 2; :::g the space of integers is the sample space! is an event, or element A; B; C are subsets of ; fa j g is a sequence of sets. A c is the complement of A: A c = =A = A A=B = A B = f! 2 A :! 2 A \ B c g : the set A with elements removed if they are also in B fx n g is a sequence of real numbers. 0.2 Mathematical De nitions Countable: If there exists a one-to-one mapping to (a subset of) the integers N (e.g. f1; 2g; N; Q). inf j fa j g = \ 1 j=1 A j: the largest set contained in each A j (it may be empty?) lim inf n!1 x n = lim n!1 inf mn x n = sup n1 inf mn x n ; hence lim inf n!1 A n = [ 1 n=1f\ 1 m=na n g lim sup n!1 x n = lim n!1 sup mn x n = inf n1 sup mn x n ; hence lim sup n!1 A n = \ 1 n=1f[ 1 m=na n g Partition of A: A collection of disjoint subsets fb j g of A such that [ 1 j=1 B j = A. sup j fa j g = [ 1 j=1 A j: the smallest set containing all A j (it may be the sample space ) Uncountable: Countable does not hold. Any open or closed real interval (e.g. (a; b] for any a < b).
2 2 1. SAMPLE SPACE, FIELDS, BOREL FIELDS Consult Bierens (chapt. 1.1, ) for details. See also Davidson (chapt. 1). Any textbook on measure theory will also be helpful. 1.1 Statistical experiment, sample space, events! DEFN. Statistical Experiment: An activity with at least one possible outcome; the set of possible outcomes is known; the outcome itself has an element of chance. DEFN. Sample Space: The set of all possible outcomes or events!: EXAMPLE (sample space): The experiment is to ip a coin once. Possible outcomes are H = heads or T = tails. = fh; T g. EXAMPLE (sample space): The experiment is to ip a coin n times and count the number of heads, denoted X. Possible outcomes are X = 0; 1; 2; :::; n heads. = f0; 1; :::; ng. 1.2 Field, -Field The sample is not rich enough to describe all possible event combinations that may arise from. Although in Example there are n + 1 possible outcomes, there are many more random events that can be described. Let n = 5. The event that at least 3 heads occur: X 2 f3; 4g. Clearly that is also a random event, but it is not a possible outcome contained in, although it is a subset of : Algebras, in particular -algebras, give us su cient richness of event possibilities. DEFN. Algebra/Field: An algebra or eld F is a collection of subsets of with the following properties: i. If A 2 F then A c 2 F (it is closed under compliments) ii. If A j 2 F for j = 1; :::; n then [ n j=1 A j 2 F (closed under nite unions) Thus F is a fairly rich set of subsets of collections of events, but not rich enough for the types of probabilistic problems we face. If countably in nite unique subsets exist then Property (ii) clearly omits some cases. The appropriate richness follows if any countable union is in F. DEFN. -Algebra or -Field: A eld F is a - eld if it is closed under countable unions: 1. If A 2 F then A c 2 F (it is closed under compliments) 2. If A j 2 F for j = 1; :::; 1 then [ 1 j=1 A j 2 F (closed under countable unions). COMMENT: We will use - elds to describe the possible array of events associated with statistical experiments and therefore with random variables X. A random variable X will be de ned only relative to some space of outcomes, and some - eld F of richly collected event subsets that can fully describe the values that X can take. If an - eld is closed under compliments and countable unions then it must contain the sample space : if A 2 F then A c ; A c [ A = 2 F, hence c =? 2 F. A - eld. F contains? and. Thus, we can de ne the - eld with the least degree of richness. DEFN. Trivial -algebra or trivial - eld: F = f?; g.
3 The de nitions of eld and - eld are slightly misleading. In particular, they are not unique (in general) to a particular, and some have more structure than others. EXAMPLE (- eld): Flip a coin three times and count the number of heads. = f0; 1; 2; 3g. Then F = f?; ; f0; 1; 2g; f3gg is a - eld. If any A; B 2 F then A c 2 F, A [ B 2 F, and so on. We will see below that F is not su ciently rich to describe this particular random experiment. EXAMPLE (- eld): Flip a coin twice and count the number of heads. = f0; 1; 2g. Then F = f?; ; f0g; f1g; f2g; f0; 1g; f0; 2g; f1; 2gg is a - eld. 1.3 Properties of - elds If is a nite set then there can only be nitely many countable unions: [ 1 j=1 A j must involve redundant sets, i.e. [ 1 j=1 A j = [ n j=1 A j for some n. Let F be an eld on nite. F is a - eld. EXAMPLE ( nite space): Roll a die. = f1; 2; 3; 4; 5; 6g. Any eld F of subsets of is a - eld. Consider F = f?; ; f2; 4; 6g; f1; 3; 5gg. By de Morgan s law if [ 1 j=1 A j 2 F then ( [ 1 j=1 A j) c = \ 1 j=1 Ac j 2 F. Since A j can be anything (another set s compliment, for example!) it follows a - eld is closed under countable intersections. The same goes for a eld. EXAMPLE (sigma- eld spanning sets): Suppose has a partition A 1 and A 2, that is A 1 [ A 2 =. Then fa 1 ; A 2 g is not necessarily a - eld, except in very simple cases. We can easy create a - eld by 1. adding compliments, and 2. adding countable unions. Then F := (fa 1 ; A 2 g) = f?; ; A 1 ; A 2 ; A c 1; A c 2; A c 1 [A c 2; (A c 1 [A c 2) c g is a - eld of subsets of : if B i 2 F then B c i 2 F and [ ib i 2 F are easily veri ed. Algebras and - elds are closed under countable intersections. The above examples are so primitive as to be useless for most economists most of the time. The entire point is to build intuition to the point that we can comfortably understand how all probability matters reduce to measures of - elds. The following moves us into the right direction. First, intersections of even uncountably many - elds is a - eld, but the property does not necessarily apply to unions. Let F, 2, be a collection of - elds of subsets of, where may be an uncountable set (e.g. a compact subset of R). Then F := \ 2 F is a - eld. PROOF: If fa j g 1 j=1, each A j 2 F, then each A j is in every F by the de nition of an intersection. Therefore each A c j and [1 j=1 A j is in every F since they are - elds. Therefore A c j 2 F and [1 j=1 A j 2 F. The same applies to and?. QED. EXAMPLE (unions of - elds may not be a - eld): [ 2 F need not be closed under countable unions. Take = [0; 1] and F n = f?; ; [0; 1 1=n]; (1 1=n; 1]g for n 1. Then F n is a - eld, and A n = [0; 1 1=n] 2 F n 2 [ 1 n=1f n, but [ 1 n=1a n = [0; 1) is not in any F n and therefore cannot be in [ 1 n=1f n. The key idea here is the limit: an in nite union can contain a limiting object not present in any particular - eld so it cannot be in the union of them. 3
4 COMMENT: The latter example has the key implication that we cannot arbitrarily "join" - elds and assume we indeed still have a - eld. In most cases of interest (i.e. not rolling a die!) we work with very abstract notions of "events" so although we cannot write "" we need not know its contents other than "!". What exactly is the total set of events! that drive an interest rate? or the decision to buy life insurance? Yet we must and will join - elds of subsets of events on because we will inspect many variables at once (e.g. an interest rate and the unemployment rate). So, beware! Verifying if a collection of subsets F is a - eld may be di cult. In particular, showing countable unions lie in F may be quite challenging. One trick is to show monotone sequences of sets fa n g in F have a limit lim n!1 A n in F. The latter property de nes a monotone class. DEFN. Monotone Class F: A class of sets F, such that if fa n g is a monotone sequence and A n 2 F 8n, then lim n!1 A n 2 F. F is a - eld if and only if it is an eld and a monotone class. 4 Think about it: - elds have sets, their compliments, their nite unions, and of course much more (extending to countable unions). So, if you show F is a eld, and show increasingly larger sets all A n 2 F and also lim n!1 A n 2 F then you will have covered countably in nite unions which are implicitly contained in those monotone sequences. 1.4 Generate/Smallest - eld The preceding lemma will be useful for de ning the smallest possible - eld containing some subset of interest C. DEFN. - eld generated by C, or (C): The smallest - eld containing a collection C of sets. Finding a - eld that contains C is easy since we need only add unions and compliments to "complete" C. But this does not necessarily lead to a unique - eld. If ff g 2 is the collection of all - elds that contains C, then the smallest - eld containing C is identically (C) := \ 2 F : EXAMPLE (- eld generated by R): Let C = f( 1; q]; q 2 Qg, the collection of halflines with ration endpoints. Since Q is countable, so is C. Then B := (C) is the smallest - eld containing C. This is by de nition the Borel eld of R. COMMENT: The - eld generated by a collection of subsets is profoundly important. In practice we are most interested in - elds generated by a random variable x, de ned below. That is, we want to know the minimal collection of subsets of events that are related to x. Once we know this we can measure the likelihood of x. EXAMPLE (- eld generated): Roll a die hence = f1; 2; 3; 4; 5; 6g. Let C = f1; 3; 5g. The smallest - eld containing C is simply (C) = f?; ; f1; 3; 5g; f2; 4; 6g : This is the - eld generated by an odd die roll. It is also the - eld generated by an even die roll (verify). 1.5 Borel sets B B
5 As we saw above, a Borel eld is a special kind of generated - eld. It is generated by the intervals on the real line. DEFN. Borel Field B: The - eld generated by C = f(a; b) : a < b, a; b 2 Rg, the set of open intervals. This is denoted as B := (C) An element of B os called a Borel set. Borel elds are not unique: collections of [a; b] or ( 1; a], or ( 1; q] for rational q 2 Q, all generate the same B. B = (( 1; a] : a 2 Rg). This is the collection of half-lines, their unions and compliments and intersections. Such pure generality lends itself to measuring, or capturing the statistical properties, of mappings X :! R (which we will call a random variable), and their transformations g(x). 5
Elements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationLECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12)
1 LECTURE NOTES IN MEASURE THEORY Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 2 PREFACE These are lecture notes on integration theory for a eight-week
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationExtension of measure
1 Extension of measure Sayan Mukherjee Dynkin s π λ theorem We will soon need to define probability measures on infinite and possible uncountable sets, like the power set of the naturals. This is hard.
More informationLecture Note 1 Set and Probability Theory. MIT 14.30 Spring 2006 Herman Bennett
Lecture Note 1 Set and Probability Theory MIT 14.30 Spring 2006 Herman Bennett 1 Set Theory 1.1 Definitions and Theorems 1. Experiment: any action or process whose outcome is subject to uncertainty. 2.
More information6.3 Conditional Probability and Independence
222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationBasic Probability Concepts
page 1 Chapter 1 Basic Probability Concepts 1.1 Sample and Event Spaces 1.1.1 Sample Space A probabilistic (or statistical) experiment has the following characteristics: (a) the set of all possible outcomes
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationIntroduction to Probability
3 Introduction to Probability Given a fair coin, what can we expect to be the frequency of tails in a sequence of 10 coin tosses? Tossing a coin is an example of a chance experiment, namely a process which
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationDiscrete Mathematics
Discrete Mathematics Chih-Wei Yi Dept. of Computer Science National Chiao Tung University March 16, 2009 2.1 Sets 2.1 Sets 2.1 Sets Basic Notations for Sets For sets, we ll use variables S, T, U,. We can
More informationMath/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability
Math/Stats 425 Introduction to Probability 1. Uncertainty and the axioms of probability Processes in the real world are random if outcomes cannot be predicted with certainty. Example: coin tossing, stock
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationSection 1.3 P 1 = 1 2. = 1 4 2 8. P n = 1 P 3 = Continuing in this fashion, it should seem reasonable that, for any n = 1, 2, 3,..., = 1 2 4.
Difference Equations to Differential Equations Section. The Sum of a Sequence This section considers the problem of adding together the terms of a sequence. Of course, this is a problem only if more than
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationCardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.
Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection
More informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationNormal distribution. ) 2 /2σ. 2π σ
Normal distribution The normal distribution is the most widely known and used of all distributions. Because the normal distribution approximates many natural phenomena so well, it has developed into a
More informationHow To Solve A Minimum Set Covering Problem (Mcp)
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More informationProbability Theory. Florian Herzog. A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T..
Probability Theory A random variable is neither random nor variable. Gian-Carlo Rota, M.I.T.. Florian Herzog 2013 Probability space Probability space A probability space W is a unique triple W = {Ω, F,
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationLecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University
Lecture 1 Introduction Properties of Probability Methods of Enumeration Asrat Temesgen Stockholm University 1 Chapter 1 Probability 1.1 Basic Concepts In the study of statistics, we consider experiments
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationDISINTEGRATION OF MEASURES
DISINTEGRTION OF MESURES BEN HES Definition 1. Let (, M, λ), (, N, µ) be sigma-finite measure spaces and let T : be a measurable map. (T, µ)-disintegration is a collection {λ y } y of measures on M such
More informationc 2008 Je rey A. Miron We have described the constraints that a consumer faces, i.e., discussed the budget constraint.
Lecture 2b: Utility c 2008 Je rey A. Miron Outline: 1. Introduction 2. Utility: A De nition 3. Monotonic Transformations 4. Cardinal Utility 5. Constructing a Utility Function 6. Examples of Utility Functions
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationGambling Systems and Multiplication-Invariant Measures
Gambling Systems and Multiplication-Invariant Measures by Jeffrey S. Rosenthal* and Peter O. Schwartz** (May 28, 997.. Introduction. This short paper describes a surprising connection between two previously
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationProbability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Probability: Terminology and Examples Class 2, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of sample space, event and probability function. 2. Be able to
More informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationA natural introduction to probability theory. Ronald Meester
A natural introduction to probability theory Ronald Meester ii Contents Preface v 1 Experiments 1 1.1 Definitions and examples........................ 1 1.2 Counting and combinatorics......................
More informationThe Kolchin Topology
The Kolchin Topology Phyllis Joan Cassidy City College of CUNY November 2, 2007 hyllis Joan Cassidy City College of CUNY () The Kolchin Topology November 2, 2007 1 / 35 Conventions. F is a - eld, and A
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology
More informationRandom variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationDiscrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 10 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice,
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationA Little Set Theory (Never Hurt Anybody)
A Little Set Theory (Never Hurt Anybody) Matthew Saltzman Department of Mathematical Sciences Clemson University Draft: August 21, 2013 1 Introduction The fundamental ideas of set theory and the algebra
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
More informationProbabilistic Strategies: Solutions
Probability Victor Xu Probabilistic Strategies: Solutions Western PA ARML Practice April 3, 2016 1 Problems 1. You roll two 6-sided dice. What s the probability of rolling at least one 6? There is a 1
More informationThe Ergodic Theorem and randomness
The Ergodic Theorem and randomness Peter Gács Department of Computer Science Boston University March 19, 2008 Peter Gács (Boston University) Ergodic theorem March 19, 2008 1 / 27 Introduction Introduction
More informationChapter 7. Homotopy. 7.1 Basic concepts of homotopy. Example: z dz. z dz = but
Chapter 7 Homotopy 7. Basic concepts of homotopy Example: but γ z dz = γ z dz γ 2 z dz γ 3 z dz. Why? The domain of /z is C 0}. We can deform γ continuously into γ 2 without leaving C 0}. Intuitively,
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationCHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
More informationStatistics in Geophysics: Introduction and Probability Theory
Statistics in Geophysics: Introduction and Steffen Unkel Department of Statistics Ludwig-Maximilians-University Munich, Germany Winter Term 2013/14 1/32 What is Statistics? Introduction Statistics is the
More informationConditional Probability, Independence and Bayes Theorem Class 3, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Conditional Probability, Independence and Bayes Theorem Class 3, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom 1 Learning Goals 1. Know the definitions of conditional probability and independence
More informationIAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION
IAM 530 ELEMENTS OF PROBABILITY AND STATISTICS INTRODUCTION 1 WHAT IS STATISTICS? Statistics is a science of collecting data, organizing and describing it and drawing conclusions from it. That is, statistics
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationST 371 (IV): Discrete Random Variables
ST 371 (IV): Discrete Random Variables 1 Random Variables A random variable (rv) is a function that is defined on the sample space of the experiment and that assigns a numerical variable to each possible
More informationarxiv:math/0510680v3 [math.gn] 31 Oct 2010
arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering
More informationAbsolute Value Equations and Inequalities
Key Concepts: Compound Inequalities Absolute Value Equations and Inequalities Intersections and unions Suppose that A and B are two sets of numbers. The intersection of A and B is the set of all numbers
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More information14.451 Lecture Notes 10
14.451 Lecture Notes 1 Guido Lorenzoni Fall 29 1 Continuous time: nite horizon Time goes from to T. Instantaneous payo : f (t; x (t) ; y (t)) ; (the time dependence includes discounting), where x (t) 2
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationGeorg Cantor and Set Theory
Georg Cantor and Set Theory. Life Father, Georg Waldemar Cantor, born in Denmark, successful merchant, and stock broker in St Petersburg. Mother, Maria Anna Böhm, was Russian. In 856, because of father
More informationLebesgue Measure on R n
8 CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationChapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way
Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationSTAT 319 Probability and Statistics For Engineers PROBABILITY. Engineering College, Hail University, Saudi Arabia
STAT 319 robability and Statistics For Engineers LECTURE 03 ROAILITY Engineering College, Hail University, Saudi Arabia Overview robability is the study of random events. The probability, or chance, that
More informationAdvanced Microeconomics
Advanced Microeconomics Ordinal preference theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 68 Part A. Basic decision and preference theory 1 Decisions
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].
More informationQuestion: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
ECS20 Discrete Mathematics Quarter: Spring 2007 Instructor: John Steinberger Assistant: Sophie Engle (prepared by Sophie Engle) Homework 8 Hints Due Wednesday June 6 th 2007 Section 6.1 #16 What is the
More informationStat 5102 Notes: Nonparametric Tests and. confidence interval
Stat 510 Notes: Nonparametric Tests and Confidence Intervals Charles J. Geyer April 13, 003 This handout gives a brief introduction to nonparametrics, which is what you do when you don t believe the assumptions
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More informationLecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010
Lecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010 Richard A. Shore 1 Department of Mathematics Cornell University Ithaca NY 14853 January 3, 2012
More informationMaximum Likelihood Estimation
Math 541: Statistical Theory II Lecturer: Songfeng Zheng Maximum Likelihood Estimation 1 Maximum Likelihood Estimation Maximum likelihood is a relatively simple method of constructing an estimator for
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationRANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis
RANDOM INTERVAL HOMEOMORPHISMS MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis This is a joint work with Lluís Alsedà Motivation: A talk by Yulij Ilyashenko. Two interval maps, applied
More informationPrinciple of Data Reduction
Chapter 6 Principle of Data Reduction 6.1 Introduction An experimenter uses the information in a sample X 1,..., X n to make inferences about an unknown parameter θ. If the sample size n is large, then
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More information6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation
6.207/14.15: Networks Lecture 15: Repeated Games and Cooperation Daron Acemoglu and Asu Ozdaglar MIT November 2, 2009 1 Introduction Outline The problem of cooperation Finitely-repeated prisoner s dilemma
More informationLIMITS AND CONTINUITY
LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION
ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,
More information