Direct comparison test: Foundations — Hinglish deep dive

4.3.8 · D1 · Maths › Calculus III — Sequences & Series › Direct comparison test

Yeh foundations page — bilkul zero se — har woh symbol aur idea build karta hai jis par parent note rely karta hai. Agar neeche koi word obvious lage, phir bhi padho: parent secretly assume karta hai ki woh sab tumhare paas hain.

0. Shuru ki picture: series hoti kya hai?

Kisi bhi symbol se pehle, ek picture. Number line par dots imagine karo, har height $a_{1}, a_{2}, a_{3}, \dots$ ke liye ek dot — yeh hain terms, candy ki individual piles.

Figure 1 — har term $a_{n}$ height $a_{n}$ ki ek pile hai jo horizontal axis par apne address $n$ par baithi hai; yahan piles jaise-jaise tum daaye chalte ho, chhoti hoti jaati hain.

Hum inhe stack karne wale hain: pehle $a_{1}$ rakho, phir uske upar $a_{2}$ , phir $a_{3}$ , aur aise hi. Poore chapter ka sawaal yeh hai: kya yeh running tower kisi finite ceiling tak pahunchta hai, ya forever climb karta rehta hai?

1. Natural numbers $N$ — woh addresses jinse hum count karte hain

Picture: hamesha ke liye daaye ki taraf equally spaced tick marks, $1, 2, 3, \dots$ label kiye hue — har pile ke liye ek slot.

Topic ko yeh kyun chahiye: neeche har symbol $N$ ke kisi member se indexed hai. "For all $n$ " ka matlab hamesha secretly "for all $n$ in $N$ " hota hai.

2. Subscript $a_{n}$ — address wala ek term

Picture: labelled boxes ki ek row. Box number $n$ mein value $a_{n}$ hai.

Topic ko yeh kyun chahiye. Poora test har address par alag se ek rule hai: "har address $n$ par, meri pile tumhari pile se zyada lambi nahi." Agar "address $n$ par pile" ka koi naam nahi hota, toh hum woh baat keh bhi nahi sakte the.

3. Sequence — ek endless labelled list

Picture: wahi boxes ki row jaisi pehle thi, lekin ab ek ek object ki tarah emphasise ki gayi — poori endless list, sirf ek pile nahi.

Topic ko yeh kyun chahiye: is topic mein do alag sequences star karenge — terms $a_{1}, a_{2}, \dots$ aur running totals $S_{1}, S_{2}, \dots$ (Section 5). Dono sequences hain; concept ko naam dene se hum baat kar sakte hain "list lambe run mein kya karti hai".

4. Inequality $0 \leq a_{n} \leq b_{n}$ — "itni se zyada lambi nahi"

Parent ki central hypothesis double inequality hai, jo for all $n \geq N$ (koi fixed starting address $N \in N$ ) hold karta hai: $0 \leq a_{n} \leq b_{n} (n \geq N) .$ Left se right padho: "zero, meri pile $a_{n}$ se zyada lambi nahi, tumhari pile $b_{n}$ se zyada lambi nahi." $N$ se aage har address par do piles, meri hamesha chhoti.

Figure 2 — har address par blue pile $a_{n}$ (hamari) orange pile $b_{n}$ (partner) se zyada lambi nahi hai; gray double-arrow gap $b_{n} - a_{n} \geq 0$ mark karta hai.

Topic ko yeh kyun chahiye: yeh term-by-term "itni se zyada lambi nahi", eventually hold karta hua, test ka poora input hai. Baaki sab machinery hai jo isse ek conclusion mein convert kare.

5. Sigma $\sum$ — "inhe sab jodo" symbol

Picture: $\sum$ ek machine hai jiska ek muh hai jo $1$ se $n$ tak ke boxes nigal leta hai aur ek number print karta hai: unki total height.

Yahan $k$ letter dummy hai — ek walker jo sirf sum ke andar exist karta hai. $\sum_{k = 1}^{n} a_{k}$ aur $\sum_{j = 1}^{n} a_{j}$ exact same total mean karte hain.

