{
  "id": "extreme-value-theorem",
  "title": "Extreme value theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The extreme value theorem states that a continuous real-valued function on a nonempty compact domain attains both a maximum and a minimum.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Weierstrass extreme value theorem",
    "Minimum–maximum theorem",
    "Max–min theorem"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/extreme-value-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/extreme-value-theorem/",
      "json": "https://aiwiki.page/zh/extreme-value-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The extreme value theorem is a theorem of mathematical analysis stating that a continuous real-valued function on a closed, bounded interval attains both an absolute maximum and an absolute minimum. More generally, the conclusion holds on any nonempty compact space. The theorem is also called the Weierstrass extreme value theorem, after Karl Weierstrass. Its essential conclusion is attainment: the extreme values occur at points of the domain, rather than merely being approached. (math.ucdavis.edu)"
    },
    {
      "heading": "Statement and interpretation",
      "text": "Let \\(a,b\\) be real numbers with \\(a\\leq b\\), and let\n\n\\[f:[a,b]\\longrightarrow\\mathbb R\\]\n\nbe continuous. Then there exist points \\(x_{\\min},x_{\\max}\\in[a,b]\\) such that\n\n\\[f(x_{\\min})\\leq f(x)\\leq f(x_{\\max}) \\qquad\\text{for every }x\\in[a,b].\\]\n\nThus\n\n\\[\\min_{x\\in[a,b]}f(x)=f(x_{\\min}), \\qquad \\max_{x\\in[a,b]}f(x)=f(x_{\\max}).\\]\n\nWhen \\(a=b\\), the domain has one point and the conclusion is immediate. The extrema are absolute, or global, because the inequalities compare values throughout the domain, not just near the extremizing points. (uoe-school-of-mathematics.github.io)\n\nAttainment is stronger than boundedness. A bounded function has finite least upper and greatest lower bounds, called its supremum and infimum, but these need not be values of the function. The theorem guarantees that both bounds belong to the function’s range. It does not assert that the extremizing points are unique. (uoe-school-of-mathematics.github.io)"
    },
    {
      "heading": "Compactness and the general form",
      "text": "The general statement is:\n\nIf \\(K\\) is a nonempty compact topological space and \\(f:K\\to\\mathbb R\\) is continuous, then \\(f\\) attains a maximum and a minimum on \\(K\\).\n\nThe governing principle from topology is that the continuous image of a compact space is compact. Consequently, \\(f(K)\\) is a nonempty compact subset of \\(\\mathbb R\\). It is therefore closed and bounded and contains its supremum and infimum. Because these numbers belong to \\(f(K)\\), they are attained by \\(f\\). This proves the theorem without requiring an interval or any differentiability. (math.dartmouth.edu)\n\nIn finite-dimensional Euclidean space, the Heine–Borel theorem identifies compact sets with sets that are both closed and bounded. Hence a continuous function \\(f:K\\to\\mathbb R\\), with nonempty closed and bounded \\(K\\subseteq\\mathbb R^n\\), attains both extrema. The set need not be an interval or connected. In a general metric space, however, closedness and boundedness alone do not establish compactness; compactness is the relevant hypothesis. (math.toronto.edu)"
    },
    {
      "heading": "A sequential proof on an interval",
      "text": "A standard proof uses the Bolzano–Weierstrass theorem.\n\nFirst, \\(f\\) is bounded. Otherwise, points \\(x_n\\in[a,b]\\) could be chosen with \\(|f(x_n)|\\geq n\\). The bounded sequence \\((x_n)\\) has a convergent subsequence \\(x_{n_k}\\to c\\), and closedness gives \\(c\\in[a,b]\\). Continuity would imply\n\n\\[f(x_{n_k})\\longrightarrow f(c),\\]\n\ncontradicting the unbounded growth of \\(|f(x_{n_k})|\\). (ocw.mit.edu)\n\nNow let \\(M=\\sup f([a,b])\\). Choose \\(y_n\\in[a,b]\\) so that\n\n\\[M-\\frac1n<f(y_n)\\leq M.\\]\n\nAgain, a subsequence converges to some \\(d\\in[a,b]\\). Continuity and the defining inequalities give\n\n\\[f(d)=\\lim_{k\\to\\infty}f(y_{n_k})=M.\\]\n\nThus the supremum is attained. Applying the same argument to \\(-f\\) proves attainment of the minimum. The proof combines boundedness of the domain, retention of subsequential limits within the domain, and preservation of limits by continuity. (ocw.mit.edu)"
    },
    {
      "heading": "Why the hypotheses matter",
      "text": "Removing a hypothesis can invalidate the conclusion:\n\n- A domain that is not closed: \\(f(x)=x\\) on \\((0,1)\\) is continuous and bounded. Its infimum is \\(0\\) and its supremum is \\(1\\), but neither is attained. (math.ucdavis.edu)\n- An unbounded domain: on \\(\\mathbb R\\), the continuous bounded function\n\n\\[f(x)=1-\\frac{1}{1+x^2}\\]\n\nhas supremum \\(1\\), but never equals \\(1\\), so it has no maximum. (uoe-school-of-mathematics.github.io)\n- Discontinuity: define \\(f(0)=0\\) and \\(f(x)=1/x\\) for \\(0<x\\leq1\\). Its domain is compact, but it is discontinuous at \\(0\\), unbounded above, and has no maximum. (math.ucdavis.edu)\n\nThese examples show that the assumptions cannot simply be omitted from a general guarantee. They are not necessary conditions for every individual function to have extrema: for example, a constant function attains both extrema even on an open interval. (openstax.org)"
    },
    {
      "heading": "Applications in calculus and optimization",
      "text": "In calculus, the theorem justifies the closed-interval method for finding absolute extrema. For a continuous function on \\([a,b]\\), extrema must occur at endpoints or at interior critical points, where its derivative is zero or does not exist. When there are finitely many such candidates, evaluating the function at all of them and at both endpoints identifies the largest and smallest values. Differentiability helps locate candidates; it is not required by the extreme value theorem itself. (openstax.org)\n\nThe theorem also supplies the existence step in the proof of Rolle’s theorem, which in turn yields the mean value theorem. A nonconstant continuous function with equal endpoint values must attain at least one extreme value in the interior; differentiability then forces the derivative to vanish there. (openstax.org)\n\nIn mathematical optimization, a continuous objective function on a nonempty compact feasible set has global minimizers and maximizers. This is an existence result, not an algorithm for finding them or a guarantee of uniqueness. In several variables, finding extrema generally requires examining the boundary as well as interior critical points. (math.toronto.edu)"
    },
    {
      "heading": "Semicontinuous extension",
      "text": "Continuity can be weakened when only one extremum is required. A real-valued upper semicontinuous function on a nonempty compact space attains a maximum; a lower semicontinuous function attains a minimum. These one-sided forms of semicontinuity exclude, respectively, values near a point exceeding its value by a fixed positive amount, or falling below it by such an amount. A continuous function satisfies both conditions, so the usual theorem follows from the two one-sided results. (arxiv.org)"
    }
  ],
  "links": [
    "mathematical-analysis",
    "continuous-function",
    "mathematical-function",
    "compact-space",
    "karl-weierstrass",
    "real-number",
    "supremum-and-infimum",
    "topology",
    "image-of-a-function",
    "euclidean-space",
    "heine-borel-theorem",
    "closed-set",
    "metric-space",
    "mathematical-proof",
    "bolzano-weierstrass-theorem",
    "limit",
    "calculus",
    "critical-point",
    "derivative",
    "rolles-theorem",
    "mean-value-theorem",
    "mathematical-optimization",
    "objective-function",
    "feasible-set"
  ],
  "sources": [
    {
      "title": "Basic Analysis: Introduction to Real Analysis",
      "url": "https://ocw.mit.edu/courses/18-100a-real-analysis-fall-2020/mit18_100af20_basic_analysis.pdf"
    },
    {
      "title": "Continuous Functions",
      "url": "https://www.math.ucdavis.edu/~hunter/intro_analysis_pdf/ch7.pdf"
    },
    {
      "title": "The Extreme Value Theorem",
      "url": "https://www.math.toronto.edu/courses/mat237y1/20199/notes/Chapter1/S1.4.html"
    },
    {
      "title": "Math 63: Winter 2021, Lecture 12",
      "url": "https://math.dartmouth.edu/~m63w21/lecture-m63-12.pdf"
    },
    {
      "title": "Continuous functions: three big theorems",
      "url": "https://uoe-school-of-mathematics.github.io/MATH08081_IMA/Ch4.S9.html"
    },
    {
      "title": "Fun with \"Analysis I\": basic theorems in calculus revisited",
      "url": "https://arxiv.org/abs/0709.4492"
    },
    {
      "title": "3 Maxima and Minima — Calculus Volume 1",
      "url": "https://openstax.org/books/calculus-volume-1/pages/4-3-maxima-and-minima"
    },
    {
      "title": "4 The Mean Value Theorem — Calculus Volume 1",
      "url": "https://openstax.org/books/calculus-volume-1/pages/4-4-the-mean-value-theorem"
    },
    {
      "title": "7 Maxima/Minima Problems — Calculus Volume 3",
      "url": "https://openstax.org/books/calculus-volume-3/pages/4-7-maxima-minima-problems"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}