Is there some onto function $f:$ $\mathbb{C}$ $\rightarrow$ $\mathbb{C}$ such that for each triangle $T$ (with its interior), $f(T)$ is a square (with interior, too) ? I would have the same question for triangles and squares without interior, respectively.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
5
1
|
|||||||||
|
|
9
|
With interior: yes. Fix a sequence of squares $Q_1\subset Q_2\subset\dots$ whose union is the entire plane. Then arrange a map $g:\mathbb R\to\mathbb R^2$ such that, for every nontrivial segment $[a,b]\subset\mathbb R$, its image is one of the squares $Q_i$. To do that, construct countably many disjoint Cantor sets so that every nontrivial interval contains at least one of them. Then send every Cantor set $K$ bijectively onto $Q_n$ where $n$ is the minimum number such that $K\cap [-n,n]\ne\emptyset$. Send the complements of these Cantor sets to a fixed point inside $Q_1$. Then define $f(x,y)=g(y)$. (This is a detailed version of gowers' answer.) UPDATE Without interior: no. Take any triangle $T$ and consider its image $Q$ with vertices $ABCD$. There is a side $I$ of $T$ whose image has infinitely many points on (at least) two sides of $Q$. If these are opposite sides, say $AB$ and $CD$, the image of any triangle containing $I$ must stay within the strip bounded by the lines $AB$ and $CD$. And if these are two adjacent sides of $Q$, say $AB$ and $AD$, the image of any triangle containing $I$ stays within the quarter of the plane bounded by the rays $AB$ and $AD$. In both cases, the images of the triangles containing $I$ do not cover the plane, hence the map is not onto. |
|||
|
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
6
|
I think this works but haven't checked. I'm pretty sure that for any open set it's easy to find a map that takes any open subset of that set to all of $\mathbb{C}$, or to all of a square, or to whatever single set you feel like. So now for each n choose a map that takes every open subset of the annulus {$z: n < |z| \leq n+1$} to the square that consists of all points with real and imaginary parts less than or equal to n. Now, given any triangle, there will be a maximum n such that it belongs to the nth annulus, and it will intersect that annulus in an open set and therefore map to a square. |
|||||||||
|

