Conts fncs, open sets, boundry

  • Thread starter Thread starter redyelloworange
  • Start date Start date
  • Tags Tags
    Sets
redyelloworange
Messages
19
Reaction score
0

Homework Statement


Let U and V be open sets in Rn and let f be a one-to-one mapping from U onto V (so that there is an inverse mapping f-1). Suppose that f and f-1 are both continuous. Show that for any set S whose closure is contained in U we have f(bd(S)) = bd(f(S)).

Homework Equations



Open sets: every point in the set is an interior point. int(S) = S. Or S contains none of its boundry points.

bd(S) = {x in Rn | B(r,x)∩S≠ø and B(r,x)∩Sc≠ø for every r>0}

The Attempt at a Solution



ie, show that the function takes a boundry to a boundry.

Let S be a set in U. The let f(S) = T. Note that f-1(T) = S.

Also, since T = {x in Rn s.t. f(x) V} and f conts, and V open, then T is open.
The same conclusion holds for S.

Thus T and S are both open. They also have the same number of elements.

I don't know where to go from here.
 
Physics news on Phys.org
Now state the definition of continuity in terms of balls. f(x)=y is continuous at x if for every B(y,d) there is a radius e such that f(B(x,e)) is contained in B(y,d).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top