View source for Math for Non-Geeks/ Extreme value theorem

← Math for Non-Geeks/ Extreme value theorem
You do not have permission to edit this page, for the following reason:
Your IP address is in a range that has been blocked on all Wikimedia Foundation wikis.
The block was made by ‪Jon Kolbert‬. The reason given is Open proxy/Webhost: See the help page if you are affected .
Start of block: 05:35, 21 February 2024
Expiry of block: 05:35, 21 February 2029
Your current IP address is 13.58.201.214. The blocked range is 13.58.0.0/16.
Please include all above details in any queries you make.
If you believe you were blocked by mistake, you can find additional information and instructions in the Stewards Block Wizard.
You can view and copy the source of this page.
{{#invoke:Math for Non-Geeks/Seite|oben}}
In the following we are going to deal with continuous functions on compact intervals. These are intervals that are closed and bounded, i.e. have the form <math>[a,b]</math>. We will see that such functions are always bounded and attain a minimum and maximum. This theorem is called the ''Extreme Value Theorem''. It is used in mathematics to prove the existence of relative extrema, i.e. points of a function that are "at the extreme" of being the lowest point in the graph (the minimum) or the highest point in the graph (the maximum).
== Motivation ==
[[File:Satz vom Minimum und Maximum – Intuition und Motivation.webm|thumb|Motivation and intuition behind the extreme value theorem (in German)]]
Let's take a continuous function <math>f</math> which is defined on a compact interval <math>[a,b]</math>. I.e. we are considering a function <math>f:[a,b]\to\R</math>. This function has the value <math>f(a)</math> at the point <math>a</math>  and the value <math>f(b)</math> at the point <math>b</math>.

[[File:Beispiel für den Satz vom Maximum und Minimum 1.svg|center|400px|The function values f(a) and f(b)]]

Now <math>f</math> is defined for every intermediate point between <math>a</math> and <math>b</math>. Intuitively, for functions without gaps in the domain of definition, continuity means that we are able to draw the graph without lifting the pen from the paper. Hence, the graph of <math>f</math> connects the points <math>(a,f(a))</math> and <math>(b,f(b))</math> by a continuous path without jumps. The following graph provides an example for such a function <math>f</math>:

[[File:Beispiel für den Satz vom Maximum und Minimum 2.svg|center|400px|The fraph of the function f]]

We note that the function <math>f</math> above is bounded. And it attains a maximum and minimum value:

[[File:Beispiel für den Satz vom Maximum und Minimum 3.svg|center|400px|The function f ist bounded and attans a maximum and a minimum]]

Is it always that way? Try for yourself to connect the points <math>(a,f(a))</math> and <math>(b,f(b))</math> by different graphs without lifting the pen. Could you imagine to draw the graph of an unbounded function - even if your paper was infinitely large?

Intuitively, the answer is no. No matter how far your graph goes up or down, you need to return to the end points at <math>(a,f(a))</math> or <math>(b,f(b))</math>. Going to infinity "''forces you to lift the pen''" and is therefore not allowed. However, the function <math>f</math> can attain very large values (like <math>10^{100}</math> or more) while staying bounded, as long as you return in order to reach the end point. This situation is illustrated in the following figure:

[[File:Beispiel für den Satz vom Maximum und Minimum 4.svg|center|200px|Another bounded function with values f(a) and f(b), attaining a maximum and a minimum]]

So our first intuition tells us that when connecting the two points <math>(a,f(a))</math> and <math>(b,f(b))</math> without lifting the pen, our function stays bounded. And it attains a maximum and a minimum. Now let's think about what could go wrong when phrasing this intuition in a mathematical way. The end points <math>a</math> and <math>b</math> of the domain of definition <math>[a,b]</math> could become problematic: For an open domain of definition <math>(a,b)</math>, the function could run towards <math> \pm \infty </math> at <math>a</math> or <math>b</math>, or it could converge towards a value without attaining it. Including the boundary points <math>\{a,b\}</math> in the domain of definition excludes these cases as it "''catches the function''" at the end points <math>(a,f(a))</math> and <math>(b,f(b))</math>. If we move a boundary to infinity, let's say by considering the domain of definition <math>[a,\infty)</math>, the function could have "''infinitely much time''" and might run towards infinity while being continuous. This happens for instance for <math>f(x) = x^2</math>. So we also expect problems with unbounded domains of definition. A statement like "''the maximum and minimum are attained''" can only be expected to hold true on a compact interval <math>[a,b]</math>. Now, in between <math>a</math> and <math>b</math>, the function could also "''break out''" and tend towards <math> \pm \infty </math> (like <math>f(x) = \tfrac 1x </math> near <math> x=0 </math>). This scenario will be prevented by assuming continuity of the function <math>f</math>.

In the following, we will mathematically verify that our intuition is true. That means we prove a statement like "''the maximum and minimum are attained''" for '''continuous''' functions defined on a '''compact''' interval <math>[a,b]</math> and discuss what may go wrong if we choose other domains of definition.

== Extreme value theorem ==
{{:Math for Non-Geeks/Template:Satz
 |titel=Extreme value theorem
 |satz=
[[File:Satz vom Maximum und Minimum - Quatematik.webm|thumb|Explanation of the extreme value theoremm (in German). ([https://www.youtube.com/watch?v=N80HZ_chNJ4 YouTube-Video] published by [https://www.youtube.com/channel/UC0LfPSALkn8YDhXZf8-Pl5A Quatematik])]]
Every '''continuous''' function defined on a '''compact''' interval <math>[a,b]</math> is '''bounded''' and attains a '''maximum''' and a '''minimum''' (extreme values). That means, if <math>f:[a,b]\to\R</math> with <math>a,b\in\R</math> and <math>a<b</math> is a continuous function, then there are arguments <math>\tilde x,\hat x \in [a,b]</math>, such that for all arguments <math>x\in[a,b]</math> the inequality <math>f(\hat x) \le f(x) \le f(\tilde x)</math> holds.

 |beispiel-noprint=ja
 |beispiel=
[[File:Plot of function x**2 * cos(x) * exp(cos(x)) - ln(x+1).svg|thumb|Graph of a function <math>f:[0,1]\to\R</math> with <math>f(x)=x^2\cdot \cos(x) \cdot e^{\cos(x)}-\ln(x+1)</math>. This function attains a maximum and a minimum, which is attained in form of a function value.]]
Consider <math>f:[0,1]\to \R</math> with <math>f(x)=x^2\cdot \cos(x) \cdot e^{\cos(x)}-\ln(x+1)</math>. The domain of definition <math>[0,1]</math> is a compact interval. In addition, <math>f</math> is continuous as it is composed out of continuous functions <math>x \mapsto x^2</math>, <math>x \mapsto e^x</math>, <math>x \mapsto \cos(x)</math> and <math>x \mapsto \ln(x+1)</math> with domains of definition <math>[0,1]</math>. Hence, <math>f</math> must attain a maximum and a minimum.

 |beweis=
[[File:Beweis des Satzes vom Maximum und Minimum.webm|thumb|Proof of the extreme value theorem (in German)]]
Let <math>f:[a,b]\to\R</math> be a continuous function with <math>a,b\in\R</math> and <math>a<b</math>. We will only prove explicitly that <math>f</math> is bounded from above and attains a maximum. The analogous statement that <math>f</math> is bounded from below and attains a minimum can be shown the same way.

So let us consider the image <math>f([a,b])</math>. This is the the set of all function values, which are attained by <math>f</math>. Let us take the supremum <math>\sup f([a,b])</math> of the set  <math>f([a,b])</math>, where we explicitly allow for use of the extended definition of the supremum <math>\sup f([a,b])=\infty</math> . If <math>f</math> is bounded from above, then <math>\sup f([a,b])=\infty</math> and else, <math>\sup([a,b]) \in \R</math> (since <math>f([a,b])\neq \emptyset</math> , the case <math>\sup\emptyset = -\infty</math> cannot occur).

Now, we know that there is a sequence in <math>f([a,b])</math> , which tends towards the supremum <math>\sup f([a,b])</math> (for each nonempty set <math>M</math> there is a subsequence in <math>M</math>, tending towards <math>\sup M</math>). Hence there is a sequence <math>(x_n)_{n\in\N}</math> of arguments in <math>[a,b]</math> with <math>\lim_{n\to\infty} f(x_n) = \sup f([a,b])</math>.

We now make use of the Bolzano-Weierstraß theorem. This theorem tells us that each sequence in a '''compact''' interval <math>[a,b]</math> with <math>a,b\in\R</math> and <math>a < b</math> has a converging subsequence. Hence, <math>(x_n)_{n\in\N}</math> also has a convergent subsequence <math>\left(x_{n_k}\right)_{k\in\N}</math>. Let <math>\tilde x</math> be the limit of the convergent subsequence <math>\left(x_{n_k}\right)_{k\in\N}</math>. Since <math>a \le x_{n_k} \le b</math> for all <math>k\in\N</math> , there is also <math>a \le \tilde x \le b</math> and therefore <math>\tilde x \in [a,b]</math>. So, <math>\tilde x</math> must be an argument of the function <math>f</math>. Since <math>f</math> is continuous, we can make use of the sequential definition of continuity

{{Math|<math>f\left(\tilde x\right) = f\left(\lim_{k\to\infty} x_{n_k}\right) = \lim_{k\to\infty} f\left(x_{n_k}\right) = \sup f([a,b])</math>}}

<math>\sup f([a,b])</math> is a function value of <math>f</math> and hence a real number. Therefore we know that <math>f</math> is bounded from above. And we have shown that <math>f</math> attains its upper bound <math>\sup f([a,b])</math> at the argument <math>\tilde x</math> . Therefore, <math>f(x) \le f(\tilde x)</math> for all <math>x\in[a,b]</math> and indeed, <math>f(\tilde x)</math>is the maximum among all function values of <math>f</math>.
}}

== Assumptions of the theorem ==
[[File:Voraussetzungen des Satzes vom Maximum und Minimum.webm|thumb|Assumptions of the extreme value theorem (in German)]]
Let's take a look at the assumptions made within the extreme value theorem:

* <math>f</math> is a continuous function
* <math>f</math> is defined on a compact interval <math>[a,b]</math>

Are those assumptions really necessary or can we relax them without losing validity of the extreme value theorem?

=== Assumption of continuity ===
[[File:Function 1x ext.svg|thumb|Function <math>f(x)=\tfrac 1x</math> on the interval <math>[-1,1]</math> with <math>f(0)=0</math>]]
First, we note that continuity prevents the function <math>f</math> from "''breaking out''" to <math>+\infty</math> or <math>-\infty</math> within its domain of definition. Ij we just allow any function <math>f:[a,b]\to\R</math> , no matter whether it is continuous or not, we will find non-continuous functions which are violating the extreme value theorem. The following function is unbounded (so it does not attain any extrema) and non-continuous at <math>x=0</math> : 

{{Math|<math>f:[-1,1]\to\R:x\mapsto \begin{cases} \frac 1x & ; x \neq 0 \\ 0 & ; x = 0 \end{cases}</math>}}

So we cannot simply drop the assumption that <math>f</math> is continuous.

=== Interval-assumption ===
[[File:Function 1x.svg|thumb|The function <math>f(x)=\tfrac 1x</math> on <math>(0,1]</math>]]
The domain of definition is also important. It must include its boundary (i.e. be closed). This way we "''catch''" the function at the interval boundary and make sure it does not "''run away''" towards infinity. The function <math>g:(0,1]\to\R: x\mapsto \tfrac 1x</math> is an example which "''runs away''" as we approach <math>x=0</math>.

Unboundedly large domains are also problematic, since the function has "''infinitely much time''" to run away. An easy example is the function <math>h:[0,\infty)\to\R: x\mapsto x^2</math>. And there are functions, which are defined on a bounded domain of definition, continuous and do not "''run away''" towards infinity, but do not attain an extremum. This happens if there are open boundaries or gaps within the domain of definition. The extremum would then be attained at the boundary (or the gap) - but this argument has been removed from the domain of definition.

{{:Math for Non-Geeks/Template:Frage
 |frage=
Does the continuous function <math>f</math> always attain a maximum or a minimum, if it is defined on a bounded interval?

 |antwort=
No. For instance, the function <math>f:(0,1)\to \R</math>, <math>f(x)=x</math> does not. There is: <math>f((0,1))=(0,1)</math>. So the infimum and maximum of the image are 0 and 1, which would be attained at the boundary (<math>x=0</math> and <math>x=1</math>), if <math>f</math> was defined there. However, we removed 0 and 1 from the domain of definition, so <math>f</math> does no longer attain an extremum.
}}

The same may happen when removing a maximum or minimum from the interior of the domain of definition instead of the boundary - which creates a gap. Of course, the function may also "''run away''" at such a gap. An example for this effect is the continuous but unbounded function <math>j:[-1,1]\setminus \{0\} \to \R : x \mapsto \tfrac 1x</math>. The argument <math>x=0</math> is excluded from the domain of definition <math>[-1,1]\setminus \{0\} = [-1,0) \cup (0,1]</math> . So this function is well defined and continuous, but it "''runs away''" at the gap. In a mathematical language, the function is unbounded and hence violates the conclusion of the extreme value theorem.

=== Outlook: Generalization of the theorem ===
So far, we only considered intervals (possibly with gaps) as candidates for the domain of definition. Is this restriction really necessary? This time, the answer is no. For instance, we can take the union of two intervals <math>D=[a,b]\cup[c,d]</math> with <math>a < b < c < d</math> and define some continuous and real-valued function <math>j</math> on <math>D</math>. If we restrict <math>j</math> to only <math>[a,b]</math> or <math>[c,d]</math> , we can apply the extreme value theorem. Both the functions <math>j_1 = j|_{[a,b]}</math> and <math>j_2 = j|_{[c,d]}</math> with restricted domain of definition are bounded and hence attain a maximum and a minimum. The function <math>j</math> must therefore also be bounded. Its maximum is the larger of the both maxima of <math>j_1</math> and <math>j_2</math> , so <math>j</math> also attains a maximum (the same holds for the minimum). Therefore, every continuous function defined on the union of two closed intervals <math>[a,b]\cup[c,d]</math> fulfills the conclusion of the extreme value theorem. The same holds if we consider three or more closed intervals - or an even larger class of domains of definition. In fact, we can precisely state what this larger class of domains of definition is:

If we take a second look at the proof, we note that the domain of definition is only mentioned at one point: where we make use of the Bolzano-Weierstraß theorem. We used it to show that any sequence from the domain of definition contains a convergent subsequence. Hence, the proof arguments hold true, as long as the domain of definition allows for the usage of the Bolzano-Weierstraß theorem.

So we can generalize the above theorem. It will hold not only on closed intervals <math>[a,b]</math>, but on all sets satisfying the Bolzano-Weierstraß theorem. We will call these sets satisfying the Bolzano-Weierstraß theorem '''sequentially closed''' sets:

{{:Math for Non-Geeks/Template:Definition
 |titel=Sequential closedness
 |definition=
A subset of the real numbers is called '''sequentially closed''' iff any sequence out of this set has a convergent subsequence.
}}

If the domain of definition <math>D</math> of a continuous function <math>f:D\to\R</math> is sequentially compact, then the function <math>f</math> must fulfill the extreme value theorem. The generalization of sequential compactness from real numbers to other sets of mathematical objects is one of the topics dealt with in topology.

== Exercise: Image of polynomials of even degree ==
[[File:Aufgabe – Bild einer Polynomfunktion.webm|thumb|Exercise: Image of polynomials of even degree (in German)]]
{{:Math for Non-Geeks/Template:Aufgabe
 |titel=Image of polynomials
 |aufgabe=
Let 

{{Math|<math>p: \R \to \R, \ p(x)=a_nx^n + a_{n-1}x^{n-1}+ \ldots + a_1x+a_0</math>}}

be a polynomial function with <math>a_0,a_1, \ldots ,a_{n-1},a_n \in \R</math> and <math>a_n \ne 0</math>. Let <math>p</math> further have an even degree <math>n</math>. Show that the image of <math>p</math> is given by

{{Math|<math>p(\R) = \begin{cases}
[y_{\min}, \infty) & \text{ for } a_n>0, \\
(-\infty ,y_{\max}] & \text{ for } a_n<0.
\end{cases}</math>}}

Here, <math>y_{\min}</math> (an case <math>a_n > 0</math>) and <math>y_{\max}</math> (in case <math>a_n < 0</math>) are real numbers.

 |beweis=

We will consider the case <math>a_n > 0</math>. The proof for the case <math>a_n < 0</math> works analogously. At first, we note that the polynomial <math>p</math> is a composition of continuous functions and hence continuous itself on <math>\R</math> . It is temping to use the extreme value theorem in order to show that <math>p</math> attains a minimum. However, <math>\R=(-\infty,\infty)</math> is not a compact interval. However, we can cut it off at very large values and make it compact this way. For even <math>n</math>, there is <math>\lim_{x \to \pm \infty} x^n = \infty</math>, da <math>n</math>. The <math>x^n</math>-term dominates the other ones, so there is also

{{Math|<math>\lim_{x \to \pm \infty} p(x)= \lim_{x \to \pm \infty} \underbrace{x^n}_{\to \infty} (\underbrace{a_n+a_{n-1}x^{-1}+ \ldots +a_1x^{-n+1}+a_0x^{-n}}_{\to a_n >0}) =  \infty</math>}}

Now, let us take any function value of <math>p</math> – for instance <math>p(0)</math>. Since <math>\lim_{x\to\infty} p(x)=\infty</math> there is an <math>S\in\R</math>, such that <math>p(x) > p(0)</math> for all <math>x \ge S</math> . Analogously, since <math>\lim_{x\to-\infty} p(x)=\infty</math> there is an <math>s\in\R</math>, such that <math>p(x) > p(0)</math> for arguments <math>x</math> smaller than <math>s</math> . Both on <math>(-\infty,s]</math> and <math>[S,\infty)</math> , the polynomial <math>p</math> is larger than the function value <math>p(0)</math>.

We can hence cut off the real number axis and restrict to the interval <math>[s,S]</math>. Since on <math>[S,\infty)</math> the function is larger than <math>p(0)</math> , the argument <math>0</math> does not belong to this set and <math>S > 0</math>. Analogously, <math>s < 0</math>. Therefore, <math>[s,S]</math> is a nonempty, closed and bounded interval. Hence it is compact an we can apply the extreme value theorem. The polynomial <math>p</math> indeed attains a minimum <math>y_{\min}</math> on <math>[s,S]</math> . Now, <math>y_{\min} \le p(0)</math> (since <math>0\in[s,S]</math>) and therefore, <math>y_{\min}</math> is also a global minimum of the polynomial.

The intermediate value theorem additionally yields that the image of <math>p</math> is an interval (see also [[Math for Non-Geeks: Zwischenwertsatz#Anchor:FolgerungZWS|Conclusions from the intermediate value theorem]]). Since <math>\lim_{x\to\infty} p(x)=\infty</math> and <math>y_{\min}</math> is a global minimum of <math>p</math> , the image of <math>p</math>  must be of the form <math>[y_{\min},\infty)</math>.
}}

== Exercise: Continuous functions on [0,1] ==
[[File:Aufgabe – Stetige Funktionen auf kompakte Intervalle.webm|thumb|Exercise: Continuous functions on [0,1] (in German)]]
{{:Math for Non-Geeks/Template:Aufgabe
 |titel=There is no continuous function on a compact interval attaining all function values exactly twice
 |aufgabe=
Show that there is no continuous function <math>f:[0,1] \to \R</math> attaining all its function values exactly twice. That means, there is no continuous function <math>f:[0,1] \to \R</math>, such that for all <math>y\in f([0,1])</math> exactly two numbers <math>x_1, x_2\in [0,1]</math> with <math>f(x_1)=f(x_2)=y</math> exist.

 |lösung=
We perform a proof by contradiction. Let <math>f:[0,1]\to\R</math> be a continuous function attaining all its values exactly twice. Since <math>f</math> is continuous and <math>[0,1]</math> is a compact interval, <math>f</math> has to be bounded and to attain a maximum <math>M</math> . By assumption, this maximum is attained exactly twice. So there are two arguments <math>x_M,\tilde x_M\in[0,1]</math> with <math>f(x_M) = f(\tilde x_M) = M</math>. Let without loss of generality be <math>x_M < \tilde x_M</math>.

Now, <math>f</math> must also attain a minimum on the interval <math>[x_M,\tilde x_M]</math> , which we call <math>m</math> . Since <math>M</math> is the maximum of <math>f</math> , it is also the maximum of the restriction <math>f|_{[x_M,\tilde x_M]}</math>. Therefore, <math>M \ge m</math>. In case <math>m=M</math> , the function <math>f</math> would have to be constant on <math>[x_M,\tilde x_M]</math> and hence attain exactly one value infinitely often. Therefore, <math>m < M</math>.

Since the minimum <math>m</math> is attained by <math>f</math> on the interval <math>[x_M,\tilde x_M]</math> and the function attains the maximum <math>M</math> on both ends of the interval, there is an <math>x_m</math> with <math>x_M < x_m < \tilde x_M</math> and <math>f(x_m)=m</math>. And we know that <math>m</math> is attained at some second argument <math>\tilde x_m \in [0,1]</math> . This argument <math>\tilde x_m</math> mab be situated on the inside of the interval <math>[x_M,\tilde x_M]</math> or on the outside.

{{:Math for Non-Geeks/Template:Fallunterscheidung
 |fall1=<math>\tilde x_m \notin [x_M,\tilde x_M]</math>
 |beweis1=
First, we consider the case  where <math>\tilde x_m</math> is not in <math>[x_M,\tilde x_M]</math> on consider - without loss of generality - the case <math>x_M < x_m < \tilde x_M < \tilde x_m</math> . The mean <math>\tfrac{M+m}2</math> of <math>M</math> and <math>m</math> is an intermediate value and will hence be attained by the function between <math>x_M</math> and <math>x_m</math> by means of the intermediate value theorem. Analogously, <math>\tfrac{M+m}2</math> is attained in the intervals <math>[x_m,\tilde x_M]</math> and <math>[\tilde x_M,\tilde x_m]</math> . So <math>\tfrac{M+m}2</math> is attained at least at three arguments, which leads to a contradiction to the function attaining each value exactly twice:

[[File:Continuous function on compact interval 1.svg|center|500px|The function f is attaining the value (M+m)/2 three times]]

 |fall2=<math>\tilde x_m \in [x_M,\tilde x_M]</math>
 |beweis2=
Now, we consider the case where <math>\tilde x_m</math> is situated inside the interval <math>[x_M,\tilde x_M]</math> . Without loss of generality, we assume <math>x_M < x_m < \tilde x_m < \tilde x_M</math> . Within the interval <math>[x_m,\tilde x_m]</math> , <math>f</math> must attain a maximum <math>M_2</math> . Since <math>m</math> is the minimum on <math>[x_m,\tilde x_m]</math> , there will be <math>M_2 \ge m</math>. In addition, <math>m</math> has already been attained twice, so we need the strict inequality <math>M_2 > m</math> (else, the function would be constant on <math>[x_m,\tilde x_m]</math>). As <math>M</math> is the maximum of <math>f</math>, which was already attained twice at <math>x_M</math> and <math>\tilde x_M</math> , there is <math>M > M_2 > m</math>.

Now, the intermediate value theorem tells us that <math>M_2</math> is attained within the interval <math>[x_M,x_m]</math> (since <math>f(x_M) = M > M_2 > m = f(x_m)</math>). For the same reason (<math>f(\tilde x_m) = m < M_2 < M = f(\tilde x_M)</math>), the value <math>M_2</math> is also attained on <math>[\tilde x_m,\tilde x_M]</math>. So <math>M_2</math> is a value attained at least three times: inside the open interval <math>(x_M,x_m)</math>, inside of <math>(x_m,\tilde x_m)</math> and inside of <math>(\tilde x_m,\tilde x_M)</math>. This is a contradiction to every value being attained exactly twice:

[[File:Continuous function on compact interval 2.svg|center|500px|A function f attaining the value M_2 three times]]
}}}}

In addition, the statement of the above exercise can be generalized in multiple ways:

# We have shown that on a compact interval <math>[a,b]</math> , there is no continuous function attaining each value twice.
# Similarly, one may show that there is no continuous function <math>f: \R \to \R</math>attaining each of its values twice. 
# And for each given number <math>n \in \N</math>, <math>n>1</math> , one can show that there is no continuous function <math>f:[a,b]\to \R</math> attaining each of its values exactly <math>n</math> times. 

{{:Math for Non-Geeks/Template:Frage
 |typ=Exercise for understanding
 |einrückung=nein
 |frage=Give an example for:

# A continuous function <math>f: [0,1] \to \R</math>, attaining each of its function values exactly once.
# A function <math>f: (0,1] \to \R</math> (non-continuous) attaining all of its function values exactly twice.

 |antwort=

Possible solution:

# <math>f: [0,1] \to \R</math> with <math>f(x)=x</math>
# <math>f: (0,1] \to \R</math> with <math>f(x) = \begin{cases} 2x & 0<x\le \frac 12 \\ 2x-1 & \frac 12 < x \le 1 \end{cases}</math>
}}  

{{#invoke:Math for Non-Geeks/Seite|unten}}

{{BookCat}}
Templates used on this page:
Math for Non-Geeks (edit)
Math for Non-Geeks/Template:Aufgabe (edit)
Math for Non-Geeks/Template:Beispiel (edit)
Math for Non-Geeks/Template:Beweis (edit)
Math for Non-Geeks/Template:Beweisschritt (edit)
Math for Non-Geeks/Template:Box (edit)
Math for Non-Geeks/Template:Definition (edit)
Math for Non-Geeks/Template:Fallunterscheidung (edit)
Math for Non-Geeks/Template:Frage (edit)
Math for Non-Geeks/Template:Klapptext (edit)
Math for Non-Geeks/Template:Lösung (edit)
Math for Non-Geeks/Template:Satz (edit)
Math for Non-Geeks: Template:Beispiel (edit)
Math for Non-Geeks: Template:Beweis (edit)
Math for Non-Geeks: Template:Beweisschritt (edit)
Math for Non-Geeks: Template:Box (edit)
Math for Non-Geeks: Template:Definition (edit)
Math for Non-Geeks: Template:Fallunterscheidung (edit)
Math for Non-Geeks: Template:Frage (edit)
Math for Non-Geeks: Template:Klapptext (edit)
Math for Non-Geeks: Template:Lösung (edit)
Math for Non-Geeks: Template:Satz (edit)
Template:BOOKCATEGORY (view source) (protected)
Template:BookCat (view source) (protected)
Template:BookCat/core (view source) (protected)
Template:BookCat/default (view source) (protected)
Template:Evalx (view source) (protected)
Template:Math (edit)
Template:NAIVEBOOKNAME (view source) (protected)
Module:List (edit)
Module:Math for Non-Geeks/Seite (edit)
Module:Math for Non-Geeks/Sitemap (edit)
Module:Serlo/Utils (edit)
Module:TScope (view source) (protected)
Module:TableTools (view source) (protected)
Module:Utils (edit)
Module:Wikilisp (view source) (protected)
Return to Math for Non-Geeks/ Extreme value theorem.
Retrieved from "https://en.wikibooks.org/wiki/Math_for_Non-Geeks/_Extreme_value_theorem"