Fermats theorem, Mathematics

Assignment Help:

Fermat's Theorem

 If f(x) has a relative extrema at x = c and f′(c) exists then x = c is a critical point of f(x). Actually, this will be a critical point that f′(c) =0.

 Proof

It is a fairly easy proof.  We will suppose that f(x) has a relative maximum to do the proof.

 The proof for a relative minimum is nearly the same. Therefore, if we suppose that we have a relative maximum at x = c after that we know that f(c) ≥ f(x) for all x which are sufficiently close to x = c.

 Particularly for all h which are sufficiently close to zero may be positive or negative we must contain,

f(c) ≥ f(c + h)

or, with a little rewrite we should have,

f(c + h) - f(c) < 0                                             (1)

Now, here suppose that h > 0 and divide both sides of (1) with h. It provides,

(f(c + h) - f(c))/h < 0

Since we're assuming that h > 0 we can here take the right-hand limit of both sides of such.

= limh0¯  (f(c + h) - f(c))/h < limh0¯ 0 = 0

We are also assume that f′(c) exists and recall this if a general limit exists then this should be equal to both one-sided limits. We can so say that,

f′(c) = limh0¯  (f(c + h) - f(c))/h = limh0¯  (f(c + h) - f(c))/h < 0

If we place this together we have here demonstrated that, f′(c) ≤ 0 .

Fine, now let's turn things around and suppose that h < 0 provides,and divide both sides of (1) with h. It  gives

(f(c + h) - f(c))/h > 0

Keep in mind that as we're assuming h < 0 we will require to switch the inequality while we divide thorugh a negative number. We can here do a same argument as above to find that,

f′(c) = limh0 (f(c + h) - f(c))/h = limh0¯  (f(c + h) - f(c))/h >   limh0¯ 0 = 0

The difference now is that currently we're going to be considering at the left-hand limit as we're assuming that h < 0 . This argument illustrates that f′(c) ≥ 0 .

 We've now shown that

 f′(c) ≤ 0 and f′(c)  ≥ 0. So only way both of such can be true at similar time is to have f′(c) = 0 and it means that x = c must be a critical point.

 As considered above, if we suppose that f(x) has a relative minimum then the proof is nearly  the same and therefore isn't illustraten here. The major differences are simply several inequalities require to be switched.


Related Discussions:- Fermats theorem

What price tag will he put on the item, The manager of a specialty store ma...

The manager of a specialty store marks up imported products 110%. If a vase imported from Italy costs him $35, what price tag will he put on the item? To ?nd out the price he s

Core concepts of marketing, examination questions and answers to the above ...

examination questions and answers to the above title.

Simplify the logical expression, Simplify the logical expression X‾ Y‾ + X‾...

Simplify the logical expression X‾ Y‾ + X‾ Z + Y Z +Y‾ Z W‾  Ans: The K-Map for the following Boolean expression is described by the following diagram. The optimized expression

Simple interest, write a program C++ programming language to calculate sim...

write a program C++ programming language to calculate simple interest, with it algorithm and it flowchart

How much, If one acre costs $2500 how much does .39 of an acre cost

If one acre costs $2500 how much does .39 of an acre cost?

Counters and registers, design a synchronous, recycling, MOD-12 counter wit...

design a synchronous, recycling, MOD-12 counter with D FF''s. Use the states 0000 through 1011 in the counter.

Show that a slope will vary along a curve, Can you show that a slope will v...

Can you show that a slope will vary along a curve (as opposed to a straight line)?

Determine if following sequences are monotonic or bounded, Determine if the...

Determine if the following sequences are monotonic and/or bounded. (a)   {-n 2 } ∞ n=0 (b) {( -1) n+1 } ∞ n=1 (c) {2/n 2 } ∞ n=5 Solution {-n 2 } ∞ n=0

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd