Please wait while we load your article...

Home > Area Of A Disk

Learn more about "Area Of A Disk"

Area of a disk

The '''area of a disk (mathematics)|disk''' (the region inside a circle) is π''r''² when the circle has radius ''r''. Here the symbol π (Greek alphabet|Greek letter Pi (letter)|pi) denotes, as usual, the constant ratio of the circumference of a circle to its diameter. Modern mathematics can obtain the area using the methods of integral calculus or its more sophisticated offspring, real analysis. However, in Ancient Greece the great mathematician Archimedes used the tools of Euclidean geometry to show that the area inside a circle is equal to that of a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius in ''Measurement of a Circle''. The circumference is 2π''r'', and the area of a triangle is half the base times the height, yielding the area π''r''² for the disk.

Archimedes proof

Following , compare a circle to a right triangle whose base has the length of the circle's circumference and whose height equals the circle's radius. If the area of the circle is not equal to that of the triangle, then it must be either greater or less. We eliminate each of these by contradiction, leaving equality as the only possibility. We use regular polygons in an essential way.

Not greater

Suppose the circle area, ''C'', may be greater than the triangle area, ''T'' = ¹⁄₂''cr''. Let ''E'' denote the excess amount. Inscribe a square in the circle, so that its four corners lie on the circle. Between the square and the circle are four segments. If the total area of those gaps, ''G''₄, is greater than ''E'', split each arc in half. This makes the inscribed square into an inscribed octagon, and produces eight segments with a smaller total gap, ''G''₈. Continue splitting until the total gap area, ''G''_''n'', is less than ''E''. Now the area of the inscribed polygon, ''P''_''n'' = ''C'' − ''G''_''n'', must be greater than that of the triangle.
-

\begin{align}
 E &{}= C - T \
   &{}> G_n \
 P_n &{}= C - G_n \
     &{}> C - E \
 P_n &{}> T
\end{align}

But this forces a contradiction, as follows. Draw a perpendicular from the center to the midpoint of a side of the polygon; its length, ''h'', is less than the circle radius. Also, let each side of the polygon have length ''s''; then the sum of the sides, ''ns'', is less than the circle circumference. The polygon area consists of ''n'' equal triangles with height ''h'' and base ''s'', thus equals ¹⁄₂''nhs''. But since ''h'' < ''r'' and ''ns'' < ''c'', the polygon area must be less than the triangle area, ¹⁄₂''cr'', a contradiction. Therefore our supposition that ''C'' might be greater than ''T'' must be wrong.

Not less

Suppose the circle area may be less than the triangle area. Let ''D'' denote the deficit amount. Circumscribe a square, so that the midpoint of each edge lies on the circle. If the total area gap between the square and the circle, ''G''₄, is greater than ''D'', slice off the corners with circle tangents to make a circumscribed octagon, and continue slicing until the gap area is less than ''D''. The area of the polygon, ''P''_''n'', must be less than ''T''.
-

\begin{align}
 D &{}= T - C \
   &{}> G_n \
 P_n &{}= C + G_n \
     &{}< C + D \
 P_n &{}< T
\end{align}

This, too, forces a contradiction. For, a perpendicular to the midpoint of each polygon side is a radius, of length ''r''. And since the total side length is greater than the circumference, the polygon consists of ''n'' identical triangles with total area greater than ''T''. Again we have a contradiction, so our supposition that ''C'' might be less than ''T'' must be wrong as well. Therefore it must be the case that the area of the circle is precisely the same as the area of the triangle. This concludes the proof.

Rearrangement proof

Following SATŌ Moshun and Leonardo da Vinci , we can use inscribed regular polygons in a different way. Suppose we inscribe a hexagon. Cut the hexagon into six triangles by splitting it from the center. Two opposite triangles both touch two common diameters; slide them along one so the radial edges are adjacent. They now form a parallelogram, with the hexagon sides making two opposite edges, one of which is the base, ''s''. Two radial edges form slanted sides, and the height is ''h'' (as in the Archimedes proof). In fact, we can assemble all the triangles into one big parallelogram by putting successive pairs next to each other. The same is true if we increase to eight sides and so on. For a polygon with 2''n'' sides, the parallelogram will have a base of length 2''ns'', and a height ''h''. As the number of sides increases, the length of the parallelogram base approaches half the circle circumference, and its height approaches the circle radius. In the limit, the parallelogram becomes a rectangle with width π''r'' and height ''r''. : A best rational approximation to the last average is ³⁵⁵⁄₁₁₃, which is an excellent value for π. But Snell proposes (and Huygens proves) a tighter bound than Archimedes.
-

n \frac{3 \sin \frac{\pi}{n}}{2+\cos\frac{\pi}{n}} < \pi < n \frac{2 \sin \frac{\pi}{n} + \tan \frac{\pi}{n}}{3}

Thus we could get the same approximation, with decimal value about 3.14159292, from a 48-gon.

Derivation

