6
$\begingroup$

Consider a closed simple polygon in the plane. It is intuitively obvious that the polygon is convex if and only if all the interior angles measure less than or equal to $\pi$ radians. I have never seen a rigorous proof of this fact and I was wondering if anyone could provide such a proof.

A related question: Given a concave polygon (or more generally a higher dimensional polytope), how can we prove that there will always be two vertices of the polygon which cannot be joined by a line lying entirely inside the polygon?

  • 2
    The answer to your related question is by definition. Concave = not convex, and a polytope is convex iff every line segment between any two points in the polytope lies entirely inside the polyhedron. Invert that condition (i.e., "there exists a line segment that exits and reenters the polytope"), and you necessarily (and sufficiently) have a concave polytope.2012-12-15
  • 2
    @JohnMoeller That definition only specifies two _points_. I'm asking whether we can strengthen the condition to two _vertices_.2012-12-15
  • 0
    Would you please provide us with your definition of a polygon?2012-12-15
  • 1
    I think the first question might follow from choosing one of the vertices that have the interior angle greater than $\pi$, triangulating the polygon and checking the value against what is known. That is, for a convex polygon, we know the interior angle has to equal $(n-2)\cdot\frac{\pi}{2}$ from triangulation. I haven't put a ton of thought into it, but this is what I'm thinking.2012-12-15
  • 0
    @OlivierBégassat A closed plane figure with straight line boundaries. Feel free to use any reasonable definition of polygon you wish though. A convex polygon is a polygon for which the interior is a convex set.2012-12-15
  • 0
    @EuYu Changing the condition to two vertices actually *weakens* it, not strengthens it. Vertices are points too; therefore it is satisfied.2012-12-15
  • 0
    @JoeZeng Indeed it does, thank you.2012-12-15
  • 0
    @Clayton I'm not too sure what you mean. The interior angles of any simple polygon sums to $(n-2)\frac{\pi}{2}$ regardless of concave or convex.2012-12-15
  • 0
    @EuYu: I'm not entirely sure of it. I haven't had a chance to think about it. When I have a mental block (studying for prelims), I'll come back here to think about your problem.2012-12-15
  • 1
    I think your question may be equivalent to the following: Given any two rays that meet at a point, the line segment that connects any two points on the ray will always be on the side of the two rays with a smaller angle. Then a polygon is simply the intersection of a bunch of these two-ray configurations.2012-12-15
  • 0
    Note that any proof will have to inherently use the simplicity of the polygon, because the theorem isn't true for self-intersecting polygons - imagine taking a heart-shaped (cardiod) loop that wraps twice around the origin and polygonalizing it.2012-12-29

2 Answers 2

2

Suppose a concave polyhedron exists so that all vertex connections produce lines entirely inside the polyhedron.

Since the object is concave, there are points on two faces with a connecting segment outside of the polyhedron. Now consider the hull of the points for just these two faces. The connecting segment must be inside this hull. Contradiction.

0

I will formulate my answer for general convex sets in vector spaces. Then convex closed polytopes (polygons) on the place accrue as a special case.

If $C$ is a convex set on a vector space $X=\mathbb{R}^n$ (One can easily generalise these facts to infinite-dimensional spaces) and $x\in\partial C$ (the boundary of $C$) then, there is a line $\mathcal{H}=\{x| Hx = K\}$ that supports $C$ at $x$, i.e. for all $x\in C$ it is $Hx\leq K$ and for $x\notin C$ it is $Hx>K$ (The relation $\leq$ is meant as the element-wise order of vectors of $X$.) This supporting hyperplane in the case of $\mathbb{R}^2$ is a line, i.e. its angle is $\pi$.

The angle you mentioned is actually the polar angle of the tangent cone $T_C(x)$ wheneven $x$ is a vertex of $C$. If $x$ is not a vertex $T_C(x)$ is a supporting hyper-plane; in general it is a cone that lies completely in a supporting plane of $C$ at $x$, so its angle is less than or equal to $\pi$. This proves your claim in a more general setting.

Back to your question again... you may also use purely Euclidean arguments (In Euclidean geometry by the way, $A_1A_2\ldots A_n$ is convex if it contains all line segments that can be drawn from its vertices. Assume that $\widehat{A_kA_{k+1} A_{k+2}}>180^\circ$. Then $A_kA_{k+2}$ has all its points outside the polygon.

  • 0
    I must say that I am much more interested in the Euclidean proof. The last paragraph you provided is one direction of my first claim. Do you have any idea how to prove the converse? If all interior angles are less than $\pi$ then the polygon is convex.2012-12-15