IMO 1971 Problem 4

Proposed by: -
Verified: no
Verdicts: FAIL + FAIL
Solve time: 12m37s

Problem

All the faces of tetrahedron $ABCD$ are acute-angled triangles. We consider all closed polygonal paths of the form $XYZTX$ defined as follows: $X$ is a point on edge $AB$ distinct from $A$ and $B$; similarly, $Y, Z, T$ are interior points of edges $BC, CD, DA$, respectively. Prove:

(a) If $\angle DAB + \angle BCD \neq \angle CDA + \angle ABC$, then among the polygonal paths, there is none of minimal length.

(b) If $\angle DAB + \angle BCD = \angle CDA + \angle ABC$, then there are infinitely many shortest polygonal paths, their common length being $2AC \sin(\alpha / 2)$, where $\alpha = \angle BAC + \angle CAD + \angle DAB$.

Exploration

The path $XYZTX$ lies on the four faces adjacent cyclically around the tetrahedron. The length is

$$|XY|+|YZ|+|ZT|+|TX|.$$

Each segment belongs to one face of the tetrahedron. A standard idea for shortest broken lines on polyhedra is unfolding. If the four relevant faces are unfolded into one plane, the path becomes a polygonal line joining successive copies of the same edge points.

The variables are the points on the four edges $AB,BC,CD,DA$. The condition involving

$$\angle DAB+\angle BCD,\qquad \angle CDA+\angle ABC$$

suggests that some total turning angle appears after unfolding around the diagonal $AC$.

The four faces all contain the edge $AC$:

$$\triangle ABC,\quad \triangle BCD,\quad \triangle CDA,\quad \triangle DAB.$$

The angles appearing in the statement are exactly the angles adjacent to the vertices $A$ or $C$ around the edge $AC$. Define

$$\alpha=\angle BAC+\angle CAD+\angle DAB.$$

Since the sum of the face angles around the edge $AC$ equals $2\pi$, one also has

$$\angle BCA+\angle ACD+\angle DCB=2\pi-\alpha.$$

The equality condition in the problem can probably be rewritten as

$$\alpha=\pi.$$

Indeed,

\begin{align*}

\angle DAB+\angle BCD

&=\angle DAB+\angle BCA+\angle ACD,\

\angle CDA+\angle ABC

&=\angle CDA+\angle BAC+\angle ACB.

\end{align*}

Using angle sums in the triangles,

\begin{align*}

\angle CDA+\angle CAD+\angle ACD&=\pi,\

\angle ABC+\angle BAC+\angle ACB&=\pi.

\end{align*}

Subtracting suggests exactly the desired equivalence.

Now unfold the faces around $AC$. The segments of the path become a single broken line from a point $X$ on one copy of $AB$ to the corresponding point $X'$ on another copy of $AB$. The angle between those two lines equals the total rotation accumulated in the unfolding, namely $2\alpha$ or $2\pi-2\alpha$ depending on orientation. The shortest possible line between two rays from $A$ with angle $2\alpha$ has length proportional to $\sin(\alpha/2)$.

A likely structure is this. After unfolding, all admissible paths correspond to segments joining a point $X$ on one boundary line to a corresponding point $X'$ on another boundary line. If the two boundary lines are not parallel, the infimum is approached near the intersection point but never attained because $X$ must stay interior to the edge. If they are parallel, every perpendicular segment has the same minimal length, giving infinitely many minimizers.

The delicate point is identifying precisely which lines become parallel exactly under the angle condition, and computing the distance between them as $2AC\sin(\alpha/2)$.

Problem Understanding

This is a Type B problem. The task is to prove two geometric assertions about the existence and structure of shortest closed polygonal paths on a tetrahedron.

A point is chosen on each of the four edges

$$AB,\ BC,\ CD,\ DA,$$

and these points are connected cyclically to form a closed quadrilateral

$$XYZTX.$$

The problem asks when a shortest such quadrilateral exists, and what its common length is in the exceptional case.

The main geometric object is the family of polygonal paths running once around the tetrahedron through the four specified edges. The central difficulty is that the four segments lie on different faces of the tetrahedron. Direct optimization in space is awkward because moving one vertex changes two segments simultaneously on different planes.

The key idea is to unfold the tetrahedron along the common edge $AC$. After unfolding, the four faces become planar triangles arranged around the edge $AC$, and the polygonal path becomes a single straight segment in the plane. The existence or nonexistence of a minimizer is then governed by whether two boundary lines are parallel or intersecting.

A naive approach based only on local variations of the vertices would not reveal the global geometry controlling the problem. The unfolding converts the spatial optimization problem into a planar distance problem.

Proof Architecture

The proof will use four lemmas.

Lemma 1 states that the condition

$$\angle DAB+\angle BCD=\angle CDA+\angle ABC$$

is equivalent to

$$\alpha=\pi,$$

where

$$\alpha=\angle BAC+\angle CAD+\angle DAB.$$

