Yahan second-derivative test kyun nahi? Kyunki hamare paas candidate points ki ek finite list hai aur hum bas actual values compare karte hain. Saddle vs. extremum classify karne ki zaroorat hi nahi — direct comparison jeet jaata hai.
f(x,y)=x2−2xy+2y ke absolute extrema D={0≤x≤3,0≤y≤2} par dhundho.
Step 1 — interior.fx=2x−2y=0,fy=−2x+2=0.Yeh step kyun? Interior extrema ko ek flat tangent plane chahiye, toh dono partials ko 0 set karo.
fy se: x=1. fx se: y=x=1. Point (1,1)D ke andar hai. ✓
f(1,1)=1−2+2=1.
Step 2 — boundary (4 edges).Kyun? Fence extremum hold kar sakti hai chahe interior flat-free ho.
Top y=2,0≤x≤3: f=x2−4x+4=(x−2)2. Critical x=2: f=0. Ends: f(0,2)=4,f(3,2)=1.
Left x=0,0≤y≤2: f=2y. Ends: f(0,0)=0,f(0,2)=4.
Right x=3,0≤y≤2: f=9−6y+2y=9−4y. Decreasing → ends: f(3,0)=9,f(3,2)=1.
Step 3 — compare. Candidate values: {1,0,9,0,4,0,4,9,1}.
abs max=9 at (3,0);abs min=0 at (0,0) and (2,2).Yeh step kyun? Hum finite candidate list mein se bas sabse bada aur sabse chhota pick karte hain.
Socho ek ऊबड़-खाबड़ trampoline ek fenced backyard ke upar khinchi gayi hai. Tum trampoline ke sabse oopar aur sabse neeche ke points chahte ho. Sirf do tarah ke spots ho sakte hain jo sabse oopar/neeche ho sakte hain: ya toh yard ke andar koi flat dimple, ya phir kahin fence ke saath. Toh tum saare flat dimples mark karo, phir poori fence ke saath chalo aur wahan ke bumps mark karo, aur finally ek kadam peeche ho ke jo tumne mark kiya uska sabse upar aur sabse neeche point dhundho. Ho gaya!
Kaunsa theorem guarantee karta hai ki absolute max & min exist karta hai?
Extreme Value Theorem — f ke liye jo closed aur bounded set D par continuous ho.
D mein guaranteed extrema ke liye kaunsi do properties chahiye?
Closed (boundary contain karta ho) aur bounded (ek disk mein fit ho).
Interior extremum ∇f=0 kyun force karta hai?
Agar ∇f=0 ho toh tum +∇f ke along move karke f badha sakte ho, toh woh max tha hi nahi (similarly min ke liye).
Absolute extrema ke liye 3-step recipe kya hai?
(1) Interior critical points ∇f=0D ke andar; (2) boundary par f ko 1-var mein reduce karo, crit pts + endpoints/corners dhundho; (3) saari values compare karo.
Kya hum absolute extrema ke liye Hessian second-derivative test use karte hain?
Nahi — hum sirf finite candidate list par actual function values compare karte hain.
Disk x2+y2=1 ki boundary par f ko simplify karne ki trick kya hai?
Constraint substitute karo aur/ya x=cost,y=sint parametrize karo taaki yeh 1-variable ho jaaye.
Corners/endpoints ko candidates mein kyun include karna zaroori hai?
Closed interval par ek 1-var function apne extrema endpoints par attain kar sakta hai, sirf jahan derivative zero ho wahan nahi.
Example 1 mein absolute max kahan tha aur uski value kya thi?
(3,0) par 9, boundary par (interior critical point par nahi).