{
  "id": "norm-mathematics",
  "title": "Norm (mathematics)",
  "lang": "en",
  "source_lang": "en",
  "summary": "A norm measures the size of a vector, generalizing length through definiteness, absolute homogeneity, and the triangle inequality.",
  "category": "mathematics",
  "subcategory": "analysis",
  "type": "concept",
  "aliases": [
    "Vector norm"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/norm-mathematics/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/norm-mathematics/",
      "json": "https://aiwiki.page/zh/norm-mathematics.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A norm is a nonnegative real-valued function that measures the size of an element of a vector space. It generalizes ordinary length to objects such as coordinate vectors, matrices, and functions. Unlike an arbitrary measure of size, a norm must respect scalar multiplication and addition and vanish only at the zero vector. Norms connect linear algebra with mathematical analysis by providing a way to define distance and convergence. (ocw.mit.edu)"
    },
    {
      "heading": "Definition and basic properties",
      "text": "Let \\(V\\) be a vector space over the real numbers or complex numbers. A norm is a map\n\n\\[\\|\\cdot\\|:V\\longrightarrow[0,\\infty)\\]\n\nsatisfying three conditions for all \\(x,y\\in V\\) and scalars \\(\\alpha\\):\n\n- Definiteness: \\(\\|x\\|=0\\) if and only if \\(x=0\\).\n- Absolute homogeneity: \\(\\|\\alpha x\\|=|\\alpha|\\|x\\|\\).\n- Triangle inequality: \\(\\|x+y\\|\\leq\\|x\\|+\\|y\\|\\).\n\nThe pair \\((V,\\|\\cdot\\|)\\) is a normed vector space. The axioms imply symmetry, \\(\\|-x\\|=\\|x\\|\\), and the reverse triangle inequality:\n\n\\[\\bigl|\\|x\\|-\\|y\\|\\bigr|\\leq\\|x-y\\|.\\]\n\nConsequently, the norm function is continuous in its induced distance. (tbetcke.github.io)\n\nA seminorm retains nonnegativity, absolute homogeneity, and the triangle inequality but may vanish on nonzero vectors. For example, \\(p(x_1,x_2)=|x_1|\\) ignores the second coordinate and is therefore not a norm on \\(\\mathbb R^2\\). (ocw.mit.edu)"
    },
    {
      "heading": "Coordinate norms and geometry",
      "text": "For \\(x=(x_1,\\ldots,x_n)\\in\\mathbb R^n\\) or \\(\\mathbb C^n\\), the \\(p\\)-norms are\n\n\\[\\|x\\|_p=\\left(\\sum_{i=1}^{n}|x_i|^p\\right)^{1/p}, \\qquad 1\\leq p<\\infty,\\]\n\nwith\n\n\\[\\|x\\|_\\infty=\\max_i|x_i|.\\]\n\nImportant cases are the \\(1\\)-norm, which sums absolute coordinate values; the \\(2\\)-norm, or Euclidean norm; and the infinity norm, which measures the largest coordinate magnitude. The Euclidean norm gives ordinary Euclidean distance through \\(\\|x-y\\|_2\\). (tbetcke.github.io)\n\nDifferent norms give different geometries. In \\(\\mathbb R^2\\), their unit balls are respectively a diamond, a disk, and an axis-aligned square for \\(p=1,2,\\infty\\). Every norm is a convex function, and its unit ball is a convex set. These properties follow from homogeneity and the triangle inequality. (stanford.edu)\n\nFor \\(0<p<1\\), the same coordinate formula does not define a norm in dimensions at least two because the triangle inequality fails. The expression commonly called the “\\(0\\)-norm,” counting nonzero coordinates, is also not a norm: multiplying a nonzero vector by a nonzero scalar leaves that count unchanged, violating homogeneity. (stanford.edu)"
    },
    {
      "heading": "Distance, convergence, and equivalence",
      "text": "Every norm defines a metric space by\n\n\\[d(x,y)=\\|x-y\\|.\\]\n\nThis distance is translation invariant. Convergence means \\(\\|x_k-x\\|\\to0\\). A normed space is a Banach space when every Cauchy sequence converges to an element of the space. Completeness is an additional property, not part of the norm axioms. (web.math.princeton.edu)\n\nTwo norms are equivalent if positive constants \\(c,C\\) exist such that\n\n\\[c\\|x\\|_a\\leq\\|x\\|_b\\leq C\\|x\\|_a\\]\n\nfor every \\(x\\). Equivalent norms define the same topology and the same convergent sequences. All norms on a fixed finite-dimensional real or complex vector space are equivalent. This does not mean that their numerical values or unit balls coincide. In infinite-dimensional spaces, norms need not be equivalent. (math.mit.edu)"
    },
    {
      "heading": "Inner-product norms",
      "text": "An inner product induces a norm by\n\n\\[\\|x\\|=\\sqrt{\\langle x,x\\rangle}.\\]\n\nThe Cauchy–Schwarz inequality establishes the triangle inequality for this construction. Not every norm arises from an inner product. A real or complex norm does so exactly when it satisfies the parallelogram law:\n\n\\[\\|x+y\\|^2+\\|x-y\\|^2 =2\\|x\\|^2+2\\|y\\|^2.\\]\n\nWhen this condition holds, polarization recovers the unique compatible inner product. A complete inner-product space is a Hilbert space. Thus Hilbert spaces are Banach spaces with additional geometric structure. (ocw.mit.edu)"
    },
    {
      "heading": "Function spaces",
      "text": "Norms also measure functions. On a measure space \\((X,\\mu)\\), the L^p norm is\n\n\\[\\|f\\|_p=\\left(\\int_X|f|^p\\,d\\mu\\right)^{1/p}, \\qquad 1\\leq p<\\infty.\\]\n\nThe space contains functions for which this quantity is finite. Its elements are equivalence classes identifying functions equal almost everywhere; this identification ensures definiteness. For \\(p=\\infty\\), the norm is the essential supremum, which disregards exceptional sets of measure zero. (math.ucdavis.edu)\n\nFor a continuous function on a compact interval,\n\n\\[\\|f\\|_\\infty=\\max_x|f(x)|.\\]\n\nConvergence in this supremum norm is uniform convergence. By contrast, integral norms measure aggregate discrepancies and can permit substantial differences on sets of small measure. These distinctions are central in functional analysis. (math.ucdavis.edu)"
    },
    {
      "heading": "Matrix norms, dual norms, and applications",
      "text": "A matrix \\(A\\), regarded as a linear map, has an induced operator norm\n\n\\[\\|A\\|=\\sup_{x\\ne0}\\frac{\\|Ax\\|}{\\|x\\|}.\\]\n\nFor Euclidean vector norms, this is the largest singular value. The Frobenius norm instead measures the matrix as an array:\n\n\\[\\|A\\|_F=\\left(\\sum_{i,j}|a_{ij}|^2\\right)^{1/2}.\\]\n\nIt generally differs from the induced Euclidean norm. Compatible induced norms satisfy \\(\\|AB\\|\\leq\\|A\\|\\|B\\|\\). (tbetcke.github.io)\n\nOn \\(\\mathbb R^n\\), the dual norm is\n\n\\[\\|y\\|_*=\\sup_{\\|x\\|\\leq1}|y^{\\mathsf T}x|.\\]\n\nThe dual of the \\(p\\)-norm is the \\(q\\)-norm when \\(1/p+1/q=1\\), including the pairing of \\(1\\) and infinity. In mathematical optimization, norms measure residual errors and constrain feasible solutions. Norm penalties also provide regularization: \\(1\\)-norm penalties can promote sparse solutions, while squared \\(2\\)-norm penalties control overall coefficient magnitude. (stanford.edu)"
    }
  ],
  "links": [
    "vector-space",
    "linear-algebra",
    "mathematical-analysis",
    "real-number",
    "complex-number",
    "triangle-inequality",
    "normed-vector-space",
    "euclidean-distance",
    "convex-function",
    "convex-set",
    "metric-space",
    "banach-space",
    "cauchy-sequence",
    "topology",
    "inner-product",
    "cauchy-schwarz-inequality",
    "parallelogram-law",
    "hilbert-space",
    "lp-space",
    "equivalence-class",
    "almost-everywhere",
    "continuous-function",
    "uniform-convergence",
    "functional-analysis",
    "matrix",
    "linear-map",
    "mathematical-optimization",
    "regularization"
  ],
  "sources": [
    {
      "title": "ocw.mit.edu/courses/18-065-matrix-methods-in-data-analysis-signal-processing-an…",
      "url": "https://ocw.mit.edu/courses/18-065-matrix-methods-in-data-analysis-signal-processing-and-machine-learning-spring-2018/resources/lecture-8-norms-of-vectors-and-matrices/"
    },
    {
      "title": "tbetcke.github.io/math0058_lecture_notes/matrix_vector_norms.html",
      "url": "https://tbetcke.github.io/math0058_lecture_notes/matrix_vector_norms.html"
    },
    {
      "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": "stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf",
      "url": "https://www.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf"
    },
    {
      "title": "web.math.princeton.edu/~js129/PDFs/teaching/MAT520_fall_2024/MAT520_Lecture_Not…",
      "url": "https://web.math.princeton.edu/~js129/PDFs/teaching/MAT520_fall_2024/MAT520_Lecture_Notes.pdf"
    },
    {
      "title": "math.mit.edu/~stevenj/18.335/norm-equivalence.pdf",
      "url": "https://math.mit.edu/~stevenj/18.335/norm-equivalence.pdf"
    },
    {
      "title": "math.ucdavis.edu/~babson/MAT200/Shktext.pdf",
      "url": "https://www.math.ucdavis.edu/~babson/MAT200/Shktext.pdf"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}