Difference between revisions of "0708-1300/Class notes for Tuesday, September 11"
(→Differentiability) |
(→Differentiability) |
||
Line 66: | Line 66: | ||
# <math>df_{x}</math> is unique. | # <math>df_{x}</math> is unique. | ||
− | |||
# <math>d(f+g)_{x}=df_{x}+dg_{x}</math> | # <math>d(f+g)_{x}=df_{x}+dg_{x}</math> | ||
− | |||
# If <math>f</math> is linear then <math>df_{x}=f</math> | # If <math>f</math> is linear then <math>df_{x}=f</math> | ||
− | |||
# <math>d(f\circ g)_{x}=df_{g(x)}\circ dg_{x}</math> | # <math>d(f\circ g)_{x}=df_{g(x)}\circ dg_{x}</math> | ||
− | |||
# For every scalar number <math>\alpha</math> it holds <math>d(\alpha f)_{x}=\alpha df_{x}</math> | # For every scalar number <math>\alpha</math> it holds <math>d(\alpha f)_{x}=\alpha df_{x}</math> | ||
Revision as of 18:36, 11 September 2007
|
Contents |
In Small Scales, Everything's Linear
Code in Mathematica:
QuiltPlot[{f_,g_}, {x_, xmin_, xmax_, nx_}, {y_, ymin_, ymax_, ny_}] := Module[ {dx, dy, grid, ix, iy}, SeedRandom[1]; dx=(xmax-xmin)/nx; dy=(ymax-ymin)/ny; grid = Table[ {x -> xmin+ix*dx, y -> ymin+iy*dy}, {ix, 0, nx}, {iy, 0, ny} ]; grid = Map[({f, g} /. #)&, grid, {2}]; Show[ Graphics[Table[ { RGBColor[Random[], Random[], Random[]], Polygon[{ grid[[ix, iy]], grid[[ix+1, iy]], grid[[ix+1, iy+1]], grid[[ix, iy+1]] }] }, {ix, nx}, {iy, ny} ]], Frame -> True ] ] QuiltPlot[{x, y}, {x, -10, 10, 8}, {y, 5, 10, 8}] QuiltPlot[{x^2-y^2, 2*x*y}, {x, -10, 10, 8}, {y, 5, 10, 8}]
See also 06-240/Linear Algebra - Why We Care.
Class Notes
Differentiability
Let , and be two normed finite dimensional vector spaces and let be a function defined on a neighborhood of the point
Definition:
We say that is differentiable (diffable) if there is a linear map so that
In this case we will say that is a differential of and will denote it by .
Theorem
If and are diffable maps then the following asertions holds:
- is unique.
- If is linear then
- For every scalar number it holds
Implicit Function Theorem
Example Although does not defines as a function of , in a neighborhood of we can define so that . Furthermore, is differentiable with differential . This is a motivation for the following theorem.
Notation
If f:X\times Y\rightarrow Z then given x\in X we will define f_{[x]}:Y\rightarrow Z by f_{[x]}(y)=f(x;y)
Definition
will be the class of all functions defined on with continuous partial derivatives up to order
Theorem(Implicit function theorem)
Let be a function defined on a neighborhood of the point and such that and suppose that is non-singular then, the following results holds:
There is an open neighborhood of , , and a function such that for every .