|X| denotes the cardinality of the set X, which is the same thing as the size of X ("cardinality" is the technical term, "size" is the informal synonym of "cardinality"). From set theory, we have a very important fact which you will need many times in all math courses, so remember it:
|X| = |Y| \Leftrightarrow X \approx Y
where X \approx Y means, by definition, that there exists a bijection from X to Y. It should be clear that, given a topological space (X,T) and a set Y:
"there exists a topology S for Y such that (X,T) is homeomorphic to (Y,S)"
iff
"|X| = |Y|"
The forward direction is obvious. For the reverse direction, we assume |X| = |Y|, so we know there's a bijection f from X to Y. We can use this f together with the topology T to induce a topology S such that f witnesses that (X,T) and (Y,S) are homoemorphic. This induced topology S = {f(U) : U is in T}.
So to prove what you're asked to prove, it suffices to show that |\mathcal{D}| = |\mathbb{S}^1|.
\mathbb{R}^4 = \mathbb{R}^2 \times \mathbb{R}^2, so \mathbb{R}^4 is the set of all pairs of points in the plane. And a pair of points in the plane determines a line in the plane. Each pair of points determines a unique line in the plane, but a line in the plane does not determine a unique pair of points in the plane (that is, if you pick two points in the plane, there is only one line that passes through both, but if you pick a line in the plane, you can pick many pairs of points through which that line passes).
Now why is \mathbb{R} \approx \mathbb{R}^4? You can in fact prove that if X is infinite and n is finite, then X^n \approx X. There might be a stronger result that one can prove, that allows n to be infinite in certain cases, but the above is enough for this problem. In particular, R is infinite and 4 is finite. Now if you're taking a course in topology, a fact like this should be something you can freely assume without proof. If not, I can sketch a proof:
We'll prove by induction that |Rn| = |R|. We need a key fact, which you should already know, and if not, be very sure to remember:
|A| < |B| iff there is an injection from A to B iff there's a surjection from B to A.
There's an obvious injection from R to R2. To get an injection going the other way, first let's agree that if x is a real number with two decimal expansions (meaning that it can end in all 0's or all 9's), we choose the one that ends in all 0's. Under this restriction, each real number has a unique decimal expansion. Now if (x,y) is an element in R2, then we can create a new real number by whose decimal expansion is made by taking alternate digits from x and y. For example, if we have:
x = 0.88888888..., y = 0.7373737373...
then the new number we make is:
0.8783878387838783...
It's not hard to prove that this is a well-defined injection, making sure we keep the restriction of only looking at the expansion that ends in all 0's when we have a number that gives us an option to look at an expansion ending with all 9's or all 0's. So we have an injection from R to [/b]R[/b]2 and an injection the other way. From the fact I mentioned, we get |R| < |R2| and |R2| < |R|. So |R| = |R2|. Next, assume that |Rk| = |R|. Then:
|\mathbb{R}^{k+1}| = |\mathbb{R}^k \times \mathbb{R}| = |\mathbb{R} \times \mathbb{R}| = |\mathbb{R}|