Problem:
Prove that the sum of the lengths of the edges of a polyhedron is at least 3 times the greatest distance between two points of the polyhedron.
Problem:
Prove that the sum of the lengths of the edges of a polyhedron is at least 3 times the greatest distance between two points of the polyhedron.
Solution:
If and are at the greatest distance, then they must be vertices. For suppose is not a vertex. Then there is a segment entirely contained in the polyhedron with as an interior point. But now at least one of angles , must be at least . Suppose it is . Then is longer than . Contradiction.
Take a plane through perpendicular to the line . Then the polyhedron must lie entirely on one side of the plane, for if lay on the opposite side to , then would be longer than . Now move the plane slightly towards keeping it perpendicular to . The intersection of the plane and the polyhedron must be a small polygon. The polygon must have at least vertices, each of which must lie on an edge of the polyhedron starting at . Select three of these edges.
As the plane is moved further towards , the selected vertices may sometimes split into multiple vertices or they may sometimes coalesce. In the former case, just choose one of the daughter vertices. In the latter case, let be the point of intersection of the plane and . Let be the point of intersection at the last coalescence (or if there was none). Then we have three paths along edges, with no edges in common, each of which projects onto and hence has length at least . Now select one or more new vertices to replace any lost through coalescence and repeat.