home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!think.com!mintaka.lcs.mit.edu!zurich.ai.mit.edu!ara
- From: ara@zurich.ai.mit.edu (Allan Adler)
- Subject: Re: proof wanted 2
- In-Reply-To: dy@shire.math.columbia.edu's message of Mon, 11 Jan 1993 22:23:38 GMT
- Message-ID: <ARA.93Jan11231158@camelot.ai.mit.edu>
- Sender: news@mintaka.lcs.mit.edu
- Organization: M.I.T. Artificial Intelligence Lab.
- References: <1iqcp7INNoph@skeena.ucs.ubc.ca> <1993Jan11.030012.26208@Princeton.EDU>
- <1993Jan11.210012.18587@Princeton.EDU>
- <1993Jan11.222338.17682@sol.ctr.columbia.edu>
- Date: Tue, 12 Jan 1993 04:11:58 GMT
- Lines: 29
-
- In article <1993Jan11.222338.17682@sol.ctr.columbia.edu> dy@shire.math.columbia.edu (Deane Yang) writes:
-
- The point here is that, except for 0, X is a discrete and therefore
- locally compact space. The conjecture needs a further assumption,
- something that makes the space everywhere nondiscrete.
-
- If I'm not mistaken, a reasonable assumption is that X is a length space.
- This means that the distance between two points in X is equal to the infimum
- of the lengths of continuous curves joining the two points. In particular,
- this means that given two points that are a finite distance apart,
- then you can always move one point a little bit and make the distance a little
- smaller.
-
-
- What about the plane with the French Railroad metric? The origin is
- Paris and every ray from the origin is a railroad line. The distance
- between two points is the minimal distance you have to travel to
- get from one to the other by train. In other words, if two
- points x,y are collinear with 0 then the distance from x to y is the usual
- distance in the plane. Otherwise, the distance is the sum of their
- usual distances to the origin. The set of all points of the form
- (1,y) with y>0 is closed in this metric but has no closest point
- to the origin.
-
- Anyway, my question is answered in the negative. So what IS the necessary
- and sufficient condition?
-
- Allan Adler
- ara@altdorf.ai.mit.edu
-