Let $U$ be a convex symmetric polygon. Put a copy of $U$ at each vertex of the unit square. Let $t$ be the smallest positive real number such that $\mathcal{U} = \cup_{\mathbf{a}\in \{0,1\}^2} tU + \mathbf{a}$ covers the unit square. See figure below.
Now if I let $\mathcal{U}' = \cup_{\mathbf{a}\in \{0,1\}^2} \frac{t}{2}U + \mathbf{a}$ (as shown in the rightmost picture) is it true that $\mathcal{U}'$ covers $\leq \frac{1}{2}$ of the area of the unit square?
Convexity is crucial here since there are counter-examples for non-convex polygons. I would still like to try to solve this problem, so I will accept answers which contain relevant theorems or resources (papers, textbooks, lecture notes).


Consider the following counterexample. Let $U$ be a long strip extending to infinity in both directions (you can think of these as long skewed rectangles if you like). In the figure below, the red, green, blue, and purple polygons represent the relevant portion of the strip scaled by $\frac{t}{2}$ and placed at $(0,0), (1,0), (0,1)$, and $(1,1)$ respectively.
The darkened portions are where the strips intersect with the unit square. The light yellow parts are the portions of the unit square not covered by any polygon. By rearranging the colored regions we see that $\mathcal{U} = \cup_{a\in \{0,1\}^2} a + \frac{t}{2}U$ covers $\frac{2}{3}$ of the area. Thus the area covered by $\mathcal{U}$ is greater than $\frac{1}{2}$.
The natural extension to this problem is to see if there is any constant $k < 1$ such that the area covered by $\mathcal{U}$ is less than $k$.