4.4.10 · D2 · HinglishMultivariable Calculus

Visual walkthroughGradient as direction of steepest ascent

2,389 words11 min read↑ Read in English

4.4.10 · D2 · Maths › Multivariable Calculus › Gradient as direction of steepest ascent

Hum assume karte hain ki tum bas yeh jaante ho: ek function zameen par har point ke liye ek height deta hai. Baaki sab — slopes, dot products, "fastest" — hum chalte chalte earn karenge.


Step 1 — Ek hill ek height map hoti hai

KYA HAI. Ek landscape imagine karo. Flat zameen par har jagah ka ek address hai: kitna east () aur kitna north (). Function tumhe ek number wapas deta hai — us jagah ki zameen ki height.

KYUN. Pehle "steepest" ki baat karne se pehle, humein koi cheez chahiye jisme steepness ho. Height map wahi cheez hai. Hum isse do tareekon se draw karte hain: ek 3-D surface ke roop mein, aur ek contour map ke roop mein — woh flat top-down view jisme hum same height waale saare points ko ek loop se jodte hain, bilkul hiking map ki tarah.

PICTURE. Left panel mein 3-D hill hai (ek bowl). Right panel mein wahi hill seedha upar se dekhi gayi hai: har pale-blue loop ek level curve hai, yani aisi points ka set jo sab ek hi fixed height par hain. Loops paas paas = steep zameen; loops door door = gentle zameen.

Figure — Gradient as direction of steepest ascent

Step 2 — "Ek direction kya hoti hai?" — unit arrow

KYA HAI. Ek point par khade hokar, tum infinitely many directions mein chal sakte ho. Hum har direction ko ek chhota arrow se label karte hain. Yahan batata hai ki step ka kitna hissa east ki taraf gaya, kitna north ki taraf.

KYUN. Hum directions ko fair tarike se compare karne wale hain. Agar ek arrow lamba hota aur doosra chhota, toh lamba arrow height zyada change karta dikhta — sirf isliye ki woh bada step hai — na ki isliye ki woh direction genuinely steeper hai. Toh hum force karte hain ki har direction-arrow ki same length ho, exactly 1. Woh length likhi jaati hai.

Yahan squared length hai (east-leg + north-leg, ek right triangle), aur square root isse wapas length mein convert karta hai. Isse set karne par har arrow radius one ke circle par aa jaata hai.

PICTURE. Saare candidate direction-arrows point se fan out karte hain; unki tips yellow unit circle trace karti hain. Har arrow ek fair, equal-length step hai.

Figure — Gradient as direction of steepest ascent

Step 3 — Ek arrow ke saath height kitni tezi se badlti hai?

KYA HAI. Pehle, ek shorthand: starting point ko har baar pair likhne ki jagah, hum un do numbers ko ek single position vector mein bundle karte hain aur isse ==== kehte hain — ek bold letter jo us point ko represent karta hai jahan tum khade ho. Ab ek direction chuno. Size ka ek chhota step us direction mein lo, toh tum new point par pahunch jaate ho (start, plus direction arrow ka hissa). Dekho ki height kitni badi, phir divide karo kitna chale usse. Step ko zero tak shrink karo. Woh limiting ratio hi directional derivative hai.

Yahan woh point hai jahan se shuru karte ho, woh point hai length ka step direction mein lene ke baad. Numerator height mein change hai; denominator chal kar ki gayi distance hai. Rise over run — ek slope.

KYUN limit? Kyunki hill curve karti hai. Bade step par slope constant nahi hoti, toh bada-step ratio ek average hoga, na ki yahaan ka actual slope. shrink karna zoom in karta hai jab tak zameen flat nahi lagti aur ratio ek honest number par settle ho jaata hai: us exact jagah us direction mein steepness.

PICTURE. Hum hill ko arrow wali vertical plane se slice karte hain. Cut edge ek 1-D curve hai; us point par us curve ka slope hai (pink tangent line).

Figure — Gradient as direction of steepest ascent

Step 4 — Infinitely many limits lena band karo: chain rule

KYA HAI. Infinitely many arrows mein se har ek ke liye woh limit fresh calculate karna hopeless hai. Iske bajay, direction mein seedhi line par chalo aur us par height ko kaho. Starting point ko components mein ==== likho, toh uski east-coordinate hai aur uski north-coordinate. Direction mein distance step lene ke baad, tumhari east-coordinate hai aur north-coordinate :

Ab ek ordinary ek-input function of hai, aur hai.

KYUN. Jaise badta hai, dono aur drift karte hain. Multivariable Chain Rule kehta hai ki height mein total change = ke move karne se aaya change, plus ke move karne se aaya change:

Yahan (ek partial derivative, likha jaata hai) woh slope hai agar sirf east mein move karte; isliye kyunki har unit of ke liye se badhta hai. North ke liye same story. set karne par sab kuch starting point par evaluate ho jaata hai:

PICTURE. ke saath total slope do known slopes se banta hai: east slope ko multiply karo step ka kitna hissa eastward hai () se, plus north slope ko se.

Figure — Gradient as direction of steepest ascent

Step 5 — Dot product pehchano

KYA HAI. Numbers ki dono lists ko align karo. Partials ko ek arrow mein collect karo, gradient . Phir bilkul wahi hai jo ka ke saath dot product hai:

KYUN matter karta hai. Dot product "matching components multiply karo, add karo" hai. Lekin iska ek doosra, geometric face bhi hai — aur wahi face agले step mein poora answer unlock karta hai.

PICTURE. Point se do arrows: ==pale-yellow gradient aur unit circle par blue direction ==, unke beech angle mark kiya hua.

Figure — Gradient as direction of steepest ascent

Step 6 — Dot product ka geometric face

KYA HAI. Pehle us quantity ko naam do jo hum abhi use karne wale hain: == ko do arrows aur ke beech ka angle maano== — kitna tum ek arrow ko rotate karte toh woh doosre ke saath line up hota (yeh wahi angle hai jo Step 5 picture mein draw hua hai). Kisi bhi do arrows ke liye, dot product unki lengths ka product times us angle ka cosine bhi hota hai:

Kyunki hai (Step 2), yeh drop out ho jaata hai. Toh

KYUN cosine? Cosine alignment measure karta hai. Jab do arrows same direction mein point karte hain (), (full agreement). Right angle par (), (koi agreement nahi). Opposite (), . Yeh exactly woh "yeh do arrows kitna agree karte hain?" dial hai jo humein chahiye.

PICTURE. Ek single dial: jaise circle ke aas paas swing karta hai, uska aur fixed gradient ke beech angle badlta hai, aur value upar neeche hoti hai. Sirf ek cheez change kar sakte ho ; is point par hill ka fixed property hai.

Figure — Gradient as direction of steepest ascent

Step 7 — Kaun sa direction jeetta hai? (payoff)

KYA HAI. Hum woh chahte hain jo ko as large as possible banaye. Sirf ek free knob hai , aur sabse bada hota hai — ke barabar — jab hota hai. Toh winning direction woh hai jo ke same taraf point kare.

Yahan ko apni length se divide karne par woh length tak shrink ho jaata hai — ek unit arrow gradient ki taraf point karta hua. Maximum rate bas hi hoti hai.

KYUN yeh sab settle kar deta hai. Koi arithmetic nahi, koi calculus of variations nahi — cosine simply se zyada nahi ho sakta, aur woh hit karta hai sirf ke along. Bas wahi ek fact hi "steepest ascent = gradient direction" hai.

PICTURE. Directions ka compass jo ke hisaab se colour-graded hai: bilkul ke along sabse bright (upar), usse opposite sabse dark (neeche).

Figure — Gradient as direction of steepest ascent

Step 8 — Baaki cases (kuch bhi uncovered nahi)

KYA HAI. Wahi formula ko doosre special angles par padho, aur us ek jagah par jo formula toot jaata hai.

kya hota hai
sabse steep ascent (gradient ke upar)
height nahi badlti → level curve ke saath chalna
sabse steep descent (; yeh hai Gradient Descent (Machine Learning))

Perpendicular fact. par height nahi badlti, toh woh direction hi level curve ki tangent hai. Kyunki woh se right angle par hoti hai, gradient har level curve se perpendicular hota hai. Isliye contour map par uphill arrow hamesha contours ko par cross karta hai.

Degenerate case: . Agar dono partials vanish ho jaayein, toh , isliye har direction ke liye — zameen momentarily flat hai (ek peak, ek valley floor, ya ek saddle). Koi steepest direction nahi hai, aur formula undefined hai kyunki zero se divide nahi kar sakte. Yeh woh ek input hai jahan "upar point karo" ka koi jawab nahi hai, aur maths honestly ek dene se mana kar deta hai.

PICTURE. Left: gradient pale-blue contours ko right angles par cross karta hua. Right: ek flat spot jahan — arrow ek dot mein collapse ho jaata hai aur saari directions equally (un)steep hain.

Figure — Gradient as direction of steepest ascent

Ek-picture summary

KYA HAI. Ek figure poori chain ko tie karta hai: gradient arrow wala ek contour map, unit directions ka fan jo unke se coloured hai, aur woh chhota " dial" jo winner decide karta hai.

Figure — Gradient as direction of steepest ascent

Ek saanss mein logic: directional derivative (chain rule) (dot product ki geometry) , equality sirf tab jab ke saath align ho.

Recall Feynman: kisi dost ko fog mein batao

Tum ek foggy hill par ho aur sirf paon ke neeche slope feel kar sakte ho. Sochte ho: kaun sa raasta sabse steep upar hai? Har direction try karna aur slope measure karna (yahi directional derivative hai) forever lag jaayega. Toh tumhe ek shortcut dikha: kisi bhi direction mein slope = east-slope times kitna-east-jao plus north-slope times kitna-north-jao. Do slopes ko ek arrow mein bundle karo — gradient — aur woh sum exactly hai "tumhara walking arrow, gradient arrow se kitna agree karta hai". Agreement cosine se measure hota hai, jo par max hota hai jab dono arrows same taraf point karein. Toh sabse steep raasta upar sirf gradient ke saath hai, aur kitna steep hai woh gradient ki length ke barabar hai. Right angle par sideways chalo aur cosine hai — zameen flat rehti hai, isliye tum ab ek contour line par stroll kar rahe ho. Poora ghoom jaao aur tumhe sabse steep raasta neeche milega. Aur agar gradient zero arrow hai, toh zameen har direction mein flat hai aur koi "upar" hi nahi hai.


Connections