description/proof of that for Hilbert space, nonempty closed convex subset, and point on Hilbert space, there is unique point on subset whose distance to point is minimum
Topics
About: vectors space
About: topological space
The table of contents of this article
Starting Context
- The reader knows a definition of Hilbert space.
- The reader knows a definition of closed set.
- The reader admits the parallelogram law on any vectors space normed induced by any inner product.
- The reader admits the proposition that the closure of any subset is the union of the subset and the accumulation points set of the subset.
- The reader admits the proposition that any metric is continuous with respect to the topology induced by the metric.
- The reader admits the proposition that for any continuous map from any product topological space into any topological space, the induced map with any set of some components of the domain fixed is continuous.
- The reader admits the proposition that for any continuous map and any net with directed index set that converges to any point on the domain, the image of the net converges to the image of the point and if the codomain is Hausdorff, the convergence of the image of the net is the image of the point.
Target Context
- The reader will have a description and a proof of the proposition that for any Hilbert space, any nonempty closed convex subset, and any point on the Hilbert space, there is the unique point on the subset whose distance to the point is the minimum.
Orientation
There is a list of definitions discussed so far in this site.
There is a list of propositions discussed so far in this site.
Main Body
1: Structured Description
Here is the rules of Structured Description.
Entities:
//
Statements:
//
2: Note
The space's being Hilbert is crucial.
For example, when the space is the metric topological subspace of the Euclidean metric space,
Also the closed subset's being convex is crucial for Proof: at least, obviously, the uniqueness does not generally hold if the closed subset is not convex.
3: Proof
Whole Strategy: Step 1: see that infimum of the distances,
Step 1:
As
Step 2:
Let us take any sequence of points on
Step 3:
Let us see that the sequence of points is a Cauchy sequence.
By the parallelogram law on any vectors space normed induced by any inner product,
For any
So,
So, the sequence of points is a Cauchy sequence.
Step 4:
As
By the proposition that the closure of any subset is the union of the subset and the accumulation points set of the subset,
So,
Step 5:
The distance map,
As
So, there is at least 1
Step 6:
Let us see that there is no other point on
Let us suppose there was another
By the parallelogram law on any vectors space normed induced by any inner product,