Let one side of an inscribed regular ''n-''gon have length ''s''_''n'' and touch the circle at points A and B. Let A′ be the point opposite A on the circle, so that A′A is a diameter, and A′AB is an inscribed triangle on a diameter. By Thales' theorem, this is a right triangle with right angle at B. Let the length of A′B be ''c''_''n'', which we call the complement of ''s''_''n''; thus ''c''_''n''²+''s''_''n''² = (2''r'')². Let C bisect the arc from A to B, and let C′ be the point opposite C on the circle. Thus the length of CA is ''s''_2''n'', the length of C′A is ''c''_2''n'', and C′CA is itself a right triangle on diameter C′C. Because C bisects the arc from A to B, C′C perpendicularly bisects the chord from A to B, say at P. Triangle C′AP is thus a right triangle, and is similarity (geometry)#Similar triangles|similar to C′CA since they share the angle at C′. Thus all three corresponding sides are in the same proportion; in particular, we have C′A : C′C = C′P : C′A and AP : C′A = CA : C′C. The center of the circle, O, bisects A′A, so we also have triangle OAP similar to A′AB, with OP half the length of A′B. In terms of side lengths, this gives us
-

\begin{align}
 c_{2n}^2 &{}= \left( r + \frac{1}{2} c_n \right) 2r \
 c_{2n} &{}= \frac{s_n}{s_{2n}} .
\end{align}

In the first equation C′P is C′O+OP, length ''r''+¹⁄₂''c''_''n'', and C′C is the diameter, 2''r''. For a unit circle we have the famous doubling equation of Ludolph van Ceulen,
-

c_{2n} = \sqrt{2+c_n} . \,\!

If we now circumscribe a regular ''n-''gon, with side A″B″ parallel to AB, then OAB and OA″B″ are similar triangles, with A″B″ : AB = OC : OP. Call the circumscribed side ''S''_''n''; then this is ''S''_''n'' : ''s''_''n'' = 1 : ¹⁄₂''c''_''n''. (We have again used that OP is half the length of A′B.) Thus we obtain
-

c_n = 2\frac{s_n}{S_n} . \,\!

Call the inscribed perimeter ''u''_''n'' = ''ns''_''n'', and the circumscribed perimenter ''U''_''n'' = ''nS''_''n''. Then combining equations, we have
-

c_{2n} = \frac{s_n}{s_{2n}} = 2 \frac{s_{2n}}{S_{2n}} ,

so that
-

u_{2n}^2 = u_n U_{2n} . \,\!

This gives a geometric mean equation. We can also deduce
-

2 \frac{s_{2n}}{S_{2n}} \frac{s_n}{s_{2n}} = 2 + 2 \frac{s_n}{S_n} ,

or
-

\frac{2}{U_{2n}} = \frac{1}{u_n} + \frac{1}{U_n} .

This gives a harmonic mean equation.

Dart approximation

When more efficient methods of finding areas are not available, we can resort to “throwing darts”. This Monte Carlo method uses the fact that if random samples are taken uniformly scattered across the surface of a square in which a disk resides, the proportion of samples that hit the disk approximates the ratio of the area of the disk to the area of the square. This should be considered a method of last resort for computing the area of a disk (or any shape), as it requires an enormous number of samples to get useful accuracy; an estimate good to 10^−''n'' requires about 100^''n'' random samples . In some other settings, the Monte Carlo method is the best method available for numerical approximation.

Finite rearrangement

We have seen that by partitioning the disk into an infinite number of pieces we can reassemble the pieces into a rectangle. A remarkable fact discovered relatively recently is that we can dissect the disk into a large but ''finite'' number of pieces and then reassemble the pieces into a square of equal area. This is called Tarski's circle-squaring problem. The nature of Laczkovich's proof is such that it proves the existence of such a partition (in fact, of many such partitions) but does not exhibit any particular partition.

Generalizations

We can stretch a disk to form an ellipse. Because this stretch is a linear transformation of the plane, it has a distortion factor which will change the area but preserve ''ratios'' of areas. This observation can be used to compute the area of an arbitrary ellipse from the area of a unit circle. Consider the unit circle circumscribed by a square of side length 2. The transformation sends the circle to an ellipse by stretching or shrinking the horizontal and vertical diameters to the major and minor axes of the ellipse. The square gets sent to a rectangle circumscribing the ellipse. The ratio of the area of the circle to the square is π/4, which means the ratio of the ellipse to the rectangle is also π/4. Suppose ''a'' and ''b'' are the lengths of the major and minor axes of the ellipse. Since the area of the rectangle is ''ab'', the area of the ellipse is π''ab''/4. We can also consider analogous measurements in higher dimensions. For example, we may wish to find the volume inside a sphere. When we have a formula for the surface area, we can use the same kind of “onion” approach we used for the disk.

References

-
(Originally published by Cambridge University Press, 1897, based on J. L. Heiberg's Greek version.)
-
-
(Originally ''Grundzüge der Mathematik'', Vandenhoeck & Ruprecht, Göttingen, 1971.)
-
-
-
-

External links

- Area enclosed by a circle (with interactive animation)
- Science News on Tarski problem
- Calculate the area of a circle online - Using its radius. Category:Articles containing proofs

Welcome to Start Learning Now. Explore to your heart's content, and we hope you enjoy reading the material we have assembled for you here!

Related News

Further Resources


	home lucky pick

Related Resources