ECONOMICS 200A MATHEMATICAL HANDOUT

Size: px
Start display at page:

Download "ECONOMICS 200A MATHEMATICAL HANDOUT"

Transcription

1 ECONOMICS 00A MATHEMATICAL HANDOUT Fall 07 A. CALCULUS REVIEW Mark Machia Derivatives, Partial Derivatives ad the Chai Rule You should already kow what a derivative is. We ll use the epressios ƒ() or dƒ()/ for the derivative of the fuctio ƒ(). To idicate the derivative of ƒ() evaluated at the poit = *, we ll use the epressios ƒ(*) or dƒ(*)/. Whe we have a fuctio of more tha oe variable, we ca cosider its derivatives with respect to each of the variables, that is, each of its partial derivatives. We use the epressios: ƒ(, ) ad ƒ(,) iterchageably to deote the partial derivative of ƒ(,) with respect to its first argumet (that is, with respect to ). To calculate this, just hold fied (treat it as a costat) so that ƒ(,) may be thought of as a fuctio of aloe, ad differetiate it with respect to. The otatio for partial derivatives with respect to (or i the geeral case, with respect to i) is aalogous. For eample, if ƒ(,) = + 3, we have: ƒ(, ) ƒ(, ) = ƒ(,) = + 3 ad = ƒ(,) = The ormal vector of a fuctio ƒ(,...,) at the poit (,...,) is just the vector (i.e., ordered list) of its partial derivatives at that poit, that is, the vector: ƒ(,..., ) ƒ(,..., ) ƒ(,..., ),,..., ƒ (,..., ), ƒ (,..., ),..., ƒ (,..., ) Normal vectors play a key role i the coditios for ucostraied ad costraied optimizatio. The chai rule gives the derivative for a fuctio of a fuctio. Thus if ƒ() g(h()) we have ƒ() = g(h()) h() The chai rule also applies to takig partial derivatives. For eample, if ƒ(,) g(h(,)) the ƒ(, ) h(, ) g( h(, )) Similarly, if ƒ(,) g(h(,),k(,)) the: ƒ(, ) h(, ) k(, ) g ( h(, ), k(, )) g ( h(, ), k(, )) The secod derivative of the fuctio ƒ() is writte: d ƒ( ) ƒ() or If the material i this sectio is ot already familiar to you, you probably wo t be able to pass this course.

2 ad it is obtaied by differetiatig the fuctio ƒ() twice with respect to (if you wat to calculate the value of the secod derivative at a particular poit *, do t substitute i * util after you ve differetiated twice). A secod partial derivative of a fuctio of several variables is aalogous, i.e., we write: ƒii(,...,) or to deote differetiatig twice with respect to i. ƒ(,..., ) i We get a cross partial derivative whe we differetiate first with respect to i ad the with respect to some other variable j. We will deote this with the epressios: ƒ(,..., ) ƒij(,...,) or Here s a strage ad woderful result: if we had differetiated i the opposite order, that is, first with respect to j ad the with respect to i, we would have gotte the same result. I other words, ƒji(,...,) ƒij(,...,) or equivaletly ƒ(,...,)/ij ƒ(,...,)/ji. i j Approimatio Formulas for Small Chages i Fuctios (Total Differetials) If ƒ() is differetiable, we ca approimate the effect of a small chage i by: ƒ = ƒ(+) ƒ() ƒ() where is the chage i. From calculus, we kow that as becomes smaller ad smaller, this approimatio becomes etremely good. We sometimes write this geeral idea more formally by epressig the total differetial of ƒ(), amely: dƒ = ƒ() but it is still just shorthad for sayig We ca approimate the chage i ƒ() by the formula ƒ ƒ(), ad this approimatio becomes etremely good for very small values of. Whe ƒ() is a fuctio of a fuctio, i.e., it takes the form ƒ() g(h()), the chai rule lets us write the above approimatio formula ad above total differetial formula as dg( h( ))) g( h( )) g( h( )) h( ) thus dg( h( )) g( h( )) h( ) For a fuctio ƒ(,...,) that depeds upo several variables, the approimatio formula is: ƒ(,..., ) ƒ(,..., ) ƒ = ƒ(+,...,+) ƒ(,...,)... Oce agai, this approimatio formula becomes etremely good for very small values of,,. As before, we sometimes write this idea more formally (ad succictly) by epressig the total differetial of ƒ(), amely:

3 ƒ(,..., ) ƒ(,..., ) dƒ... or i equivalet otatio: dƒ = ƒ(,...,) + + ƒ(,...,) B. ELASTICITY Let the variable y deped upo the variable accordig to some fuctio, i.e.: y = ƒ() How resposive is y to chages i? Oe measure of resposiveess would be to plot the fuctio ƒ() ad look at its slope. If we did this, our measure of resposiveess would be: absolute chage i y y dy slope of f ( ) = f ( ) absolute chage i Elasticity is a differet measure of resposiveess tha slope. Rather tha lookig at the ratio of the absolute chage i y to the absolute chage i, elasticity is a measure of the proportioate (or percetage) chage i y to the proportioate (or percetage) chage i. Formally, if y = ƒ(), the the elasticity of y with respect to, writte Ey,, is give by: E y, = y proportioate chage i y y y proportioate chage i y If we cosider very small chages i (ad hece i y), y/ becomes dy/ = ƒ(), so we get that the elasticity of y with respect to is give by: y y = y dy E, ( ) y f y y y Note that if ƒ() is a icreasig fuctio the elasticity will be positive, ad if ƒ() is a decreasig fuctio, it will be egative. It is crucial to ote that while elasticity ad slope are both measures of how resposive y is to chages i, they are differet measures. I other words, elasticity is ot the same as slope. For eample, if y is eactly proportioal to, i.e., if we have y = c, the slope of this curve would be c, but its elasticity is give by: dy Ey, = c y c I other words, wheever y is eactly proportioal to, the elasticity of y with respect to will be oe, regardless of the value of the coefficiet c. Here s aother eample to show that elasticity is ot the same as slope. The fuctio y = obviously has a costat slope (amely 4). But it does ot have a costat elasticity. To see this, use the formula agai: 3

