Re: SMOOTH URYSOHN'S LEMMA



On Tue, 31 Jul 2007 22:01:17 -0400, quasi <quasi@xxxxxxxx> wrote:

On Tue, 31 Jul 2007 21:02:16 -0400, quasi <quasi@xxxxxxxx> wrote:

On Tue, 31 Jul 2007 20:02:22 EDT, craigt <ctcowan1972@xxxxxxxxx>
wrote:

On Mon, 30 Jul 2007 21:08:05 -0700, bigli
<nimbigli@xxxxxxxxx> wrote:

Let K and F be disjoint closed subsets of the
Euclidean space R^n,
then is there a smooth (C^infinite) function f: R^n
---> [0,1] such that
f(K) = {1} and f(F) ={0} ?

Yes, in fact, here's an explicit function ...

Define f:R^n->[0,1] by

f(p) = d(p,F) / (d(p,K) + d(p,F))

This ain't smooth.

Agreed.

But the fix is easy (I think).

Just square the distances.

In other words,

define f:R^n->[0,1] by

f(p) = d(p,F)^2 / (d(p,K)^2 + d(p,F)^2)

where d(p,F) and d(p,K) denote the Euclidean distances from p to the
sets F and K, respectively.

Doesn't this work?

To answer my own question, no it doesn't always work.

I think f will always be differentiable, although I'm not positive
about even that.

However f is not necessarily infinitely differentiable.

For a counterexample in R^2, let F={(-1,0)} and K={(1,0)}.

Then the function f, as defined above, can be expressed as a piecewise
function as follows ...

f(x,y) =

(x+1)^2 + y^2, if x<1

y^2, if -1<=x<=1

(x-1)^2 + y^2, if x>1

Whoops -- I don't know what I was thinking.

That formula is nowhere close to correct -- sorry.

There's no need for piecewise -- that was an hallucination on my part.

The correct f is simply

f(x,y) = ((x+1)^2 + y^2) / ((x+1)^2 + (x-1)^2 + 2*y^2)

which is clearly infinitely differentiable.

So maybe the functions f, based on squared distances, will always
work?

No, I doubt it.

It was the fact that F and K were singletons that made it so easy. If,
for example, we let F be a V shape, then f will probably fail to be
infinitely differentiable (for any nonempty closed set K disjoint from
F).

quasi
.



Relevant Pages

  • Re: Luminance to candlepower and inverse square law
    ... As long as the diameter of the beam increases linearly with distance ... This condition is generally satisfied for lamp sources for distances ... the inverse-square law at large enough distances too (in the ... > square of the separation between the lamp and the reflector. ...
    (sci.optics)
  • Re: Rational Trig
    ... >> simply by replacing distances by their squares, ... > there is no reason to take a square root at all. ... > instead of angles. ... alot of stuff like trangulation without any square roots look up tables etc ...
    (comp.programming)
  • Re: mulling metrics
    ... If we arrange them as a square, than two distances must be square roots ... more dimensional objects is determined by the embedding dimension. ...
    (sci.physics)
  • Re: Mapping a square grid to a rectangular grid
    ... >>> of the square. ... >>a solution with low variance in the distance between neighbors. ... I could take the sum of the square of the distances. ...
    (sci.math)
  • basic graph drawing
    ... I need to dram some cluster of points in a 2D euclidean space. ... pairwise combination i have the distances. ... Which tool do you recommend me to draw this set of points, ...
    (sci.math)