Malfatti circles

From Infogalactic: the planetary knowledge core
Jump to: navigation, search
Malfatti circles

In geometry, the Malfatti circles are three circles inside a given triangle such that each circle is tangent to the other two and to two sides of the triangle. They are named after Gian Francesco Malfatti, who made early studies of the problem of constructing these circles in the mistaken belief that they would have the largest possible total area of any three disjoint circles within the triangle.

Malfatti's problem has been used to refer both to the problem of constructing the Malfatti circles and to the problem of finding three area-maximizing circles within a triangle. A simple construction of the Malfatti circles was given by Jacob Steiner in 1826, and many mathematicians have since studied the problem. Malfatti himself supplied a formula for the radii of the three circles, and they may also be used to define two triangle centers, the Ajima–Malfatti points of a triangle.

The problem of maximizing the total area of three circles in a triangle is never solved by the Malfatti circles. Instead, the optimal solution can always be found by a greedy algorithm that finds the largest circle within the given triangle, the largest circle within the three connected subsets of the triangle outside of the first circle, and the largest circle within the five connected subsets of the triangle outside of the first two circles. Although it was first formulated in 1930, the correctness of this procedure was not proven until 1994.

Malfatti's problem

File:Malfatti circles in equilateral triangle.svg
Comparison of the Malfatti circles and the three area-maximizing circles within an equilateral triangle

In 1803 Gian Francesco Malfatti posed the problem of cutting three cylindrical columns out of a triangular prism of marble, maximizing the total volume of the columns. He assumed, as did many others after him, that the solution to this problem was given by three tangent circles within the triangular cross-section of the wedge. That is, more abstractly, he conjectured that the three Malfatti circles have the maximum total area of any three disjoint circles within a given triangle.[1]

Malfatti published in Italian and his work may not have been read by many in the original. It was popularised for a wider readership in French by Joseph Diaz Gergonne in the first volume of his ``Annales" (1810/11), with further discussion in the second and tenth. However, this advertisement most likely acted as a filter, as Gergonne only stated the circle-tangency problem, not the area-maximizing one.

The conjecture is wrong; Lob and Richmond (1930), who went back to the original Italian text, observed that for some triangles a larger area can be achieved by a greedy algorithm that inscribes a single circle of maximal radius within the triangle, inscribes a second circle within one of the three remaining corners of the triangle, the one with the smallest angle, and inscribes a third circle within the largest of the five remaining pieces. The difference in area for an equilateral triangle is small, just over 1%,[2] but as Howard Eves pointed out in 1946, for an isosceles triangle with a very sharp apex, the optimal circles (stacked one atop each other above the base of the triangle) have nearly twice the area of the Malfatti circles.[3]

Goldberg (1967) showed that, for every triangle, the Lob–Richmond procedure produces three circles with larger area than the Malfatti circles, so the Malfatti circles are never optimal. Zalgaller and Los' (1994) classified all of the different ways that a set of maximal circles can be packed within a triangle; using their classification, they proved that the greedy algorithm always finds three area-maximizing circles, and they provided a formula for determining which packing is optimal for a given triangle. In his 1997 Ph.D. thesis, Melissen conjectured more generally that, for any integer n, the greedy algorithm finds the area-maximizing set of n circles within a given triangle; the conjecture is known to be true for n ≤ 3.[4]

History

The problem of constructing three circles tangent to each other within a triangle was posed by the 18th-century Japanese mathematician Ajima Naonobu prior to the work of Malfatti, and included in an unpublished collection of Ajima's works made a year after Ajima's death by his student Kusaka Makoto.[5] Even earlier, the same problem was considered in a 1384 manuscript by Gilio di Cecco da Montepulciano, now in the Municipal Library of Sienna, Italy.[6]

Since the work of Malfatti, there has been a significant amount of work on methods for constructing Malfatti's three tangent circles; Richard K. Guy writes that the literature on the problem is "extensive, widely scattered, and not always aware of itself".[7] Notably, in 1826 Jakob Steiner presented a simple geometric construction based on bitangents; other authors have since claimed that Steiner's presentation lacked a proof, which was later supplied by Andrew Hart (1856), but Guy points to the proof scattered within two of Steiner's own papers from that time. Lob and Richmond cite solutions by C. L. Lehmus (1819), Eugène Charles Catalan (1845), J. Derousseau (1895), A. Pampuch (1904), and J. L. Coolidge (1916), all based on algebraic formulations of the problem. The algebraic solutions do not distinguish between internal and external tangencies among the circles and the given triangle; if the problem is generalized to allow tangencies of either kind, then a given triangle will have 32 different solutions[8] and conversely a triple of mutually tangent circles will be a solution for eight different triangles.[7] Bottema (2001) and Guy (2007) cite additional work on the problem and its generalizations by C. Adams (1846), Adolphe Quidde (1850), K. H. Schellbach (1853), Arthur Cayley (1854, 1857, 1875), Alfred Clebsch (1857), P. Simons (1874), J. Casey (1888), Rouché and Comberousse (1900), H. F. Baker (1925), L. J. Rogers (1928), Angelo Procissi (1932), Jun Naito (1975), and D. G. Rogers (2005).

