## Torricelli point and angles of 120 degrees

Denote a triangle with angles smaller than . The point which minimizes the sum is called the Torricelli point of the triangle . One interesting property of the Toricelli point, besides the fact that it minimizes the above sum is that all the angles formed around are equal and have .

I will prove here that the fact that the angles around are of can be derived without any geometric considerations, just from the fact that is the solution of the problem

The usual method of construction for the Torricelli point is to build outside the triangle three equilateral triangles . After that, draw the circumcircles of these equliateral triangles and they will meet at a point . Using Ptolemy’s theorem we can find that (and the other two relations), and furthermore, using the properties of the angles of cyclic quadrilaterals, is the intersection of . The fact that minimizes is just a consequence of the triangle inequality now, and the angles around are of by construction.

The *trouble* with this proof is that it is constructive, i.e. it builds directly the object it tries to prove it exists. This does not usually happen when we encounter more general problems where the explicit solution is not obvious, and so the method presented below can turn out to be useful in more general problems.

First, it is obvious that the problem

has a solution . The conditions made on the angles of the triangle are to avoid the degenerated case where is one of the vertices of the triangle.

Denote . Consider such that (for small enough). Then we can calculate using only and (and the cosine theorem) in the following way:

The point can be considered as a function of , and so can be considered the sum . The fact that for the above sum is minimum implies that the derivative of

in is equal to . But we have

and is equivalent to .

Doing the same thing on the segments we obtain the other two similar relations which combined give , and so all the angles around have .

This proof can be used in more general cases: if we have a partition of some set in a finite number of polygons such that at every vertex at most three segments meet, the optimal partition (if it exists) which minimizes the sum of (relative) perimeters of the given polygons then at each joint point the angles will be of .