Hilbert Space: Closest point property

Click For Summary

Homework Help Overview

The discussion revolves around the closest point property in the context of Hilbert spaces, specifically focusing on a theorem that states if A is a convex, closed subset of a Hilbert space H, then for any point x in H, there exists a point y in A such that the distance from x to y is minimized. The original poster attempts to demonstrate that it suffices to prove this theorem for the specific case where x equals zero, utilizing an isometry transformation.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants discuss the necessity of showing the theorem for x = 0 and the implications of A being convex and closed. There is an exploration of whether A needs to be a subspace and how translations affect the properties of A. Questions arise about the application of the least length property and how to approach the problem geometrically.

Discussion Status

The conversation is ongoing, with participants providing hints and suggestions for visualizing the problem through drawings. Some guidance has been offered regarding the transformation of sets and the selection of points with minimal norms, but no consensus has been reached on the approach to take.

Contextual Notes

Participants note that A is not necessarily a subspace but rather a convex and closed subset, which raises questions about the assumptions being made in the theorem's application. The need for additional clarification on the properties of A in relation to translations is also highlighted.

P3X-018
Messages
144
Reaction score
0

Homework Statement



The theorem about the closest point property says:
If A is a convex, closed subspace of a hilbert space H, then

\forall x \in H\,\, \exists y \in A:\,\,\,\, \| x-y\| = \inf_{a\in A}\|x-a\|

I have to show that it is enough to show this theorem for x = 0 only, by using the isometry T_{x_0}(x) = x_0 + x.

The Attempt at a Solution



So I would have to show that \exists y \in A such that \|y\| = \inf_{a\in A}\|a\|, that is if A contains an element with least length, than for any point x in H there is a point in A that is closest to x, than any other in A.
Then what?
Any hint is appreciated.
 
Physics news on Phys.org
If A is a subspace, the claim \exists y so that \|y\| = \textrm{inf}_{a\in A} \|a\|, is trivial, because such y is the origo. So I suppose the A was not supposed to be assumed to be a subspace. A being convex and closed should be enough. Then... A remains convex and closed in translations.
 
Yeah that's right. A isn't assumed to be a subspace, just a subset.
And you are saying that "A remains convex and closed in translations", how can this be used to show what I want. Because x -a need not lie in A, so I can't use the property with least length. Or how would I be able to use it?
 
I needed to stop and think myself... but let's see, I think I got this.

One hint that I must give you, is that draw pictures! These are kind of tasks where there is too many different things that you can start doing, and it's difficult to guess what you are supposed to start doing without first drawing some kind of picture.

A set

<br /> -x + A = \{-x+a\;|\; a\in A\}<br />

seems to can handy. Choose y&#039;\in -x+A so that it has the smallest norm in this set. Then the desired y should be almost found.
 

Similar threads

  • · Replies 43 ·
2
Replies
43
Views
5K
Replies
20
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
Replies
0
Views
620
  • · Replies 14 ·
Replies
14
Views
3K