Arithmetic–Geometric Mean Iteration: Monotonicity and Convergence
Pairing geometric and arithmetic means makes one sequence climb and the other fall; AM–GM traps them between each other, so both converge to a shared limit.
کارت مفهوم کنکور ارشد علوم کامپیوتر
اهمیت
۰/۵
A classic way konkur builds a convergence problem is to interleave two sequences through the geometric mean and the arithmetic mean. Starting from 0<a1<b1, define
an+1=anbn,bn+1=2an+bn.
The whole behaviour is driven by one inequality: the AM–GM inequality, xy≤2x+y for x,y≥0, with equality iff x=y.
The pattern to recognize
Whenever a problem mixes anbn (or any geometric mean) with 2an+bn (or any arithmetic mean), you are looking at the arithmetic–geometric mean (AGM) iteration. It is a nested-interval machine: [an,bn] is a shrinking chain of intervals.
How to apply it (4 moves)
Order the terms. AM–GM gives an+1=anbn≤2an+bn=bn+1, so an≤bn for everyn (the hypothesis a1<b1 seeds it).
Show {an} increases. Because bn≥an, an+1=anbn≥an⋅an=an.
Show {bn} decreases. Because an≤bn, bn+1=2an+bn≤2bn+bn=bn.
Invoke the Monotone Convergence Theorem.{an} is increasing and bounded above by b1; {bn} is decreasing and bounded below by a1. Both converge.
Why the limits are equal
The gap collapses. Subtracting,
bn+1−an+1≤bn+1−an=2an+bn−an=2bn−an,
so the width at least halves each step: bn−an≤2n−1b1−a1→0. Hence liman=limbn. This common value is the arithmetic–geometric meanM(a1,b1), squeezed between the two sequences forever:
a1<a2<⋯<M(a1,b1)<⋯<b2<b1.
Mini-example
Take a1=1,b1=3.
n
an
bn
1
1
3
2
3≈1.732
2
3
23≈1.861
≈1.866
The a-column rises, the b-column falls, and after only two steps they agree to two decimals — both heading to M(1,3)≈1.863.
Exam trick: the single fact GM≤AM pins down both monotonicities at once — geometric-mean term goes up, arithmetic-mean term goes down. Don't test numerically; quote AM–GM plus the Monotone Convergence Theorem and you are done.
فرمولهای کلیدی
AGM iteration
an+1=anbn,bn+1=2an+bn
Geometric mean feeds the lower sequence; arithmetic mean feeds the upper one.
AM–GM inequality
xy≤2x+y(x,y≥0),equality iff x=y
The engine behind both monotonicities and the ordering a_n \le b_n.
Gap contraction
0≤bn−an≤2n−1b1−a1→0
Interval width at least halves each step, forcing a common limit M(a_1,b_1).