MathLabs

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 b+f≤ab+f\le a is not wasted: when compared with the strict face inequality e+f>ae+f>a, it immediately tells us that ee must be longer than bb.

b+f≤a  ⟹  e+f>a  ⟹  e>bb+f\le a \;\Longrightarrow\; e+f>a \;\Longrightarrow\; e>b
Detailed analysis

If b+f>ab+f>a, then the edges a,b,fa,b,f already have their largest edge smaller than the sum of the other two, and the other two triangle inequalities follow from aa being the maximum: a+b>fa+b>f and a+f>ba+f>b. So suppose instead that b+f≤ab+f\le a. In the face whose edges are a,e,fa,e,f, the triangle inequality gives e+f>ae+f>a. Combining b+f≤a<e+fb+f\le a<e+f and cancelling ff yields e>be>b.