TITLE: Trouble understanding how the Transfer Principle is applied for the Extreme Value theorem.
QUESTION [8 upvotes]: I am reading Keisler's Elementary Calculus (which can be downloaded here). I am having trouble understanding his proof sketch of Extreme Value Theorem and how he is applying the Transfer Principle.
For reference, he defines the "Transfer Principle" as:

Every real statement that holds for one or more particular functions holds for the hyperreal natural extension of these functions.

On page 164 (using left corner numbering) of the book he provides the following "sketch":

I understand the counter examples and I am able to understand the issues with them using standard tools. I don't understand, however, how one can immediately utilize the Transfer Principle. It is not immediately obvious to me that "there is a partition point $a + K\delta$ at which $f(a + K\delta)$ has the largest value."
To elaborate, the proof seems circular. In trying to to "expand" the sketch to be more precise. I ended up writing instead of:

By the Transfer Principle, there is a partition point $a + K\delta$ at which $f(a + K\delta)$ has the largest value.

To:

Applying the Transfer Principle to the Extreme Value Theorem we see that the Extreme Value holds for hyperreals as well. Hence, there is a partition point $a + K\delta$ at which $f(a + K\delta)$ has the largest value.

But this relies on a proof of the Extreme Value Theorem for reals.
Hopefully what I am saying makes sense, please ask for any clarification.

REPLY [3 votes]: Let me propose a different interpretation of transfer (in the formulation suggested by m_t_) for the Intermediate Value Theorem.
Consider the following "standard" argument about ordinary real numbers. For all $n \in \mathbb{N}$, it is possible to partition $[a,b]$ into $a, a+\frac{b-a}{n}, \ldots, a+n\frac{b-a}{n}=b$.
Since there is a finite number of partition points (they are $n+1$), it is well-defined the maximum among the values $f(a), f\left(a+\frac{b-a}{n}\right), \ldots, f(b)$.
Recall that, by transfer, finite and $^\ast$finite sets satisfy the same properties. As a consequence, you can always pick the biggest element of a $^\ast$finite set.
Hence, transfer entails also that for all $n \in\ \! ^\ast\mathbb{N}$ the number
$$\max\left\{ f(a), f\left(a+\frac{b-a}{n}\right) , \ldots, f\left(a+n\frac{b-a}{n}\right)=f(b) \right\}$$
is well-defined for every partition of $^\ast[a,b]$ into $n$ equal parts.
In other words, you are proving the Extreme Value Theorem by applying transfer to the statement "every finite set has a maximum element", and not to the Extreme Value Theorem for real numbers.
Let now $n \in\ \! ^\ast\mathbb{N}$ be infinite, and let $$f\left(a+K\frac{b-a}{n}\right) = \max\left\{ f(a), f\left(a+\frac{b-a}{n}\right) , \ldots, f\left(a+n\frac{b-a}{n}\right)=f(b) \right\}.$$ (What I call $\frac{b-a}{n}$ is the infinitesimal $\delta$ in the original proof by Keisler).
Define $c=\ \!^\circ\left(a+K\frac{b-a}{n}\right)$. By continuity of $f$ you have that $^\circ\left(^\ast f\left(a+K\frac{b-a}{n}\right) \right) = f(c)$. From here onward, it is possible to follow the original proof by Keisler.