KonkurStudy
همه کارت‌ها

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<b10 < a_1 < b_1, define

an+1=anbn,bn+1=an+bn2.a_{n+1} = \sqrt{a_n b_n}, \qquad b_{n+1} = \frac{a_n + b_n}{2}.

The whole behaviour is driven by one inequality: the AM–GM inequality, xy≤x+y2\sqrt{xy} \le \tfrac{x+y}{2} for x,y≥0x, y \ge 0, with equality iff x=yx = y.

The pattern to recognize

Whenever a problem mixes anbn\sqrt{a_n b_n} (or any geometric mean) with an+bn2\tfrac{a_n+b_n}{2} (or any arithmetic mean), you are looking at the arithmetic–geometric mean (AGM) iteration. It is a nested-interval machine: [an,bn][a_n, b_n] is a shrinking chain of intervals.

How to apply it (4 moves)

  1. Order the terms. AM–GM gives an+1=anbn≤an+bn2=bn+1a_{n+1} = \sqrt{a_n b_n} \le \tfrac{a_n + b_n}{2} = b_{n+1}, so an≤bna_n \le b_n for every nn (the hypothesis a1<b1a_1 < b_1 seeds it).
  2. Show {an}\{a_n\} increases. Because bn≥anb_n \ge a_n,   an+1=anbn≥an⋅an=an.\;a_{n+1} = \sqrt{a_n b_n} \ge \sqrt{a_n \cdot a_n} = a_n.
  3. Show {bn}\{b_n\} decreases. Because an≤bna_n \le b_n,   bn+1=an+bn2≤bn+bn2=bn.\;b_{n+1} = \tfrac{a_n + b_n}{2} \le \tfrac{b_n + b_n}{2} = b_n.
  4. Invoke the Monotone Convergence Theorem. {an}\{a_n\} is increasing and bounded above by b1b_1; {bn}\{b_n\} is decreasing and bounded below by a1a_1. Both converge.

Why the limits are equal

The gap collapses. Subtracting,

bn+1−an+1≤bn+1−an=an+bn2−an=bn−an2,b_{n+1} - a_{n+1} \le b_{n+1} - a_n = \frac{a_n + b_n}{2} - a_n = \frac{b_n - a_n}{2},

so the width at least halves each step: bn−an≤b1−a12 n−1→0b_n - a_n \le \tfrac{b_1 - a_1}{2^{\,n-1}} \to 0. Hence lim⁡an=lim⁡bn\lim a_n = \lim b_n. This common value is the arithmetic–geometric mean M(a1,b1)M(a_1, b_1), squeezed between the two sequences forever:

a1<a2<⋯<M(a1,b1)<⋯<b2<b1.a_1 < a_2 < \cdots < M(a_1,b_1) < \cdots < b_2 < b_1.

Mini-example

Take a1=1, b1=3a_1 = 1,\ b_1 = 3.

nn ana_n bnb_n
1 11 33
2 3≈1.732\sqrt{3} \approx 1.732 22
3 23≈1.861\sqrt{2\sqrt{3}} \approx 1.861 ≈1.866\approx 1.866

The aa-column rises, the bb-column falls, and after only two steps they agree to two decimals — both heading to M(1,3)≈1.863M(1,3) \approx 1.863.

Exam trick: the single fact GM≤AM\mathrm{GM} \le \mathrm{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=an+bn2a_{n+1} = \sqrt{a_n b_n}, \qquad b_{n+1} = \frac{a_n + b_n}{2}

Geometric mean feeds the lower sequence; arithmetic mean feeds the upper one.

AM–GM inequality
xy≤x+y2(x,y≥0), equality iff x=y\sqrt{xy} \le \frac{x + y}{2} \quad (x, y \ge 0),\ \text{equality iff } x = y

The engine behind both monotonicities and the ordering a_n \le b_n.

Gap contraction
0≤bn−an≤b1−a12 n−1→00 \le b_n - a_n \le \frac{b_1 - a_1}{2^{\,n-1}} \to 0

Interval width at least halves each step, forcing a common limit M(a_1,b_1).

#sequences#monotone-convergence#am-gm#arithmetic-geometric-mean#bounded-sequence#nested-intervals#limits

سوالات تمرینی