4 E y, which is obviously ot costat as varies. dy 4 = 4 y Fially, we ote that if a fuctio has a costat elasticity, it must take the form ƒ() c for some costats c > 0 ad. We prove this by the calculatio: E ƒ( ), = ( ) d ƒ( ) c ƒ( ) c Note that will be positive if the fuctio is icreasig, ad egative if it is decreasig. C. LEVEL CURVES OF FUNCTIONS If ƒ(,) is a fuctio of the two variables ad, a level curve of ƒ(,) is just a locus of poits i the (,) plae alog which ƒ(,) takes o some costat value, say the value k. The equatio of this level curve is therefore give by ƒ(,) = k. For eample, the level curves of a cosumer s utility fuctio are just his or her idifferece curves (defied by the equatio U(,) = u0), ad the level curves of a firm s productio fuctio are just the isoquats (defied by the equatio ƒ(l,k) = Q0). The slope of a level curve is idicated by the otatio: ƒ(, ) k ƒ0 or where the subscripted equatios are used to remid us that ad must vary i a maer which keeps us o the ƒ(,) = k level curve (i.e., so that ƒ = 0). To calculate this slope, recall the vector of chages (,) will keep us o this level curve if ad oly if it satisfies the equatio: 0 = f ƒ(,) + ƒ(,) which implies that ad will accordigly satisfy: so that i the limit we have: ƒ(, ) k ƒ (, ) ƒ (, ) ƒ(, ) k ƒ (, ) ƒ (, ) This slope gives the rate at which we ca trade off or substitute agaist so as to leave the value of the fuctio ƒ(,) uchaged. This cocept will be of frequet use i this course. 4

5 slope = b ƒ, gk ƒ(, ) ƒ(, ) ƒ(, ) = k A applicatio of this result is that the slope of the idifferece curve at a give cosumptio budle is give by the ratio of the margial utilities of the two commodities at that budle. Aother applicatio is that the slope of a isoquat at a give iput budle is the ratio of the margial products of the two factors at that iput budle. I the case of a fuctio ƒ(,...,) of several variables, we will have a level surface i dimesioal space alog which the fuctio is costat, that is, defied by the equatio ƒ(,...,) = k. I this case the level surface does ot have a uique taget lie. However, we ca still determie the rate at which we ca trade off ay pair of variables i ad j so as to keep the value of the fuctio costat. By eact aalogy with the above derivatio, this rate is give by: ƒ (,..., ) i j i ƒ (,..., ) j ƒ(,..., ) k j ƒ0 i Fially, give ay level curve (or level surface) correspodig to the value k, the better-tha set of that level curve or level surface is the set of all poits at which the fuctio yields a higher value tha k, ad the worse-tha set is the set of all poits at which the fuctio yields a lower value tha k. D. POSSIBLE PROPERTIES OF FUNCTIONS Cardial vs. Ordial Properties of a Fuctio Cosider some domai X. For coveiece, we ca epress each poit i X by the boldface symbol = (,...,), * = ( *,..., * ), etc. Every real-valued fuctio ƒ() = ƒ(,...,) over X implies (amog other thigs) the followig two types of iformatio: ordial iformatio: how the fuctio raks differet poits i its domai, i.e., the rakig ord over poits i X, as defied by A ord B ƒ(a) ƒ(b) cardial iformatio: how the fuctio raks differeces betwee pairs of poits i the domai, the rakig crd over all pairs of poits i X, as defied by {A, B} crd {C, D} ƒ(a) ƒ(b) ƒ(c) ƒ(d) 5

6 It is easy to prove that the rakigs ord ad crd will always be trasitive (ca you do this?) ad we defie their associated relatios ord, ~ord, ord ad crd, ~crd, crd i the obvious maer. Note that a pair of fuctios ƒ() ad g() over X will have the same ordial iformatio as each other if ad oly if they are liked by some icreasig trasformatio of the form g() (ƒ()) for some strictly icreasig fuctio () Similarly, a pair of fuctios ƒ() ad g() will have the same cardial iformatio as each other if ad oly if they are liked by some icreasig affie trasformatio of the form g() a ƒ() + b for some costats a, b with a > 0 Although it is importat to recall that every fuctio has both cardial ad ordial iformatio, we typically refer to a fuctio as ordial if oly its ordial iformatio is relevat. A eample is a stadard utility fuctio U(,...,) over ostochastic commodity budles (,...,), whose ordial iformatio is precisely the cosumer s preferece relatio over such budles. We refer to a fuctio as cardial if its cardial iformatio is relevat. A eample of a cardial fuctio is a cosumer s vo Neuma-Morgester utility fuctio which (uder the epected utility hypothesis) represets their attitudes toward risk (if you have ot yet see this cocept, do t worry.) The cardial iformatio of a fuctio icludes its ordial iformatio, sice * ord ƒ(*) ƒ() ƒ(*) ƒ() ƒ() ƒ() {*, } crd {, } But do t thik that a fuctio s cardial iformatio (the rakig crd) ehausts the iformatio of the fuctio. For eample, kowig all the cardial iformatio of a productio fuctio still leaves you with o idea of how much output it yields from ay iput budle! (I.e., productio fuctios are more tha just cardial fuctios.) Scale Properties of a Fuctio The fuctio ƒ(,...,) ehibits costat returs to scale or is homogeeous of degree oe, if ƒ(,...,) ƒ(,...,) for all,..., ad all > 0 i.e. if multiplyig all argumets by implies the value of the fuctio is also multiplied by. A fuctio ƒ(,...,) is said to ehibit scale ivariace or is homogeeous of degree zero if ƒ(,...,) ƒ(,...,) for all,..., ad all > 0 i.e., if multiplyig all argumets by leads to o chage i the value of the fuctio. Say that ƒ(,...,) is homogeeous of degree oe, so that we have ƒ(,...,) ƒ(,...,). Differetiatig this idetity with respect to yields: settig = the gives: ƒ ( i,..., ) i ƒ(,..., ) for all,..., ad > 0 i ƒ ( i,..., ) i ƒ(,..., ) for all,..., i which is called Euler s theorem, ad which will tur out to have very importat implicatios for the distributio of icome amog factors of productio. Here s aother useful result: if a fuctio is homogeeous of degree, the its partial derivatives are all homogeeous of degree 0. To see this, take the idetity ƒ(,...,) ƒ(,...,) ad this time differetiate with respect to i, to get: 6

