Problem 4
Prove that in every tetrahedron there is a vertex such that the three edges meeting there have lengths which are the sides of a triangle.
Step 2 of 4: Assume one candidate fails; the opposite face gives e > b
In plain words
The failed inequality is not wasted: when compared with the strict face inequality , it immediately tells us that must be longer than .
Detailed analysis
If , then the edges already have their largest edge smaller than the sum of the other two, and the other two triangle inequalities follow from being the maximum: and . So suppose instead that . In the face whose edges are , the triangle inequality gives . Combining and cancelling yields .