Approximations and expansions Definition
Chebyshev set
Builds on Normed vector spaceBest approximation
Definition
Let be a normed vector space and let be nonempty. The set is a Chebyshev set if every has exactly one best approximation from , that is, exactly one with . The map sending to this point is the metric projection onto .
Remarks
Example: in with the Euclidean norm, the closed unit disc is a Chebyshev set. For the nearest point is itself. For it is and no other point of , since the triangle inequality is strict off the ray through .
Non-example: the unit circle in is not a Chebyshev set, because the origin has every point of the circle as a nearest point.
A Chebyshev set is closed, since a point of the closure not in would have distance but no nearest point. Every nonempty closed convex set in a Hilbert space is a Chebyshev set, by the Hilbert projection theorem. In with the Euclidean norm the converse holds: every Chebyshev set is convex. Whether every Chebyshev set in an infinite-dimensional Hilbert space is convex is an open problem.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Best approximation concept
- Normed vector space concept
- Chebyshev set definition
Further reading
About this page
| Tag | N9QDDYY7GK |
|---|---|
| URI | m2://N9QDDYY7GK |
| Kind | definition |
| Writing | W0 stub |
| MSC | 41A65, 41A52, 46B20 |
| Defines | Chebyshev set |
| Uses | Normed vector space, Best approximation |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.