Difference between revisions of "1966 IMO Problems/Problem 3"
m |
|||
(8 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | ==Problem== | ||
+ | |||
Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space. | Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space. | ||
Line 62: | Line 64: | ||
point <math>P</math> in the plane. | point <math>P</math> in the plane. | ||
− | + | We will do the proof in three steps: | |
− | the | + | |
− | in one of six regions as seen in the pictures below. | + | <math>\mathbf{1.}</math> We will show that if <math>P</math> is in one of the exterior |
+ | regions, then there is a point <math>P_1</math> on the boundary of the triangle | ||
+ | (a vertex, or on a side), such that <math>PA + PB + PC > P_1A + P_1B + P_1C</math>. | ||
+ | |||
+ | <math>\mathbf{2.}</math> Then we will show that if <math>P</math> is on the boundary, then | ||
+ | <math>PA + PB + PC > OA + OB + OC</math>. | ||
+ | |||
+ | <math>\mathbf{3.}</math> For the final step, we will show that if <math>P</math> is a point | ||
+ | of minimum for <math>PA + PB + PC</math> inside the triangle, then the extensions | ||
+ | of <math>PA, PB, PC</math> are perpendicular to the opposite sides <math>BC, AC, AB</math>. | ||
+ | This implies that <math>P = O</math>. | ||
+ | |||
+ | <math>\mathbf{Proof\ of\ 1:}</math> If the point <math>P</math> is outside the triangle, | ||
+ | it can be in one of six regions as seen in the pictures below. | ||
[[File:Prob_1966_3_fig1.png|600px]] | [[File:Prob_1966_3_fig1.png|600px]] | ||
Line 72: | Line 87: | ||
<math>P_1 = A</math>, <math>PA + PB + PC > P_1A + P_1B + P_1C</math> (because <math>P_1A = 0</math> | <math>P_1 = A</math>, <math>PA + PB + PC > P_1A + P_1B + P_1C</math> (because <math>P_1A = 0</math> | ||
and <math>P_1B < PB</math> as sides in an obtuse triangles, and similarly | and <math>P_1B < PB</math> as sides in an obtuse triangles, and similarly | ||
− | <math>P_1C < PC | + | <math>P_1C < PC</math>). |
− | |||
− | |||
− | |||
If <math>P</math> is in a region delimited by a segment which is a side of the | If <math>P</math> is in a region delimited by a segment which is a side of the | ||
Line 82: | Line 94: | ||
<math>AB</math>. Then <math>PA + PB + PC > P_1A + P_1B + P_1C</math> (because the triangle | <math>AB</math>. Then <math>PA + PB + PC > P_1A + P_1B + P_1C</math> (because the triangle | ||
<math>\triangle PP_1C</math> is obtuse, and because the triangles | <math>\triangle PP_1C</math> is obtuse, and because the triangles | ||
− | <math>\triangle PP_1A, \triangle PP_1B</math> are right triangles | + | <math>\triangle PP_1A, \triangle PP_1B</math> are right triangles). |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | + | <math>\mathbf{Proof\ of\ 2:}</math> Now assume that <math>P_1 = A</math>. A direct, simple | |
− | that | + | computation shows that <math>P_1A + P_1B + P_1C > OA + OB + OC</math> (indeed, if |
− | + | we take the side of the triangle to be <math>1</math>, then <math>P_1A + P_1B + P_1C = 2</math>, | |
+ | and <math>OA + OB + OC = 3 \cdot \frac{\sqrt{3}}{3} = \sqrt{3}</math>). | ||
− | + | Now assume that <math>P_1</math> is on <math>AB</math>. If <math>P_1</math> is not the midpoint of <math>AB</math>, | |
+ | let <math>P_2</math> be the midpoint. Then <math>P_1A + P_1B + P_1C > P_2A + P_2B + P_2C</math> | ||
+ | (because <math>P_1A + P_1B = P_2A + P_2B = AB</math> and <math>P_1C > P_2C</math>). A direct, | ||
+ | simple computation shows that <math>P_2A + P_2B + P_2C > OA + OB + OC</math> (indeed, | ||
+ | if we take the side of the triangle to be <math>1</math>, | ||
+ | <math>P_2A + P_2B + P_2C = 1 + \frac{\sqrt{3}}{2}</math> and <math>OA + OB + OC = \sqrt{3}</math>). | ||
− | In this case, we make a proof by contradiction. We | + | <math>\mathbf{Proof\ of\ 3:}</math> Assume that <math>P</math> is inside the triangle |
− | <math>P</math> is a point where <math>PA + PB + PC</math> is minimum, then the extensions | + | <math>\triangle ABC</math>. In this case, we make a proof by contradiction. We |
− | of <math>PA, PB, PC</math> are perpendicular to the opposite sides <math>BC, AC, AB</math>. | + | will show that if <math>P</math> is a point where <math>PA + PB + PC</math> is minimum, then |
− | (This statement implies that <math>P = O</math>.) If this | + | the extensions of <math>PA, PB, PC</math> are perpendicular to the opposite sides |
− | at least one of <math>PA \perp BC, PB \perp AC, PC \perp AB</math> | + | <math>BC, AC, AB</math>. (This statement implies that <math>P = O</math>.) If this were not |
− | We can assume that <math>PC</math> is not perpendicular to <math>AB</math>. Then draw | + | true, at least one of <math>PA \perp BC, PB \perp AC, PC \perp AB</math> would be |
+ | false. We can assume that <math>PC</math> is not perpendicular to <math>AB</math>. Then draw | ||
the ellipse with focal points <math>A, B</math> which goes through <math>P</math>. | the ellipse with focal points <math>A, B</math> which goes through <math>P</math>. | ||
Line 115: | Line 127: | ||
This proves the 2-dimensional case. | This proves the 2-dimensional case. | ||
− | + | NOTE: a very picky reader might object that the proof used that | |
a minimum of <math>PA + PB + PC</math> exists, and is achieved at a point <math>P</math> | a minimum of <math>PA + PB + PC</math> exists, and is achieved at a point <math>P</math> | ||
inside the triangle. This can be justified simply by noting that | inside the triangle. This can be justified simply by noting that | ||
Line 124: | Line 136: | ||
boundary of the triangle, so it is inside. | boundary of the triangle, so it is inside. | ||
− | Now we will give the proof in the 3-dimensional case. It is extremely | + | Now we will give the proof in the 3-dimensional case. We will do the |
− | similar to the proof in the 2-dimensional case, we just need to go from | + | proof in three steps. It is extremely similar to the proof in the |
− | 2D to 3D, so I will skip some details. | + | 2-dimensional case, we just need to go from 2D to 3D, so I will skip |
+ | some details. | ||
− | 1. We will show that if <math>P</math> is in one of the exterior regions, then | + | <math>\mathbf{1.}</math> We will show that if <math>P</math> is in one of the exterior regions, |
− | there is a point <math>P_!</math> on the boundary of the tetrahedron (a vertex, | + | then there is a point <math>P_!</math> on the boundary of the tetrahedron (a vertex, |
or on a edge, or on a side, such that | or on a edge, or on a side, such that | ||
<math>PA + PB + PC + PD > P_1A + P_1B + P_1C + P_1D</math>. | <math>PA + PB + PC + PD > P_1A + P_1B + P_1C + P_1D</math>. | ||
− | 2. Then we will show that if <math> | + | <math>\mathbf{2.}</math> Then we will show that if <math>P</math> is on the boundary, then |
− | <math> | + | <math>PA + PB + PC + PD > OA + OB + OC + OD</math>. |
− | 3. | + | <math>\mathbf{3.}</math> For the final step, consider the plane going through |
− | <math>PA + PB + PC + PD</math> inside the tetrahedron, then the extensions of | + | the edge <math>CD</math> perpendicular to the edge <math>AB</math>, the plane going through |
− | <math>PA | + | <math>AB</math> perpendicular to <math>CD</math>, the plane going through <math>CA</math> perpendicular |
− | + | to <math>BD</math>, etc. There are six such planes, and they all contain <math>O</math>, | |
+ | the center of the circumscribed sphere. We will show that if <math>P</math> is | ||
+ | a point of minimum for <math>PA + PB + PC + PD</math> inside the tetrahedron, | ||
+ | then <math>P</math> is in each of the six planes described above. This implies | ||
+ | that <math>P = O</math>. | ||
+ | |||
+ | <math>\mathbf{Proof\ of\ 1:}</math> Let <math>P</math> be in one of the exterior regions. | ||
+ | Assume <math>P</math> is in a prism shaped region delimited by extensions of | ||
+ | three sides meeting in a vertex (there are 4 of them). Assume it | ||
+ | is at vertex <math>A</math>, the sides being the extensions of planes | ||
+ | <math>ABC, ABD, ACD</math>. Then take <math>P_1 = A</math>. We have | ||
+ | <math>PA + PB + PC + PD > P_1A + P_1B + P_1C + P_1D</math> because of obtuse | ||
+ | triangles formed with <math>PP_1</math>. | ||
+ | |||
+ | Now assume <math>P</math> is in one of the wedge shaped regions, formed by an | ||
+ | edge and the extensions of two sides going through them. (there are | ||
+ | six such regions.) Assume this is the line <math>AB</math> and the extensions | ||
+ | of <math>ABC, ABD</math>. Then take <math>P_1</math> to be the foot of the perpendicular | ||
+ | from <math>P</math> to <math>AB</math>. Again, we have the desired inequality because | ||
+ | <math>PP_1</math> formed some right and obtuse triangles. | ||
+ | |||
+ | Now assume <math>P</math> is in the truncated prism region delimited by a side | ||
+ | and the extensions of the faces going through the edges of this side. | ||
+ | (There are four such regions.) Assume this is the side <math>ABC</math>, and | ||
+ | extensions of the sides <math>DAB, DBC, DCA</math>. Then take <math>P_1</math> to be the | ||
+ | foot of the perpendicular from <math>P</math> to the plane <math>ABC</math>. Again, we | ||
+ | have the desired inequality because of right and obtuse triangles | ||
+ | formed by <math>PP_1</math>. | ||
+ | |||
+ | <math>\mathbf{Proof\ of\ 2:}</math> Assume <math>P_1 = A</math>. If we take the edge of | ||
+ | the tetrahedron to be <math>1</math>, a direct computation gives us that | ||
+ | <math>P_1A + P_1B + P_1C + P_1D = 3</math>, and | ||
+ | <math>OA + OB + OC + OD = 4 \cdot \frac{\sqrt{6}}{4} = \sqrt{6}</math>. | ||
+ | |||
+ | Assume <math>P_1</math> is on <math>AB</math>. If <math>P_1</math> is not the midpoint of <math>AB</math>, take | ||
+ | <math>P_2</math> to be the midpoint of <math>AB</math>. Then | ||
+ | <math>P_1A + P_1B + P_1C + P_1D > P_2A + P_2B + P_2C + P_2D</math> because of | ||
+ | right triangles formed by <math>P_2C, P_2D</math>. And, if we take the edge of | ||
+ | the tetrahedron to be <math>1</math>, a direct computation yields that | ||
+ | <math>P_2A + P_2B + P_2C + P_2D = 1 + 2 \cdot \frac{\sqrt{3}}{2} = 1 + \sqrt{3}</math>, | ||
+ | which is bigger than <math>OA + OB + OC + OD = \sqrt{6}</math>. | ||
+ | |||
+ | Assume <math>P_1</math> is on <math>ABC</math>. If <math>P_1</math> is not the circumcenter of | ||
+ | <math>\triangle ABC</math> then take <math>P_2</math> to be the circumcenter. We have | ||
+ | <math>P_1D > P_2D</math> because <math>P_2D \perp ABC</math>. We also have | ||
+ | <math>P_1A + P_1B + P_1C > P_2A + P_2B + P_2C</math> because we proved the | ||
+ | 2-dimensional analogue of the problem. And, if we take the edge | ||
+ | of the tetrahedron to be <math>1</math>, we have | ||
+ | <math>P_2A + P_2B + P_2C + P_2D = \sqrt{3} + \frac{\sqrt{6}}{3}</math>, which | ||
+ | is bigger than <math>OA + OB + OC + OD = \sqrt{6}</math>. | ||
− | + | NOTE: In the above paragraph, we used that the similar result | |
+ | is true in the 2-dimensional case, with an equilateral triangle | ||
+ | instead of a regular tetrahedron. | ||
+ | NOTE: This part of the proof concludes filling in the gap in the | ||
+ | first "Solution", written above. (A reader may complain that the | ||
+ | proof in Solution 2 is very long (compared to the first "Solution"), | ||
+ | but the first "Solution" should have done this too, one way or | ||
+ | another.) | ||
+ | <math>\mathbf{Proof\ of\ 3:}</math> Now consider the six planes going through | ||
+ | one edge, perpendicular to the opposite edge. They intersect at | ||
+ | the circumcenter of the tetrahedron. Assume <math>P</math> is a point in the | ||
+ | interior of the tetrahedron where <math>PA + PB + PC + PD</math> achieves its | ||
+ | minimum value. Then <math>P</math> is in each of the six plane. | ||
+ | Prove this statement by contradiction. Assume that there is | ||
+ | a plane among the six, so that <math>P</math> is not on it. Assume the | ||
+ | plane is the one going through <math>CD</math>, perpendicular to <math>AB</math>. | ||
+ | To make it more explicit, this is the plane going through | ||
+ | <math>C, D, E</math>, where <math>E</math> is the midpoint of <math>AB</math>. | ||
+ | Consider the ellipsoid with focal points <math>A, B</math> going through <math>P</math>. | ||
+ | This can be obtained as the set of points <math>Q</math> in space so that | ||
+ | <math>QA + QB = PA + PB</math>. It can also be obtained as the surface | ||
+ | obtained when we form the ellipse with focal points <math>A, B</math> in | ||
+ | the plane <math>ABC</math> (as the set of points <math>Q</math> so that | ||
+ | <math>QA + QB = PA + PB</math>), and we rotate this ellipse from the plane | ||
+ | <math>ABC</math> around its axis <math>AB</math>. Let <math>P_1</math> be the foot of the | ||
+ | perpendicular from <math>P</math> to the plane <math>CDE</math>. We have | ||
+ | <math>PC > P_1C, PD > P_1D</math> because <math>PP_1 \perp CDE</math>. We also have | ||
+ | <math>PA + PB > P_1A + P_1B</math> because <math>P_1</math> is in the interior of the | ||
+ | ellipsoid. (Indeed, the intersection of the plane <math>CDE</math> and the | ||
+ | ellipsoid is the circle generated by rotating the ends of the | ||
+ | small axis of the ellipse in the plane <math>ABC</math>. Since the point | ||
+ | <math>P</math> is not on the plane CDE, it must be on a smaller circle, so | ||
+ | its projection to the plane <math>CDE</math> will be inside.) | ||
− | + | This concludes the proof of the problem. | |
− | + | [Solution by pf02, September 2024] | |
Latest revision as of 19:16, 10 November 2024
Problem
Prove that the sum of the distances of the vertices of a regular tetrahedron from the center of its circumscribed sphere is less than the sum of the distances of these vertices from any other point in space.
Solution
We will need the following lemma to solve this problem:
Let be a regular tetrahedron, and a point inside it. Let be the distances from to the faces , and . Then, is constant, independent of .
We will compute the volume of in terms of the areas of the faces and the distances from the point to the faces:
because the areas of the four triangles are equal. ( stands for the area of .) Then
This value is constant, so the proof of the lemma is complete.
Let our tetrahedron be , and the center of its circumscribed sphere be . Construct a new regular tetrahedron, , such that the centers of the faces of this tetrahedron are at , , , and .
For any point in ,
with equality only occurring when , , , and are perpendicular to the faces of , meaning that . This completes the proof.
~mathboy100
Remarks (added by pf02, September 2024)
1. The text of the Lemma needed a little improvement, which I did.
2. The Solution above is not complete. It considered only points inside the tetrahedron, but the problem specifically said "any other point in space".
3. I will give another solution below, in which I will also fill in the gap of the solution above, mentioned in the preceding paragraph.
Solution 2
We will first prove the problem in the 2-dimensional case. We do this to convey the idea of the proof, and because we will use this in one spot in proving the 3-dimensional case. So let us prove that:
The sum of the distances of the vertices of an equilateral triangle from the center of its circumscribed circle is less than the sum of the distances of these vertices from any other point in the plane.
We will do the proof in three steps:
We will show that if is in one of the exterior regions, then there is a point on the boundary of the triangle (a vertex, or on a side), such that .
Then we will show that if is on the boundary, then .
For the final step, we will show that if is a point of minimum for inside the triangle, then the extensions of are perpendicular to the opposite sides . This implies that .
If the point is outside the triangle, it can be in one of six regions as seen in the pictures below.
If is in a region delimited by extensions of two sides of the triangle, as in the picture on the left, we notice that by taking , (because and as sides in an obtuse triangles, and similarly ).
If is in a region delimited by a segment which is a side of the triangle and by the extensions of two sides, as in the picture on the right, take the foot of the perpendicular from to . Then (because the triangle is obtuse, and because the triangles are right triangles).
Now assume that . A direct, simple computation shows that (indeed, if we take the side of the triangle to be , then , and ).
Now assume that is on . If is not the midpoint of , let be the midpoint. Then (because and ). A direct, simple computation shows that (indeed, if we take the side of the triangle to be , and ).
Assume that is inside the triangle . In this case, we make a proof by contradiction. We will show that if is a point where is minimum, then the extensions of are perpendicular to the opposite sides . (This statement implies that .) If this were not true, at least one of would be false. We can assume that is not perpendicular to . Then draw the ellipse with focal points which goes through .
Now consider the point on the ellipse such that . Because of the properties of the ellipse, , and because of the definition of the ellipse . We conclude that , which contradicts the assumption that was such that was minimum.
This proves the 2-dimensional case.
NOTE: a very picky reader might object that the proof used that a minimum of exists, and is achieved at a point inside the triangle. This can be justified simply by noting that and quoting the theorem from calculus (or is it topology?) which says that a continuous function on a closed, bounded set has a minimum, and there is a point where the minimum is achieved. Because of the arguments in the proof, this point can not be on the boundary of the triangle, so it is inside.
Now we will give the proof in the 3-dimensional case. We will do the proof in three steps. It is extremely similar to the proof in the 2-dimensional case, we just need to go from 2D to 3D, so I will skip some details.
We will show that if is in one of the exterior regions, then there is a point on the boundary of the tetrahedron (a vertex, or on a edge, or on a side, such that .
Then we will show that if is on the boundary, then .
For the final step, consider the plane going through the edge perpendicular to the edge , the plane going through perpendicular to , the plane going through perpendicular to , etc. There are six such planes, and they all contain , the center of the circumscribed sphere. We will show that if is a point of minimum for inside the tetrahedron, then is in each of the six planes described above. This implies that .
Let be in one of the exterior regions. Assume is in a prism shaped region delimited by extensions of three sides meeting in a vertex (there are 4 of them). Assume it is at vertex , the sides being the extensions of planes . Then take . We have because of obtuse triangles formed with .
Now assume is in one of the wedge shaped regions, formed by an edge and the extensions of two sides going through them. (there are six such regions.) Assume this is the line and the extensions of . Then take to be the foot of the perpendicular from to . Again, we have the desired inequality because formed some right and obtuse triangles.
Now assume is in the truncated prism region delimited by a side and the extensions of the faces going through the edges of this side. (There are four such regions.) Assume this is the side , and extensions of the sides . Then take to be the foot of the perpendicular from to the plane . Again, we have the desired inequality because of right and obtuse triangles formed by .
Assume . If we take the edge of the tetrahedron to be , a direct computation gives us that , and .
Assume is on . If is not the midpoint of , take to be the midpoint of . Then because of right triangles formed by . And, if we take the edge of the tetrahedron to be , a direct computation yields that , which is bigger than .
Assume is on . If is not the circumcenter of then take to be the circumcenter. We have because . We also have because we proved the 2-dimensional analogue of the problem. And, if we take the edge of the tetrahedron to be , we have , which is bigger than .
NOTE: In the above paragraph, we used that the similar result is true in the 2-dimensional case, with an equilateral triangle instead of a regular tetrahedron.
NOTE: This part of the proof concludes filling in the gap in the first "Solution", written above. (A reader may complain that the proof in Solution 2 is very long (compared to the first "Solution"), but the first "Solution" should have done this too, one way or another.)
Now consider the six planes going through one edge, perpendicular to the opposite edge. They intersect at the circumcenter of the tetrahedron. Assume is a point in the interior of the tetrahedron where achieves its minimum value. Then is in each of the six plane.
Prove this statement by contradiction. Assume that there is a plane among the six, so that is not on it. Assume the plane is the one going through , perpendicular to . To make it more explicit, this is the plane going through , where is the midpoint of .
Consider the ellipsoid with focal points going through . This can be obtained as the set of points in space so that . It can also be obtained as the surface obtained when we form the ellipse with focal points in the plane (as the set of points so that ), and we rotate this ellipse from the plane around its axis . Let be the foot of the perpendicular from to the plane . We have because . We also have because is in the interior of the ellipsoid. (Indeed, the intersection of the plane and the ellipsoid is the circle generated by rotating the ends of the small axis of the ellipse in the plane . Since the point is not on the plane CDE, it must be on a smaller circle, so its projection to the plane will be inside.)
This concludes the proof of the problem.
[Solution by pf02, September 2024]
See Also
1966 IMO (Problems) • Resources | ||
Preceded by Problem 2 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 4 |
All IMO Problems and Solutions |