TITLE: Show that finitely many disjoint discs can be inscribed in a unit square with total area approaching 1
QUESTION [9 upvotes]: (a) Given $\epsilon > 0$, show that the unit disc contains finitely many dyadic squares whose total area exceeds $\pi - \epsilon$, and which intersect each other only along their boundaries.
(b) Show that the assertion is false for $\epsilon < \pi / 2$ if we demand that the dyadic squares be disjoint.
(c) Formulate (a) in dimension $m = 3$ and $m \geq 4$.
(d) Do the analysis with squares and discs interchanged. That is, given $\epsilon > 0$ prove that finitely many disjoint discs can be drawn inside the unit square so that the total area of the discs exceeds
$1 - \epsilon$.

I have done parts (a) to (b), and at least sketched out the proof for (c), but part (d) is totally eluding me. For a start, I'm not even sure it's true, but since it's given as a problem in a printed book (Real Mathematical Anlsyis, by Pugh), I am inclined to think it is valid.
Does anyone have any suggestions on how to approach this? Or even better, a proof sketch? I've tried a number of different ways, involving suprema, self-similarity, and what have you, but none seems to lead anywhere constructive.

REPLY [3 votes]: Let $a\le 1$ be supremum of all finite disc packing areas in the unit square. Consider the square minus an inscribed disc. Because its boundary is a zero-measure set (or whatever argument also worked for the first part of the problem), it can be exhausted arbitrarily well by finitely many dyadic squares, that is for $\epsilon>0$ we find a finite set of squares such that the squares  fill a proportion $1-\epsilon$ of this shape. For each small square find a finite disc filling that fills a proportion of  $a-\epsilon$ of their respective area. Then the total area filled by all discs is $$\tag1\frac\pi4+\left(1-\frac\pi 4\right)(1-\epsilon)(a-\epsilon). $$
As $\epsilon\to 0$, the expression in $(1)$ goes $\to a+\frac\pi4(1-a)$ which must be $\le a$. Hence $a=1$.

More generally, consider a convex shape $S$ of positive area $A$ inside the unit square. Let $a\le 1$ be the supremum of all subsets of the unit square that can be obtained as disjoint union of finitely many scaled and translated copies of $S$. Then $a=1$. To see this, partition the square into $n\times n$ smaller squares (see picture). 
There are three types of such small squares: $e$ exterior squares (white in the picture), $i$ interior squares (light red in the image) and $b$ boudary squares (blue/purple). Of course $e+b+i=n^2$ and $\frac1{n^2}i\le A\le \frac1{n^2}(i+b)$.
The boundary of $S$ intersects the vertical lines at most $2(n-1)$ times (along the two paths from its top to its bottom) and the same holds for the vertical lines. Every boundary square has at least two such intersection points on its edges and each intersection point belongs to at most four small squares. 
We conclude that $b\le 8(n-1)$ and hence $ \left|A-\frac{i+b}{n^2}\right|\le \frac b{n^2}<\frac 8n$.
If we pick a fiite paking that covers almost $a$ of the unit square (say, it covers $\ge a-\epsilon$), we can put a scaled-down copy of this packing into each of the $e$ "white" squares and, together with the original shape $S$, obtain a finite packing of the unit square that covers at least
$$ e\cdot\frac{a-\epsilon}{n^2}+A=\left(1-\frac{i+b}{n^2}\right)(a-\epsilon)+A\ge \left(1-A-\frac 8n\right)(a-\epsilon)+A.$$
As $n\to\infty$ and $\epsilon\to 0$ the right hand side converges to $a+(1-a)A$. As this limit must be $\le a$, we conclude $a=1$.