Absolute vs conditional convergence: Visual walkthrough

4.3.11 · D2 · Maths › Calculus III — Sequences & Series › Absolute vs conditional convergence

Symbols chhoone se pehle, aao agree kar lete hain ki har word ka matlab kya hai.

Step 1 — Signed Series ko Ek Walk ki Tarah Picture Karo

KYA. Hum terms $a_{n}$ ko ek number line par steps ki tarah rakhte hain: positive term daayein jaata hai, negative term baayein jaata hai, aur step ki length $∣ a_{n} ∣$ hai.

KYUN. Sum abstract hai; ek walk concrete hai. $\sum a_{n}$ ki convergence ek visible sawal ban jaata hai: kya walker ek jagah settle ho jaata hai? Yahi woh cheez hai jise hum control karna chahte hain.

PICTURE. Neeche, blue path signed walk $\sum a_{n}$ hai. Dekho kaise left-steps (orange) right-steps (blue) ko partially undo karte hain — woh undoing cancellation hai, aur yeh walker ka dost hai.

Figure — Absolute vs conditional convergence

$running total after N terms S_{N} = N signed steps a_{1} + a_{2} + \dots + a_{N}$

$S_{N}$ — walker $N$ steps ke baad kahan khada hai.
har $a_{k}$ — ek signed step (sign = direction, magnitude $∣ a_{k} ∣$ = length).

Step 2 — "No-Cancellation" Walk Hamesha Aage Jaata Hai

KYA. Signed walk ke saath-saath, ek doosra walk draw karo jahan har step daayein jaata hai, same length $∣ a_{n} ∣$ ke saath. $N$ steps ke baad uska total hai $T_{N} = ∣ a_{1} ∣ + \dots + ∣ a_{N} ∣$ .

KYUN. Signs hatana kisi bhi undoing ko mana karta hai. Isliye absolute walk $T_{N}$ kam se kam utni tezi se badhta hai jitna signed walk drifts karta hai — yeh ek upper bound hai is baat par ki cheezein kitni dur ja sakti hain. Agar yeh relentless climb bhi settle ho jaata hai, to wilder signed walk ke paas koi room nahi hai behave karne ka.

PICTURE. Blue = signed walk (wapas ja sakta hai). Orange = absolute walk (sirf aage). Orange curve hamesha blue ke distance travelled se upar hai.

$T_{N} = \sum_{n = 1}^{N} ∣ a_{n} ∣ versus S_{N} = \sum_{n = 1}^{N} a_{n}$

$T_{N}$ — sign-stripped steps ka total (kabhi decrease nahi hota).
Theorem ki hypothesis yeh hai ki $T_{N}$ settle hota hai, matlab $\sum ∣ a_{n} ∣$ converge karta hai.

Hum given hain ki orange walk converge karta hai. Hum deduce karna chahte hain ki blue bhi karta hai. Steps 3–6 bridge banate hain.

Step 3 — Compare Karne ke Liye Ek Non-Negative Quantity Banao

KYA. Har term ke liye define karo $b_{n} = a_{n} + ∣ a_{n} ∣$ . Claim: $0 \leq b_{n} \leq 2∣ a_{n} ∣$ .

KYUN. Signed series ke liye humara eklauta convergence-detecting machine jo hum pictures se trust karte hain woh hai Comparison Test — lekin comparison sirf non-negative terms par kaam karta hai (tum kuch aisa sandwich nahi kar sakte jo dono taraf jump kare). Isliye hum ek aisi quantity banate hain jo guaranteed $\geq 0$ ho, lekin $a_{n}$ se bani ho. Woh hai $b_{n}$ .

PICTURE. Do cases sab kuch decide karte hain:

Agar $a_{n} \geq 0$ (right step): $b_{n} = a_{n} + a_{n} = 2∣ a_{n} ∣$ — sandwich ka top.
Agar $a_{n} < 0$ (left step): $b_{n} = a_{n} + (- a_{n}) = 0$ — sandwich ka bottom.

Green bars ( $b_{n}$ ) hamesha floor $0$ aur ceiling $2∣ a_{n} ∣$ ke beech pakde rehte hain.

$0 \leq b_{n} a_{n} + ∣ a_{n} ∣ \leq ceiling 2∣ a_{n} ∣$

$b_{n} = a_{n} + ∣ a_{n} ∣$ — manufactured non-negative term.
Lower bound $0$ — exactly tab hit hota hai jab step baayein point kare.
Upper bound $2∣ a_{n} ∣$ — exactly tab hit hota hai jab step daayein point kare.

Step 4 — Comparison Test Green Series ko Crush Karta Hai

KYA. Kyunki $0 \leq b_{n} \leq 2∣ a_{n} ∣$ aur $\sum 2∣ a_{n} ∣ = 2 \sum ∣ a_{n} ∣$ converge karta hai (given, ek constant se multiply), Comparison Test kehta hai $\sum b_{n}$ converge karta hai.

KYUN. Comparison ki picture: agar non-negative bars ka ek ooncha stack ( $2∣ a_{n} ∣$ ) ka total area finite hai, to non-negative bars ka koi bhi chhota stack ( $b_{n}$ ) jo neeche baitha hai uska bhi area finite hoga. Finite area ↔ running total settle hota hai.

PICTURE. Orange bars = ceiling $2∣ a_{n} ∣$ (finite total, given). Green bars = $b_{n}$ , har ek itna ooncha nahi. Green area orange area se zyada nahi ho sakta, isliye woh bhi finite hai.

$\sum 2∣ a_{n} ∣ converges b_{n} \leq 2∣ a_{n} ∣, b_{n} \geq 0 \sum b_{n} converges$