Gatto (2000) and Mazzotti (1998) recount an episode in 19th-century Neapolitan mathematics related to the Malfatti circles. In 1839, Vincenzo Flauti, a synthetic geometer, posed a challenge involving the solution of three geometry problems, one of which was the construction of Malfatti's circles; his intention in doing so was to show the superiority of synthetic to analytic techniques. Despite a solution being given by Fortunato Padula, a student in a rival school of analytic geometry, Flauti awarded the prize to his own student, Nicola Trudi, whose solutions Flauti had known of when he posed his challenge. More recently, the problem of constructing the Malfatti circles has been used as a test problem for computer algebra systems.[9]

Steiner's construction

Steiner's construction of the Malfatti circles.

Although much of the early work on the Malfatti circles used analytic geometry, in 1826 Jakob Steiner provided the following simple synthetic construction.

A circle that is tangent to two sides of a triangle, as the Malfatti circles are, must be centered on one of the angle bisectors of the triangle (green in the figure). These bisectors partition the triangle into three smaller triangles, and Steiner's construction of the Malfatti circles begins by drawing a different triple of circles (shown dashed in the figure) inscribed within each of these three smaller triangles. Each pair of two of these three inscribed circles has two bitangents, lines that touch both of the dashed circles and pass between them: one bitangent is the angle bisector, and the second bitangent is shown as the red dashed line in the figure. Label the three sides of the given triangle as a, b, and c, and label the three bitangents that are not angle bisectors as x, y, and z, where x is the bitangent to the two circles that do not touch side a, y is the bitangent to the two circles that do not touch side b, and z is the bitangent to the two circles that do not touch side c. Then the three Malfatti circles are the inscribed circles to the three tangential quadrilaterals abyx, aczx, and bczy.[10] The three bitangents x, y, and z cross the triangle sides at the point of tangency with the third inscribed circle, and may also be found as the reflections of the angle bisectors across the lines connecting pairs of centers of these incircles.[7]

Radius formula

The radius of each of the three Malfatti circles may be determined as a formula involving the three side lengths a, b, and c of the triangle, the inradius r, the semiperimeter s = (a + b + c)/2, and the three distances d, e, and f from the incenter of the triangle to the vertices opposite sides a, b, and c respectively. The formulae for the three radii are:

r_1 = \frac{r}{2(s-a)}(s+d-r-e-f),
r_2 = \frac{r}{2(s-b)}(s+e-r-d-f), and
r_3 = \frac{r}{2(s-c)}(s+f-r-d-e).

According to Stevanović (2003), these formulae were discovered by Malfatti and published posthumously by him in 1811.

Related formulae may be used to find examples of triangles whose side lengths, inradii, and Malfatti radii are all rational numbers or all integers. For instance, the triangle with side lengths 28392, 21000, and 25872 has inradius 6930 and Malfatti radii 3969, 4900, and 4356. As another example, the triangle with side lengths 152460, 165000, and 190740 has inradius 47520 and Malfatti radii 27225, 30976, and 32400.[11]

Ajima–Malfatti points

First Ajima–Malfatti point

Given a triangle ABC and its three Malfatti circles, let D, E, and F be the points where two of the circles touch each other, opposite vertices A, B, and C respectively. Then the three lines AD, BE, and CF meet in a single triangle center known as the first Ajima–Malfatti point after the contributions of Ajima and Malfatti to the circle problem. The second Ajima–Malfatti point is the meeting point of three lines connecting the tangencies of the Malfatti circles with the centers of the excircles of the triangle.[12][13] Other triangle centers also associated with the Malfatti circles include the Yff–Malfatti point, formed in the same way as the first Malfatti point from three mutually tangent circles that are all tangent to the lines through the sides of the given triangle, but that lie partially outside the triangle,[14] and the radical center of the three Malfatti circles.[15]

See also

Notes

  1. Ogilvy (1990).
  2. Wells (1991).
  3. Eves (1946); Ogilvy (1990).
  4. Andreatta, Bezdek & Boroński (2010).
  5. Fukagawa & Rothman (2008).
  6. Simi & Toti Rigatelli (1993).
  7. 7.0 7.1 7.2 Guy (2007).
  8. Bottema (2001) credits the enumeration of these solutions to Pampuch (1904), but Cajori (1893) notes that this count of the number of solutions was already given in an 1826 remark by Steiner.
  9. Hitotumatu (1995); Takeshima & Anai (1996).
  10. Martin (1998), exercise 5.20, p. 96.
  11. Miller (1875).
  12. Weisstein, Eric W., "Ajima-Malfatti Points", MathWorld..
  13. C. Kimberling, Encyclopedia of Triangle Centers, X(179) and X(180).
  14. Encyclopedia of Triangle Centers, X(400).
  15. Stevanović (2003).

References

  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found.. The cover of Martin's book features an illustration of the Malfatti circles.
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found.. Proposed by Artemas Martin; solved by the proposer and by Asher B. Evans; compare Martin's Question 4401,also in this volume, pp. 102–103, again solved by Evans and Martin. Note further that Martin had asked for a geometrical solution in The Lady's and Gentleman's Diary for 1869 (so appearing in late 1868), with solution in the LDG for the following year, pp. 89–90. Versions of the problem then appear from 1879 in The Mathematical Visitor, edited by Martin. A solver of the first of these, Marcus Baker, proposed the second; he also presented a talk surveying the subject to the Philosophical Society of Washington in 1877 that then appeared in the Society's Bulletin. This survey is perhaps the first in English to cite the work of Adolph Gustav Quidde, but copied in from a survey in German.
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..
  • Lua error in package.lua at line 80: module 'strict' not found..

External links