Traditional geometry Given any Euclidean triangle and an arbitrary point let d(P) = |PA|+|PB|+|PC|. The aim of this section is to identify a point such that d(P_0) for all P\ne P_0. If such a point exists then it will be the Fermat point. In what follows will denote the points inside the triangle and will be taken to include its boundary . A key result that will be used is the dogleg rule, which asserts that if a triangle and a polygon have one side in common and the rest of the triangle lies inside the polygon then the triangle has a shorter perimeter than the polygon: :If is the common side, extend to cut the polygon at the point . Then the polygon's perimeter is, by the
triangle inequality: :\text{perimeter} > |AB|+|AX|+|XB| = |AB|+|AC|+|CX|+|XB| \geq |AB|+|AC|+|BC|. Let be any point outside . Associate each vertex with its remote zone; that is, the half-plane beyond the (extended) opposite side. These 3 zones cover the entire plane except for itself and clearly lies in either one or two of them. If is in two (say the and zones’ intersection) then setting P' = A implies d(P')=d(A) by the dogleg rule. Alternatively if is in only one zone, say the -zone, then d(P') where is the intersection of and . So
for every point outside there exists a point in such that d(P')
Case 1. The triangle has an angle ≥ 120°. Without loss of generality, suppose that the angle at is ≥ 120°. Construct the equilateral triangle and for any point in (except itself) construct so that the triangle is equilateral and has the orientation shown. Then the triangle is a 60° rotation of the triangle about so these two triangles are congruent and it follows that d(P)=|CP|+|PQ|+|QF| which is simply the length of the path . As is constrained to lie within , by the dogleg rule the length of this path exceeds |AC|+|AF|=d(A). Therefore, d(A) for all P \in \Delta, P \ne A. Now allow to range outside . From above a point P' \in \Omega exists such that d(P') and as d(A) \leq d(P') it follows that d(A) for all outside . Thus d(A) for all P\ne A which means that is the Fermat point of . In other words,
the Fermat point lies at the obtuse-angled vertex.
Case 2. The triangle has no angle ≥ 120°. Construct the equilateral triangle , let be any point inside , and construct the equilateral triangle . Then is a 60° rotation of about so :d(P) = |PA|+|PB|+|PC| = |AP|+|PQ|+|QD| which shows that the sum of the distances sought is just the length of the path from A to D along a piecewise linear line. Now we show that if is chosen to be the isogonic center of the path lies on a straight line - and thus it is minimal. To do this, construct the equilateral triangle . Let be the point where and intersect. By construction, this point is the first isogonic center (see above) of . Carry out the same exercise with as you did with , and find the point . By the angular restriction lies inside . Since is the isogonic center, ; by construction , therefore , and are aligned on the line from to . (Also, is a 60° rotation of about , so must lie somewhere on ). Since it follows that lies between and . Since the path now lies on a straight line, d(P_0)=|AD|. Moreover, if P\ne P_0 then either or won't lie on which means d(P_0)=|AD| Now allow to range outside . From above a point P' \in \Omega exists such that d(P') and as d(P_0)\leq d(P') it follows that d(P_0) for all outside . That means is the Fermat point of . In other words,
the Fermat point is coincident with the first isogonic center.
Vector analysis Let be any five points in a plane. Denote the vectors \overrightarrow{OA},\ \overrightarrow{OB},\ \overrightarrow{OC},\ \overrightarrow{OX} by respectively, and let be the unit vectors from along . :\begin{align} \end{align} Adding gives :|\mathbf a| + |\mathbf b| + |\mathbf c| \leq |\mathbf a - \mathbf x| + |\mathbf b - \mathbf x| + |\mathbf c - \mathbf x| + \mathbf x \cdot (\mathbf i + \mathbf j + \mathbf k). If meet at at angles of 120° then , so :|\mathbf a| + |\mathbf b| + |\mathbf c| \leq |\mathbf a - \mathbf x| + |\mathbf b - \mathbf x| + |\mathbf c - \mathbf x| for all . In other words, :|OA| + |OB| + |OC| \leq |XA| + |XB| + |XC| and hence is the Fermat point of . This argument fails when the triangle has an angle because there is no point where meet at angles of 120°. Nevertheless, it is easily fixed by redefining and placing at so that . Note that because the angle between the unit vectors is which exceeds 120°. Since :|\mathbf 0| \leq |\mathbf 0 - \mathbf x| + \mathbf{x \cdot k}, the third inequality still holds, the other two inequalities are unchanged. The proof now continues as above (adding the three inequalities and using ) to reach the same conclusion that (or in this case ) must be the Fermat point of .
Lagrange multipliers Another approach to finding the point within a triangle, from which the sum of the distances to the
vertices of the triangle is minimal, is to use one of the
mathematical optimization methods; specifically, the method of
Lagrange multipliers and the
law of cosines. We draw lines from the point within the triangle to its vertices and call them . Also, let the lengths of these lines be respectively. Let the angle between and be , and be . Then the angle between and is . Using the method of Lagrange multipliers we have to find the minimum of the Lagrangian , which is expressed as: :L=x+y+z+\lambda_1 (x^2 + y^2 - 2xy\cos(\alpha) - a^2) + \lambda_2 (y^2 + z^2 - 2yz\cos(\beta) - b^2) + \lambda_3 (z^2 + x^2 - 2zx\cos(\alpha+\beta) - c^2) where are the lengths of the sides of the triangle. Equating each of the five partial derivatives \tfrac{\partial L}{\partial x}, \tfrac{\partial L}{\partial y}, \tfrac{\partial L}{\partial z}, \tfrac{\partial L}{\partial \alpha}, \tfrac{\partial L}{\partial \beta} to zero and eliminating eventually gives and so . However the elimination is a long and tedious business, and the end result covers only Case 2. == Properties ==