Other ways to do this problem? (R^n topology)

  • Thread starter Thread starter quasar987
  • Start date Start date
  • Tags Tags
    Topology
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 2K views
Messages
4,796
Reaction score
32

Homework Statement


The problem is to show that if A is closed in R^n, and x is outside of A, then there is a point y in A such that d(y,x) = d(x,A).

My method of solution involves letting b = d(x,A) = inf{d(x,z) : z in A} and considering a closed ball of radius b + delta centered on x, and then constructing a sequence of points {z_n} in [itex]\overline{B}_{b+\delta}(x)\cap A[/itex] such that d(z_n,x)-->b (possible because b is an infimum). Because the ball is compact, there is a convergeant subsequence to z_n, but because each z_n is in A and A is closed, that limit is in A. I then show that the distance btw this limit and x is b by using the triangle inequality.

However, I had solved this problem at work in my head 3 weeks ago and I remember this was not the answer I had found. My solution from 3 weeks ago was swifter somehow, I remember. Anyone got any idea what it could have been?
 
Physics news on Phys.org
If A was compact, and if we knew that continuous functions [itex]f:X\to\mathbb{R}[/itex], where X is a compact metric space, always reach their minimum and maximum somewhere, then we could just note that mapping [itex]y\mapsto d(y,x)[/itex] must reach it's minimum somewhere in A.

Since A is not compact, it should be first somehow showed that it is sufficient to study some compact part of it, like set [itex]A\cap \overline{B}(0,R)[/itex] with some large R. And if the theorem about continuous mappings out of compact metric spaces is not known, then its proof is probably equally complicated as your proof. So I'm not sure it this is really any easier. Although going through some more general theorems is usually more elegant, in some sense.
 
A is not empty. Pick an arbitray point a in A. Now let r be the distance from x to a. The thing you're looking for must be smaller than r, now, is there anyway to consider only points that are at most distance r from x and lying in A, I wonder...
 
It comes down to the fact that a continuous function on a compact subset of R^n has a maximium, quasar - there is no point or need to invoke sequences. It is quite simple - you can assume A is a compact set.
 
Well, ok, but this is just the method of jostpuurand he was correct that the max-min thm on compact is now known at this time. :-p

But thanks for your input matt & jostpuurand. I guess my original solution was just erroneous or was and incomplete version of that of post #1.