Mathematical Preliminaries
|
|
- Stewart Wilkinson
- 5 years ago
- Views:
Transcription
1 Mathematical Preliminaries Economics Intermediate Macroeconomics Aaron Hedlund Baylor University Fall 2013 Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
2 Outline I: Sequences and Series II: Continuity and Differentiation III: Optimization and Comparative Statics IV: Basic Probability and Statistics Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
3 Sequences and Series A sequence is a function whose domain is the positive integers. Examples: f (t) = 2t or 2, 4, 6, 8, 10,... f (t) = ( 2) t or 2, 4, 8, 16, 32,... A sequence is convergent with limit L if, for any ɛ > 0, there is some T such that a t L < ɛ whenever t > T. We write lim t a t = L. If {a t } has no limit, it is divergent. If {a t } is a sequence, then s T = T t=t 0 a t, T = 1, 2, 3, is a series. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
4 Sequences and Series Theorem If s T = T t=t 0 a t is the series associated with sequence a t and a lim T +1 T a T = L it follows that: 1 if L < 1, then s T converges 2 if L > 1, then s T diverges 3 if L = 1, then s T may converge or diverge A geometric series is a series s T of the form s T = T t=t 0 ar t = ar T0 + ar T0+1 + ar T ar T Applying the theorem above, a geometric series converges if ar T +1 ar = r < 1. T Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
5 Sequences and Series The partial sum of a geometric series can be written explicitly as T ar t = ar T0 (1 r T T0+1 ) 1 r t=t 0 Taking the limit when r < 1, we get lim T T ar t = ar T0 1 r t=t 0 The present value PV of a stream of payments {π t } T t=1, discounted at rate r, is given by PV = T t=1 π t (1 + r) t 1 Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
6 Continuity and Differentiation A function f : (a, b) R is continuous at x 0 (a, b) if, for any ɛ > 0, there exists δ > 0 such that f (x) f (x 0 ) < ɛ whenever x x 0 < δ. We say that f (x) is differentiable at x (a, b) if the limit f (x) = f (x + x) f (x) lim x 0 x exists and is finite. The derivative of y = f (x) can also be written as dy df dx or dx. A function is continuously differentiable on a set S if it is differentiable and its derivative is continuous on S. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
7 Differentiation Rules 1 f (x) = c f (x) = 0. 2 f (x) = x n f (x) = nx n 1. 3 g(x) = cf (x) g (x) = cf (x). 4 h(x) = f (x) ± g(x) h (x) = f (x) ± g (x). 5 h(x) = f (x)g(x) h (x) = f (x)g(x) + f (x)g (x). 6 h(x) = f (x) g(x) h (x) = g(x)f (x) f (x)g (x) [g(x)] 2. 7 h(x) = f (g(x)) h (x) = f (g(x))g (x), or dh dx = df dx g(x) dg dx. 8 h(x) = f 1 (x) h 1 dh (x) =, or f (f 1 (x)) dx = 1 df dx f 1 (x) Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25.
8 Partial Differentiation The partial derivative of a function y = f (x 1, x 2,..., x n ) with respect to x i is written as y x i, f x i, or f i, and is defined as f f (x 1,..., x i + x i,..., x n ) f (x 1,..., x i,..., x n ) = lim x i x i 0 x i Most of the partial differentiation rules are simple extensions of the single variable rules, except for the chain rule. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
9 Multivariable Chain Rule and Total Differentiation Chain rule: Let y = f (u 1, u 2,..., u m ) and u i = g i (x 1, x 2,..., x n ) for all i = 1, 2,..., m. Denote x = (x 1,..., x n ) and define h(x) = f (g 1 (x),..., g m (x)). Then h x j = f u 1 g 1 x j + f u 2 g 2 x j + + f u m g m x j = m f u i i=1 y = y u 1 + y u y u m = x j u 1 x j u 2 x j u m x j The total differential of a function f (x) is i=1 ui =g i (x) m y u i g i x j, i.e. ui =g i (x) u i x j df = n i=1 f x i dx i Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
10 Second-Order Partial Derivatives The second-order partial derivative of f (x) with respect to x i and then x j is Theorem (Young s Theorem) f ij = f i(x) x j If f (x) has continuous first-order and second-order partial derivatives, the order of differentiation in computing the cross-partial is irrelevant, i.e. f ij = f ji. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
11 Concavity and Convexity A set S is convex if (1 θ)x + θx S for all x, x S and θ (0, 1). A function f (x) is concave if, for all x, x, and θ (0, 1), f ((1 θ)x + θx ) (1 θ)f (x) + θf (x ) A function f (x) is quasi-concave if, for all x, x, and θ (0, 1), f ((1 θ)x + θx ) min{f (x), f (x )} Equivalently, f is quasi-concave if S(a) = {x: f (x) a} are convex for all a. All concave functions are quasi-concave but not vice-versa. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
12 Concavity and Differentiability Univariate functions: Let f (x) be twice continuously differentiable. If f is concave, then f 0. Bivariate functions: Let f (x 1, x 2 ) be twice continuously differentiable. If f is concave, then f11 0 and f 11 f 22 (f 12 ) 2 0. If f (x 1, x 2 ) is quasi-concave, then f 11 f 2 2 2f 1f 2 f 12 + f 22 f 2 1 < 0. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
13 Constrained Optimization This section establishes necessary and sufficient conditions for solutions to problems of the following form: g 1 (x) 0 g 2 (x) 0... max f (x) such that g l (x) 0 h 1 (x) = 0... h k (x) = 0 Define the Lagrangian to the above problem as l k L(x, λ, γ) = f (x) + λ i g i (x) + γ j h j (x) i=1 j=1 Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
14 Constrained Optimization Theorem (Kuhn-Tucker) Suppose that f, {g i } l i=1, and {h j} k j=1 are continuously differentiable and x is a local constrained optimizer of f. Also, assume that the constraint qualification is satisfied. Then there exist multipliers λ and γ such that L First-Order Conditions: (x, λ, γ ) = 0,..., L (x, λ, γ ) = 0 x 1 x { n g1 (x Constraints: ) 0,..., g l (x ) 0 h 1 (x ) = 0,..., h k (x ) = 0 Complementary Slackness: λ 1g 1 (x ) = 0,..., λ l g l(x ) = 0 Nonnegative g-multipliers: λ 1 0,..., λ l 0 If f is concave and if {g i } l i=1 and {h j} k j=1 are quasi-concave, then the above conditions are also sufficient for x to be an optimal solution. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
15 Constrained Optimization: A Few Remarks An inequality constraint g i (x) is binding at a solution x if loosening the constraint and re-optimizing causes f to increase. Mathematically, f (x (m i )) m i = λ i (m i) > 0 where x (m i ) is the solution with multiplier λ i (m i) when the constraint is loosened to g i (x) m i. A binding constraint has g i (x ) = 0 and λ i > 0. A non-binding constraint has g i (x ) > 0 and λ i = 0. In rare instances λ i = 0 and g i (x ) = 0, in which case the constraint is not binding because λ i = 0. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
16 Constrained Optimization: A Simple Example A Binding Constraint: max x 2 + 4x 4 such that x 3 0 L = x 2 + 4x 4 + λ(x 3) Solution Conditions: L x = 0 = 2x λ x 3 0 λ (x 3) = 0 λ 0 x = 3, λ = 2 A Non-Binding Constraint: max x 2 + 4x 4 such that 3 x 0 L = x 2 + 4x 4 + λ(3 x) Solution Conditions: L x = 0 = 2x + 4 λ 3 x 0 λ (3 x ) = 0 λ 0 x = 2, λ = 0 Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
17 Comparative Statics Comparative statics analyzes how optimal solutions respond to changes in underlying parameters. Example: how does labor supply change in response to a wage increase? First, an important theorem: Theorem (Implicit Function Theorem) Let F (x, y) be a continuously differentiable function around (x, y ) with F (x, y ) = 0 and F y (x, y ) 0. Then there is a continuously differentiable function y = f (x) defined in a neighborhood B of x such that 1 F (x, y(x)) = 0 for all x B 2 y = f (x ) y 3 x i (x ) = f i (x ) = F xi (x, y )/F y (x, y ) Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
18 Comparative Statics - One Endogenous Variable Assume that we have an optimization problem that gives the following solution condition: F (x, α) = 0 Assume that F and the implicit solution x (α) are differentiable. As a function of α, we have Differentiating by α gives F (x (α), α) = 0 F x dx dα + F α = 0 dx dα = F α(x, α) F x (x, α) Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
19 Comparative Statics - Two Endogenous Variables Suppose we have the following solution conditions: F 1 (x 1, x 2, α) = 0 F 2 (x 1, x 2, α) = 0 Assume that the solution gives differentiable implicit functions x1 (α) and x2 (α). Differentiating with respect to α gives F1 1 x1 F 2 1 α + F 2 1 x1 α + F 2 2 x 2 Solving the system of equations gives α + F α 1 = 0 x2 α + F α 2 = 0 x 1 α = F 2 αf 1 2 F 1 αf 2 2 F 1 1 F 2 2 F 2 1 F 1 2 and x 2 α = F 1 αf 2 1 F 2 αf 1 1 F 1 1 F 2 2 F 2 1 F 1 2 Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
20 Probability and Statistics Let Ω = {ω 1, ω 2,..., ω n } denote the sample space of an experiment, where each ω i is an outcome. Example: tossing a single die can yield any of the following outcomes: {1, 2, 3, 4, 5, 6}. An event is a subset of outcomes in the sample space E Ω. Example: getting an even-numbered toss is the event that consists of the following outcomes: {2, 4, 6}. We can assign a probability P(E) to events, where P satisfies 1 0 P(E) 1 for all E. 2 P(Ω) = 1. 3 P(E 1 E m ) = m i=1 P(E i) if E 1,..., E m are mutually exclusive events. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
21 Conditional Probability and Independence The conditional probability of E 2 given E 1 is the probability that E 2 will occur given that E 1 has occurred. It is represented by P(E 2 E 1 ) = P(E 1 E 2 ) P(E 1 ) Events E 1 and E 2 are independent if P(E 2 E 1 ) = P(E 2 ), or equivalently, if P(E 1 E 2 ) = P(E 1 )P(E 2 ). In applications it is useful to know Bayes rule: P(E F ) = P(E F ) P(F ) = P(F E)P(E) P(F E)P(E) + P(F E c )P(E c ) Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
22 Random Variables and Expectations A random variable X is a function defined on a sample space, X : Ω R. Example: Ω = {Heads, Tails}, X (Heads) = 0, X (Tails) = 1. The expected value or mean of a random variable X is E(X ) = n x i P(ω : X (ω) = x i ) i=1 where X takes on values {x 1,..., x n }. Let P(x i ) = P(ω : X (ω) = x i ). Above example: E(X ) = = 0.5. We often write µ X instead of E(X ). Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
23 Example: Expected Utility Set of events each period is S = {s 1,..., s S }. Event histories s t = (s 0, s 1,..., s t ) with probabilities π(s t ). Consumers value random consumption streams {c t (s t )} using expected utility: U({c t(s t )}) = E β t u(c t) = t=0 β t π(s t )u(c t(s t )) t=0 s t S t Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
24 Variance, Covariance, and Correlation The variance of a random variable is Var(X ) = E[(X µ X ) 2 ] = n (x i µ X ) 2 P(x i ) i=1 The covariance of two random variables X and Y is Cov(X, Y ) = E[(X µ X )(Y µ Y )] = n (x i µ X )(y i µ Y )P(x i, y i ) i=1 The correlation between X and Y is Corr(X, Y ) = Cov(X,Y ) SD(X )SD(Y ), where SD(X ) = Var(X ) is the standard deviation of X. Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
25 Sample Statistics When confronting actual data, the underlying probabilities are not readily observable, forcing us to compute sample statistics. Suppose we have data {(x 1, y 1 ), (x 2, y 2 ),..., (x n, y n )}. The sample mean and variance of X are X = 1 n n i=1 x i and Var(X ) = 1 n 1 n i=1 (x i X ) 2. The sample covariance between X and Y is Cov(X, Y ) = 1 n 1 n i=1 (x i X )(y i Y ). Econ 3307 (Baylor University) Mathematical Preliminaries Fall / 25
Probability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27
Probability Review Yutian Li Stanford University January 18, 2018 Yutian Li (Stanford University) Probability Review January 18, 2018 1 / 27 Outline 1 Elements of probability 2 Random variables 3 Multiple
More informationOptimization. A first course on mathematics for economists
Optimization. A first course on mathematics for economists Xavier Martinez-Giralt Universitat Autònoma de Barcelona xavier.martinez.giralt@uab.eu II.3 Static optimization - Non-Linear programming OPT p.1/45
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationAlgorithms for Uncertainty Quantification
Algorithms for Uncertainty Quantification Tobias Neckel, Ionuț-Gabriel Farcaș Lehrstuhl Informatik V Summer Semester 2017 Lecture 2: Repetition of probability theory and statistics Example: coin flip Example
More informationPaul Schrimpf. October 17, UBC Economics 526. Constrained optimization. Paul Schrimpf. First order conditions. Second order conditions
UBC Economics 526 October 17, 2012 .1.2.3.4 Section 1 . max f (x) s.t. h(x) = c f : R n R, h : R n R m Draw picture of n = 2 and m = 1 At optimum, constraint tangent to level curve of function Rewrite
More informationReview of Probability Theory
Review of Probability Theory Arian Maleki and Tom Do Stanford University Probability theory is the study of uncertainty Through this class, we will be relying on concepts from probability theory for deriving
More informationMathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions
Mathematical Economics (ECON 471) Lecture 3 Calculus of Several Variables & Implicit Functions Teng Wah Leo 1 Calculus of Several Variables 11 Functions Mapping between Euclidean Spaces Where as in univariate
More informationEE514A Information Theory I Fall 2013
EE514A Information Theory I Fall 2013 K. Mohan, Prof. J. Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2013 http://j.ee.washington.edu/~bilmes/classes/ee514a_fall_2013/
More informationEC /11. Math for Microeconomics September Course, Part II Lecture Notes. Course Outline
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 20010/11 Math for Microeconomics September Course, Part II Lecture Notes Course Outline Lecture 1: Tools for
More informationSeminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1
Seminars on Mathematics for Economics and Finance Topic 5: Optimization Kuhn-Tucker conditions for problems with inequality constraints 1 Session: 15 Aug 2015 (Mon), 10:00am 1:00pm I. Optimization with
More informationQuick Tour of Basic Probability Theory and Linear Algebra
Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra CS224w: Social and Information Network Analysis Fall 2011 Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra Outline Definitions
More informationCourse: ESO-209 Home Work: 1 Instructor: Debasis Kundu
Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear
More informationLecture 2: Repetition of probability theory and statistics
Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:
More informationModern Optimization Theory: Concave Programming
Modern Optimization Theory: Concave Programming 1. Preliminaries 1 We will present below the elements of modern optimization theory as formulated by Kuhn and Tucker, and a number of authors who have followed
More informationJoint Distribution of Two or More Random Variables
Joint Distribution of Two or More Random Variables Sometimes more than one measurement in the form of random variable is taken on each member of the sample space. In cases like this there will be a few
More informationMicroeconomic Theory. Microeconomic Theory. Everyday Economics. The Course:
The Course: Microeconomic Theory This is the first rigorous course in microeconomic theory This is a course on economic methodology. The main goal is to teach analytical tools that will be useful in other
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
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 informationMathematical Economics: Lecture 2
Mathematical Economics: Lecture 2 Yu Ren WISE, Xiamen University September 25, 2012 Outline 1 Number Line The number line, origin (Figure 2.1 Page 11) Number Line Interval (a, b) = {x R 1 : a < x < b}
More information8. Constrained Optimization
8. Constrained Optimization Daisuke Oyama Mathematics II May 11, 2018 Unconstrained Maximization Problem Let X R N be a nonempty set. Definition 8.1 For a function f : X R, x X is a (strict) local maximizer
More informationInformation Theory Primer:
Information Theory Primer: Entropy, KL Divergence, Mutual Information, Jensen s inequality Seungjin Choi Department of Computer Science and Engineering Pohang University of Science and Technology 77 Cheongam-ro,
More informationProperties of Walrasian Demand
Properties of Walrasian Demand Econ 2100 Fall 2017 Lecture 5, September 12 Problem Set 2 is due in Kelly s mailbox by 5pm today Outline 1 Properties of Walrasian Demand 2 Indirect Utility Function 3 Envelope
More informationExercises with solutions (Set D)
Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where
More informationPROBABILITY AND INFORMATION THEORY. Dr. Gjergji Kasneci Introduction to Information Retrieval WS
PROBABILITY AND INFORMATION THEORY Dr. Gjergji Kasneci Introduction to Information Retrieval WS 2012-13 1 Outline Intro Basics of probability and information theory Probability space Rules of probability
More information1.3 The Indirect Utility Function
1.2 Utility Maximization Problem (UMP) (MWG 2.D, 2.E; Kreps 2.2) max u (x) s.t. p.x w and x 0 hx Xi For a cts preference relation represented by a cts utility fn, u ( ): 1. The UMP has at least one solution
More informationRandom Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R
In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample
More information1: PROBABILITY REVIEW
1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following
More informationThe general programming problem is the nonlinear programming problem where a given function is maximized subject to a set of inequality constraints.
1 Optimization Mathematical programming refers to the basic mathematical problem of finding a maximum to a function, f, subject to some constraints. 1 In other words, the objective is to find a point,
More informationEC /11. Math for Microeconomics September Course, Part II Problem Set 1 with Solutions. a11 a 12. x 2
LONDON SCHOOL OF ECONOMICS Professor Leonardo Felli Department of Economics S.478; x7525 EC400 2010/11 Math for Microeconomics September Course, Part II Problem Set 1 with Solutions 1. Show that the general
More informationMathematical Appendix
Ichiro Obara UCLA September 27, 2012 Obara (UCLA) Mathematical Appendix September 27, 2012 1 / 31 Miscellaneous Results 1. Miscellaneous Results This first section lists some mathematical facts that were
More informationM378K In-Class Assignment #1
The following problems are a review of M6K. M7K In-Class Assignment # Problem.. Complete the definition of mutual exclusivity of events below: Events A, B Ω are said to be mutually exclusive if A B =.
More informationEcon Slides from Lecture 14
Econ 205 Sobel Econ 205 - Slides from Lecture 14 Joel Sobel September 10, 2010 Theorem ( Lagrange Multipliers ) Theorem If x solves max f (x) subject to G(x) = 0 then there exists λ such that Df (x ) =
More informationRandom Variables and Their Distributions
Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital
More informationChapter 3: Random Variables 1
Chapter 3: Random Variables 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationPrinciples in Economics and Mathematics: the mathematical part
Principles in Economics and Mathematics: the mathematical part Bram De Rock Bram De Rock Mathematical principles 1/65 Practicalities about me Bram De Rock Office: R.42.6.218 E-mail: bderock@ulb.ac.be Phone:
More informationIntroduction to Machine Learning
Introduction to Machine Learning Introduction to Probabilistic Methods Varun Chandola Computer Science & Engineering State University of New York at Buffalo Buffalo, NY, USA chandola@buffalo.edu Chandola@UB
More informationPart IA Probability. Theorems. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Theorems Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More informationMicroeconomics I. September, c Leopold Sögner
Microeconomics I c Leopold Sögner Department of Economics and Finance Institute for Advanced Studies Stumpergasse 56 1060 Wien Tel: +43-1-59991 182 soegner@ihs.ac.at http://www.ihs.ac.at/ soegner September,
More informationChapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University
Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real
More informationWe introduce methods that are useful in:
Instructor: Shengyu Zhang Content Derived Distributions Covariance and Correlation Conditional Expectation and Variance Revisited Transforms Sum of a Random Number of Independent Random Variables more
More informationMathematical Economics. Lecture Notes (in extracts)
Prof. Dr. Frank Werner Faculty of Mathematics Institute of Mathematical Optimization (IMO) http://math.uni-magdeburg.de/ werner/math-ec-new.html Mathematical Economics Lecture Notes (in extracts) Winter
More informationMathematical Preliminaries for Microeconomics: Exercises
Mathematical Preliminaries for Microeconomics: Exercises Igor Letina 1 Universität Zürich Fall 2013 1 Based on exercises by Dennis Gärtner, Andreas Hefti and Nick Netzer. How to prove A B Direct proof
More informationMore on Distribution Function
More on Distribution Function The distribution of a random variable X can be determined directly from its cumulative distribution function F X. Theorem: Let X be any random variable, with cumulative distribution
More informationFormulas for probability theory and linear models SF2941
Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms
More informationMath 141: Lecture 11
Math 141: Lecture 11 The Fundamental Theorem of Calculus and integration methods Bob Hough October 12, 2016 Bob Hough Math 141: Lecture 11 October 12, 2016 1 / 36 First Fundamental Theorem of Calculus
More informationMathematical Foundations -1- Constrained Optimization. Constrained Optimization. An intuitive approach 2. First Order Conditions (FOC) 7
Mathematical Foundations -- Constrained Optimization Constrained Optimization An intuitive approach First Order Conditions (FOC) 7 Constraint qualifications 9 Formal statement of the FOC for a maximum
More informationEcon 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS. Carmen Astorne-Figari Washington University in St. Louis.
Econ 508-A FINITE DIMENSIONAL OPTIMIZATION - NECESSARY CONDITIONS Carmen Astorne-Figari Washington University in St. Louis August 12, 2010 INTRODUCTION General form of an optimization problem: max x f
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More information02 Background Minimum background on probability. Random process
0 Background 0.03 Minimum background on probability Random processes Probability Conditional probability Bayes theorem Random variables Sampling and estimation Variance, covariance and correlation Probability
More informationStat 5101 Notes: Algorithms (thru 2nd midterm)
Stat 5101 Notes: Algorithms (thru 2nd midterm) Charles J. Geyer October 18, 2012 Contents 1 Calculating an Expectation or a Probability 2 1.1 From a PMF........................... 2 1.2 From a PDF...........................
More informationMath Bootcamp 2012 Miscellaneous
Math Bootcamp 202 Miscellaneous Factorial, combination and permutation The factorial of a positive integer n denoted by n!, is the product of all positive integers less than or equal to n. Define 0! =.
More informationMA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems
MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems Review of Basic Probability The fundamentals, random variables, probability distributions Probability mass/density functions
More informationMULTIVARIATE PROBABILITY DISTRIBUTIONS
MULTIVARIATE PROBABILITY DISTRIBUTIONS. PRELIMINARIES.. Example. Consider an experiment that consists of tossing a die and a coin at the same time. We can consider a number of random variables defined
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationN. L. P. NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP. Optimization. Models of following form:
0.1 N. L. P. Katta G. Murty, IOE 611 Lecture slides Introductory Lecture NONLINEAR PROGRAMMING (NLP) deals with optimization models with at least one nonlinear function. NLP does not include everything
More informationIn view of (31), the second of these is equal to the identity I on E m, while this, in view of (30), implies that the first can be written
11.8 Inequality Constraints 341 Because by assumption x is a regular point and L x is positive definite on M, it follows that this matrix is nonsingular (see Exercise 11). Thus, by the Implicit Function
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland ECON 77200 - Math for Economists Boston College, Department of Economics Fall 207 The Kuhn-Tucker and envelope theorems can be used to characterize the
More information1/37. Convexity theory. Victor Kitov
1/37 Convexity theory Victor Kitov 2/37 Table of Contents 1 2 Strictly convex functions 3 Concave & strictly concave functions 4 Kullback-Leibler divergence 3/37 Convex sets Denition 1 Set X is convex
More informationMath Camp II. Calculus. Yiqing Xu. August 27, 2014 MIT
Math Camp II Calculus Yiqing Xu MIT August 27, 2014 1 Sequence and Limit 2 Derivatives 3 OLS Asymptotics 4 Integrals Sequence Definition A sequence {y n } = {y 1, y 2, y 3,..., y n } is an ordered set
More informationHomework 4 Solution, due July 23
Homework 4 Solution, due July 23 Random Variables Problem 1. Let X be the random number on a die: from 1 to. (i) What is the distribution of X? (ii) Calculate EX. (iii) Calculate EX 2. (iv) Calculate Var
More informationDeep Learning for Computer Vision
Deep Learning for Computer Vision Lecture 3: Probability, Bayes Theorem, and Bayes Classification Peter Belhumeur Computer Science Columbia University Probability Should you play this game? Game: A fair
More informationPCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities
PCMI 207 - Introduction to Random Matrix Theory Handout #2 06.27.207 REVIEW OF PROBABILITY THEORY Chapter - Events and Their Probabilities.. Events as Sets Definition (σ-field). A collection F of subsets
More information1 Probability theory. 2 Random variables and probability theory.
Probability theory Here we summarize some of the probability theory we need. If this is totally unfamiliar to you, you should look at one of the sources given in the readings. In essence, for the major
More informationJanuary 29, Introduction to optimization and complexity. Outline. Introduction. Problem formulation. Convexity reminder. Optimality Conditions
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis Dimensioning II Department of Electronics Communications Engineering Tampere University of Technology, Tampere, Finl January 29, 2014 1 2 3
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 informationMore on Lagrange multipliers
More on Lagrange multipliers CE 377K April 21, 2015 REVIEW The standard form for a nonlinear optimization problem is min x f (x) s.t. g 1 (x) 0. g l (x) 0 h 1 (x) = 0. h m (x) = 0 The objective function
More information4. Distributions of Functions of Random Variables
4. Distributions of Functions of Random Variables Setup: Consider as given the joint distribution of X 1,..., X n (i.e. consider as given f X1,...,X n and F X1,...,X n ) Consider k functions g 1 : R n
More informationProblem Set 2 Solutions
EC 720 - Math for Economists Samson Alva Department of Economics Boston College October 4 2011 1. Profit Maximization Problem Set 2 Solutions (a) The Lagrangian for this problem is L(y k l λ) = py rk wl
More informationLecture 1: August 28
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 1: August 28 Our broad goal for the first few lectures is to try to understand the behaviour of sums of independent random
More informationThe Kuhn-Tucker and Envelope Theorems
The Kuhn-Tucker and Envelope Theorems Peter Ireland EC720.01 - Math for Economists Boston College, Department of Economics Fall 2010 The Kuhn-Tucker and envelope theorems can be used to characterize the
More informationMultivariate probability distributions and linear regression
Multivariate probability distributions and linear regression Patrik Hoyer 1 Contents: Random variable, probability distribution Joint distribution Marginal distribution Conditional distribution Independence,
More informationInformation geometry for bivariate distribution control
Information geometry for bivariate distribution control C.T.J.Dodson + Hong Wang Mathematics + Control Systems Centre, University of Manchester Institute of Science and Technology Optimal control of stochastic
More informationIntroduction to Machine Learning
What does this mean? Outline Contents Introduction to Machine Learning Introduction to Probabilistic Methods Varun Chandola December 26, 2017 1 Introduction to Probability 1 2 Random Variables 3 3 Bayes
More informationCALCULUS. Berkant Ustaoğlu CRYPTOLOUNGE.NET
CALCULUS Berkant Ustaoğlu CRYPTOLOUNGE.NET Secant 1 Definition Let f be defined over an interval I containing u. If x u and x I then f (x) f (u) Q = x u is the difference quotient. Also if h 0, such that
More informationWeek 3: Sets and Mappings/Calculus and Optimization (Jehle September and Reny, 20, 2015 Chapter A1/A2)
Week 3: Sets and Mappings/Calculus and Optimization (Jehle and Reny, Chapter A1/A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 20, 2015 Week 3: Sets and Mappings/Calculus
More informationAppendix A : Introduction to Probability and stochastic processes
A-1 Mathematical methods in communication July 5th, 2009 Appendix A : Introduction to Probability and stochastic processes Lecturer: Haim Permuter Scribe: Shai Shapira and Uri Livnat The probability of
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More informationMath Refresher - Calculus
Math Refresher - Calculus David Sovich Washington University in St. Louis TODAY S AGENDA Today we will refresh Calculus for FIN 451 I will focus less on rigor and more on application We will cover both
More informationMATHEMATICS FOR ECONOMISTS. Course Convener. Contact: Office-Hours: X and Y. Teaching Assistant ATIYEH YEGANLOO
INTRODUCTION TO QUANTITATIVE METHODS IN ECONOMICS MATHEMATICS FOR ECONOMISTS Course Convener DR. ALESSIA ISOPI Contact: alessia.isopi@manchester.ac.uk Office-Hours: X and Y Teaching Assistant ATIYEH YEGANLOO
More information5. Duality. Lagrangian
5. Duality Convex Optimization Boyd & Vandenberghe Lagrange dual problem weak and strong duality geometric interpretation optimality conditions perturbation and sensitivity analysis examples generalized
More informationLecture 2: Convex Sets and Functions
Lecture 2: Convex Sets and Functions Hyang-Won Lee Dept. of Internet & Multimedia Eng. Konkuk University Lecture 2 Network Optimization, Fall 2015 1 / 22 Optimization Problems Optimization problems are
More informationCalculus Overview. f(x) f (x) is slope. I. Single Variable. A. First Order Derivative : Concept : measures slope of curve at a point.
Calculus Overview I. Single Variable A. First Order Derivative : Concept : measures slope of curve at a point. Notation : Let y = f (x). First derivative denoted f ʹ (x), df dx, dy dx, f, etc. Example
More informationMATHEMATICAL ECONOMICS: OPTIMIZATION. Contents
MATHEMATICAL ECONOMICS: OPTIMIZATION JOÃO LOPES DIAS Contents 1. Introduction 2 1.1. Preliminaries 2 1.2. Optimal points and values 2 1.3. The optimization problems 3 1.4. Existence of optimal points 4
More information1.12 Multivariate Random Variables
112 MULTIVARIATE RANDOM VARIABLES 59 112 Multivariate Random Variables We will be using matrix notation to denote multivariate rvs and their distributions Denote by X (X 1,,X n ) T an n-dimensional random
More informationStructural and Multidisciplinary Optimization. P. Duysinx and P. Tossings
Structural and Multidisciplinary Optimization P. Duysinx and P. Tossings 2018-2019 CONTACTS Pierre Duysinx Institut de Mécanique et du Génie Civil (B52/3) Phone number: 04/366.91.94 Email: P.Duysinx@uliege.be
More informationChapter 3: Random Variables 1
Chapter 3: Random Variables 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationHW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.
HW1 solutions Exercise 1 (Some sets of probability distributions.) Let x be a real-valued random variable with Prob(x = a i ) = p i, i = 1,..., n, where a 1 < a 2 < < a n. Of course p R n lies in the standard
More informationEconomics 101A (Lecture 3) Stefano DellaVigna
Economics 101A (Lecture 3) Stefano DellaVigna January 24, 2017 Outline 1. Implicit Function Theorem 2. Envelope Theorem 3. Convexity and concavity 4. Constrained Maximization 1 Implicit function theorem
More information4. Convex optimization problems (part 1: general)
EE/AA 578, Univ of Washington, Fall 2016 4. Convex optimization problems (part 1: general) optimization problem in standard form convex optimization problems quasiconvex optimization 4 1 Optimization problem
More informationMAT137 Calculus! Lecture 6
MAT137 Calculus! Lecture 6 Today: 3.2 Differentiation Rules; 3.3 Derivatives of higher order. 3.4 Related rates 3.5 Chain Rule 3.6 Derivative of Trig. Functions Next: 3.7 Implicit Differentiation 4.10
More informationQF101: Quantitative Finance August 22, Week 1: Functions. Facilitator: Christopher Ting AY 2017/2018
QF101: Quantitative Finance August 22, 2017 Week 1: Functions Facilitator: Christopher Ting AY 2017/2018 The chief function of the body is to carry the brain around. Thomas A. Edison 1.1 What is a function?
More informationIntroduction to Probability Theory
Introduction to Probability Theory Ping Yu Department of Economics University of Hong Kong Ping Yu (HKU) Probability 1 / 39 Foundations 1 Foundations 2 Random Variables 3 Expectation 4 Multivariate Random
More informationGeneralization to inequality constrained problem. Maximize
Lecture 11. 26 September 2006 Review of Lecture #10: Second order optimality conditions necessary condition, sufficient condition. If the necessary condition is violated the point cannot be a local minimum
More informationReview (Probability & Linear Algebra)
Review (Probability & Linear Algebra) CE-725 : Statistical Pattern Recognition Sharif University of Technology Spring 2013 M. Soleymani Outline Axioms of probability theory Conditional probability, Joint
More informationWeek 4: Calculus and Optimization (Jehle and Reny, Chapter A2)
Week 4: Calculus and Optimization (Jehle and Reny, Chapter A2) Tsun-Feng Chiang *School of Economics, Henan University, Kaifeng, China September 27, 2015 Microeconomic Theory Week 4: Calculus and Optimization
More informationFinal Review: Problem Solving Strategies for Stat 430
Final Review: Problem Solving Strategies for Stat 430 Hyunseung Kang December 14, 011 This document covers the material from the last 1/3 of the class. It s not comprehensive nor is it complete (because
More informationProbability theory for Networks (Part 1) CS 249B: Science of Networks Week 02: Monday, 02/04/08 Daniel Bilar Wellesley College Spring 2008
Probability theory for Networks (Part 1) CS 249B: Science of Networks Week 02: Monday, 02/04/08 Daniel Bilar Wellesley College Spring 2008 1 Review We saw some basic metrics that helped us characterize
More informationExpectation and Variance
Expectation and Variance August 22, 2017 STAT 151 Class 3 Slide 1 Outline of Topics 1 Motivation 2 Expectation - discrete 3 Transformations 4 Variance - discrete 5 Continuous variables 6 Covariance STAT
More informationA6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011
A6523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Reading Chapter 5 (continued) Lecture 8 Key points in probability CLT CLT examples Prior vs Likelihood Box & Tiao
More informationChapter 2: Differentiation
Chapter 2: Differentiation Spring 2018 Department of Mathematics Hong Kong Baptist University 1 / 82 2.1 Tangent Lines and Their Slopes This section deals with the problem of finding a straight line L
More information