← Back to home

Madhava'S Correction Term

Madhava's Correction Term

The expression known as Madhava's correction term, a contribution attributed to the pioneering mathematician Madhava of Sangamagrama (active roughly between 1340 and 1425 CE), represents a sophisticated refinement designed to yield a more accurate approximation of the mathematical constant π than one might achieve by simply truncating the Madhava–Leibniz infinite series for π. This particular series, a cornerstone in the history of calculus, is presented as:

π4=113+1517+\frac{\pi}{4} = 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots

When we consider the partial sum of the first nn terms of this series, we obtain an approximation for π4\frac{\pi}{4}:

π4113+1517++(1)n112n1\frac{\pi}{4} \approx 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots + (-1)^{n-1} \frac{1}{2n-1}

Madhava's insight was to introduce a correction term, which we can denote as F(n)F(n), to enhance this approximation. The refined formula then becomes:

π4113+1517++(1)n112n1+(1)nF(n)\frac{\pi}{4} \approx 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots + (-1)^{n-1} \frac{1}{2n-1} + (-1)^{n} F(n)

Scholars have identified three distinct expressions for F(n)F(n) that have been linked to Madhava:

F1(n)=14nF_1(n) = \frac{1}{4n} F2(n)=n4n2+1F_2(n) = \frac{n}{4n^2 + 1} F3(n)=n2+14n3+5nF_3(n) = \frac{n^2 + 1}{4n^3 + 5n}

While the surviving works of the Kerala school of astronomy and mathematics offer some clues regarding the derivation of F1(n)F_1(n) and F2(n)F_2(n), the provenance of F3(n)F_3(n) remains a subject of considerable scholarly speculation. The very existence of these correction terms suggests a level of mathematical sophistication that anticipated later developments in calculus by centuries.

Correction Terms as Presented in Kerala Texts

The expressions for F2(n)F_2(n) and F3(n)F_3(n) are explicitly documented in the Yuktibhasha, a seminal treatise on mathematics and astronomy authored by the astronomer Jyesthadeva of the Kerala school, dating to approximately 1530 CE. The expression for F1(n)F_1(n), while crucial, appears within the Yuktibhasha primarily as an intermediate step in the derivation of F2(n)F_2(n).

Further insight into the F2(n)F_2(n) correction term can be found in the Yuktidipika–Laghuvivrthi commentary on the Tantrasangraha. This treatise, completed in 1501 by Nilakantha Somayaji, an eminent astronomer and mathematician of the Kerala school, contains verses (Chapter 2, Verses 271–274) that describe the calculation of the circumference of a circle with remarkable detail.

The English translation of these verses reads:

"To the diameter multiplied by 4 alternately add and subtract in order the diameter multiplied by 4 and divided separately by the odd numbers 3, 5, etc. That odd number at which this process ends, four times the diameter should be multiplied by the next even number, halved and [then] divided by one added to that [even] number squared. The result is to be added or subtracted according as the last term was subtracted or added. This gives the circumference more accurately than would be obtained by going on with that process."

In contemporary mathematical notation, this passage can be interpreted as:

Circumference=4d4d3+4d5±4dp4d(p+1)/21+(p+1)2\text{Circumference} = 4d - \frac{4d}{3} + \frac{4d}{5} - \cdots \pm \frac{4d}{p} \mp \frac{4d(p+1)/2}{1+(p+1)^2}

Here, dd represents the diameter of the circle, and pp is the last odd number used in the series. If we substitute p=2n1p = 2n - 1, the final term on the right-hand side aligns precisely with 4dF2(n)4d F_2(n).

The same commentary also presents the F3(n)F_3(n) correction term in Chapter 2, Verses 295–296, with a translation of the verses stating:

"A subtler method, with another correction. [Retain] the first procedure involving division of four times the diameter by the odd numbers, 3, 5, etc. [But] then add or subtract it [four times the diameter] multiplied by one added to the next even number halved and squared, and divided by one added to four times the preceding multiplier [with this] multiplied by the even number halved."

In modern notation, this translates to:

Circumference=4d4d3+4d5±4dp4dm(1+4m)(p+1)/2\text{Circumference} = 4d - \frac{4d}{3} + \frac{4d}{5} - \cdots \pm \frac{4d}{p} \mp \frac{4dm}{(1+4m)(p+1)/2}

Where m=1+(p+12)2m = 1 + \left(\frac{p+1}{2}\right)^2. Again, setting p=2n1p = 2n - 1 reveals that the final term corresponds to 4dF3(n)4d F_3(n).

Accuracy of the Correction Terms