7 ƒi(,...,) ƒi(,...,) for all,..., ad > 0 or equivaletly: ƒi(,...,) ƒi(,...,) for all,..., ad > 0 which establishes our result. I other words, if a productio fuctio ehibits costat returs to scale, the margial products of all the factors will be scale ivariat. More geerally, a fuctio ƒ(,...,) is homogeeous of degree if ƒ(,...,) ƒ(,...,) for all,..., ad all > 0 i.e., if multiplyig all argumets by implies that the value of the fuctio is multiplied by. Aother way to thik of this property is that ƒ(,...,) has a costat scale elasticity of. To check your uderstadig of argumets ivolvig homogeeous fuctios, see if you ca prove the followig geeralizatio of the previous paragraph s result: If ƒ(,...,) is homogeeous of degree k, the its partials are all homogeeous of degree k. Cocave ad Cove Fuctios A real-valued fuctio ƒ() = ƒ(,...,) over a cove domai X is said to be cocave if ad cove if ƒ( + ( ) *) ƒ() + ( ) ƒ(*) for all, *, ad all (0,) ƒ( + ( ) *) ƒ() + ( ) ƒ(*) for all, *, ad all (0,) ƒ() is strictly cocave/cove if the relevat iequality holds strictly for all, * ad. If ƒ() is a cocave/cove fuctio of a sigle variable, the above coditios imply that the chord likig ay two poits o its graph will lie everywhere o or below/above it. If ƒ() is twice differetiable, the it will be cocave/cove if ad oly if its secod derivative ƒ() is everywhere opositive/oegative. However, the lik with secod derivatives is ot so eact for strict cocavity/coveity: the fuctio ƒ() = 4 is twice differetiable ad strictly cove over the etire real lie, evet though its secod derivative ƒ() is ot positive at = 0. Fially, ƒ() = ƒ(,...,) is affie if it takes the form ƒ(,...,) i= aii + b for some costats a,...,a, b. Affie fuctios are simultaeously weakly cocave ad weakly cove. Quasicocave ad Quasicove Fuctios A real-valued fuctio ƒ() = ƒ(,...,) over a cove domai X is quasicocave if ad quasicove if ƒ( + ( ) *)ƒ() for all, * such that ƒ(*) = ƒ(), ad all (0,) ƒ( + ( ) *)ƒ() for all, * such that ƒ(*) = ƒ(), ad all (0,) We use the terms strictly quasicocave/quasicove if the relevat iequality always holds strictly. There are a couple other equivalet defiitios of these cocepts. Perhaps the most ituitive is ƒ() = ƒ(,...,) is quasicocave for every *, the set { ƒ() ƒ(*) is a cove set } ƒ() = ƒ(,...,) is quasicove for every *, the set { ƒ() ƒ(*) is a cove set } Fuctios that are cocavecove, but ot strictly so, are sometimes termed weakly cocaveweakly cove. 7

8 Alteratively, ƒ() = ƒ(,...,) is quasicocave for all, *, ƒ( + ( )*) mi [ƒ(*),ƒ()] for all (0,) quasicove for all, *, ƒ( + ( )*) ma [ƒ(*),ƒ()] for all (0,) The fudametal differece betwee cocavity/coveity ad quasicocavity/quasicoveity is: Quasicocavity/quasicoveity are ordial cocepts, i that they solely pertai to properties of a fuctio s implied rakig ord : quasicocave for all *, the set { ord * is a cove set } quasicove for all *, the set { ord * is a cove set } Thus if a fuctio is quasicocave/quasicove, so is every icreasig trasformatio of it. Cocavity/coveity are cardial cocepts, i that they solely pertai to properties of the implied rakig crd. O the assumptio that the fuctio is cotiuous, they ca be show to be equivalet to the coditio that wheever ƒ(*) ƒ(), the ƒ(*) ƒ(½*+½) / ƒ(½*+½) ƒ(). This property ca be epressed i terms of the rakig crd as: cocave if {*, } crd {, } the {*, ½*+½} crd {½*+½, } cove if {*, } crd {, } the {*, ½*+½} crd {½*+½, } Thus, if a fuctio is cocave/cove, so is every icreasig affie trasformatio of it. Note that every cocave/cove fuctio is ecessarily quasicocave/quasicove, but ot vice versa: thik about the fuctio ƒ(,) over X = {(,) 0, 0}. E. DETERMINANTS, SYSTEMS OF LINEAR EQUATIONS & CRAMER S RULE The Determiat of a Matri I order to solve systems of liear equatios we eed to defie the determiat A of a square matri A. If A is a matri, that is, if A = [a], we defie A = a. I the case: if A = a a a a we defie A = aa aa that is, the product alog the dowward slopig diagoal (aa), mius the product alog the upward slopig diagoal (aa). I the 3 3 case: if A = a a a a a a a a a the first form (i.e., recopy the first two colums). The we defie: a a a a a a a a a a a a a a a A = aaa33 + aa3a3 + a3aa3 a3aa3 aa3a3 aaa33 i other words, add the products of all three dowward slopig diagoals ad subtract the products of all three upward slopig diagoals. Ufortuately, this techique does t work for 4 4 or bigger matrices, so to hell with them. 8

9 Systems of Liear Equatios ad Cramer s Rule The geeral form of a system of liear equatios i the ukow variables,..., is: a + a + + a = c a + a + + a = c a + a + + a = c for some matri of coefficiets A = a a a a a a a a a c c ad vector of costats C =. c Note that the first subscript i the coefficiet aij refers to its row ad the secod subscript refers to its colum (thus, aij is the coefficiet of j i the i th equatio). We ow preset Cramer s Rule for solvig systems of liear equatios. The solutios * ad * to the liear system: a + a = c are simply: a + a = c c a a c c a a c ad * * a a a a a a a a The solutios *, * ad * 3 to the 3 3 system: a + a + a33 = c a + a + a33 = c a3 + a3 + a333 = c3 are: c a a a c a a a c 3 3 c a a a c a a a c 3 3 c a a a c a a a c a a a3 a a a3 a a a3 a a a a a a a a a a a a a a a a a a

10 Note that i both the ad the 3 3 case we have that * i is obtaied as the ratio of two determiats. The deomiator is always the determiat of the coefficiet matri A. The umerator is the determiat of a matri which is just like the coefficiet matri, ecept that the j th colum has bee replaced by the vector of right had side costats. F. SOLVING OPTIMIZATION PROBLEMS The Geeral Structure of Optimizatio Problems Ecoomics is full of optimizatio (maimizatio or miimizatio) problems: the maimizatio of utility, the miimizatio of epediture, the miimizatio of cost, the maimizatio of profits, etc. Uderstadig these will be a lot easier if we cosider what is systematic about such problems. Each optimizatio problem has a objective fuctio ƒ(,...,;,...,m) which we are tryig to either maimize or miimize (i our eamples, we ll always be maimizig). This fuctio depeds upo both the cotrol variables,..., which we (or the ecoomic aget) are able to set, as well as some parameters,...,m, which are give as part of the problem. Thus a geeral ucostraied maimizatio problem takes the form: ma ƒ(,...,;,...,m).,..., Although we will ofte have may parameters,...,m i a give problem, for simplicity we shall assume from ow o that there is oly a sigle parameter. All of our results will apply to the may-parameter case, however. We represet the solutios to this problem, which obviously deped upo the values of the parameter(s), by the solutio fuctios: ( ) ( ) It is ofte useful to ask how well have we doe? or i other words, how high ca we get ƒ(,...,;), give the value of the parameter? This is obviously determied by substitutig i the optimal solutios back ito the objective fuctio, to obtai: ( ) ( ) ƒ(,..., ; ) ƒ( ( ),..., ( ); ) ad () is called the optimal value fuctio. Sometimes we will be optimizig subject to a costrait o the cotrol variables (such as the budget costrait of the cosumer). Sice this costrait may also deped upo oe or more parameters, our problem becomes: ma ƒ(,...,;),..., subject to g(,...,;) = 0 I this case we still defie the solutio fuctios ad optimal value fuctio i the same way we just have to remember to take ito accout the costrait. Although it is possible that there could 0

