IMO 1968 Problem 4

Proposed by: -
Verified: no
Verdicts: PASS + UNKNOWN
Solve time: 18m05s

Problem

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.

Exploration

Assume a tetrahedron with vertices $A,B,C,D$ satisfies the opposite of the claim, meaning that at every vertex the three incident edges fail to form the sides of a triangle. At a vertex this means one edge is at least the sum of the other two.

Fix a vertex $A$. If $AB$ is not the edge violating the triangle condition at $A$, then either $AC \ge AB+AD$ or $AD \ge AB+AC$. Both are impossible if $AB$ is the longest edge in the entire tetrahedron, since each would force an edge incident to $A$ to exceed a globally maximal edge. This suggests that once a globally longest edge is chosen, it must be the “violating” edge at both endpoints.

Testing small configurations confirms consistency of this restriction: whenever one edge is forced to dominate at both endpoints, additive comparisons across adjacent faces accumulate too much total length, suggesting a contradiction obtained by summing inequalities over the two endpoints of the longest edge.

The structure that survives these checks is to select a maximal edge and force two inequalities at its endpoints, then compare them with triangle inequalities in the adjacent faces.

Problem Understanding

A tetrahedron has six positive edge lengths $AB, AC, AD, BC, BD, CD$. The goal is to show that there exists a vertex, say $A$, such that its three incident edges satisfy the triangle inequalities

$AB < AC + AD,\quad AC < AB + AD,\quad AD < AB + AC.$

Equivalently, we must show that it is impossible for every vertex to have one incident edge that is at least the sum of the other two. If such a “bad” vertex existed everywhere, then at each vertex one edge would dominate in this additive sense, and these dominant edges must interact consistently across shared edges of the tetrahedron.

Key Observations

A vertex $A$ is bad exactly when one of its incident edges is at least the sum of the other two. If $AB$ is the largest edge among $AB, AC, AD$, then the inequalities $AC \ge AB+AD$ and $AD \ge AB+AC$ are impossible, since both right hand sides exceed $AB$. Hence, if a vertex is bad and $AB$ is its largest incident edge, then necessarily $AB \ge AC+AD$.

Let $AB$ be the longest edge among all six edges of the tetrahedron. Any inequality involving an edge larger than $AB$ is impossible, so any vertex where a violation occurs must use its incident edge that is also globally maximal in a compatible way. This forces $AB$ to be the violating edge at both endpoints $A$ and $B$.

Thus the assumption that every vertex is bad forces

$AB \ge AC+AD,\quad AB \ge BC+BD.$

These inequalities can be combined with triangle inequalities in the faces adjacent to $AB$.

Solution

Assume, for contradiction, that no vertex has its three incident edges forming the sides of a triangle. Then every vertex has an incident edge that is at least the sum of the other two incident edges.

Let $AB$ be a longest edge among all six edges of the tetrahedron.

At vertex $A$, the edge $AB$ cannot fail to be the offending edge. If instead $AC \ge AB+AD$ held, then $AC > AB$, contradicting maximality of $AB$. The same contradiction occurs if $AD \ge AB+AC$. Hence

$AB \ge AC + AD.$

At vertex $B$, the same argument applies. Neither $BC \ge AB+BD$ nor $BD \ge AB+BC$ is possible because both would imply an edge exceeding $AB$. Therefore

$AB \ge BC + BD.$

Adding these two inequalities yields

$2AB \ge AC + AD + BC + BD.$

Rewriting the right-hand side gives

$AC + AD + BC + BD = (AC + BC) + (AD + BD).$

In triangle $ABC$, the triangle inequality gives

$AC + BC > AB,$

and in triangle $ABD$, it gives

$AD + BD > AB.$

Adding these strict inequalities produces

$AC + BC + AD + BD > 2AB.$

This contradicts $2AB \ge AC + AD + BC + BD$.

The contradiction shows that the assumption that every vertex is bad is impossible. Therefore at least one vertex has no incident edge exceeding the sum of the other two, meaning its three incident edges satisfy all triangle inequalities.

This completes the proof. ∎

Verification of Key Steps

The selection of $AB$ as a globally maximal edge is valid because the set of edges is finite and all lengths are positive real numbers. The elimination of alternative violations at vertex $A$ and $B$ is justified because any inequality of the form $AC \ge AB+AD$ would force $AC > AB$, contradicting maximality of $AB$, and similarly for the other alternative.

The use of triangle inequalities in triangles $ABC$ and $ABD$ is valid because each face of a tetrahedron is a nondegenerate triangle, so each pair of edges in a face satisfies strict triangle inequality.

The summation step preserves strictness correctly: adding two strict inequalities yields a strict inequality, which directly contradicts the non-strict bound obtained earlier. All comparisons are consistent and refer only to the same six edge lengths without hidden assumptions.

Alternative Approaches

A different approach assigns to each vertex its largest incident edge and analyzes the induced directed graph on vertices. Under the assumption that every vertex is bad, this produces a directed structure that forces a cycle whose edge inequalities accumulate inconsistently, yielding a contradiction without selecting a global maximal edge.

Another approach works with the sum of all edge lengths and shows that if every vertex violated the triangle condition, the total sum would simultaneously be strictly greater and not greater than itself when counted through vertex-based decompositions, producing an algebraic impossibility.