For fixed , the function on is continuous, indeed -Lipschitz continuous by the reverse triangle inequality. A continuous real-valued function on a nonempty compact space attains its minimum by the extreme value theorem. Hence some satisfies
The metric is symmetric, so this is also . Compactness supplies attainment of the infimum.
A metric space is sequentially compact if every sequence has a convergent subsequence whose limit belongs to the space. A limit point of is a point for which every open ball about contains a point of other than .
Let lie in a compact metric space. If one value occurs infinitely often, take a constant subsequence. Otherwise its set of values is infinite. If had no limit point, every point of the space would have a neighborhood containing at most one member of . A finite subcover of these neighborhoods would force finite, a contradiction. Thus has a limit point; the stated subsequence result supplies a convergent subsequence. This proves sequential compactness.
Assume now that is nonempty, as is necessary for the requested minimum and fixed point. The function is continuous, as a composition of with the metric. The extreme value theorem on a compact space implies that attains its infimum, say at . If , strict decrease of distances gives
contradicting minimality. Thus . If were distinct fixed points, then , another contradiction. Hence there is exactly one fixed point. This is the fixed point theorem for a strictly distance-decreasing map on a compact metric space.
Compactness is essential. On , take
Here , so there is no fixed point. Nevertheless everywhere, and the mean value theorem gives for distinct . There is no uniform Lipschitz constant less than , since as .
For , the unit sphere is nonempty and compact by the Heine-Borel theorem. The function is continuous and therefore attains a minimum and a maximum on it by the extreme value theorem. Either point supplies a nonzero eigenvector in part (ii), with a real multiplier. Thus always has a real eigenvalue, indeed a nonnegative one. This gives existence without assuming the spectral theorem first.
For , the unit sphere is nonempty and compact by the Heine-Borel theorem. The function is continuous and therefore attains a minimum and a maximum on it by the extreme value theorem. Either point supplies a nonzero eigenvector in part (ii), with a real multiplier. Thus always has a real eigenvalue, indeed a nonnegative one. This gives existence without assuming the spectral theorem first.
A sequentially compact space is one in which every sequence has a subsequence converging to a point of the space. A limit point of means every open ball around meets .
In a compact metric space, a sequence with a finite set of values has a constant subsequence. If its value set is infinite and had no limit point, each point of the space would have a neighbourhood containing at most one point of that value set. A finite subcover would then make the value set finite, a contradiction. It therefore has a limit point in the space, and the permitted subsequence result gives a convergent subsequence. This proves sequential compactness.
For the remaining assertions assume the compact space is nonempty, as required for a fixed-point claim. The displacement function is continuous by the stated continuity of the metric and of . The extreme value theorem gives a minimum . If , then , and strict decrease of distances implies
contradicting minimality. Thus and is a fixed point. Two distinct fixed points would satisfy , also impossible. Hence the fixed point is unique.
On the noncompact real line, take
Its derivative is strictly between zero and one. The mean value theorem therefore gives for each distinct pair. Yet , so it has no fixed point. Compactness, rather than merely pointwise strict shrinkage, supplies attainment of a zero displacement in the preceding proof.
The feasible set is closed and contained in the rectangle
It is therefore compact, and the continuous function attains a global maximum there by the extreme value theorem. At the two boundary endpoints where a coordinate is zero, the product is zero. Meanwhile is feasible because the conjugate exponents satisfy , and its product is one. Hence every maximizer has .
On that positive region the constraint is with nonzero gradient. The Lagrange multiplier equations are
The first two identities imply . Since , the multiplier is nonzero, so . The constraint now gives
Thus the sole interior candidate is . Existence of a maximum and the boundary comparison prove the unique global result
This conjugate-power constrained product maximum is valid for all real with ; no integrality of the exponents is needed.
Figure 1.
The constrained product reaches one where the two level curves are tangent
. Original illustration for p=3 and q=3/2. The constraint arc meets the product level xy=1 only at (1,1), where both gradients point along (1,1). The red dashed line is their common tangent. Details.
The constraint is a compact set, so the continuous objective attains both extrema by the extreme value theorem. Use Lagrange multipliers with :
Since the second component makes , the two equations give , or . Substitution into the constraint yields
with matching signs. The objective values are therefore
The constraint gradient never vanishes on the ellipse, so these are all the possible extrema. As a direct check, set , ; then and the Cauchy-Schwarz inequality gives , with equality at the same points.
The continuous function attains a global maximum and minimum on the closed disc by the extreme value theorem. All four unconstrained stationary points have squared distance eight, so none lies in its interior. The extrema must therefore lie on .
The constraint gradient is nonzero on that circle, so Lagrange multipliers apply:
Subtracting gives . If , the constraint gives . Otherwise ; substitution into either equation gives . This is impossible, since on the circle. Thus the diagonal points are the only candidates. Comparing their values gives
The extreme value theorem guarantees extrema on the closed interval. Compare its endpoints and the stationary points :
Thus
The two-point answer in each case also follows from the even function symmetry.
Peano existence theorem Created 2026-09-29 Updated 2026-10-14
Let be an open set, , and a continuous function. Through every there is a local solution of a differential equation: a continuously differentiable function on an open interval containing , satisfying the displayed initial value problem pointwise. No Lipschitz condition is assumed.[ref]
Continuity of a proposed rate law therefore guarantees at least one trajectory for a short time. For a physical model, this is a first consistency check: can the stated rule and initial condition actually be followed? Prediction also needs uniqueness. The delayed solutions of a square-root differential equation below show how the same rule and initial condition can leave a departure time undetermined. The Picard-Lindelöf theorem supplies a sufficient additional hypothesis for uniqueness; failure of that hypothesis alone does not prove nonuniqueness.
For the initial value problem , , a forward solution of a differential equation can stay zero until any , then follow . The delayed solutions of a square-root differential equation verify this freedom exactly.
Figure 1.
One initial condition admits an arbitrary forward waiting time
. Colored curves leave zero at the marked waits ; the dashed curve stays zero forever. Every curve satisfies the same original differential equation for . Details.
Local existence gives neither a global solution of a differential equation nor a bound on all future values. The continuous function already permits finite-time blowup; the finite-dimensional continuation criterion explains the additional issue of extending a trajectory within its domain.
Proof outline: choose a compact set . By the extreme value theorem, . Take with . Forward Euler method polygons remain in the closed ball and satisfy . The Arzelà-Ascoli theorem yields a convergent subsequence with uniform convergence. Uniform continuity of on makes their integral equation defect tend uniformly to zero, so the limit satisfies
The fundamental theorem of calculus gives a continuously differentiable function. Repeat backward and join at , where both derivatives equal .[ref]
The compact set here uses a finite-dimensional vector space; bounded closed balls in an arbitrary Banach space need not be compact. When , the constant solution of a differential equation works on the entire time interval in . In general the proof selects a subsequence, without asserting that all polygons converge to one unique trajectory.
A real continuous function on that tends to as has range for an attained minimum . Choose a compact interval outside which its values exceed , and minimize there by the extreme value theorem. For any , choose a far point with value larger than and apply the intermediate value theorem between it and a minimizer. Distance from a fixed point to a continuous graph is an example because it is at least the horizontal distance.
In a finite flow network, a maximum flow exists because the feasible flow set contains the zero flow and is a compact set: the capacity constraints bound every coordinate, and they and flow conservation define a closed set. The strength of a flow is a continuous function, so the extreme value theorem gives an attained maximum. An augmenting path in the residual network would permit positive augmentation, contradicting maximality. The source-reachable vertices in the residual network therefore define a cut of a flow network whose outgoing original edges are saturated and incoming original edges carry zero flow. Flow conservation makes the strength of a flow equal to this cut capacity, proving the max-flow min-cut theorem.
Existence and strong duality for finite real flow network edge capacities do not imply finite termination for every choice of augmenting paths in the Ford-Fulkerson algorithm. With irrational capacities, some choices can continue forever. With integer capacities, Integrality of the Ford-Fulkerson algorithm instead forces finite termination; rational capacities reduce to that case by a common denominator. Choosing shortest augmenting paths as in the Edmonds–Karp algorithm avoids dependence on capacity magnitudes.[ref]
Rolle theorem Created 2026-09-24 Updated 2026-10-14
Rolle's theorem is the equal-endpoint case of the mean value theorem. Let and let the real-valued function be continuous on the closed interval and differentiable on the open interval . If , there exists with . Geometrically, a tangent line somewhere in the interior is horizontal, like the secant line joining the endpoints. [ref]
For the polynomial on , both endpoint values are zero and the derivative is . Thus , where , and the horizontal tangent line is . The horizontal secant line is : equal endpoint values do not force the interior tangent line to pass through those endpoints.
The absolute value function on exposes the importance of differentiability. It is continuous and , so the secant line has slope zero. However,
and the derivative does not exist at zero because the one-sided derivatives disagree. Every existing derivative in the interior is nonzero. The corner fails a hypothesis of both Rolle's theorem and the mean value theorem, so neither conclusion is guaranteed.
For a short proof, the extreme value theorem supplies a greatest and a least value on . If is a constant function, every interior point works. Otherwise at least one of these values differs from the common endpoint value, so it is attained at an interior extremum. At an interior local maximum or local minimum, differentiability forces the derivative to be zero: the difference quotients from the two sides have opposite weak signs and the same limit.
This turns repeated values into information about derivatives. Two distinct roots of a polynomial force a root of its derivative between them; iterating this idea gives the Rolle root count with multiplicities. More generally, a differentiable function with nonzero derivative throughout a real interval cannot repeat a value there, hence is injective. The beauty is that knowing only two equal values guarantees an exact local feature somewhere between them.
Supremum can fail to be attained at an oscillatory endpoint Created 2026-10-06 Updated 2026-11-05
Define a bounded function on by
It is continuous away from zero, but its supremum is and it has no global maximum. For every , , and . On the other hand,
The strict pointwise bound proves nonattainment, while this sequence proves that no smaller upper bound works. The extreme value theorem fails to apply because of the discontinuity at zero. Defining an endpoint value below its oscillatory limit superior cannot repair that missing hypothesis.
Supremum norm Created 2026-09-24 Updated 2026-10-14
The supremum norm of a bounded real- or complex-valued function on a set is
For a continuous function on a compact space, the extreme value theorem makes this supremum a maximum.