11 be more tha oe costrait i a give problem, we will oly cosider problems with a sigle costrait. For eample, if we were lookig at the profit maimizatio problem, the cotrol variables would be the quatities of iputs ad outputs chose by the firm, the parameters would be the curret iput ad output prices, the costrait would be the productio fuctio, ad the optimal value fuctio would be the firm s profit fuctio, i.e., the highest attaiable level of profits give curret iput ad output prices. I ecoomics we are iterested both i how the optimal values of the cotrol variables ad the optimal attaiable value vary with the parameters. I other words, we will be iterested i differetiatig both the solutio fuctios ad the optimal value fuctio with respect to the parameters. Before we ca do this, however, we eed to kow how to solve ucostraied or costraied optimizatio problems. First Order Coditios for Ucostraied Optimizatio Problems The first order coditios for the ucostraied optimizatio problem: ma,..., ƒ(,...,) are simply that each of the partial derivatives of the objective fuctio be zero at the solutio values ( *,..., * ), i.e. that: ƒ( *,..., * ) = 0 ƒ( *,..., * ) = 0 The ituitio is that if you wat to be at a moutai top (a maimum) or the bottom of a bowl (a miimum) it must be the case that o small chage i ay cotrol variable be able to move you up or dow. That meas that the partial derivatives of ƒ(,...,) with respect to each of the i s must be zero. Secod Order Coditios for Ucostraied Optimizatio Problems If our optimizatio problem is a maimizatio problem, the secod order coditio for this solutio to be a local maimum is that ƒ(,...,) be a weakly cocave fuctio of (,...,) (i.e., a moutai top) i the locality of this poit. Thus, if there is oly oe cotrol variable, the secod order coditio is that ƒ (*) < 0 at the optimum value of the cotrol variable. If there are two cotrol variables, it turs out that the coditios are: ƒ( *, * ) < 0 ƒ( *, * ) < 0 ad ƒ (, ) ƒ (, ) * * * * ƒ (, ) ƒ (, ) 0 Whe we have a miimizatio problem, the secod order coditio for this solutio to be a local miimum is that ƒ(,...,) be a weakly cove fuctio of (,...,) (i.e., the bottom of a bowl) i

12 the locality of this poit. Thus, if there is oly oe cotrol variable, the secod order coditio is that ƒ (*) > 0. If there are two cotrol variables, the coditios are: ƒ( *, * ) > 0 ƒ( *, * ) > 0 ad ƒ (, ) ƒ (, ) * * * * ƒ (, ) ƒ (, ) 0 (yes, this last determiat really is supposed to be positive). First Order Coditios for Costraied Optimizatio Problems (VERY importat) The first order coditios for the two-variable costraied optimizatio problem: ma, subject to are easy to see from the followig diagram ƒ(,) g(,) = c ( *, * ) g(,) = c level curves of ƒ(,) 0 The poit ( *, * ) i the diagram is clearly ot a ucostraied maimum, sice icreasig both ad would move you to a higher level curve for ƒ(,). However, this chage is ot legal sice it does ot satisfy the costrait it would move you off of the level curve g(,) = c. I order to stay o the level curve, we must joitly chage ad i a maer which preserves the value of g(,). That is, we ca oly tradeoff agaist at the legal rate: g(, ) g (, ) g(, ) c g 0 The coditio for maimizig ƒ(,) subject to g(,) = c is that o tradeoff betwee ad at this legal rate be able to raise the value of ƒ(,). This is the same as sayig that the level curve of the costrait fuctio be taget to the level curve of the objective fuctio. I other words, the tradeoff rate which preserves the value of g(,) (the legal rate) must be the same as the tradeoff rate that preserves the value of ƒ(,). We thus have the coditio:

13 which implies that: which is i tur equivalet to: for some scalar. g0 ƒ0 g(, ) f(, ) g (, ) f (, ) ƒ(,) = g(,) ƒ(,) = g(,) To summarize, we have that the first order coditios for the costraied maimizatio problem: ma ƒ(, ), subject to are that the solutios ( *, * ) satisfy the equatios g(,) = c ƒ( *, * ) = g( *, * ) ƒ( *, * ) = g( *, * ) g( *, * ) = for some scalar. A easy way to remember these coditios is simply that the ormal vector to ƒ(,) at the optimal poit ( *, * ) must be a scalar multiple of the ormal vector to g(,) at the optimal poit ( *, * ), i.e. that: ( ƒ( *, * ), ƒ( *, * ) ) = ( g( *, * ), g( *, * )) ad also that the costrait g( *, * ) = c be satisfied. c This same priciple eteds to the case of several variables. I other words, the coditios for ( *,..., * ) to be a solutio to the costraied maimizatio problem: ma,..., subject to ƒ(,...,) g(,...,) = c is that o legal tradeoff betwee ay pair of variables i ad j be able to affect the value of the objective fuctio. I other words, the tradeoff rate betwee i ad j that preserves the value of g(,...,) must be the same as the tradeoff rate betwee i ad j that preserves the value of ƒ(,...,). We thus have the coditio: or i other words, that: i i for ay i ad j j g0 j ƒ0 g (,..., ) ƒ (,..., ) j j for ay i ad j g (,..., ) ƒ (,..., ) i i 3

14 Agai, the oly way to esure that these ratios will be equal for ay i ad j is to have: ƒ(,...,) = g(,...,) ƒ(,...,) = g(,...,) ƒ(,...,) = g(,...,) To summarize: the first order coditios for the costraied maimizatio problem: ma,..., subject to are that the solutios ( *,..., * ) satisfy the equatios: ƒ(,...,) g(,...,) = c ƒ( *,..., * ) = g( *,..., * ) ƒ( *,..., * ) = g( *,..., * ) ƒ( *,..., * ) = g( *,..., * ) ad the costrait: g( *,..., * ) = c Oce agai, the easy way to remember this is simply that the ormal vector of ƒ(,...,) be a scalar multiple of the ormal vector of g(,...,) at the optimal poit, i.e.: ( ƒ( *,..., * ),..., ƒ( *,..., * ) ) = ( g( *,..., * ),..., g( *,..., * ) ) ad also that the costrait g( *,..., * ) = c be satisfied. Lagragias The first order coditios for the above costraied maimizatio problem are just a system of + equatios i the + ukows,..., ad. Persoally, I suggest that you get these first order coditios the direct way by simply settig the ormal vector of ƒ(,...,) to equal a scalar multiple of the ormal vector of g(,...,) (with the scale factor ). However, aother way to obtai these equatios is to costruct the Lagragia fuctio: L(,...,,) ƒ(,...,) + [c g(,...,)] (where is called the Lagragia multiplier). The, if we calculate the partial derivatives L/,...,L/ ad L/ ad set them all equal to zero, we get the equatios: L( *,..., *,)/ = ƒ( *,..., * ) g( *,..., * ) = 0 L( *,..., *,)/ = ƒ( *,..., * ) g( *,..., * ) = 0 L( *,..., *,)/ = c g( *,..., * ) = 0 4

