# prove that differentiation and integration are inverse functions??

• Jul 6th 2013, 12:51 AM
mpx86
prove that differentiation and integration are inverse functions??
$\displaystyle \mathop {\lim }\limits_{h \to 0} A(x + h) - A(x) = \mathop {\lim }\limits_{h \to 0} hf(x)\\f(x) = \frac{{\mathop {\lim }\limits_{h \to 0} A(x + h) - A(x)}}{h} = \frac{{dA(x)}}{{dx}}\\$

this only proves that derivative (or tangent ) to area function is function itself....
how to prove that area function is the integral function ..

here A(x) is the area under the curve f(x)....
• Jul 6th 2013, 02:03 AM
Prove It
Re: prove that differentiation and integration are inverse functions??
To understand this, we need to understand the Mean Value Theorem. Basically, the Mean Value Theorem says that for any function that is continuous on an interval, the gradient of any chord on that interval will have the same gradient as the function at some point between them. In symbols: \displaystyle \displaystyle \begin{align*} f'(c) = \frac{f(b) - f(a)}{b - a}, a \leq c \leq b \end{align*}.

Now let's assume that we want to evaluate the area under a curve between two points \displaystyle \displaystyle \begin{align*} a \end{align*} and \displaystyle \displaystyle \begin{align*} b \end{align*}. To do this, we can subdivide this interval into \displaystyle \displaystyle \begin{align*} n \end{align*} rectangles and mark in the midpoints of each interval, i.e. \displaystyle \displaystyle \begin{align*} a = x_0 < m_1 < x_1 < m_2 < x_2 < \dots < m_{n - 1} < x_n = b \end{align*}. The length of each rectangle will be the difference between two successive subdivisions \displaystyle \displaystyle \begin{align*} x_i - x_{i - 1} \end{align*}, and the width of each rectangle will be the value of the function at the midpoint of the interval. So the area of each rectangle is \displaystyle \displaystyle \begin{align*} \left( x_i - x_{i - 1} \right) f \left( m_i \right) \end{align*}.

Now we can approximate the entire area by adding all these rectangles. So

\displaystyle \displaystyle \begin{align*} A \approx \sum_{ i = 1}^n { \left( x_i - x_{i - 1} \right) f \left( m_i \right) } \end{align*}

and this approximation becomes more accurate when we make more subdivisions. So that means

\displaystyle \displaystyle \begin{align*} A = \lim_{n \to \infty} \sum_{i = 1}^n{ \left( x_i - x_{i - 1} \right) f \left( m_i \right) } \end{align*}

Let's take another look at the Mean Value Theorem:

\displaystyle \displaystyle \begin{align*} f'(c) &= \frac{f(b) - f(a)}{b - a} \\ \left( b - a \right) f'(c) &= f(b) - f(a) \\ \textrm{ or } \left( b - a \right) f(c) &= F(b) - F(a) \textrm{ where } F'(x) = f(x) \end{align*}

Notice that the area of each rectangle looks VERY similar to the LHS of this equation (i.e. the difference between two x values multiplied by a function value evaluated at a point between the two x values). And when we increase the number of rectangles and make the subdivisions extremely small, it gets to the point where the midpoint is the ONLY point in between them, so will be the value where the gradient of the function is equal to the gradient of the chord. So that means we can use the Mean Value Theorem to simplify.

\displaystyle \displaystyle \begin{align*} A &= \lim_{n \to \infty} \sum_{i = 1}^n \left( x_i - x_{i - 1} \right) f \left( m_i \right) \\ &= \lim_{n \to \infty} \sum_{i =1}^n \left[ F \left( x_i \right) - F \left( x_{i - 1} \right) \right] \\ &= \lim_{n \to \infty} \left\{ \left[ F \left( x_1 \right) - F \left( x_ 0 \right) \right] + \left[ F \left( x_2 \right) - F \left( x_1 \right) \right] + \left[ F \left( x_3 \right) - F \left( x_2 \right) \right] + \dots + \left[ F \left( x_n \right) - F \left( x_{n - 1} \right) \right] \right\} \\ &= \lim_{n \to \infty} \left[ F \left( x_n \right) - F \left( x_0 \right) \right] \\ &= \lim_{n \to \infty} \left[ F \left( b \right) - F \left( a \right) \right] \\ &= F \left( b \right) - F \left( a \right) \end{align*}

So that means to evaluate the area under a curve between two points, you evaluate the difference between an antiderivative of the function at those two points.
• Jul 6th 2013, 06:03 AM
mpx86
Re: prove that differentiation and integration are inverse functions??
$\displaystyle f'(c) = \frac{{f(b) - f(a)}}{{b - a}}\ \right)\\$

$\displaystyle f'(c)\left( {b - a} \right) = f(b) - f(a)\\$

doesnt this imply this

$\displaystyle \left( {b - a} \right)f'(c) = F'(b) - F'(a){\rm{where}}F'(x) = f(x)$

rather than

$\displaystyle $\left( {b - a} \right)f(c){\rm{ }} = F(b) - F(a){\rm{where}}F'(x) = f(x)$$
• Jul 6th 2013, 06:06 AM
Prove It
Re: prove that differentiation and integration are inverse functions??
Quote:

Originally Posted by mpx86
$\displaystyle f'(c) = \frac{{f(b) - f(a)}}{{b - a}}\left( {b - a} \right)\\$

$\displaystyle f'(c)\left( {b - a} \right) = f(b) - f(a)\\$

doesnt this imply this

$\displaystyle \left( {b - a} \right)f'(c) = F'(b) - F'(a){\rm{where}}F'(x) = f(x)$

You're right, it does not imply that. But that is NOT what I wrote. Read it properly!
• Jul 6th 2013, 06:19 AM
mpx86
Re: prove that differentiation and integration are inverse functions??
how can
$\displaystyle \left( {b - a} \right)f'(c) = F'(b) - F'(a){\rm{where}}F'(x) = f(x)$
implies
$\displaystyle $\left( {b - a} \right)f(c){\rm{ }} = F(b) - F(a){\rm{where}}F'(x) = f(x)$$

sorry but i cant get this step ...........