{
  "aliases": null,
  "backlinks": [
    {
      "field": "specializes",
      "target": "2QV28WYQTQ"
    },
    {
      "field": "specializes",
      "target": "ASWF03X5AM"
    },
    {
      "field": "uses",
      "target": "76JD0ZG3B1"
    },
    {
      "field": "uses",
      "target": "9S18DSRFND"
    },
    {
      "field": "uses",
      "target": "AMP0CRE14P"
    },
    {
      "field": "uses",
      "target": "C0AKF92CWH"
    },
    {
      "field": "uses",
      "target": "CCPS738AH8"
    },
    {
      "field": "uses",
      "target": "HKRN90DCWK"
    },
    {
      "field": "uses",
      "target": "N9QDDYY7GK"
    },
    {
      "field": "uses",
      "target": "NNHM06RCNV"
    },
    {
      "field": "uses",
      "target": "SRW9PD2RSA"
    },
    {
      "field": "uses",
      "target": "Z76K1W7BSH"
    },
    {
      "field": "about",
      "target": "9S18DSRFND"
    },
    {
      "field": "about",
      "target": "AMP0CRE14P"
    },
    {
      "field": "about",
      "target": "CCPS738AH8"
    },
    {
      "field": "about",
      "target": "HKRN90DCWK"
    },
    {
      "field": "about",
      "target": "SRW9PD2RSA"
    },
    {
      "field": "defines",
      "target": "XEEZ2MQ6XM"
    }
  ],
  "body": "\n## Summary\n\nA best approximation of a point $x$ from a set $A$ in a normed space is a point of $A$ nearest to $x$.\nIt is the optimal answer to an approximation problem.\nExistence, uniqueness and characterization of best approximations are the first questions of approximation theory.\n\n## Explanations\n\n### L1 human\n\nThink of a point in the plane and a line: the best approximation is the foot of the perpendicular, the point of the line nearest to the given point.\nIn approximation theory the \"points\" are functions and the set is, for example, all polynomials of degree at most $n$.\nFor $f(x) = x^2$ on $[0, 1]$ and the uniform distance, the best straight line is $x - 1/8$, which is never further than $1/8$ from the parabola.\nA best approximation may fail to exist, for instance when the set has a hole where the nearest point should be.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "41A50",
      "41A65"
    ],
    "name": "Best approximation",
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Approximation_theory"
      }
    ],
    "tag": "7N4988HN3P"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/7N4988HN3P/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/7N4988HN3P.md",
  "msc": [
    "41A50",
    "41A65"
  ],
  "name": "Best approximation",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/7N4/7N4988HN3P.md",
  "status": null,
  "tag": "7N4988HN3P",
  "uri": "m2://7N4988HN3P",
  "url": "https://tamnd.github.io/math2/wiki/best-approximation/",
  "writing": {
    "tag": "7N4988HN3P",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      },
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}