15 But these equatios are the same as our origial + first order coditios. I other words, the method of Lagragias is othig more tha a roudabout way of geeratig our coditio that the ormal vector of ƒ(,...,) be times the ormal vector of g(,...,), ad the costrait g(,...,) = c be satisfied. See the stadard tets for secod order coditios for costraied optimizatio. G. COMPARATIVE STATICS OF SOLUTION FUNCTIONS: IMPLICIT DIFFERENTIATION Havig arrived at the first order coditios for a costraied or ucostraied optimizatio problem, we ca ow ask how the optimal values of the cotrol variables chage whe the parameters chage (for eample, how the optimal quatity of a commodity will be affected by a price chage or a icome chage). The easiest way to do this would be to actually solve the first order coditios for the solutios, that is, solve for the fuctios: * = * () * = * ()... * = * () the just differetiate these fuctios with respect to the parameter to obtai the derivatives: ( ) ( ) ( )... d d d However, first order coditios are usually much too complicated to solve. Are we up a creek? No: there is aother approach kow as implicit differetiatio, which always works. The idea behid implicit differetiatio is very simple. Sice the optimal values: * = * () * = * ()... * = * () come from the first order coditios, it stads to reaso that the derivatives of these optimal values will come from the derivatives of the first order coditios, where i each case, we are talkig about derivatives with respect to the parameter. Let s do it for the simplest of cases. Cosider the ucostraied maimizatio problem: ma (, ) with the sigle cotrol variable, the sigle parameter, ad where (,)/ < 0. We kow that the solutio * = *() solves the first order coditio: (*,) 0 If we wat to fid */, we would simply differetiate this first order coditio with respect to the parameter. Before doig this, it s useful to remid ourselves of eactly which variables will be affected by a chage i, or i other words, those variables which deped upo. This ca be doe by drawig arrows over these variables, or alteratively, by represetig all fuctioal depedece eplicitly, that is: Differetiatig with respect to yields: ( *, ) 0 or alteratively ( *( ), ) 0 5

16 *( ) ( *( ), ) ( *( ), ) 0 d Note that we get oe term for each arrow we have draw o the left (or each appearace of o the right). Rearragig ad solvig for the derivative *()/, we obtai: d *( ) ( *( ), ) ( *( ), ) d ( *( ), ) ( *( ), ) Let s take aother eample, this time with two cotrol variables ad two parameters. For the geeral ucostraied maimizatio problem: ma, ƒ(,;,) the solutios * = * (,) ad * = * (,) solve the first order coditios: ƒ( *, * ;,) = 0 ƒ( *, * ;,) = 0 If, say, we wated to fid the derivative * /, we would differetiate these first order coditios with respect to the parameter. Before doig this, use arrows to idetify the variables that will be affected by a chage i. I this eample, they are the solutios * ad *, as well as itself (the parameter agai remais fied). We thus get: ƒ (, ; ; ) 0 ƒ (, ; ; ) 0 Differetiatig these two equatios with respect to gives us: ƒ (, ;, ) ƒ (, ;, ) ƒ 3(, ;, ) 0 ƒ (, ;, ) ƒ (, ;, ) ƒ 3(, ;, ) 0 or equivaletly: ƒ (, ;, ) ƒ (, ;, ) ƒ 3(, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ 3(, ;, ) This is a set of two liear equatios i the two terms * / ad * /, ad hece ca be solved by substitutio, or by Cramer s Rule (see below), to obtai: ad ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) 3 3 ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) ƒ (, ;, ) 3 3 6

17 We could do this same procedure i a costraied maimizatio problem as well, provided we remember to differetiate all + of the first order coditios, icludig the last oe (the costrait equatio). This procedure will always work i gettig the derivatives of the optimal values of the cotrol variables with respect to ay parameter. To use it, just remember that it cosists of three steps: STEP : Derive the first order coditio(s) for the maimizatio or miimizatio problem. As usual, the eact form of the first order coditios depeds o the umber of cotrol variables i the problem, ad o whether it is a ucostraied or costraied optimizatio problem. STEP : Differetiate the first order coditio(s) with respect to the parameter that is chagig. Before doig this, it s always useful to draw arrows over those variables that will chage as a result of the chage i the parameter. These will geerally cosist of all of the cotrol variables, the Lagragia multiplier if we are workig with a costraied optimizatio problem, ad the parameter itself. STEP 3: Solve for the desired derivative(s). If there is a sigle cotrol variable, this cosists of solvig for the sigle derivative (say) */. If there is more tha oe cotrol variable, this will ivolve solvig a system of liear equatios for the derivatives * /, * / etc. H. COMPARATIVE STATICS OF OPTIMAL VALUE FUNCTIONS: THE ENVELOPE THEOREM The fial questio we ca ask is how the optimal attaiable value of the objective fuctio varies whe we chage the parameters. This has a surprisig aspect to it. I the ucostraied maimizatio problem: ma ƒ(,...,;),..., recall that we get the optimal value fuctio () by substitutig the solutios (),...,() back ito the objective fuctio, i.e.: () ƒ((),...,();) Thus, we could simply differetiate with respect to to get: d ( ) ƒ ( ),..., ( ); ( ) d d ƒ ( ),..., ( ); ( ) d ƒ ( ),..., ( ); where the last term is obviously the direct effect of upo the objective fuctio. The first terms are there because a chage i affects the optimal i values, which i tur affect the objective fuctio. All i all, this derivative is a big mess. However, if we recall the first order coditios to this problem, we see that sice / =... = / = 0 at the optimum, all of these first terms are zero, so that we just get: 7

