Yeh page assume karta hai ki tumne pehle kuch nahi dekha. Isse pehle ki tum yeh line padh sako:
∀ε>0∃δ>0s.t.0<∣x−a∣<δ⇒∣f(x)−L∣<ε,
tumhe pata hona chahiye ki har ek mark ka matlab kya hai aur woh dikhta kaise hai. Hum unhe ek-ek karke build karenge, aisi order mein jahan koi cheez use hone se pehle earn ki jaati hai. Jab hum khatam karenge, toh woh line ek seedha English sentence ki tarah padhegi.
Shuru karo mathematics ki sabse simple picture se: ek seedhi horizontal line, jis par numbers marked hain. Left chhota hai, right bada hai.
Hum baar-baar is line par ek special jagah par wapas aayenge: woh value jis taraf input ja raha hai. Hum usse a kehte hain.
Topic ko iske zaroorat kyun hai: poora game a ke paas behaviour ke baare mein hai. Bina ek fixed landmark ke approach karne ke liye, "close" ka koi matlab nahi.
Toh hamare paas actually do lines hain: ek horizontal input line (jahan x aur a rehte hain) aur ek vertical output line (jahan f(x) land karta hai). Graph woh picture hai jo unhe connect karti hai.
Topic ko iske zaroorat kyun hai: limits un statements ke baare mein hain jo output f(x) kya karta hai jab input x, a ki taraf move karta hai.
Yeh pehla real tool hai. Hum baar-baar kehte rehte hain "close." Close ka matlab hai "chhoti distance." Toh hume do numbers ke beech distance measure karne ka ek clean tarika chahiye.
Agar x, 5 par hai aur a, 3 par hai, toh gap 2 hai. Agar x, 1 par hai aur a, 3 par hai, toh gap bhi 2 hai — lekin 1−3=−2, ek negative number. Distance kabhi negative nahi ho sakti, isliye hum sign hata dete hain.
Topic ko iske zaroorat kyun hai: "x, a ke close hai" aur "f(x), L ke close hai" dono honest inequalities ∣x−a∣<small aur ∣f(x)−L∣<small ban jaate hain.
Key move: distance ke baare mein ek inequality line par ek band (ek interval) draw karti hai.
Yeh same kyun hain? ∣x−a∣<δ kehta hai "x aur a ke beech gap δ se kam hai," iska matlab hai x zyada se zyada δ right par ho sakta hai (x<a+δ) ya zyada se zyada δ left par (x>a−δ). Do directions, ek band.
Topic ko iske zaroorat kyun hai: poori epsilon–delta definition do bands hai (ek output par, ek input par) aur unhe connect karne wala ek promise.
Ab do band half-widths ko naam do. Dono Greek letters hain, dono hamesha strictly positive hain (zero width ki band mein move karne ki koi jagah nahi hogi).
Topic ko iske zaroorat kyun hai: yeh do hi "kitna close" ki poori vocabulary hain. ε challenge hai; δ reply hai.
Yeh do symbols hi definition ko ek game banate hain, aur unka order sahi rakhna is page ka sabse important idea hai.
Definition ki spine hai:
whatever demand∀ε>0I can answer∃δ>0s.t. (the promise holds).
Topic ko iske zaroorat kyun hai: poora "challenge–response duel" aur proof recipe ("Let ε>0. Choose δ=…") kuch nahi sirf in quantifiers ko order mein padhna hai.
Definition mein, 0<∣x−a∣<δ⇒∣f(x)−L∣<ε promise hai: agar input tumhare δ-band ke andar land kare (aur a na ho), toh output ε-band ke andar guaranteed hai. Promise tab tooti jaati hai jab input ne mana kiya lekin output bahar chali gayi.
Topic ko iske zaroorat kyun hai: yahi exact link hai jo "input close" ko "output close" mein convert karta hai — poori definition ka dil.
Ab har ek mark earn ho gaya hai. Definition ko plain English mein dobara padho:
∀ε>0∃δ>0:0<∣x−a∣<δ⇒∣f(x)−L∣<ε
Recall Poora sentence, decoded
"Har ek output-tolerance ε ke liye (chahe kitna bhi tiny ho), ek input-allowance δexist karta hai aisa ki jab bhix, a ke aas-paas δ-band ke andar baithe lekin a khud na ho, f(x)guaranteed hai ki L ke aas-paas ε-band ke andar baithe."