{
  "id": "big-omega-notation",
  "title": "Big-Omega Notation",
  "lang": "en",
  "source_lang": "en",
  "summary": "Big-Omega notation expresses an asymptotic lower bound on a function, commonly used to describe computational resource requirements as input size grows.",
  "category": "computer-science",
  "subcategory": "algorithms-theory",
  "type": "concept",
  "aliases": [
    "Big-Ω notation",
    "Omega notation",
    "asymptotic lower-bound notation"
  ],
  "generated_at": "2026-11-06",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/big-omega-notation/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/big-omega-notation/",
      "json": "https://aiwiki.page/zh/big-omega-notation.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Big-Omega notation, written \\(\\Omega\\), describes an asymptotic lower bound on the growth of a function. In its standard computer science meaning, \\(f(n)=\\Omega(g(n))\\) states that, beyond some threshold, \\(f(n)\\) is at least a positive constant multiple of \\(g(n)\\). It is widely used in computational complexity to express lower bounds on running time, memory consumption, and other resources. The notation describes a relationship between functions; it does not, by itself, specify whether an analysis concerns the best, average, or worst case."
    },
    {
      "heading": "Formal definition",
      "text": "Let \\(f\\) and \\(g\\) be real-valued functions on the positive integers, with both functions nonnegative for all sufficiently large inputs. Then\n\n\\[f(n)=\\Omega(g(n))\\]\n\nif there exist constants \\(c>0\\) and \\(n_0\\) such that\n\n\\[0\\leq c\\,g(n)\\leq f(n) \\qquad\\text{for every }n\\geq n_0.\\]\n\nThe constants must be independent of \\(n\\). Their existence matters; their precise values usually do not.\n\nFor example, let\n\n\\[f(n)=3n^2-5n+2.\\]\n\nFor every integer \\(n\\geq 2\\),\n\n\\[f(n)-n^2=2n^2-5n+2=(2n-1)(n-2)\\geq 0.\\]\n\nThus \\(f(n)=\\Omega(n^2)\\), with \\(c=1\\) and \\(n_0=2\\). The function also belongs to \\(\\Omega(n)\\) and \\(\\Omega(1)\\): a lower bound need not be the strongest available bound.\n\nStrictly, \\(\\Omega(g)\\) denotes a set of functions. Consequently,\n\n\\[f\\in\\Omega(g)\\]\n\nis the set-theoretic form of the statement. The conventional expression \\(f=\\Omega(g)\\) is widely used, but its equals sign should not be treated as ordinary symmetric equality.\n\nThe same definition applies to functions of a real variable as that variable tends to infinity, with the inequality required for every sufficiently large real argument."
    },
    {
      "heading": "Relationship to other asymptotic notations",
      "text": "Big-Omega belongs to the family of asymptotic notations, which compare growth while suppressing constant factors and behavior on bounded portions of the domain.\n\nNotation | Meaning for eventually nonnegative functions\n\\(f(n)=O(g(n))\\) | \\(f\\) is eventually bounded above by a positive constant multiple of \\(g\\).\n\\(f(n)=\\Omega(g(n))\\) | \\(f\\) is eventually bounded below by a positive constant multiple of \\(g\\).\n\\(f(n)=\\Theta(g(n))\\) | Both bounds hold, possibly with different constants.\n\\(f(n)=\\omega(g(n))\\) | For every positive constant \\(c\\), eventually \\(f(n)\\geq c\\,g(n)\\).\n\nIn particular, Big-O notation and Big-Omega are dual:\n\n\\[f(n)=\\Omega(g(n)) \\quad\\Longleftrightarrow\\quad g(n)=O(f(n)).\\]\n\nA tight asymptotic bound, expressed using Big-Theta notation, satisfies\n\n\\[f(n)=\\Theta(g(n)) \\quad\\Longleftrightarrow\\quad f(n)=O(g(n)) \\ \\text{and}\\ f(n)=\\Omega(g(n)).\\]\n\nLittle-omega notation is stronger than Big-Omega. For eventually positive \\(g\\),\n\n\\[f(n)=\\omega(g(n)) \\quad\\Longleftrightarrow\\quad \\frac{f(n)}{g(n)}\\longrightarrow+\\infty.\\]\n\nThus \\(n^2=\\Omega(n^2)\\), but \\(n^2\\neq\\omega(n^2)\\). By contrast, \\(n^2=\\omega(n)\\)."
    },
    {
      "heading": "Interpretation in algorithm analysis",
      "text": "When analyzing an algorithm, Big-Omega can describe a lower bound on any explicitly defined resource function. Common examples include time complexity and space complexity.\n\nLet \\(t_A(x)\\) be the running time of algorithm \\(A\\) on input \\(x\\). Assuming the extrema exist, define\n\n\\[T_{\\mathrm{worst}}(n)=\\max_{|x|=n}t_A(x), \\qquad T_{\\mathrm{best}}(n)=\\min_{|x|=n}t_A(x).\\]\n\nThese functions support different claims:\n\n- \\(T_{\\mathrm{worst}}(n)=\\Omega(g(n))\\) means that, for every sufficiently large input size, some input requires at least \\(c\\,g(n)\\) time.\n- \\(T_{\\mathrm{best}}(n)=\\Omega(g(n))\\) means that every input of each sufficiently large size requires at least \\(c\\,g(n)\\) time.\n- An average-case lower bound concerns the expected value under a specified input distribution.\n\nFor a randomized algorithm, an expectation may instead be taken over the algorithm’s internal randomness. A lower bound on expected time is not automatically a lower bound that holds for every execution.\n\nLower bounds do not mean best-case complexity\n\nBig-Omega is sometimes informally described as “best-case notation.” This is incorrect. Best-case and worst-case analysis determine which resource function is being studied; Big-Omega specifies the direction of a bound on that function.\n\nFor example, sequential search through an unsorted array can terminate after its first comparison. Its best-case running time is therefore \\(\\Theta(1)\\). Its worst-case running time is \\(\\Theta(n)\\), and hence also \\(\\Omega(n)\\). The latter statement does not imply that every search takes linear time.\n\nAlgorithm bounds and problem bounds\n\nA lower bound for one algorithm differs from a lower bound for an entire computational problem.\n\nShowing that a particular sorting algorithm takes \\(\\Omega(n\\log n)\\) time does not establish that all sorting algorithms require that much time. A problem-level lower bound must cover every algorithm permitted by a specified computational model.\n\nFor comparison-based sorting of \\(n\\) distinct elements, a deterministic algorithm must distinguish among \\(n!\\) possible input orderings. A binary comparison tree therefore has worst-case height at least\n\n\\[\\left\\lceil\\log_2(n!)\\right\\rceil =\\Omega(n\\log n).\\]\n\nThis lower bound applies to the comparison model. It does not prohibit faster sorting methods under different assumptions, such as methods exploiting bounded integer keys. Merge sort achieves an \\(O(n\\log n)\\) worst-case upper bound, matching the comparison lower bound in asymptotic order."
    },
    {
      "heading": "Establishing a Big-Omega bound",
      "text": "Direct inequalities\n\nThe most direct proof supplies suitable constants \\(c\\) and \\(n_0\\).\n\nFor a polynomial with positive leading coefficient,\n\n\\[p(n)=a_kn^k+a_{k-1}n^{k-1}+\\cdots+a_0, \\qquad a_k>0,\\]\n\nthe lower-degree terms eventually have magnitude at most \\(\\frac{a_k}{2}n^k\\). Consequently,\n\n\\[p(n)\\geq \\frac{a_k}{2}n^k\\]\n\nfor sufficiently large \\(n\\), proving \\(p(n)=\\Omega(n^k)\\).\n\nRatio tests\n\nIf \\(g(n)>0\\) eventually, then\n\n\\[f(n)=\\Omega(g(n)) \\quad\\Longleftrightarrow\\quad \\liminf_{n\\to\\infty}\\frac{f(n)}{g(n)}>0,\\]\n\nwhere the limit inferior may be \\(+\\infty\\).\n\nIn particular, if the ordinary ratio limit exists and is positive, whether finite or infinite, it establishes a Big-Omega bound. If the limit is zero, the bound does not hold.\n\nAn ordinary limit is not required. For example,\n\n\\[f(n)=n\\bigl(2+(-1)^n\\bigr)\\]\n\nhas \\(f(n)/n\\) alternating between \\(1\\) and \\(3\\). The ratio does not converge, yet \\(f(n)=\\Omega(n)\\).\n\nCounting and unavoidable work\n\nAlgorithmic lower bounds often arise from work that cannot be avoided under the chosen model. Examples include reading necessary input entries, writing an explicit output, or distinguishing sufficiently many possible answers.\n\nSuch arguments require precise assumptions. Producing \\(m\\) explicit output items requires \\(\\Omega(m)\\) output operations in a model where each operation writes only a constant number of items. Returning a compressed representation or a reference to existing data is a different task and need not satisfy the same bound."
    },
    {
      "heading": "Properties and limitations",
      "text": "For eventually nonnegative functions, Big-Omega is transitive:\n\n\\[f=\\Omega(g),\\qquad g=\\Omega(h) \\quad\\Longrightarrow\\quad f=\\Omega(h).\\]\n\nMultiplying either function by a fixed positive constant does not change the relation. Changing finitely many function values also has no effect.\n\nSeveral limitations follow from its asymptotic nature:\n\n- It does not give exact costs. A statement such as \\(T(n)=\\Omega(n)\\) specifies neither a concrete running time nor the threshold at which the inequality begins to hold.\n- It need not be tight. Both \\(n\\) and \\(n^3\\) are in \\(\\Omega(n)\\).\n- It requires an eventual uniform bound. Large values on an infinite subsequence are insufficient. A function equal to \\(n^2\\) on even inputs and \\(1\\) on odd inputs is not \\(\\Omega(n)\\).\n- It depends on the computational model. Treating arbitrary-precision arithmetic as one operation can produce different bounds from counting individual bit operations.\n- It requires a specified limit regime. For several input parameters, a claim such as \\(T(n,m)=\\Omega(nm)\\) must state which parameter values are included and whether the constants are uniform across them."
    },
    {
      "heading": "Historical conventions",
      "text": "The symbol \\(\\Omega\\) has not had a single universal asymptotic meaning. In the Hardy–Littlewood convention used in parts of analytic number theory, \\(f=\\Omega(g)\\) indicates, roughly, that \\(f\\) is not asymptotically negligible relative to \\(g\\), rather than asserting an eventual positive lower bound.\n\nFor positive \\(g\\), this convention is commonly formulated through\n\n\\[\\limsup_{x\\to\\infty} \\left|\\frac{f(x)}{g(x)}\\right|>0.\\]\n\nIt permits substantial values along a subsequence and does not require the computer-science inequality to hold at every sufficiently large argument. The eventual-lower-bound convention was advocated by Donald Knuth and is standard in algorithm analysis. When moving between mathematical fields, the definition in use must therefore be checked rather than inferred from the symbol alone."
    }
  ],
  "links": [
    "mathematical-function",
    "computer-science",
    "computational-complexity",
    "big-o-notation",
    "big-theta-notation",
    "algorithm",
    "time-complexity",
    "space-complexity",
    "expected-value",
    "randomized-algorithm",
    "array-data-structure",
    "sorting-algorithm",
    "merge-sort",
    "polynomial",
    "bit"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}