18 d ( ) ƒ( ( ),..., ( ); ) d This meas that whe we evaluate how the optimal value fuctio is affected whe we chage a parameter, we oly have to cosider that parameter s direct effect o the objective fuctio, ad ca igore the idirect effects caused by the resultig chages i the optimal values of the cotrol variables. If we keep this i mid, we ca save a lot of time. The evelope theorem also applies to costraied maimizatio problems. Cosider the problem ma,..., subject to ƒ(,...,;) g(,...,;) = c Oce agai, we get the optimal value fuctio by pluggig the optimal values of the cotrol variables (amely (),...,()) ito the objective fuctio: () ƒ((),...,();) Note that sice these values must also satisfy the costrait, we also have: c g((),...,();) 0 so we ca multiply by () ad add to the previous equatio to get: () ƒ((),...,();) + ()[c g((),...,();)] which is the same as if we had plugged the optimal values (),...,() ad () directly ito the Lagragia formula, or i other words: () L((),...,(),();) ƒ((),...,();) + ()[c g((),...,();)] Remember, eve though it ivolves ad the costrait, the above equatio is still the formula for the optimal value fuctio (i.e. the highest attaiable value of ƒ(,...,;) subject to the costrait). Now if we differetiate the above idetity with respect to, we get: d ( ) L ( ),..., ( ), ( ); ( ) d d L L L ( ),..., ( ), ( ); ( ) d ( ),..., ( ), ( ); d ( ) d ( ),..., ( ), ( ); But oce agai, sice the first order coditios for the costraied maimizatio problem are that L/ = = L/ = L/ = 0, all but the last of these right had terms are zero, so we get: 8

19 d d L( ( ),..., ( ), ( ); ) ( ) I other words, we oly have to take ito accout the direct effect of o the Lagragia fuctio, ad ca igore the idirect effects due to chages i the optimal values of the i s ad. A very helpful thig to kow. 9

ECONOMICS 100ABC MATHEMATICAL HANDOUT

ECONOMICS 100ABC MATHEMATICAL HANDOUT ECONOMICS 00ABC MATHEMATICAL HANDOUT 03-04 Professor Mark Machia A. CALCULUS REVIEW Derivatives, Partial Derivatives ad the Chai Rule* You should already kow what a derivative is. We ll use the epressios

More information

ECONOMICS 100A MATHEMATICAL HANDOUT

ECONOMICS 100A MATHEMATICAL HANDOUT ECONOMICS A MATHEMATICAL HANDOUT Fall 3 abd β abc γ abc µ abc Mark Machia A. CALCULUS REVIEW Derivatives, Partial Derivatives ad the Chai Rule You should already kow what a derivative is. We ll use the

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

John Riley 30 August 2016

John Riley 30 August 2016 Joh Riley 3 August 6 Basic mathematics of ecoomic models Fuctios ad derivatives Limit of a fuctio Cotiuity 3 Level ad superlevel sets 3 4 Cost fuctio ad margial cost 4 5 Derivative of a fuctio 5 6 Higher

More information

Linear Regression Demystified

Linear Regression Demystified Liear Regressio Demystified Liear regressio is a importat subject i statistics. I elemetary statistics courses, formulae related to liear regressio are ofte stated without derivatio. This ote iteds to

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said

More information

A.1 Algebra Review: Polynomials/Rationals. Definitions:

A.1 Algebra Review: Polynomials/Rationals. Definitions: MATH 040 Notes: Uit 0 Page 1 A.1 Algera Review: Polyomials/Ratioals Defiitios: A polyomial is a sum of polyomial terms. Polyomial terms are epressios formed y products of costats ad variales with whole

More information

INTEGRATION BY PARTS (TABLE METHOD)

INTEGRATION BY PARTS (TABLE METHOD) INTEGRATION BY PARTS (TABLE METHOD) Suppose you wat to evaluate cos d usig itegratio by parts. Usig the u dv otatio, we get So, u dv d cos du d v si cos d si si d or si si d We see that it is ecessary

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen) Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

The Growth of Functions. Theoretical Supplement

The Growth of Functions. Theoretical Supplement The Growth of Fuctios Theoretical Supplemet The Triagle Iequality The triagle iequality is a algebraic tool that is ofte useful i maipulatig absolute values of fuctios. The triagle iequality says that

More information

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy

Linear Differential Equations of Higher Order Basic Theory: Initial-Value Problems d y d y dy Liear Differetial Equatios of Higher Order Basic Theory: Iitial-Value Problems d y d y dy Solve: a( ) + a ( )... a ( ) a0( ) y g( ) + + + = d d d ( ) Subject to: y( 0) = y0, y ( 0) = y,..., y ( 0) = y

More information

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f,

AP Calculus BC Review Applications of Derivatives (Chapter 4) and f, AP alculus B Review Applicatios of Derivatives (hapter ) Thigs to Kow ad Be Able to Do Defiitios of the followig i terms of derivatives, ad how to fid them: critical poit, global miima/maima, local (relative)

More information

Principle Of Superposition

Principle Of Superposition ecture 5: PREIMINRY CONCEP O RUCUR NYI Priciple Of uperpositio Mathematically, the priciple of superpositio is stated as ( a ) G( a ) G( ) G a a or for a liear structural system, the respose at a give

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

Castiel, Supernatural, Season 6, Episode 18

Castiel, Supernatural, Season 6, Episode 18 13 Differetial Equatios the aswer to your questio ca best be epressed as a series of partial differetial equatios... Castiel, Superatural, Seaso 6, Episode 18 A differetial equatio is a mathematical equatio

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee

More information

Economics 2450A: Public Economics Section 3: Mirrlees Taxation

Economics 2450A: Public Economics Section 3: Mirrlees Taxation Ecoomics 2450A: Public Ecoomics Sectio 3: Mirrlees Taxatio Matteo Paradisi September 26, 2016 I today s sectio we will solve the Mirrlees tax problem. We will ad derive optimal taxes itroducig the cocept

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture & 3: Pricipal Compoet Aalysis The text i black outlies high level ideas. The text i blue provides simple mathematical details to derive or get to the algorithm

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

PRACTICE FINAL/STUDY GUIDE SOLUTIONS

PRACTICE FINAL/STUDY GUIDE SOLUTIONS Last edited December 9, 03 at 4:33pm) Feel free to sed me ay feedback, icludig commets, typos, ad mathematical errors Problem Give the precise meaig of the followig statemets i) a f) L ii) a + f) L iii)

More information

LINEAR ALGEBRA. Paul Dawkins

LINEAR ALGEBRA. Paul Dawkins LINEAR ALGEBRA Paul Dawkis Table of Cotets Preface... ii Outlie... iii Systems of Equatios ad Matrices... Itroductio... Systems of Equatios... Solvig Systems of Equatios... 5 Matrices... 7 Matrix Arithmetic

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Estimation for Complete Data

Estimation for Complete Data Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of

More information

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example:

In algebra one spends much time finding common denominators and thus simplifying rational expressions. For example: 74 The Method of Partial Fractios I algebra oe speds much time fidig commo deomiators ad thus simplifyig ratioal epressios For eample: + + + 6 5 + = + = = + + + + + ( )( ) 5 It may the seem odd to be watig

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the