Left side — known convergent tower (absolute series ka double).
Arrow condition — woh do hypotheses jo comparison demand karta hai: upar se bounded aur non-negative.
Right side — naya earned fact: green series settle hoti hai.

Step 5 — Trick Undo Karo: Signed Sum Wapas Lo

KYA. $b_{n} = a_{n} + ∣ a_{n} ∣$ ko $a_{n}$ ke liye solve karo: dono sides se $∣ a_{n} ∣$ subtract karo taaki mile $a_{n} = b_{n} - ∣ a_{n} ∣$ .

KYUN. Humne $b_{n}$ sirf comparison se past sneakily nikal ne ke liye banaya tha. Ab hum disguise utaarte hain aur original signed term wapas paate hain — lekin do cheezein ki difference ke roop mein jinhein hum ab jaante hain ki dono converge karti hain.

PICTURE. Green tower $\sum b_{n}$ (converges, Step 4) minus orange tower $\sum ∣ a_{n} ∣$ (converges, given) equals blue signed series.

$a_{n} = converges (Step 4) b_{n} - converges (given) ∣ a_{n} ∣$

$b_{n}$ — Step 4 ke comparison se settled.
$∣ a_{n} ∣$ — hypothesis se settled.
Unka difference hai $a_{n}$ : woh cheez jo hum chahte the.

Step 6 — Convergents ka Difference Converge Karta Hai: Ho Gaya

KYA. Convergent series ek vector space banate hain: agar $\sum b_{n}$ aur $\sum ∣ a_{n} ∣$ dono converge karte hain, to $\sum (b_{n} - ∣ a_{n} ∣) = \sum a_{n}$ bhi converge karta hai. $■$

KYUN. Yeh limits ki algebra ko visual banata hai: agar do running totals dono ek fixed height par home in karte hain, unka difference un heights ke difference par home in karta hai. Koi nayi cancellation magic nahi chahiye — bas do settled numbers subtract karo.

PICTURE. Jab $N \to \infty$ , green total height $G$ ke paas jaata hai, orange total height $A$ ke paas jaata hai; isliye blue signed total $G - A$ ke paas jaata hai, ek single fixed number.

$lim_{N \to \infty} S_{N} = (lim \sum b_{n}) - (lim \sum ∣ a_{n} ∣) = G - A (finite)$

$G$ — green series ki settling height.
$A$ — absolute series ki settling height.
$G - A$ — $\sum a_{n}$ ka guaranteed finite limit. Theorem prove ho gaya.

Step 7 — Degenerate & Edge Cases (Kabhi Skip Nahi Karte)

KYA / KYUN / PICTURE un corners ke liye jinhein derivation ko survive karna chahiye:

Ek-Picture Summary

Upar sab kuch, compressed: $b_{n}$ banao floor aur ceiling ke beech → comparison $b_{n}$ ko tame karta hai → $∣ a_{n} ∣$ subtract karo → $a_{n}$ milta hai.

Recall Feynman: plain words mein poora walk retell karo

Main prove karna chahta hoon ki pluses aur minuses ki ek list ek real number mein add hoti hai. Dikkat: minuses running total ko bounce karaate hain, aur mera eklauta reliable "does-it-settle?" tester needs everything pointing the same way. Isliye main ek trick khelti hoon. Har term mein main uski apni length add karta hoon: ek right-step double ho jaata hai, ek left-step zero ho jaata hai. Ab har number $\geq 0$ hai — mera tester allowed hai. Aur in fixed-up numbers mein se har ek original step ki length ke double se bada nahi hai. Mujhe already bataya gaya tha ki lengths ka tower settle hota hai, isliye uska double settle hota hai, isliye — comparison se — mera fixed-up tower bhi settle hota hai. Akhir mein main trick utaarta hoon: original term bas (fixed-up term) minus (length) hai. Do towers jo dono settle hoti hain, subtract karne par, ek aisi tower milti hai jo settle hoti hai. Isliye signed sum ek number par land karta hai. Reason ki absolute convergence zyada strong kyun hai: agar lengths khud settle hoti hain, mujhe kabhi cancellation ki zaroorat hi nahi thi — sum armored hai. Agar woh settle nahi hoti (jaise $\sum \frac{1}{n}$ ), sum survive karta hai sirf delicate left-right dance ki wajah se, aur steps shuffle karne par woh kahin bhi ja sakta hai.

Recall

Ek sentence mein, Step 3 mein $∣ a_{n} ∣$ ko $a_{n}$ mein kyun add karte hain? ::: Ek non-negative quantity $b_{n}$ manufacture karne ke liye taaki Comparison Test (jise non-negative terms chahiye) legal ho jaaye. Kaun si ek hypothesis poora proof power karti hai? ::: Ki $\sum ∣ a_{n} ∣$ converge karta hai (isliye $\sum 2 ∣ a_{n} ∣$ converge karta hai aur $b_{n}$ ko bound karta hai). Converse kyun false hai, picture language mein? ::: Signed walk purely left-right cancellation se settle ho sakta hai jabki length-tower infinity tak bhaag jaata hai — yahi conditional convergence hai.

Connections

Parent: Absolute vs Conditional Convergence
Comparison Test — Step 4 ka engine
Alternating Series Test — converse-counterexample ki convergence prove karta hai
p-series · Harmonic series — kyun counterexample ka length-tower diverge karta hai
Riemann Rearrangement Theorem — absolute/conditional distinction ka payoff
Ratio Test · Power series & radius of convergence — tests jo directly absolute convergence detect karte hain