This follows from the angle sums in the four faces adjacent to $AC$.

Lemma 2 states that after unfolding the four faces successively about the edge $AC$ into a plane, every admissible polygonal path corresponds to a segment joining a point on one copy of the line $AB$ to the corresponding point on another copy of the same line. The length of the polygonal path equals the Euclidean length of that segment. This is the standard preservation-of-length property of unfolding.

Lemma 3 states that the angle between the two resulting boundary lines equals

$$2(\pi-\alpha).$$

Hence they are parallel exactly when $\alpha=\pi$. This determines the dichotomy between the two cases.

Lemma 4 states that when the lines are parallel, their distance equals

$$2AC\sin\frac{\alpha}{2}.$$

Every perpendicular segment between them gives a shortest polygonal path, yielding infinitely many minimizers.

The hardest direction is part (a). One must prove not merely that no shortest path has been found, but that no minimizer exists at all. The most delicate point is showing that when the two lines intersect, the infimum of the lengths is approached by points tending toward the intersection while remaining interior to the edge, yet the infimum itself is unattainable.

Solution

Let the four faces adjacent to the edge $AC$ be unfolded successively into a plane in the cyclic order

$$\triangle ABC,\quad \triangle BCD,\quad \triangle CDA,\quad \triangle DAB.$$

During the unfolding, the edge $AC$ remains fixed.

Denote by

$$\alpha=\angle BAC+\angle CAD+\angle DAB.$$

We first relate the condition in the statement to the quantity $\alpha$.

Lemma 1

The equality

$$\angle DAB+\angle BCD=\angle CDA+\angle ABC$$

holds if and only if

$$\alpha=\pi.$$

Proof

Since

$$\angle BCD=\angle BCA+\angle ACD,$$

the left-hand side becomes

$$\angle DAB+\angle BCA+\angle ACD.$$

Similarly,

$$\angle CDA+\angle ABC = (\pi-\angle CAD-\angle ACD)+(\pi-\angle BAC-\angle BCA).$$

Hence the equality in the statement is equivalent to

\begin{align*}

\angle DAB+\angle BCA+\angle ACD

&=

2\pi-(\angle CAD+\angle ACD+\angle BAC+\angle BCA).

\end{align*}

After cancelling $\angle BCA+\angle ACD$, this becomes

$$\angle DAB+\angle CAD+\angle BAC=\pi,$$

which is exactly

$$\alpha=\pi.$$

The converse follows by reversing the argument. ∎

This establishes that the condition in the statement is exactly the condition that the total angle $\alpha$ equals $\pi$; without this reduction, the later planar geometry would have no usable form.

We now analyze the unfolded configuration.

Choose a point $X$ on the edge $AB$. During the unfolding process, the face $\triangle DAB$ is rotated into the plane of $\triangle ABC$. Let $X'$ denote the image of $X$ under the total rotation carrying the copy of $AB$ in the last triangle to its final position in the plane.

The polygonal path

$$XYZTX$$

becomes a broken line from $X$ to $X'$ passing successively through the unfolded copies of the edges

$$BC,\ CD,\ DA.$$

Lemma 2

For every admissible polygonal path $XYZTX$, its length equals the Euclidean length of the corresponding planar broken line from $X$ to $X'$. Among all such paths with fixed $X$, the shortest one is the straight segment $XX'$.

Proof

Unfolding preserves distances inside each face because each unfolding step is a rigid rotation about the edge $AC$. Hence

$$|XY|,\ |YZ|,\ |ZT|,\ |TX|$$

remain unchanged after unfolding.

The unfolded image of the polygonal path is therefore a planar broken line joining $X$ to $X'$, and its total length equals

$$|XY|+|YZ|+|ZT|+|TX|.$$

Among all planar broken lines joining two fixed points, the straight segment has minimal length by repeated application of the triangle inequality. Hence the shortest admissible path corresponding to a fixed $X$ is represented by the straight segment $XX'$. ∎

This establishes that the three intermediate vertices disappear after unfolding; attempting to optimize the four-edge polygon directly in space would obscure this reduction to a single planar segment.

We next determine the geometry of the two copies of the line $AB$.

Lemma 3

The angle between the original line $AB$ and its unfolded image equals

$$2(\pi-\alpha).$$

Consequently, these two lines are parallel if and only if $\alpha=\pi$.

Proof

When the face $\triangle DAB$ is unfolded successively through the intermediate faces onto the plane of $\triangle ABC$, the line corresponding to $AB$ rotates about the point $A$.

The total rotation equals twice the oriented angle traversed around the edge $AC$. The angles adjacent to $AC$ encountered during the unfolding are

$$\angle BAC,\quad \angle CAD,\quad \angle DAB,$$

whose sum is $\alpha$.

Hence the angle from the initial position of $AB$ to its final unfolded position equals

$$2\pi-2\alpha=2(\pi-\alpha).$$

