Summary
This lesson solves problems in which the best of many possible configurations must be found: the rectangle of largest area, the cylinder of least surface, the shortest path or the fastest one. The earlier lessons provided the tools for finding the absolute extrema of a given function; here the function is not given, and most of the work, and of the errors, lies in constructing it. The lesson sets out a method in five stages (the variable, the function, the domain, the absolute extrema with their justification, and the conclusion) and proves that a function and its composition with a strictly increasing function attain their extrema at the same points, which allows one, for instance, to minimize the square of a distance instead of the distance. It then proves that every point has a nearest point on the graph of a function continuous on a closed interval, and that, if this nearest point is not at the boundary, the given point lies on the normal line; and it deduces from the principle of least time the laws of refraction, Snell’s law, and of reflection, Heron’s law. The problems find the box of largest volume, the cylinder of least surface, the longest rod that can turn a corner, the place from which a painting is seen under the largest angle and the fastest way to cross a canal.
Learning objectives
- Translate a geometric or physical problem into the search for the absolute extremum of a function of one variable, on a precisely specified domain.
- Justify that the extremum found is absolute: by the Weierstrass theorem if the domain is a closed and bounded interval, and if it is not, by the sign of the derivative, convexity or the limits at the endpoints of the domain.
- Find the point of a graph nearest to a given point and recognize that the line joining them is normal to the graph.
- Deduce from the principle of least time the laws of reflection and of refraction, and recognize when the optimum lies at the boundary of the domain.
The method
The lessons on the Weierstrass theorem and on maxima and minima taught how to find the absolute extrema of a given function on a given interval. In an optimization problem, by contrast, what is asked for is the best configuration of a figure or of a motion, and the function to be studied, together with its domain, must be constructed from the statement. The method has five stages.
- The variable. Choose a quantity that determines the configuration (a length, an angle, a position) and express all the others in terms of it, by means of the conditions of the problem.
- The function. Write the quantity to be made maximal or minimal as a function of that single variable.
- The domain. Specify the set of values that the variable can take in the problem, which is usually an interval. If the function extends continuously to degenerate configurations, such as a rectangle of zero height or a box with no volume, it is convenient to admit them in order to obtain a closed interval, provided the extremum sought is not attained at them.
- The absolute extrema. Find them on the domain and justify that they are absolute. If the domain is a closed and bounded interval, the Weierstrass theorem guarantees that they exist, and the proposition on absolute extrema on a closed and bounded interval, from the lesson on maxima and minima, finds them by comparing values. If it is not, one uses the sign of the derivative (the theorem of the first derivative test for absolute extrema, or the corollary of a single critical point, from the same lesson), convexity (the corollary on the critical points of a convex function, from the lesson on concavity and convexity) or the limits at the endpoints of the domain (the proposition on absolute extrema on an open interval).
- The conclusion. Return to the problem: give the optimal configuration, not only the optimal value, and check that it makes sense, dimensionally and in particular cases.
The fourth stage is the one most often omitted: finding a point where the derivative vanishes is not enough. That point may be a minimum when a maximum is sought, a merely local extremum or a point outside the domain; and the absolute extremum may lie at an endpoint of the interval, where the derivative need not vanish. The lesson on maxima and minima showed, with , that a single critical point guarantees nothing if the domain is not an interval. It is often convenient, moreover, to replace the function by a simpler one that attains its extrema at the same points.
Let be a function defined on a set , a point of and a function strictly increasing on a set containing the values of . Then attains at its absolute maximum on if and only if attains it there, and the same holds for the absolute minimum, for local extrema and for strict extrema. If is strictly decreasing, attains at a maximum if and only if attains at a minimum of the same type, and conversely. A strictly increasing function does not alter the order among values, and extrema depend only on that order.
Proof
Let and be in the domain of . If , strict monotonicity gives ; if , the values coincide; and if , it gives . Hence the inequalities between the numbers and between their images are equivalent.
With and , for each in , or for each in whose distance from is less than some , the inequalities that define the absolute maximum, the local one and the strict ones, according to the lesson on maxima and minima and the definition of local extremum in the lesson on the theorems of Fermat, Rolle, Lagrange and Cauchy, hold for if and only if they hold for . The minimum is handled in the same way, and if is strictly decreasing, the inequalities between the images are reversed.
The most frequently used cases are four. The square root is strictly increasing on : a distance and its square are minimized at the same points, and the square contains no square roots. Squaring is strictly increasing on : a nonnegative quantity and its square are maximized at the same points. The logarithm is strictly increasing on : a product of positive powers and its logarithm, which is a sum, are as well. And a positive function attains its maximum where its reciprocal attains its minimum, because is strictly decreasing on .
Among the rectangles inscribed in a semicircle of radius , with one side on the diameter, find the one of largest area. The reasoning follows the stages of the method.
Proof
The variable and the function. Place the center at the origin and the diameter on the horizontal axis. The rectangle is determined by , half of its base: its upper vertices lie on the semicircle, at , and its area is the following function.
The domain. The genuine rectangles correspond to in ; we also admit and , which give degenerate rectangles, of zero area, and we obtain a closed and bounded interval on which is continuous: by the Weierstrass theorem, the maximum exists. Since is not negative, by the lemma it suffices to maximize its square, which is a polynomial and, unlike , is differentiable at as well.
The candidates. The derivative of vanishes at a single point of .
The comparison and the conclusion. By the proposition on absolute extrema on a closed and bounded interval, the maximum of is the largest of its values at , at and at the critical point. The optimal rectangle has base and height , half the base, and area .
Reflecting the optimal rectangle in the diameter yields a square of side inscribed in the full circle, of area , which is, by the same calculation, the rectangle of largest area inscribed in it. The degenerate rectangles did not alter the result: the maximum is attained at a genuine rectangle.
Loading the content…
Completed
Sign in to save your progress