User:IssaRice/Chain rule proofs: Difference between revisions

From Machinelearning
Line 3: Line 3:
Since <math>g</math> is differentiable at <math>y_0</math>, we know <math>g'(y_0)</math> is a real number, and we can write
Since <math>g</math> is differentiable at <math>y_0</math>, we know <math>g'(y_0)</math> is a real number, and we can write


<math>g(y) = g(y_0) + g'(y_0)(y - y_0) + [g(y) - (g(y_0) + g'(y_0)(y-y_0))]</math>
<math>g(y) = g(y_0) + g'(y_0)(y - y_0) + [g(y) - (g(y_0) + g'(y_0)(y-y_0))]</math> (there is no magic: the terms just cancel out)


If we define <math>E_g(\Delta y) := g(y) - (g(y_0) + g'(y_0)(y-y_0))</math> we can write
If we define <math>E_g(\Delta y) := g(y) - (g(y_0) + g'(y_0)(y-y_0))</math> we can write

Revision as of 01:36, 28 November 2018

Using Newton's approximation

Since g is differentiable at y0, we know g′(y0) is a real number, and we can write

g(y)=g(y0)+g′(y0)(y−y0)+[g(y)−(g(y0)+g′(y0)(y−y0))] (there is no magic: the terms just cancel out)

If we define Eg(Δy):=g(y)−(g(y0)+g′(y0)(y−y0)) we can write

g(y)=g(y0)+g′(f(x0))(y−y0)+Eg(Δy)

Newton's approximation says that |Eg(Δy)|≤ϵ|y−y0| as long as |y−y0|≤δ.

Since f is differentiable at x0, we know that it must be continuous at x0. This means we can keep |f(x)−y0|≤δ as long as we keep |x−x0|≤δ′.

Since f(x)∈Y and |f(x)−y0|≤δ, this means we can substitute y=f(x) and get

g(f(x))=g(y0)+g′(f(x0))(f(x)−y0)+Eg(Δf)

Now we use the differentiability of f. We can write

f(x)=f(x0)+f′(x0)(x−x0)+[f(x)−(f(x0)+f′(x0)(x−x0))]

Again, we can define Ef(Δx):=f(x)−(f(x0)+f′(x0)(x−x0)) and write this as

f(x)=f(x0)+f′(x0)(x−x0)+Ef(Δx)

Now we can substitute this into the expression for g(f(x)) to get

g(f(x))=g(y0)+g′(f(x0))(f′(x0)(x−x0)+Ef(Δx))+Eg(Δf)

where we have canceled out two terms using f(x0)=y0.

Thus we have

g(f(x))=g(y0)+g′(f(x0))f′(x0)(x−x0)+[g′(f(x0))Ef(Δx)+Eg(Δf)]

The stuff in square brackets is our "error term" for g∘f. Now we just need to make sure it is small, even after dividing by |x−x0|.