More information

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains. the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values

More information

Maximum and Minimum Values

Maximum and Minimum Values Sec 4.1 Maimum ad Miimum Values A. Absolute Maimum or Miimum / Etreme Values A fuctio Similarly, f has a Absolute Maimum at c if c f f has a Absolute Miimum at c if c f f for every poit i the domai. f

More information

Statistics 511 Additional Materials

Statistics 511 Additional Materials Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability

More information

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients.

Definitions and Theorems. where x are the decision variables. c, b, and a are constant coefficients. Defiitios ad Theorems Remember the scalar form of the liear programmig problem, Miimize, Subject to, f(x) = c i x i a 1i x i = b 1 a mi x i = b m x i 0 i = 1,2,, where x are the decisio variables. c, b,

More information

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j. Eigevalue-Eigevector Istructor: Nam Su Wag eigemcd Ay vector i real Euclidea space of dimesio ca be uiquely epressed as a liear combiatio of liearly idepedet vectors (ie, basis) g j, j,,, α g α g α g α

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5 CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio

More information

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d

Linear regression. Daniel Hsu (COMS 4771) (y i x T i β)2 2πσ. 2 2σ 2. 1 n. (x T i β y i ) 2. 1 ˆβ arg min. β R n d Liear regressio Daiel Hsu (COMS 477) Maximum likelihood estimatio Oe of the simplest liear regressio models is the followig: (X, Y ),..., (X, Y ), (X, Y ) are iid radom pairs takig values i R d R, ad Y

More information

Support vector machine revisited

Support vector machine revisited 6.867 Machie learig, lecture 8 (Jaakkola) 1 Lecture topics: Support vector machie ad kerels Kerel optimizatio, selectio Support vector machie revisited Our task here is to first tur the support vector

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e. Theorem: Let A be a square matrix The A has a iverse matrix if ad oly if its reduced row echelo form is the idetity I this case the algorithm illustrated o the previous page will always yield the iverse

More information

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows

More information

Notes for Lecture 5. 1 Grover Search. 1.1 The Setting. 1.2 Motivation. Lecture 5 (September 26, 2018)

Notes for Lecture 5. 1 Grover Search. 1.1 The Setting. 1.2 Motivation. Lecture 5 (September 26, 2018) COS 597A: Quatum Cryptography Lecture 5 (September 6, 08) Lecturer: Mark Zhadry Priceto Uiversity Scribe: Fermi Ma Notes for Lecture 5 Today we ll move o from the slightly cotrived applicatios of quatum

More information

Fundamental Concepts: Surfaces and Curves

Fundamental Concepts: Surfaces and Curves UNDAMENTAL CONCEPTS: SURACES AND CURVES CHAPTER udametal Cocepts: Surfaces ad Curves. INTRODUCTION This chapter describes two geometrical objects, vi., surfaces ad curves because the pla a ver importat

More information

U8L1: Sec Equations of Lines in R 2

U8L1: Sec Equations of Lines in R 2 MCVU U8L: Sec. 8.9. Equatios of Lies i R Review of Equatios of a Straight Lie (-D) Cosider the lie passig through A (-,) with slope, as show i the diagram below. I poit slope form, the equatio of the lie

More information

Appendix: The Laplace Transform

Appendix: The Laplace Transform Appedix: The Laplace Trasform The Laplace trasform is a powerful method that ca be used to solve differetial equatio, ad other mathematical problems. Its stregth lies i the fact that it allows the trasformatio

More information

Lecture 6 Simple alternatives and the Neyman-Pearson lemma

Lecture 6 Simple alternatives and the Neyman-Pearson lemma STATS 00: Itroductio to Statistical Iferece Autum 06 Lecture 6 Simple alteratives ad the Neyma-Pearso lemma Last lecture, we discussed a umber of ways to costruct test statistics for testig a simple ull

More information

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator

Economics 241B Relation to Method of Moments and Maximum Likelihood OLSE as a Maximum Likelihood Estimator Ecoomics 24B Relatio to Method of Momets ad Maximum Likelihood OLSE as a Maximum Likelihood Estimator Uder Assumptio 5 we have speci ed the distributio of the error, so we ca estimate the model parameters

More information

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 50-004 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

Topic 9: Sampling Distributions of Estimators

Topic 9: Sampling Distributions of Estimators Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Linear Support Vector Machines

Linear Support Vector Machines Liear Support Vector Machies David S. Roseberg The Support Vector Machie For a liear support vector machie (SVM), we use the hypothesis space of affie fuctios F = { f(x) = w T x + b w R d, b R } ad evaluate

More information

Math 10A final exam, December 16, 2016

Math 10A final exam, December 16, 2016 Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the

More information

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row: Math 5-4 Tue Feb 4 Cotiue with sectio 36 Determiats The effective way to compute determiats for larger-sized matrices without lots of zeroes is to ot use the defiitio, but rather to use the followig facts,

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

Ray-triangle intersection

Ray-triangle intersection Ray-triagle itersectio ria urless October 2006 I this hadout, we explore the steps eeded to compute the itersectio of a ray with a triagle, ad the to compute the barycetric coordiates of that itersectio.

More information

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall

Similarity Solutions to Unsteady Pseudoplastic. Flow Near a Moving Wall Iteratioal Mathematical Forum, Vol. 9, 04, o. 3, 465-475 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/imf.04.48 Similarity Solutios to Usteady Pseudoplastic Flow Near a Movig Wall W. Robi Egieerig

More information

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.

