3
$\begingroup$

I have two solid two-dimensional shapes on a plane, $S_1$ and $S_2$, with boundaries $B_1$ and $B_2$. If the boundaries of the two shapes are allowed to touch, but no points internal to the boundaries are allowed to intersect, is it true that the boundaries of $S_1$ and $S_2$ can touch at only a single point on a plane (allowing for rotation, translation, reflection, etc. of the shapes) if and only if $S_1$ and $S_2$ are strictly convex? How does this generalize to higher dimensions?

Update in response to WimC's comment: Can we say that $S_1$ and/or $S_2$ are strictly convex if and only if their boundaries can be touched together at most at a single point?

Update 2: Perhaps we can rescue the original statement of this problem, requiring $S_1$ and $S_2$ to both be strictly convex, if we require that there should only ever be a single point of intersection for arbitrary dilations of either shape?

Update 3: In response to Rahul's comment, the converse statement of want to show here is that, provided neither $S_1$ or $S_2$ are strictly convex, then there MUST exist some configuration of the shapes that allows for multiple simultaneous contacts along their boundaries. We know that if both shapes are strictly convex then there can only be one point of contact, and we've discussed conditions where one point of contact can exist when only one shape is strictly convex, but it seems more challenging to show that one shape being strictly convex is both necessary and sufficient for forbidding multiple points of simultaneous contact.

For weakly convex functions, i.e. convex hulls etc. with straight lines in their boundaries, can we make a similar statement about the number of edges that can touch?

Please note that this is a (hopefully) more focused version of an earlier question, now removed, which asked for the properties of $B_1$ and $B_2$ that guaranteed some strict upperbound for the number of points $k$ where $B_1$ and $B_2$ can touch.

  • 0
    @Rahul Narain Thanks, I have added a further update in response to your comment.2012-12-30

1 Answers 1

1

No.

If you take $S_1 = \{(x,y) | y \leq 0\}$ and $S_2 = \overline{B}((0,1),1)$, then $S_1 \cap S_2 = \{(0,0)\}$, but $S_1$ is not strictly convex by any definition.

One set may be non-convex, and still have only one touching point. Assuming that touching means $S_1 \cap S_2 \neq \emptyset$ and $S_1^\circ \cap S_2^\circ = \emptyset$, then define $S_1 = B((0,0),2)\setminus B((2,0), 1)$ and $S_2(x,y)=B((x,y),\frac{1}{2})$. If you draw a picture, then it should be clear that if $(x,y)$ are such that $S_1$ and $S_2(x,y)$ are touching, then the intersection contains at most one point. (It is not hard to prove, just messy.)

  • 2
    I think the sets need to be simply connected; otherwise two annuli form a counterexample. Maybe you might as well assume that they are homeomorphic to a closed disc.2013-01-01