Topic ko yeh kyun chahiye: parent har jagah $\sum a_{n}$ likhta hai. Jab upar ek number $n$ hai toh yeh ek finite sum hai (safe, ordinary addition). Jab upar $\infty$ hai toh yeh infinite series hai — study ka asli object, Section 7 mein define kiya gaya.

6. Partial sums $S_{n}$ — running tower

Figure 3 — blue staircase partial sums $S_{n}$ ka sequence hai: har step agli pile $a_{n}$ add karta hai, aur heights red dashed ceiling ki taraf press karti hain.

Naya symbol $S_{n}$ kyun, sirf $\sum$ kyun nahi? Kyunki hum tower ko badhta dekhna chahte hain. List $S_{1}, S_{2}, S_{3}, \dots$ khud ek sequence hai (Section 3) — aur poora game yeh poochna hai ki jaise $n$ infinity ki taraf march karta hai, woh list kya karti hai.

7. Limit $lim_{n \to \infty} S_{n}$ , aur convergence vs divergence

Pehle humein precisely yeh kehna hoga ki heights ke sequence ka "ceiling pe settle karna" ka kya matlab hai.

Picture: $S$ par ek horizontal line aur uske around half-width $ε$ ka ek thin shaded strip kheencho. "Limit $S$ " ka matlab hai staircase eventually us strip mein ghus jaata hai aur andar trapped rehta hai — chahe tum usse kitna bhi thin banao.

Picture: do towers side by side. Ek pehle fast badhti hai, phir additions itne tiny ho jaate hain ki height ek invisible ceiling ke against flatten ho jaati hai — convergence. Doosri har baar itna add karti rehti hai ki koi bhi ceiling jo tum kheencho, woh tod de — divergence.

Topic ko yeh kyun chahiye: "converges" / "diverges" test ka output hai. Parent kabhi $S$ compute nahi karta — woh sirf decide karta hai ki in do words mein se kaun sa apply hota hai, comparison se.

8. Bounded above — "ceiling exist karta hai" idea

Picture: height $B$ par ek horizontal line kheencho. Bounded-above ka matlab hai har dot $S_{1}, S_{2}, \dots$ us line par ya neeche rehta hai.

Topic ko yeh kyun chahiye: proof ka key step dikhata hai ki tower ki heights saari ek finite number $B$ ke neeche trapped hain (badi series ka total). "Never shrinks" ke saath combine karke, yeh tower ko trap kar leta hai — jo agla idea hai.

9. Engine: Monotone Convergence

Picture: ek tower jo sirf badhta hai, lekin ceiling line $B$ se kabhi upar nahi ja sakta. Uske paas jaane ki jagah sirf kisi final height ki taraf squeeze hona hai, $B$ par ya neeche. Woh oscillate nahi kar sakta (sirf upar jaata hai) aur escape nahi kar sakta (ceiling rok leti hai). Toh woh zaroor settle karega.

Figure 4 — green staircase sirf upar jaata hai (kabhi neeche nahi) phir bhi red bound $B$ ke neeche rehta hai; corner mein phansa hua, yeh zaroor gray limit line par converge karega.

Topic ko yeh kyun chahiye: yeh literally DCT ka proof hai. Non-negative terms se (a) increasing milta hai; ek convergent badi series se (b) bounded above milta hai; theorem phir convergence force karta hai. Ise samjho aur test apna ho jaata hai.

10. Package karna: Direct Comparison Test khud

Ab upar ka har symbol kaam aata hai. Yahan parent's theorem ek baar puri tarah, saare hypotheses table par rakhe hue.

11. Do benchmark series jinhe tumhe pehle se jaanna chahiye

Test hamesha tumhari mystery series ko ek known series se compare karta hai. Do known families lagbhag saara kaam karti hain:

Topic ko yeh kyun chahiye: DCT "unknown" ko "known" mein convert karta hai — lekin tabhi jab tumhare paas knowns ka ek stable ho. Yeh do woh benchmark partners hain jinhe parent ke examples har baar dhoondh ke laate hain.

Recall DCT directly negative terms handle kyun nahi kar sakta?

Kyunki "never shrinks" fact ko $a_{n + 1} \geq 0$ chahiye. Sign changes ke saath tower neeche ja sakta hai, Monotone Convergence ab apply nahi hota, aur tumhe Absolute convergence ya Alternating Series Test par switch karna padega.

Equipment checklist

Har sawaal padho, zor se jawab do, phir reveal karo.

Set

N

kya hai aur yahan se kahan shuru hota hai?

Natural numbers

{1, 2, 3, \dots}

— counting numbers jinka koi sabse bada member nahi,

1

se shuru.

Sequence kya hoti hai?

Ek endless list jo

N

ke har address

n

ko exactly ek value

a_{n}

assign karti hai; jaise

a_{1}, a_{2}, a_{3}, \dots

a_{n}

mein subscript kya batata hai?

Index — woh address ki kaun sa term (pile) meant hai, jahan

n \in N

n \geq N

ke liye

0 \leq a_{n} \leq b_{n}

plain words mein kya kehta hai?

Address

N

se aage, mera term non-negative hai aur tumhare term

b_{n}

se zyada lambi nahi.

"Eventually" / starting address

N

ka kya matlab hai?

Condition kisi fixed

N \in N

ke liye all

n \geq N

ke liye hold karti hai; finitely many early terms convergence affect nahi karte.

\sum_{k = 1}^{n} a_{k}

expand karo.

a_{1} + a_{2} + \dots + a_{n}

— address

1

n

tak terms jodo.

Partial sum

S_{n}

kya hai?

Running total

a_{1} + \dots + a_{n}

—

n

piles ke baad tower ki height.

lim_{n \to \infty} S_{n} = S

precisely kya kehta hai clearly batao.

Har

ε > 0

ke liye ek

N \in N

hai jiske saath all

n \geq N

ke liye

∣ S_{n} - S ∣ < ε

— heights

S

ke around kisi bhi band ke andar aa jaati hain aur rehti hain.

S_{n + 1} - S_{n} = a_{n + 1}

key fact kyun hai?

Agar terms

\geq 0

hain, toh tower kabhi nahi shrinks, isliye partial sums ka sequence increasing hai.

\sum a_{k}

converge karne ka kya matlab hai?

Uske partial sums

S_{n}

ka ek finite limit

S = lim_{n \to \infty} S_{n}

ho.

B

se bounded above" kya hota hai?

Har partial sum

\leq B

rahe;

B

ek ceiling hai jo kabhi nahi tooti.

Monotone Convergence Theorem batao.

Ek increasing sequence jo bounded above ho woh ek finite limit par converge karti hai.

Direct Comparison Test ke DONO halves batao.

Agar eventually

0 \leq a_{n} \leq b_{n}

ho: (1)

\sum b_{n}

converges

\Rightarrow \sum a_{n}

converges; (2)

\sum a_{n}

diverges

\Rightarrow \sum b_{n}

diverges.

Benchmark ke baare mein kaun si hypothesis kabhi nahi chhodna chahiye?

Tumhe benchmark ka fate pata hona chahiye — ki

\sum b_{n}

converges (convergence half) ya

\sum a_{n}

diverges (divergence half).

Kis

p

ke liye

\sum 1/ n^{p}

converge karta hai?

p > 1

ke liye;

p \leq 1

diverge karta hai — harmonic case

p = 1

diverge karta hai.

Kis

r

ke liye

\sum r^{n}

converge karta hai?

∣ r ∣ < 1

ke liye.

DCT directly sign-changing terms par kyun apply nahi hota?

Partial sums decrease ho sakte hain, isliye woh increasing nahi hote aur Monotone Convergence use nahi ho sakta.