w (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ. 2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For

More information

Matrices and vectors

Matrices and vectors Oe Matrices ad vectors This book takes for grated that readers have some previous kowledge of the calculus of real fuctios of oe real variable It would be helpful to also have some kowledge of liear algebra

More information

Optimally Sparse SVMs

Optimally Sparse SVMs A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but

More information

CHAPTER I: Vector Spaces

CHAPTER I: Vector Spaces CHAPTER I: Vector Spaces Sectio 1: Itroductio ad Examples This first chapter is largely a review of topics you probably saw i your liear algebra course. So why cover it? (1) Not everyoe remembers everythig

More information

Cov(aX, cy ) Var(X) Var(Y ) It is completely invariant to affine transformations: for any a, b, c, d R, ρ(ax + b, cy + d) = a.s. X i. as n.

Cov(aX, cy ) Var(X) Var(Y ) It is completely invariant to affine transformations: for any a, b, c, d R, ρ(ax + b, cy + d) = a.s. X i. as n. CS 189 Itroductio to Machie Learig Sprig 218 Note 11 1 Caoical Correlatio Aalysis The Pearso Correlatio Coefficiet ρ(x, Y ) is a way to measure how liearly related (i other words, how well a liear model

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Notes on iteration and Newton s method. Iteration

Notes on iteration and Newton s method. Iteration Notes o iteratio ad Newto s method Iteratio Iteratio meas doig somethig over ad over. I our cotet, a iteratio is a sequece of umbers, vectors, fuctios, etc. geerated by a iteratio rule of the type 1 f

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam 4 will cover.-., 0. ad 0.. Note that eve though. was tested i exam, questios from that sectios may also be o this exam. For practice problems o., refer to the last review. This

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

Sequences I. Chapter Introduction

Sequences I. Chapter Introduction Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS

CHAPTER 5 SOME MINIMAX AND SADDLE POINT THEOREMS CHAPTR 5 SOM MINIMA AND SADDL POINT THORMS 5. INTRODUCTION Fied poit theorems provide importat tools i game theory which are used to prove the equilibrium ad eistece theorems. For istace, the fied poit

More information

Chapter 2: Numerical Methods

Chapter 2: Numerical Methods Chapter : Numerical Methods. Some Numerical Methods for st Order ODEs I this sectio, a summar of essetial features of umerical methods related to solutios of ordiar differetial equatios is give. I geeral,

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

MA131 - Analysis 1. Workbook 2 Sequences I

MA131 - Analysis 1. Workbook 2 Sequences I MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................

More information

Introduction to Machine Learning DIS10

Introduction to Machine Learning DIS10 CS 189 Fall 017 Itroductio to Machie Learig DIS10 1 Fu with Lagrage Multipliers (a) Miimize the fuctio such that f (x,y) = x + y x + y = 3. Solutio: The Lagragia is: L(x,y,λ) = x + y + λ(x + y 3) Takig

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1) 5. Determiats 5.. Itroductio 5.2. Motivatio for the Choice of Axioms for a Determiat Fuctios 5.3. A Set of Axioms for a Determiat Fuctio 5.4. The Determiat of a Diagoal Matrix 5.5. The Determiat of a Upper

More information

Machine Learning for Data Science (CS 4786)

Machine Learning for Data Science (CS 4786) Machie Learig for Data Sciece CS 4786) Lecture 9: Pricipal Compoet Aalysis The text i black outlies mai ideas to retai from the lecture. The text i blue give a deeper uderstadig of how we derive or get

More information

SNAP Centre Workshop. Basic Algebraic Manipulation

SNAP Centre Workshop. Basic Algebraic Manipulation SNAP Cetre Workshop Basic Algebraic Maipulatio 8 Simplifyig Algebraic Expressios Whe a expressio is writte i the most compact maer possible, it is cosidered to be simplified. Not Simplified: x(x + 4x)

More information

Mon Feb matrix inverses. Announcements: Warm-up Exercise:

Mon Feb matrix inverses. Announcements: Warm-up Exercise: Math 225-4 Week 6 otes We will ot ecessarily fiish the material from a give day's otes o that day We may also add or subtract some material as the week progresses, but these otes represet a i-depth outlie

More information

Section 1 of Unit 03 (Pure Mathematics 3) Algebra

Section 1 of Unit 03 (Pure Mathematics 3) Algebra Sectio 1 of Uit 0 (Pure Mathematics ) Algebra Recommeded Prior Kowledge Studets should have studied the algebraic techiques i Pure Mathematics 1. Cotet This Sectio should be studied early i the course

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Optimization Methods MIT 2.098/6.255/ Final exam

Optimization Methods MIT 2.098/6.255/ Final exam Optimizatio Methods MIT 2.098/6.255/15.093 Fial exam Date Give: December 19th, 2006 P1. [30 pts] Classify the followig statemets as true or false. All aswers must be well-justified, either through a short

More information

CHAPTER 5. Theory and Solution Using Matrix Techniques

CHAPTER 5. Theory and Solution Using Matrix Techniques A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL

More information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

1 Approximating Integrals using Taylor Polynomials

1 Approximating Integrals using Taylor Polynomials Seughee Ye Ma 8: Week 7 Nov Week 7 Summary This week, we will lear how we ca approximate itegrals usig Taylor series ad umerical methods. Topics Page Approximatig Itegrals usig Taylor Polyomials. Defiitios................................................

More information

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense, 3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [

More information

CALCULATION OF FIBONACCI VECTORS

CALCULATION OF FIBONACCI VECTORS CALCULATION OF FIBONACCI VECTORS Stuart D. Aderso Departmet of Physics, Ithaca College 953 Daby Road, Ithaca NY 14850, USA email: saderso@ithaca.edu ad Dai Novak Departmet of Mathematics, Ithaca College

More information

CALCULUS BASIC SUMMER REVIEW

CALCULUS BASIC SUMMER REVIEW CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=

More information

Lesson 10: Limits and Continuity

Lesson 10: Limits and Continuity www.scimsacademy.com Lesso 10: Limits ad Cotiuity SCIMS Academy 1 Limit of a fuctio The cocept of limit of a fuctio is cetral to all other cocepts i calculus (like cotiuity, derivative, defiite itegrals

More information

Math E-21b Spring 2018 Homework #2

Math E-21b Spring 2018 Homework #2 Math E- Sprig 08 Homework # Prolems due Thursday, Feruary 8: Sectio : y = + 7 8 Fid the iverse of the liear trasformatio [That is, solve for, i terms of y, y ] y = + 0 Cosider the circular face i the accompayig

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES

DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES DEPARTMENT OF ACTUARIAL STUDIES RESEARCH PAPER SERIES Icreasig ad Decreasig Auities ad Time Reversal by Jim Farmer Jim.Farmer@mq.edu.au Research Paper No. 2000/02 November 2000 Divisio of Ecoomic ad Fiacial

More information

1 Duality revisited. AM 221: Advanced Optimization Spring 2016

1 Duality revisited. AM 221: Advanced Optimization Spring 2016 AM 22: Advaced Optimizatio Sprig 206 Prof. Yaro Siger Sectio 7 Wedesday, Mar. 9th Duality revisited I this sectio, we will give a slightly differet perspective o duality. optimizatio program: f(x) x R

More information

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12

Machine Learning Theory Tübingen University, WS 2016/2017 Lecture 12 Machie Learig Theory Tübige Uiversity, WS 06/07 Lecture Tolstikhi Ilya Abstract I this lecture we derive risk bouds for kerel methods. We will start by showig that Soft Margi kerel SVM correspods to miimizig

More information

Math 113, Calculus II Winter 2007 Final Exam Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions Math, Calculus II Witer 7 Fial Exam Solutios (5 poits) Use the limit defiitio of the defiite itegral ad the sum formulas to compute x x + dx The check your aswer usig the Evaluatio Theorem Solutio: I this

More information

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

More information