Difference between revisions of "Exhaustion, method of"
(Importing text file) |
Ulf Rehmann (talk | contribs) m (tex encoded by computer) |
||
Line 1: | Line 1: | ||
+ | <!-- | ||
+ | e0368401.png | ||
+ | $#A+1 = 30 n = 0 | ||
+ | $#C+1 = 30 : ~/encyclopedia/old_files/data/E036/E.0306840 Exhaustion, method of | ||
+ | Automatically converted into TeX, above some diagnostics. | ||
+ | Please remove this comment and the {{TEX|auto}} line below, | ||
+ | if TeX found to be correct. | ||
+ | --> | ||
+ | |||
+ | {{TEX|auto}} | ||
+ | {{TEX|done}} | ||
+ | |||
A method of proof used by mathematicians of antiquity in order to determine areas and volumes. The name "method of exhaustion" was introduced in the 17th century. | A method of proof used by mathematicians of antiquity in order to determine areas and volumes. The name "method of exhaustion" was introduced in the 17th century. | ||
− | The typical scheme of proof by the method of exhaustion can, in modern terms, be explained as follows. In order to determine a quantity | + | The typical scheme of proof by the method of exhaustion can, in modern terms, be explained as follows. In order to determine a quantity $ A $ |
+ | one constructs a certain sequence of quantities $ C _ {1} , C _ {2} \dots $ | ||
+ | such that | ||
− | < | + | $$ \tag{1 } |
+ | C _ {n} < A ; | ||
+ | $$ | ||
− | one assumes that a | + | one assumes that a $ B $ |
+ | is known such that | ||
− | + | $$ \tag{2 } | |
+ | C _ {n} < B , | ||
+ | $$ | ||
− | and that for any integer | + | and that for any integer $ K $ |
+ | and all sufficiently large $ n $ | ||
+ | the inequalities | ||
− | + | $$ \tag{3 } | |
+ | K ( A - C _ {n} ) < D ,\ \ | ||
+ | K ( B - C _ {n} ) < D | ||
+ | $$ | ||
− | are fulfilled, with | + | are fulfilled, with $ D $ |
+ | a constant. From the modern point of view, to transfer (3) to | ||
− | + | $$ \tag{4 } | |
+ | A = B | ||
+ | $$ | ||
one only has to notice that (1)–(3) imply | one only has to notice that (1)–(3) imply | ||
− | + | $$ | |
+ | \lim\limits _ {n \rightarrow \infty } | ||
+ | ( A - C _ {n} ) = 0 ,\ \ | ||
+ | \lim\limits _ {n \rightarrow \infty } | ||
+ | ( B - C _ {n} ) = 0 , | ||
+ | $$ | ||
− | + | $$ | |
+ | A = \lim\limits _ {n \rightarrow \infty } C _ {n} = B . | ||
+ | $$ | ||
− | The mathematicians of antiquity, not having developed the theory of limits (cf. [[Limit|Limit]]), used a reductio ad absurdum argument here: they proved that neither of the inequalities < | + | The mathematicians of antiquity, not having developed the theory of limits (cf. [[Limit|Limit]]), used a reductio ad absurdum argument here: they proved that neither of the inequalities $ A < B $, |
+ | $ A > B $ | ||
+ | is possible. To disprove the first one, they established by the [[Archimedean axiom|Archimedean axiom]] that for $ R = B - A $ | ||
+ | there exists a $ K $ | ||
+ | such that $ K R > D $, | ||
+ | and (1) then led to | ||
− | + | $$ | |
+ | K ( B - C _ {n} ) > \ | ||
+ | K ( B - A ) > D , | ||
+ | $$ | ||
which contradicts the second inequality in (3). The other assertion is disproved in a similar way. Hence (4) remains. | which contradicts the second inequality in (3). The other assertion is disproved in a similar way. Hence (4) remains. | ||
− | The introduction of the method of exhaustion and of the axiom that lies at its foundation is ascribed to Eudoxus of Cnidus. The method was extensively used by Eudoxus, while Archimedes used it with extraordinary skill and variety. E.g., in order to determine the area | + | The introduction of the method of exhaustion and of the axiom that lies at its foundation is ascribed to Eudoxus of Cnidus. The method was extensively used by Eudoxus, while Archimedes used it with extraordinary skill and variety. E.g., in order to determine the area $ A $ |
+ | of a segment of a parabola, Archimedes constructs the areas $ C _ {1} , C _ {2} \dots $ | ||
+ | of segments that are stepwise "exhausting" the area $ A $. | ||
Here | Here | ||
− | + | $$ | |
+ | C _ {2} = C _ {1} + | ||
− | + | \frac{1}{4} | |
+ | C _ {1} , | ||
+ | $$ | ||
− | + | $$ | |
+ | {\dots \dots \dots \dots } | ||
+ | $$ | ||
+ | |||
+ | $$ | ||
+ | C _ {n} = C _ {1} + | ||
+ | \frac{1}{4} | ||
+ | C _ {1} + \dots + | ||
+ | \frac{1}{4 ^ {n-} 1 } | ||
+ | C _ {1} . | ||
+ | $$ | ||
Instead of the limit transition | Instead of the limit transition | ||
− | + | $$ | |
+ | A = \lim\limits _ | ||
+ | {n \rightarrow \infty } \ | ||
+ | C _ {n} = \ | ||
+ | \left ( | ||
+ | 1 + | ||
+ | \frac{1}{4} | ||
+ | + | ||
+ | \frac{1}{16} | ||
+ | + \dots | ||
+ | \right ) | ||
+ | C _ {1} = | ||
+ | \frac{4}{3} | ||
+ | C _ {1} , | ||
+ | $$ | ||
− | Archimedes proves geometrically that for any | + | Archimedes proves geometrically that for any $ n $, |
− | < | + | $$ |
+ | A - C _ {n} < \ | ||
+ | |||
+ | \frac{1}{4 ^ {n-} 1 } | ||
+ | |||
+ | C _ {1} . | ||
+ | $$ | ||
Introducing the area | Introducing the area | ||
− | + | $$ | |
+ | B = | ||
+ | \frac{4}{3} | ||
+ | C _ {1} , | ||
+ | $$ | ||
he obtains | he obtains | ||
− | + | $$ | |
+ | B - C _ {n} = \ | ||
+ | |||
+ | \frac{1}{3 \cdot 4 ^ {n-} 1 } | ||
+ | |||
+ | C _ {1} , | ||
+ | $$ | ||
and, following the reasoning explained above, finishes his proof with | and, following the reasoning explained above, finishes his proof with | ||
− | + | $$ | |
− | + | A = B = \ | |
+ | \frac{4}{3} | ||
+ | C _ {1} . | ||
+ | $$ | ||
====Comments==== | ====Comments==== | ||
− | |||
====References==== | ====References==== | ||
<table><TR><TD valign="top">[a1]</TD> <TD valign="top"> C.B. Boyer, "A history of mathematics" , Wiley (1968) pp. 100; 142–146</TD></TR></table> | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> C.B. Boyer, "A history of mathematics" , Wiley (1968) pp. 100; 142–146</TD></TR></table> |
Latest revision as of 19:38, 5 June 2020
A method of proof used by mathematicians of antiquity in order to determine areas and volumes. The name "method of exhaustion" was introduced in the 17th century.
The typical scheme of proof by the method of exhaustion can, in modern terms, be explained as follows. In order to determine a quantity $ A $ one constructs a certain sequence of quantities $ C _ {1} , C _ {2} \dots $ such that
$$ \tag{1 } C _ {n} < A ; $$
one assumes that a $ B $ is known such that
$$ \tag{2 } C _ {n} < B , $$
and that for any integer $ K $ and all sufficiently large $ n $ the inequalities
$$ \tag{3 } K ( A - C _ {n} ) < D ,\ \ K ( B - C _ {n} ) < D $$
are fulfilled, with $ D $ a constant. From the modern point of view, to transfer (3) to
$$ \tag{4 } A = B $$
one only has to notice that (1)–(3) imply
$$ \lim\limits _ {n \rightarrow \infty } ( A - C _ {n} ) = 0 ,\ \ \lim\limits _ {n \rightarrow \infty } ( B - C _ {n} ) = 0 , $$
$$ A = \lim\limits _ {n \rightarrow \infty } C _ {n} = B . $$
The mathematicians of antiquity, not having developed the theory of limits (cf. Limit), used a reductio ad absurdum argument here: they proved that neither of the inequalities $ A < B $, $ A > B $ is possible. To disprove the first one, they established by the Archimedean axiom that for $ R = B - A $ there exists a $ K $ such that $ K R > D $, and (1) then led to
$$ K ( B - C _ {n} ) > \ K ( B - A ) > D , $$
which contradicts the second inequality in (3). The other assertion is disproved in a similar way. Hence (4) remains.
The introduction of the method of exhaustion and of the axiom that lies at its foundation is ascribed to Eudoxus of Cnidus. The method was extensively used by Eudoxus, while Archimedes used it with extraordinary skill and variety. E.g., in order to determine the area $ A $ of a segment of a parabola, Archimedes constructs the areas $ C _ {1} , C _ {2} \dots $ of segments that are stepwise "exhausting" the area $ A $.
Here
$$ C _ {2} = C _ {1} + \frac{1}{4} C _ {1} , $$
$$ {\dots \dots \dots \dots } $$
$$ C _ {n} = C _ {1} + \frac{1}{4} C _ {1} + \dots + \frac{1}{4 ^ {n-} 1 } C _ {1} . $$
Instead of the limit transition
$$ A = \lim\limits _ {n \rightarrow \infty } \ C _ {n} = \ \left ( 1 + \frac{1}{4} + \frac{1}{16} + \dots \right ) C _ {1} = \frac{4}{3} C _ {1} , $$
Archimedes proves geometrically that for any $ n $,
$$ A - C _ {n} < \ \frac{1}{4 ^ {n-} 1 } C _ {1} . $$
Introducing the area
$$ B = \frac{4}{3} C _ {1} , $$
he obtains
$$ B - C _ {n} = \ \frac{1}{3 \cdot 4 ^ {n-} 1 } C _ {1} , $$
and, following the reasoning explained above, finishes his proof with
$$ A = B = \ \frac{4}{3} C _ {1} . $$
Comments
References
[a1] | C.B. Boyer, "A history of mathematics" , Wiley (1968) pp. 100; 142–146 |
Exhaustion, method of. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Exhaustion,_method_of&oldid=11968