{
  "id": "linear-functional",
  "title": "Linear Functional",
  "lang": "en",
  "source_lang": "en",
  "summary": "A linear functional is a scalar-valued linear map on a vector space, fundamental to duality, geometry, and functional analysis.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Linear form",
    "Covector",
    "Dual vector"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/linear-functional/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/linear-functional/",
      "json": "https://aiwiki.page/zh/linear-functional.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A linear functional is a linear map from a vector space to its underlying field of scalars. Unlike a general linear operator, which may return a vector in another space, a linear functional returns a single scalar. The terminology applies both to finite-dimensional spaces and to spaces whose elements are functions. Linear functionals form the dual space and provide a framework for studying coordinates, scalar measurements, and continuity. (pi.math.cornell.edu)"
    },
    {
      "heading": "Definition and elementary properties",
      "text": "Let \\(V\\) be a vector space over a field \\(\\mathbb F\\). A map \\(f:V\\to\\mathbb F\\) is a linear functional if\n\n\\[f(\\alpha x+\\beta y)=\\alpha f(x)+\\beta f(y)\\]\n\nfor every \\(x,y\\in V\\) and \\(\\alpha,\\beta\\in\\mathbb F\\). This combines additivity and homogeneity. It implies \\(f(0)=0\\), \\(f(-x)=-f(x)\\), and preservation of every finite linear combination. In analysis, the scalars are usually real numbers or complex numbers. (pi.math.cornell.edu)\n\nLinearity depends on the specified scalar field: a real-linear map on a complex vector space need not be complex-linear. In particular, complex conjugation is real-linear but not complex-linear. Also, an expression \\(x\\mapsto f(x)+b\\), where \\(b\\ne0\\), is an affine map, not a linear functional, because it does not send zero to zero. (math.mit.edu)"
    },
    {
      "heading": "Coordinates and the algebraic dual",
      "text": "On \\(\\mathbb F^n\\), every linear functional has the form\n\n\\[f(x_1,\\ldots,x_n)=a_1x_1+\\cdots+a_nx_n.\\]\n\nRelative to the standard coordinates, it is represented by the \\(1\\times n\\) matrix \\((a_1,\\ldots,a_n)\\), acting on a column vector. Its coefficients determine the functional uniquely. (cs.cornell.edu)\n\nMore generally, if \\(e_1,\\ldots,e_n\\) is a basis of \\(V\\), its dual basis consists of functionals \\(e^1,\\ldots,e^n\\) satisfying\n\n\\[e^i(e_j)=\\delta_{ij}.\\]\n\nThus, if \\(x=\\sum_jx_je_j\\), then \\(e^i(x)=x_i\\), and\n\n\\[f=\\sum_{i=1}^{n}f(e_i)e^i.\\]\n\nThe algebraic dual \\(V^*=\\operatorname{Hom}_{\\mathbb F}(V,\\mathbb F)\\), with pointwise addition and scalar multiplication, consequently has the same dimension as \\(V\\) when \\(V\\) is finite-dimensional. (math.mit.edu)\n\nA choice of basis yields an isomorphism between \\(V\\) and \\(V^*\\), but the vector-space structure alone does not specify one canonically. By contrast, the evaluation map into the double dual,\n\n\\[J:V\\longrightarrow V^{**},\\qquad J(x)(f)=f(x),\\]\n\nrequires no basis and is an isomorphism in finite dimensions. (math.mit.edu)"
    },
    {
      "heading": "Kernels and hyperplanes",
      "text": "The kernel of a functional is\n\n\\[\\ker f=\\{x\\in V:f(x)=0\\},\\]\n\na linear subspace. If \\(f\\ne0\\), then \\(f\\) is surjective onto \\(\\mathbb F\\), and its kernel has codimension one. In finite dimensions, this follows from the rank–nullity theorem. Such a kernel is a linear hyperplane. (homepages.ucl.ac.uk)\n\nChoose \\(v\\) with \\(f(v)=1\\). Every vector admits the decomposition\n\n\\[x=\\bigl(x-f(x)v\\bigr)+f(x)v,\\]\n\nwhere the first summand lies in \\(\\ker f\\). For any scalar \\(c\\), the level set \\(f(x)=c\\) is the translated hyperplane \\(cv+\\ker f\\). Over the real numbers, these level sets describe parallel scalar-valued constraints. (homepages.ucl.ac.uk)"
    },
    {
      "heading": "Function-space examples",
      "text": "A fixed-point evaluation is linear: on the space of continuous functions on \\([a,b]\\),\n\n\\[E_t(g)=g(t),\\qquad t\\in[a,b].\\]\n\nLikewise, the integration functional\n\n\\[I(g)=\\int_a^b g(s)\\,ds\\]\n\nis linear. Weighted integration, \\(g\\mapsto\\int_a^b g(s)w(s)\\,ds\\), gives further examples whenever the indicated integrals exist. (pi.math.cornell.edu)\n\nOn the space of polynomials, extracting a specified coefficient is a linear functional. Evaluating a derivative at a fixed point, \\(p\\mapsto p'(t)\\), is another example. These illustrate why “functional” does not imply nonlinearity or require an infinite-dimensional domain: the defining feature is scalar-valued linearity. (cs.cornell.edu)"
    },
    {
      "heading": "Continuity and boundedness",
      "text": "In functional analysis, the domain often carries a norm. A functional on a normed vector space \\(X\\) is continuous exactly when there exists \\(C\\ge0\\) such that\n\n\\[|f(x)|\\le C\\|x\\|\\qquad(x\\in X).\\]\n\nContinuity at zero alone suffices. Here, “bounded” means bounded on the unit ball, not bounded on the entire space; any nonzero functional grows without bound along suitable scalar multiples. (ocw.mit.edu)\n\nThe functional’s operator norm is\n\n\\[\\|f\\|=\\sup_{\\|x\\|\\le1}|f(x)|.\\]\n\nThe continuous dual consists only of continuous linear functionals, unlike the algebraic dual, which imposes no continuity requirement. The continuous dual is a Banach space under this norm even if \\(X\\) is incomplete. Every functional on a finite-dimensional real or complex normed space is continuous; infinite-dimensional spaces can have discontinuous functionals. (ocw.mit.edu)"
    },
    {
      "heading": "Representation, extension, and weak convergence",
      "text": "For a Hilbert space \\(H\\), the Riesz representation theorem states that every continuous linear functional has a unique representation\n\n\\[f(x)=\\langle x,y\\rangle,\\qquad y\\in H,\\]\n\nusing the convention that the inner product is linear in its first argument. Moreover, \\(\\|f\\|=\\|y\\|\\). In complex spaces, the correspondence \\(y\\mapsto f\\) is conjugate-linear. (ocw.mit.edu)\n\nThe Hahn–Banach theorem ensures that a bounded linear functional on a subspace of a real or complex normed space extends to the whole space without increasing its norm. Consequently, continuous functionals separate distinct points and recover the norm through\n\n\\[\\|x\\|=\\sup_{\\|f\\|\\le1}|f(x)|.\\]\n\nExtensions need not be unique. (ocw.mit.edu)\n\nLinear functionals also define the weak topology: the weakest topology making every member of the continuous dual continuous. A sequence \\(x_n\\) converges weakly to \\(x\\) precisely when \\(f(x_n)\\to f(x)\\) for every continuous linear functional \\(f\\). This tests convergence through scalar evaluations rather than directly through norm distances. (math.ucdavis.edu)"
    }
  ],
  "links": [
    "linear-map",
    "vector-space",
    "field-mathematics",
    "dual-space",
    "linear-combination",
    "real-number",
    "complex-number",
    "affine-map",
    "matrix",
    "basis-linear-algebra",
    "dimension-vector-space",
    "isomorphism",
    "kernel-linear-map",
    "linear-subspace",
    "rank-nullity-theorem",
    "hyperplane",
    "integral",
    "polynomial",
    "derivative",
    "functional-analysis",
    "normed-vector-space",
    "banach-space",
    "hilbert-space",
    "inner-product",
    "hahn-banach-theorem"
  ],
  "sources": [
    {
      "title": "pi.math.cornell.edu/m/sites/default/files/imported/Courses/615/615n06.pdf",
      "url": "https://pi.math.cornell.edu/m/sites/default/files/imported/Courses/615/615n06.pdf"
    },
    {
      "title": "math.mit.edu/classes/18.952/spring2011/chapter1.pdf",
      "url": "https://math.mit.edu/classes/18.952/spring2011/chapter1.pdf"
    },
    {
      "title": "cs.cornell.edu/courses/cs6210/2025fa/lec/2025-08-25.html",
      "url": "https://www.cs.cornell.edu/courses/cs6210/2025fa/lec/2025-08-25.html"
    },
    {
      "title": "homepages.ucl.ac.uk/~ucahad0/3103_handout_3.pdf",
      "url": "https://www.homepages.ucl.ac.uk/~ucahad0/3103_handout_3.pdf"
    },
    {
      "title": "ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/3d4c…",
      "url": "https://ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/3d4cc88026d44a01f936cd6a0aa995cb_MIT18_102s20_lec_FA.pdf"
    },
    {
      "title": "ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/8fb8…",
      "url": "https://ocw.mit.edu/courses/18-102-introduction-to-functional-analysis-spring-2021/8fb8d5c170f1613151aca71de21027bc_MIT18_102s21_full_lec.pdf"
    },
    {
      "title": "math.ucdavis.edu/~babson/MAT200/200-20/Analysis.pdf",
      "url": "https://www.math.ucdavis.edu/~babson/MAT200/200-20/Analysis.pdf"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}