2025-03-30

1061: For Hilbert Space, Nonempty Closed Convex Subset, and Point on Hilbert Space, There Is Unique Point on Subset Whose Distance to Point Is Minimum

<The previous article in this series | The table of contents of this series |

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



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:
F: {R,C}, with the canonical field structure
V: { the F Hilbert spaces }, with ,:V×VF, :VR, and dist:V×VR
C: { the nonempty closed convex subsets of V}
w: V
//

Statements:
!v0C(dist(w,v0)=inf{dist(w,v)|vC})
//


2: Note


The space's being Hilbert is crucial.

For example, when the space is the metric topological subspace of the Euclidean metric space, R2, that (the subspace) is the union of the open unit disc and the point, (0,2), the open unit disc is a nonempty closed convex subset (the intersection of the closed unit disk on R2 and the subspace), and the infimum of the distances from (0,2) is 1, but there is no point on the closed subset whose distance to the point is 1, in fact, there is no point on the space whose distance to the point is 1.

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, d, exists; Step 2: take any sequence of points on C whose distances converge to d; Step 3: see that the sequence is a Cauchy sequence; Step 4: see that the convergence is on C; Step 5: see that the distance of the convergence to w is d; Step 6: see that there is no other point on C whose distance to w is d.

Step 1:

As {dist(w,v)|vC} is a subset of R lower bounded by 0, {dist(w,v)|vC} has the infimum dR: which is a nature of R.

Step 2:

Let us take any sequence of points on C, v1,v2,..., such that ddist(w,vj)<d+1/2j, which is possible because d=inf{dist(w,v)|vC}: there may be some duplications, which does not matter.

dist(w,v1),dist(w,v2),... converges to d.

Step 3:

Let us see that the sequence of points is a Cauchy sequence.

dist(vm,vn)=vnvm=(vnw)(vmw).

By the parallelogram law on any vectors space normed induced by any inner product, (vnw)(vmw)2=2(vnw2+vmw2)(vnw)+(vmw)2=2(vnw2+vmw2)vn+vm2w2=2(vnw2+vmw2)4(vn+vm)/2w2.

For any 0<ϵ, there is an NN such that for each N<m,n, vmw2,vnw2<d2+ϵ2/4.

(vn+vm)/2C, because C is convex, so, d(vn+vm)/2w.

So, vnvm2=2(vnw2+vmw2)4(vn+vm)/2w2<2(2(d2+ϵ2/4))4d2=ϵ2.

So, the sequence of points is a Cauchy sequence.

Step 4:

As V is complete, there is the convergence of the sequence, v0V.

v0 is an accumulation point of C, because for each open ball around v0, there is a vjC contained in the open ball, because the sequence converges to v0.

By the proposition that the closure of any subset is the union of the subset and the accumulation points set of the subset, v0 is on the closure of C, but the closure of C is C, because C is closed.

So, v0C.

Step 5:

The distance map, dist(w,v):VR, with w fixed is a continuous map, by the proposition that any metric is continuous with respect to the topology induced by the metric and 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.

As dist(w,v1),dist(w,v2),... converges to d, dist(w,v0)=d, by 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.

So, there is at least 1 v0C such that dist(w,v0)=inf{dist(w,v)|vC}.

Step 6:

Let us see that there is no other point on C whose distance to w is d.

Let us suppose there was another v0C such that dist(w,v0)=d.

v0v0=(v0w)(v0w).

By the parallelogram law on any vectors space normed induced by any inner product, (v0w)(v0w)2=2(v0w2+v0w2)(v0w)+(v0w)2=2(v0w2+v0w2)(v0+v0)2w2=2(v0w2+v0w2)4(v0+v0)/2w2, but v0w=dist(w,v0)=d, v0w=dist(w,v0)=d, and as (v0+v0)/2C, d(v0+v0)/2w, so, 2(2d2)4d2=0, which implies that (v0w)(v0w)2=0, which implies that v0=v0.


References


<The previous article in this series | The table of contents of this series |