|
Day & Time: Monday and Wednesday 1:10pm — 2:25pm Location: 207 Math Instructor: Joël Bellaïche Office Hours: Tuesdays, 9-11am, in 525 Mathematics Teaching assistants : Yao Liu, Peter Insley (undergraduate TAs), Tung To, Chenxu Li (graduate TAs) Recitations: Peter Insley will have recitations twice a week, to help you with the homework (due or not) and to answer questions. There will be one recitation every Mondays on 5-6PM in room 621 Math, and one evry Thursday 5-6PM in room 622 Math. Textbook: Knut Sydsaeter, Peter Hammond, Atle Seierstad, Arne Strom, Further Mathematics for Economic Analysis Prentice Hall (Financial Times) . ISBN 02736555760. It is available at the University bookstore Additional student support is available on Sydsaeter's web site Examinations: There will be one in class test. It will be on Wednesday, March 7 . The final exam is projected on Monday, May 07, 1:10pm-4pm Program: The course is a continuation of the calculus
sequence developping the various analytic tools needed to solve
optimizations's problems. Although the course will be mainly
problems-solving oriented, a more important part than in the calculus course will be given to proofs, both in class and in the exercises or tests.
A strong emphasis will be given to the applications to economics, with many
examples developped in class or to be read in the book. The modelization of
an economic question into a well-posed mathematical problem will sometimes
be part of the exercises. The theory of differential equations (chapters 5 to 7) will not be covered in this class. For that material, see the course Ordinary Differential Equations (Math E1210) Prerequisites: Calculus I, II, III, and Linear Algebra.
(or the equivalent). |
![]() |
Goals: At the end of the course, students should be able to
Expectations: To achieve these goals, students are advised to
Homework: There will be two kinds of homework:
Written work: We write to communicate. Please bear this in mind as you complete assignments and take exams. You must explain your work in order to obtain full credit; an assertion is not an answer. For specific suggestions see A guide to writing in mathematics classes.
Academic honesty: It is the obligation of each student to understand the University's policies regarding academic honesty and to uphold these standards. Students are encouraged to talk about the problems, but should write up the solutions individually. Students should acknowledge the assistance of any book, software, student or professor.
Help: Help is available if you have trouble with homework or lecture material. My office hours are a good place to start. You may also take advantage of the Mathematics Help Room (333 Milbank Hall, on the Barnard campus). You may drop by whenever the Help Room is open; no appointment is necessary.
Calculators: Calculators — in particular graphing calculators — are not required for this course. If you have one, you are welcome to use it when you do your homework. However, calculators will not be allowed during any tests or exams.
Disabilities: Students with disabilities who will be taking this course and may need disability-related classroom accommodations are encouraged to make an appointment to see the instructor as soon as possible. Also, stop by the Office of Disability Services (BC, CC) to register for support services.
| Class | Topic | Read | Exercises | Due |
| Jan 17 | Introduction | |||
| Jan 22 | Quadratic forms, scalar products, norms and distances | § 1.8; | 1.8:1,2,3,4,5,6 | |
| Jan 24 | Taylor's formula. | §2,6;§13.1 | 2.6:1,2 | |
| Jan 29 | Point-set topology in R^n: interior points, closed and open sets. | §13.1,2.2 | 13.1:1,2,4,5,6,7,8,9,13,15. | Problems set 1 |
| Jan 31 | Topology. Convex sets. | §2.2,2.3 | 2.2:1,2,3,4,5,6,8 | |
| Feb 5 | Convex, concave sets and functions | §2.2,2.3 | 2.3:1,2,3,4,5,6,7,8; | Problems set 2 |
| Feb 7 | Convex, concave, strictly convex, strictly concave functions | §2.3,2.4 | 2.4:1,2 | |
| Feb 12 | Quasi-convex and quasi-concave functions. Extreme points | §3.1 | 2.5:1,2,3,4,5; 3.1:1,2 | Problems set 3 and Solutions |
| Feb 14 | Extreme points. The model of a price-taker producer | §3.1. | 3.1:3,4,5 | |
| Feb 19 | The envelope theorem (unconstrained case). Local Extreme points | §3.1,3.2 | 3.2:1,2,3,4,5 | |
| The Lagrange theorem | §3.3 | 3.3:1,2,3,4,5,6 | Problems set 4 and Solutions | |
| Feb 26 | Envelope theorems for the Lagrange Problem. Local second-order conditions | §3.3,3.4 | 3.4:1,2,3,4,5,6 | |
| Feb 28 | Inequality constrains: the Kuhn-Tucker theorem. | §3.5 | 3.5:1,2,3,4,5,6,7,8 | Problems set 5 and Solutions |
| Mar 5 | Constraint qualifications. Positivity constraints. Short Review | §3.7 | 3.6:1,2. 3.7:1,2,3,4 | |
| Mar 7 | Midterm exam (and its solution) | Training midterm (Solutions) | ||
| Mar 12 | Midterm break | Mar 14 | Midterm break | |
| Mar 19 | Short review of (linear with constant coefficients) differential equations. Calculus of variations: the optimal saving Problem | §5.4,6.3,8.1 | 5.4:2,3,4,5; 6.3:1,2,3,4,5,6,7,8,9; 8.1:1 | Mar 21 | Calculus of Variations : The Euler equation | §8.2 | 8.2:1,2,3,4,5,6,7 |
| Mar 26 | Calculus of Variations: Proof of the Euler equation. Examples | §8.3,8.4 | 8.3:1,2,3;8.4:1,2,3,4 | Problems set 6 and Solutions (by Yao Liu) | Mar 28 | Calculus of Variations: Study of the Optimal saving problem; More general terminal conditions | §8.5 | 8.5:1,2,3,4,5 |
| Apr 2 | Control theory: motivation, and an example | §9.1 | 9.2:1,2,3,4,5,6 | Problems set 7 and solution | Apr 4 | Control theory: the basic problem, the maximum principle, relation with Euler equation | §9.2,9.5 | 9.2:1,2,3,4,5,6. 9.5:1,2,3,4 |
| Apr 9 | Control theory: the standard problem. Interpretation of the adjoint variables | §9.3,9.4,9.6 | 9.4:1 to 10, 9.6:1,4 | Problems set 8 and solution | Apr 11 | Control theory: Arrow's sufficient conditions. Variable final time | §9.6,9.7,9.8 | 9.7:2,3,4.: | Problems set 9 and solution |
| Apr 16 | Control theory: Variable final time. Scrap values. | §9.8,9.10 | 9.8:1,2,3. 9.10:1,2,3,5 | Apr 18 | Fixed point theorems: Convergent and Cauchy sequences. Fixed point for contraction mapping. | §13.2 | 13.2:1,2,3,4. | Apr 23 | Fixed point theorems: Brouwer's theorem; economic and game-theoretic applications. | §13.3,14.3,14.4 | 14.4:1,2,3,5 | Problems set 10 and solution | Apr 25 | Fixed point theorems: Correspondances and Kakutani's theorem (not for the exam) | §14.5,14.1,14.2,14.4 | 14.5;1 | Apr 30 | Review. Last day of class | § | Problems set 11 | May 7 | Final Exam (1pm-4pm)/td> | Cumulative. Mainly on calculus of variations and control theory. | Training final (solutions) |