To evaluate the efficacy of these correction terms, let us define si(n)s_i(n) as the approximation of π4\frac{\pi}{4} using the Madhava correction term Fi(n)F_i(n):

si(n)=113+1517++(1)n112n1+(1)nFi(n)s_i(n) = 1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots + (-1)^{n-1} \frac{1}{2n-1} + (-1)^{n} F_i(n)

With p=2n+1p = 2n + 1, the absolute errors, π4si(n)\left| \frac{\pi}{4} - s_i(n) \right|, are bounded as follows:

1p3p1(p+2)3(p+2)<π4s1(n)<1p3p\frac{1}{p^3-p} - \frac{1}{(p+2)^3-(p+2)} < \left| \frac{\pi}{4} - s_1(n) \right| < \frac{1}{p^3-p}

4p5+4p4(p+2)5+4(p+2)<π4s2(n)<4p5+4p\frac{4}{p^5+4p} - \frac{4}{(p+2)^5+4(p+2)} < \left| \frac{\pi}{4} - s_2(n) \right| < \frac{4}{p^5+4p}

36p7+7p5+28p336p36(p+2)7+7(p+2)5+28(p+2)336(p+2)<π4s3(n)<36p7+7p5+28p336p\frac{36}{p^7+7p^5+28p^3-36p} - \frac{36}{(p+2)^7+7(p+2)^5+28(p+2)^3-36(p+2)} \cdots < \left| \frac{\pi}{4} - s_3(n) \right| < \frac{36}{p^7+7p^5+28p^3-36p}

The accuracy of these approximations in computing the value of π\pi can be further examined by looking at the errors E(n)E(n) (for the truncated series) and Ei(n)E_i(n) (using the correction terms):

E(n)=π4(113+1517++(1)n112n1)E(n) = \pi - 4\left(1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots + (-1)^{n-1} \frac{1}{2n-1}\right) Ei(n)=E(n)4×(1)nFi(n)E_i(n) = E(n) - 4 \times (-1)^{n} F_i(n)

The following table illustrates the magnitude of these errors for selected values of nn:

nn E(n)E(n) E1(n)E_1(n) E2(n)E_2(n) E3(n)E_3(n)
11 9.07×102-9.07 \times 10^{-2} 1.86×1041.86 \times 10^{-4} 1.51×106-1.51 \times 10^{-6} 2.69×1082.69 \times 10^{-8}
21 4.76×102-4.76 \times 10^{-2} 2.69×1052.69 \times 10^{-5} 6.07×108-6.07 \times 10^{-8} 3.06×10103.06 \times 10^{-10}
51 1.96×102-1.96 \times 10^{-2} 1.88×1061.88 \times 10^{-6} 7.24×1010-7.24 \times 10^{-10} 6.24×10136.24 \times 10^{-13}
101 9.90×103-9.90 \times 10^{-3} 2.43×1072.43 \times 10^{-7} 2.38×1011-2.38 \times 10^{-11} 5.33×10155.33 \times 10^{-15}
151 6.62×103-6.62 \times 10^{-3} 7.26×1087.26 \times 10^{-8} 3.18×1012-3.18 \times 10^{-12} 1×1016\approx 1 \times 10^{-16}

As the table clearly demonstrates, the introduction of Madhava's correction terms leads to a dramatic increase in the accuracy of the approximation for π\pi, with each subsequent term (F1F_1, F2F_2, F3F_3) offering a significantly better convergence rate.

Continued Fraction Expressions for the Correction Terms

An intriguing observation is that the correction terms F1(n)F_1(n), F2(n)F_2(n), and F3(n)F_3(n) correspond to the first three convergents of specific continued fraction expansions.

One such expansion is:

14n+1n+1n+\frac{1}{4n + \frac{1}{n + \frac{1}{n + \cdots}}}

Another, more complex, continued fraction is given by:

14n+12n+224n+32n++r2n[43(rmod2)]+=14n+224n+424n+624n+824n+\frac{1}{4n + \frac{1^2}{n + \frac{2^2}{4n + \frac{3^2}{n + \frac{\cdots}{\cdots + \frac{r^2}{n[4-3(r \bmod 2)]+\cdots}}}}}} = \frac{1}{4n + \frac{2^2}{4n + \frac{4^2}{4n + \frac{6^2}{4n + \frac{8^2}{4n + \cdots}}}}}

The function f(n)f(n) that makes the equation

π4=113+15±1nf(n+1)\frac{\pi}{4} = 1 - \frac{1}{3} + \frac{1}{5} - \cdots \pm \frac{1}{n} \mp f(n+1)

exact can be expressed as:

f(n)=12×1n+12n+22n+32n+f(n) = \frac{1}{2} \times \frac{1}{n + \frac{1^2}{n + \frac{2^2}{n + \frac{3^2}{n + \cdots}}}}

The first three convergents of this infinite continued fraction are precisely Madhava's correction terms. Furthermore, this function f(n)f(n) exhibits a remarkable property:

f(2n)=14n+224n+424n+624n+824n+f(2n) = \frac{1}{4n + \frac{2^2}{4n + \frac{4^2}{4n + \frac{6^2}{4n + \frac{8^2}{4n + \cdots}}}}}

This connection to continued fractions highlights the deep structural relationships within mathematical series and approximations.

Speculative Derivation by Hayashi et al.

In 1990, a team of Japanese researchers, T. Hayashi, T. Kusuba, and M. Yano, proposed a compelling hypothesis regarding Madhava's method for obtaining these correction terms. Their theory rests on two fundamental assumptions: that Madhava utilized the approximation π355113\pi \approx \frac{355}{113} and employed the principles of the Euclidean algorithm for division.

They defined S(n)S(n) as the absolute difference between the truncated Madhava–Leibniz series and π4\frac{\pi}{4}:

S(n)=113+1517++(1)n12n1π4S(n) = \left|1 - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots + \frac{(-1)^{n-1}}{2n-1} - \frac{\pi}{4}\right|

Using π=355113\pi = \frac{355}{113}, they computed values for S(n)S(n), expressed them as fractions with a numerator of 1, and then, by discarding the fractional part of the denominator, derived approximations. This process, when applied iteratively, yielded results that closely matched Madhava's correction terms:

For n=1n=1: S(1)=97452=14+649714S(1) = \frac{97}{452} = \frac{1}{4 + \frac{64}{97}} \approx \frac{1}{4} This aligns with F1(1)=14(1)=14F_1(1) = \frac{1}{4(1)} = \frac{1}{4}.

Applying the process further to the remainder 6497\frac{64}{97}: 6497=11+336411\frac{64}{97} = \frac{1}{1 + \frac{33}{64}} \approx \frac{1}{1} 3364=11+313311\frac{33}{64} = \frac{1}{1 + \frac{31}{33}} \approx \frac{1}{1} This iterative process, they suggested, could lead to the subsequent correction terms.

For n=2n=2: S(2)=1611356=18+6816118S(2) = \frac{161}{1356} = \frac{1}{8 + \frac{68}{161}} \approx \frac{1}{8} This result, however, does not directly match F2(2)=24(22)+1=217F_2(2) = \frac{2}{4(2^2)+1} = \frac{2}{17}. The Hayashi et al. hypothesis suggests that the second approximation, derived from the continued fraction expansion of S(n)S(n), corresponds to F2(n)F_2(n):

S(n)14n+1n=n4n2+1S(n) \approx \frac{1}{4n + \frac{1}{n}} = \frac{n}{4n^2 + 1} This precisely matches F2(n)F_2(n).

And the third approximation yields F3(n)F_3(n):

S(n)14n+1n+1n=n2+1n(4n2+5)S(n) \approx \frac{1}{4n + \frac{1}{n + \frac{1}{n}}} = \frac{n^2+1}{n(4n^2+5)} While the formula derived by Hayashi et al. for F3(n)F_3(n) is n2+14n3+5n\frac{n^2+1}{4n^3+5n}, the denominator in their continued fraction expansion is n(4n2+5)n(4n^2+5), which differs slightly. However, the core idea of iterative refinement through Euclidean-like division of remainders to generate increasingly accurate approximations is evident.

The explicit steps shown for deriving the second and third approximations are:

For F2(n)F_2(n): 68161=12+256812\frac{68}{161} = \frac{1}{2 + \frac{25}{68}} \approx \frac{1}{2} 2568=12+182512\frac{25}{68} = \frac{1}{2 + \frac{18}{25}} \approx \frac{1}{2} This leads to the approximation F2(n)=n4n2+1F_2(n) = \frac{n}{4n^2+1}.

For F3(n)F_3(n): 168551=13+4716813\frac{168}{551} = \frac{1}{3 + \frac{47}{168}} \approx \frac{1}{3} 47168=13+274713\frac{47}{168} = \frac{1}{3 + \frac{27}{47}} \approx \frac{1}{3} This iterative process, when applied consistently, suggests how Madhava might have arrived at the more complex correction terms, bridging the gap between arithmetic manipulation and the sophisticated analysis of infinite series. The speculative nature of this derivation only adds to the mystique and brilliance of Madhava's contributions.