MHB Finding Minimum Value of Polynomial Function f

Click For Summary
The discussion focuses on demonstrating that for any polynomial function f, there exists a real number y such that |f(y)| is less than or equal to |f(x)| for all x in the real numbers. If f has a real root, then y can be chosen as that root, resulting in |f(y)| = 0. For even-degree polynomials without real roots, the minimum value can be found using calculus, as the derivative f' will have real roots indicating local minima. An alternative approach involves the boundedness theorem, which states that |f(x)| achieves a minimum value within a specified interval. Overall, the existence of a minimum value for |f| is established through these methods.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! I have also an other question (Blush)

Knowing that $f$ is a polynomial function,how can I show that there is a $y \in \mathbb{R}$,such that $|f(y)|\leq |f(x)| \forall x \in \mathbb{R}$ ?
 
Last edited:
Physics news on Phys.org
Are you sure of the question? how can all polynomials be bounded below by a positive real number ?
 
ZaidAlyafey said:
Are you sure of the question? how can all polynomials be bounded below by a positive real number ?

I forgot the absolute value at $f(x)$.Sorry! :o
 
Let us take two cases

[1] If $f$ intersects the x-axis at $$y=a$$ then since $|f(a)|=0$ we have $|f(x)| \geq |f(a)|$.

[2] If $f$ doesn't intersect the x-axis then it is a polynomial of even degree and you can find the minimum of $$|f|$$ by differentiation.
 
ZaidAlyafey said:
Let us take two cases

[1] If $f$ intersects the x-axis at $$y=a$$ then since $|f(a)|=0$ we have $|f(x)| \geq |f(a)|$.

[2] If $f$ doesn't intersect the x-axis then it is a polynomial of even degree and you can find the minimum of $$|f|$$ by differentiation.

How can I use these facts to show that there is such a $y$ ?
 
What Zaid is referring to is that any real polynomial of odd degree has a root.

If our polynomial has a root, say at $a$, then $f(a) = 0$, so we may take $y = a$.

This takes care of all polynomials that have a real root (which includes ALL polynomials of odd degree, and SOME polynomials of even degree).

Which leaves with with even degree polynomials that have no real root (like, for example, $x^4 + 1$).

If $f$ is of even degree, then $f'$ is of odd degree. By the discussion above, $f'$ has a root (it may have more than one).

Now $f$ is bounded below by 0 (if the leading term's coefficient is > 0) or bounded above by 0 (if the leading term's coefficient < 0). Since we are considering $|f|$ it doesn't matter if we talk about $f$ of $-f$, since both have the same absolute value.

So we may as well assume $f > 0$. We know that the set of real roots of $f'$ is non-empty. We can (if we feel like being thorough) distinguish 3 cases:

1. $f'$ has just one real root. This must be a global minimum for $f$.

2. $f'$ has two real roots. One of these must be the global minimum, and the other an inflection point.

3. $f'$ has 3 real roots. Two of these are local minima, the third (which is between the other two) is a local maximum. The local minimum with the smallest value is the desired global minimum.

In all 3 cases, a global minimum exists, which we can then choose to be our $y$.

As for our example above, we find that $f'(x) = 4x^3$, which has the sole root $x = 0$.

And, from inspection, it is not hard to see to $x^4 + 1$ has a minimum value of 1 at $x = 0$.
 
Deveno said:
What Zaid is referring to is that any real polynomial of odd degree has a root.

If our polynomial has a root, say at $a$, then $f(a) = 0$, so we may take $y = a$.

This takes care of all polynomials that have a real root (which includes ALL polynomials of odd degree, and SOME polynomials of even degree).

Which leaves with with even degree polynomials that have no real root (like, for example, $x^4 + 1$).

If $f$ is of even degree, then $f'$ is of odd degree. By the discussion above, $f'$ has a root (it may have more than one).

Now $f$ is bounded below by 0 (if the leading term's coefficient is > 0) or bounded above by 0 (if the leading term's coefficient < 0). Since we are considering $|f|$ it doesn't matter if we talk about $f$ of $-f$, since both have the same absolute value.

So we may as well assume $f > 0$. We know that the set of real roots of $f'$ is non-empty. We can (if we feel like being thorough) distinguish 3 cases:

1. $f'$ has just one real root. This must be a global minimum for $f$.

2. $f'$ has two real roots. One of these must be the global minimum, and the other an inflection point.

3. $f'$ has 3 real roots. Two of these are local minima, the third (which is between the other two) is a local maximum. The local minimum with the smallest value is the desired global minimum.

In all 3 cases, a global minimum exists, which we can then choose to be our $y$.

As for our example above, we find that $f'(x) = 4x^3$, which has the sole root $x = 0$.

And, from inspection, it is not hard to see to $x^4 + 1$ has a minimum value of 1 at $x = 0$.

I understand..Thank you! :)
 
Alternatively, you can prove that for every polynomial $f(x)$ there exist points $M,N$ such that $|f(x)|>f(M)$ for all $x<M$ and $|f(x)|>f(N)$ for all $x>N$. The boundedness theorem says that $|f(x)|$ has a minimum in $[M,N]$, so the global minimum is the least of that minimum, $f(M)$ and $f(N)$. This approach does not require using the derivative.
 
Evgeny.Makarov said:
Alternatively, you can prove that for every polynomial $f(x)$ there exist points $M,N$ such that $|f(x)|>f(M)$ for all $x<M$ and $|f(x)|>f(N)$ for all $x>N$. The boundedness theorem says that $|f(x)|$ has a minimum in $[M,N]$, so the global minimum is the least of that minimum, $f(M)$ and $f(N)$. This approach does not require using the derivative.

I understand..Thanks a lot! :)
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 16 ·
Replies
16
Views
2K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K