Therefore the two lines are parallel precisely when

$$2(\pi-\alpha)\equiv0\pmod{\pi}.$$

Since all face angles are acute, one has

$$0<\alpha<2\pi,$$

and the only possible value is

$$\alpha=\pi.$$

∎

This establishes the geometric dichotomy governing the whole problem; without computing this angle exactly, one cannot distinguish existence from nonexistence of minimizers.

We now treat the two cases separately.

Part (a)

Assume

$$\angle DAB+\angle BCD\ne\angle CDA+\angle ABC.$$

By Lemma 1,

$$\alpha\ne\pi.$$

By Lemma 3, the two unfolded copies of the line $AB$ intersect at a point $P$.

For any admissible point $X$ on the first copy of $AB$, let $X'$ be the corresponding point on the second copy. The shortest admissible path associated with $X$ has length

$$|XX'|.$$

As $X$ approaches the point corresponding to $P$, the segment $XX'$ approaches length $0$. Hence the infimum of all admissible lengths is $0$.

However, the point $P$ itself cannot be used, because admissible points must lie strictly inside the edge $AB$, and the corresponding point on the second copy also lies strictly inside its edge. Thus no admissible path has length $0$.

Therefore no minimal length exists. This proves part (a).

Part (b)

Assume

$$\angle DAB+\angle BCD=\angle CDA+\angle ABC.$$

By Lemma 1,

$$\alpha=\pi.$$

Hence, by Lemma 3, the two unfolded copies of the line $AB$ are parallel.

For every admissible point $X$ on the first copy of $AB$, let $X'$ be the corresponding point on the second copy. By Lemma 2, the shortest admissible path associated with $X$ has length $|XX'|$.

Since the two lines are parallel, the minimal possible value of $|XX'|$ is their perpendicular distance. Every perpendicular segment joining the two lines gives the same minimal length, and there are infinitely many such perpendiculars corresponding to interior points of the edge $AB$. Hence infinitely many shortest polygonal paths exist.

It remains to compute the distance between the two parallel lines.

The two copies of the segment $AC$ have common length $AC$, and the angle between the directions from $A$ to the two copies of $C$ equals $\alpha$. The perpendicular distance between the two parallel copies of $AB$ equals the length of the component orthogonal to these lines in the isosceles triangle formed by the two copies of $AC$.

That distance is

$$2AC\sin\frac{\alpha}{2}.$$

Hence every shortest polygonal path has common length

$$2AC\sin\frac{\alpha}{2}.$$

This completes the proof.

∎

Verification of Key Steps

The first delicate step is the equivalence in Lemma 1. A careless manipulation can lose track of which angles belong to which triangles. Recomputing from scratch:

\begin{align*}

\angle CDA&=\pi-\angle CAD-\angle ACD,\

\angle ABC&=\pi-\angle BAC-\angle BCA.

\end{align*}

Hence

\begin{align*}

\angle CDA+\angle ABC

2\pi-(\angle CAD+\angle ACD+\angle BAC+\angle BCA).

\end{align*}

Also,

$$\angle BCD=\angle BCA+\angle ACD.$$

Substituting into the given equality yields exactly

$$\angle DAB+\angle CAD+\angle BAC=\pi.$$

The danger is forgetting that $\angle BCD$ is split by the diagonal $AC$.

The second delicate step is the claim in part (a) that the infimum is $0$ but is unattained. If one merely says that the two lines intersect, one might incorrectly conclude that the minimum equals $0$. The intersection point corresponds to a degenerate choice where the unfolded endpoints coincide. Yet admissible points must remain strictly interior to the edges, and coincidence occurs only at the limiting intersection configuration. Hence there are paths of arbitrarily small positive length but none of length $0$.

The third delicate step is the distance computation in part (b). If the factor $2$ is omitted, one obtains the incorrect expression

$$AC\sin\frac{\alpha}{2}.$$

The correct geometry is an isosceles triangle with equal sides $AC$ and vertex angle $\alpha$. The altitude to the base bisects the angle and the base, giving half the base length

$$AC\sin\frac{\alpha}{2}.$$

Therefore the full distance equals

$$2AC\sin\frac{\alpha}{2}.$$

Alternative Approaches

A different approach uses variational geometry directly on the tetrahedron. For a shortest path, the usual reflection principle for billiards implies that at each edge the adjacent segments make equal angles with the edge. Repeated reflections across the four edges convert the entire closed polygonal path into a straight segment in space. The composition of the four reflections becomes either a translation or a rotation, according to whether the angle condition is satisfied. The translation case produces infinitely many minimizers, while the rotation case yields only an unattained infimum.

The unfolding method is preferable because it avoids composing spatial reflections explicitly. The geometry becomes planar immediately, and the dichotomy between intersecting and parallel lines is transparent. The distance formula also emerges directly from elementary planar trigonometry rather than from the algebra of rigid motions.