{
  "id": "supremum-and-infimum",
  "title": "Supremum and Infimum",
  "lang": "en",
  "source_lang": "en",
  "summary": "The supremum and infimum of a set are its least upper bound and greatest lower bound, whether or not those bounds belong to the set.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Least upper bound and greatest lower bound",
    "Sup and inf"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/supremum-and-infimum/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/supremum-and-infimum/",
      "json": "https://aiwiki.page/zh/supremum-and-infimum.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The supremum of a set in an ordered space is its least upper bound, and the infimum is its greatest lower bound. Written \\(\\sup A\\) and \\(\\inf A\\), they describe the tightest possible bounds on a set \\(A\\), even when the set has no largest or smallest element. These concepts are fundamental to mathematical analysis, where they underpin the completeness of the real numbers, convergence theorems, integration, and optimization. They also apply more generally to partially ordered sets."
    },
    {
      "heading": "Definitions",
      "text": "Let \\(A\\) be a subset of a partially ordered set \\((P,\\leq)\\).\n\nAn element \\(u\\in P\\) is an upper bound of \\(A\\) if\n\n\\[a\\leq u\\qquad\\text{for every }a\\in A.\\]\n\nThe set \\(A\\) is bounded above if at least one such upper bound exists.\n\nAn element \\(s\\in P\\) is the supremum of \\(A\\) if:\n\n- \\(s\\) is an upper bound of \\(A\\).\n- \\(s\\leq u\\) for every upper bound \\(u\\) of \\(A\\).\n\nThus the supremum is the least element of the set of upper bounds.\n\nDually, an element \\(l\\in P\\) is a lower bound of \\(A\\) if\n\n\\[l\\leq a\\qquad\\text{for every }a\\in A.\\]\n\nAn element \\(i\\in P\\) is the infimum of \\(A\\) if:\n\n- \\(i\\) is a lower bound of \\(A\\).\n- \\(l\\leq i\\) for every lower bound \\(l\\) of \\(A\\).\n\nA supremum or infimum, when it exists, is unique. For example, if \\(s\\) and \\(t\\) are both suprema of the same set, their defining properties give \\(s\\leq t\\) and \\(t\\leq s\\); antisymmetry then gives \\(s=t\\).\n\nThe notations\n\n\\[\\sup_{x\\in D}f(x) \\quad\\text{and}\\quad \\inf_{x\\in D}f(x)\\]\n\nrefer to the supremum and infimum of the values taken by a function \\(f\\) on \\(D\\)."
    },
    {
      "heading": "Difference from maximum and minimum",
      "text": "A maximum of a set must belong to that set. A supremum need not.\n\nFor the open interval\n\n\\[A=(0,1),\\]\n\nthe supremum is \\(1\\) and the infimum is \\(0\\), but \\(A\\) has neither a maximum nor a minimum. Every member can be replaced by a larger member and by a smaller member while remaining inside the interval.\n\nFor the closed interval\n\n\\[B=[0,1],\\]\n\nthe same bounds are attained:\n\n\\[\\inf B=\\min B=0, \\qquad \\sup B=\\max B=1.\\]\n\nIn general, whenever a supremum exists,\n\n\\[\\sup A\\in A \\quad\\Longleftrightarrow\\quad A\\text{ has a maximum}.\\]\n\nThe corresponding statement holds for the infimum and minimum.\n\nEvery nonempty finite subset of a totally ordered set has a maximum and a minimum. This need not hold in a partially ordered set, because some elements may be incomparable. Moreover, a maximal element, meaning one with no strictly larger element in the set, need not be a maximum: a maximum must be greater than or equal to every element."
    },
    {
      "heading": "Approximation from within a set",
      "text": "For a nonempty subset \\(A\\) of the real numbers, a finite number \\(s\\) is its supremum precisely when:\n\n- \\(a\\leq s\\) for every \\(a\\in A\\);\n- for every \\(\\varepsilon>0\\), there is an \\(a\\in A\\) such that\n\n\\[s-\\varepsilon<a\\leq s.\\]\n\nThe second condition says that members of \\(A\\) come arbitrarily close to \\(s\\) from below, unless \\(s\\) itself is attained. If this condition failed, some number smaller than \\(s\\) would still be an upper bound.\n\nSimilarly, \\(i=\\inf A\\) precisely when \\(i\\) is a lower bound and, for every \\(\\varepsilon>0\\), some \\(a\\in A\\) satisfies\n\n\\[i\\leq a<i+\\varepsilon.\\]\n\nConsequently, a finite supremum can always be approached by a sequence of members of the set. Choosing \\(a_n\\in A\\) with\n\n\\[s-\\frac1n<a_n\\leq s\\]\n\ngives \\(a_n\\to s\\). The supremum need not occur as a term of that sequence.\n\nFor example,\n\n\\[A=\\left\\{1-\\frac1n:n=1,2,3,\\ldots\\right\\}\\]\n\nhas\n\n\\[\\inf A=0,\\qquad \\sup A=1.\\]\n\nHere \\(0\\) is a minimum, whereas \\(1\\) is not a maximum."
    },
    {
      "heading": "Completeness of the real numbers",
      "text": "The least-upper-bound property states that every nonempty set of real numbers that is bounded above has a real supremum. Equivalently, every nonempty real set bounded below has a real infimum.\n\nThis is an order-completeness property of the real number system. It distinguishes the reals from the rational numbers, despite the fact that both are densely ordered fields.\n\nConsider\n\n\\[A=\\{q\\in\\mathbb Q:q\\geq0,\\ q^2<2\\}.\\]\n\nThis set has rational upper bounds, but it has no supremum in \\(\\mathbb Q\\). Viewed as a subset of \\(\\mathbb R\\), it has supremum \\(\\sqrt2\\), an irrational number.\n\nThe ambient ordered set therefore matters. The same collection of elements may have a supremum in one ordered space and none in another.\n\nConsequences for analysis\n\nThe least-upper-bound property supports many basic results of calculus. For example, if a real sequence \\((a_n)\\) is increasing and bounded above, set\n\n\\[s=\\sup\\{a_n:n\\geq1\\}.\\]\n\nFor each \\(\\varepsilon>0\\), some \\(a_N>s-\\varepsilon\\). Monotonicity then gives\n\n\\[s-\\varepsilon<a_n\\leq s \\qquad(n\\geq N),\\]\n\nso the sequence has limit \\(s\\).\n\nFor an ordered field, the least-upper-bound property is equivalent to the conjunction of the Archimedean property and completeness for Cauchy sequences. The order-theoretic and metric formulations describe different aspects of the completeness of \\(\\mathbb R\\)."
    },
    {
      "heading": "Infinite bounds and the empty set",
      "text": "Within \\(\\mathbb R\\), a set unbounded above has no supremum, and a set unbounded below has no infimum. It is often convenient to work instead in the extended real number line\n\n\\[\\overline{\\mathbb R}=\\mathbb R\\cup\\{-\\infty,+\\infty\\}.\\]\n\nThere,\n\n\\[\\sup A=+\\infty\\]\n\nfor a set unbounded above, and\n\n\\[\\inf A=-\\infty\\]\n\nfor a set unbounded below. These are statements about order; they do not make every arithmetic operation involving infinity meaningful.\n\nThe empty set requires special care. Every element of an ordered space is both an upper and a lower bound of it, because the defining conditions have no elements to check. Therefore:\n\n- Its supremum exists exactly when the ambient space has a least element, which is then that supremum.\n- Its infimum exists exactly when the ambient space has a greatest element, which is then that infimum.\n\nThus neither exists in \\(\\mathbb R\\), whereas in \\(\\overline{\\mathbb R}\\),\n\n\\[\\sup\\varnothing=-\\infty, \\qquad \\inf\\varnothing=+\\infty.\\]"
    },
    {
      "heading": "Basic identities and inequalities",
      "text": "For nonempty real sets with the relevant finite bounds, the following rules hold.\n\nInclusion\n\nIf \\(A\\subseteq B\\), then\n\n\\[\\sup A\\leq\\sup B, \\qquad \\inf B\\leq\\inf A.\\]\n\nEnlarging a set can raise its supremum or lower its infimum.\n\nTranslation, scaling, and negation\n\nWriting \\(A+c=\\{a+c:a\\in A\\}\\),\n\n\\[\\sup(A+c)=\\sup A+c, \\qquad \\inf(A+c)=\\inf A+c.\\]\n\nFor \\(\\lambda>0\\),\n\n\\[\\sup(\\lambda A)=\\lambda\\sup A, \\qquad \\inf(\\lambda A)=\\lambda\\inf A.\\]\n\nFor \\(\\lambda<0\\), the order reverses:\n\n\\[\\sup(\\lambda A)=\\lambda\\inf A, \\qquad \\inf(\\lambda A)=\\lambda\\sup A.\\]\n\nIn particular,\n\n\\[\\inf A=-\\sup(-A).\\]\n\nSums\n\nFor the set \\(A+B=\\{a+b:a\\in A,\\ b\\in B\\}\\),\n\n\\[\\sup(A+B)=\\sup A+\\sup B\\]\n\nwhen both suprema are finite. The analogous identity holds for finite infima.\n\nFor two functions on the same nonempty domain, however, only\n\n\\[\\sup_x(f(x)+g(x)) \\leq \\sup_x f(x)+\\sup_x g(x)\\]\n\nis guaranteed when the quantities are finite. Equality may fail because the two functions may approach their largest values at different arguments."
    },
    {
      "heading": "Applications",
      "text": "Optimization\n\nIn optimization, the infimum of an objective function over a feasible set is the best possible objective value for minimization. A minimizer is a feasible point that attains this value.\n\nFor example, minimizing \\(f(x)=x\\) over \\(x>0\\) gives infimum \\(0\\), but no minimizer. For every positive tolerance \\(\\varepsilon\\), a feasible point exists with\n\n\\[f(x)<\\inf_{y>0}f(y)+\\varepsilon.\\]\n\nThus approximate optimality can be meaningful even without attainment.\n\nThe extreme value theorem supplies an important sufficient condition: a real-valued continuous function on a nonempty compact space attains both its supremum and its infimum.\n\nUpper and lower limits\n\nFor a real sequence \\((a_n)\\), its upper and lower limits are defined in the extended real line by\n\n\\[\\limsup_{n\\to\\infty}a_n = \\inf_{n\\geq1}\\sup_{k\\geq n}a_k,\\]\n\nand\n\n\\[\\liminf_{n\\to\\infty}a_n = \\sup_{n\\geq1}\\inf_{k\\geq n}a_k.\\]\n\nThese record the limiting upper and lower behavior of the tails. The sequence converges to a finite real number \\(L\\) exactly when both quantities equal \\(L\\).\n\nIntegration and function spaces\n\nIn the Darboux formulation of the Riemann integral, upper sums use the supremum of a bounded function on each subinterval, while lower sums use its infimum. Integrability means that the infimum of all upper sums equals the supremum of all lower sums.\n\nIn functional analysis, the supremum norm of a bounded function on a nonempty set is\n\n\\[\\|f\\|_\\infty=\\sup_x|f(x)|.\\]\n\nIn measure theory, the essential supremum instead disregards exceptional sets of measure zero. It is the infimum of the constants \\(M\\) for which \\(f\\leq M\\) almost everywhere. This distinction is central to L^\\infty spaces, whose elements identify functions that agree almost everywhere."
    },
    {
      "heading": "Suprema and infima in general orders",
      "text": "Outside the real line, suprema and infima express more general forms of combination and common restriction.\n\nFor a family \\(\\mathcal A\\) of subsets of a fixed set \\(X\\), ordered by inclusion,\n\n\\[\\sup\\mathcal A=\\bigcup_{A\\in\\mathcal A}A, \\qquad \\inf\\mathcal A=\\bigcap_{A\\in\\mathcal A}A,\\]\n\nwhere the intersection of the empty family is taken to be \\(X\\).\n\nFor positive integers ordered by divisibility, the infimum of two integers is their greatest common divisor, and their supremum is their least common multiple. Here “upper” means “divisible by,” not “numerically larger.”\n\nA lattice is a partially ordered set in which every pair has a supremum, called its join, and an infimum, called its meet. A complete lattice has both for every subset, including the empty subset. The power set of any set, ordered by inclusion, is a complete lattice, as is the extended real line. The real line itself is not a complete lattice: it has neither a greatest nor a least element, and unbounded subsets lack the corresponding real bounds."
    }
  ],
  "links": [
    "mathematical-analysis",
    "partial-order",
    "mathematical-function",
    "real-number",
    "rational-number",
    "irrational-number",
    "calculus",
    "limit",
    "cauchy-sequence",
    "empty-set",
    "mathematical-optimization",
    "objective-function",
    "feasible-set",
    "extreme-value-theorem",
    "continuous-function",
    "compact-space",
    "riemann-integral",
    "functional-analysis",
    "measure-theory",
    "almost-everywhere",
    "lp-space",
    "greatest-common-divisor"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}