Is page mein kuch bhi assume nahi kiya gaya. parent note ka har squiggle yahan ground up se build kiya gaya hai, ek aisi order mein jahan har symbol earn hota hai pehle agle symbol ke use se. Upar se neeche padho.
Picture.R1 ek line hai. R2 ek flat sheet hai — ek point (x1,x2) hota hai, ek address "daayein x1 jao, upar x2 jao". R3 aapke aas-paas ki space hai. 3 se aage draw nahi kar sakte, lekin rules bilkul same rehte hain, isliye hum R2 picture karte hain aur trust karte hain.
Topic ko iski zaroorat kyun hai. Optimization poochhta hai "kaun sa point best hai?" — yeh tab tak nahi pooch sakte jab tak pata nahi ki "point" kya hai aur woh kis "space" mein rehta hai. Baaki sab Rn ke upar decoration hai.
"θx+(1−θ)y" ka sense banane se pehle, humein pata hona chahiye ki ek point ko stretch karna aur do points ko add karna matlab kya hai. Yeh do operations Rn ki poori grammar hain.
Yeh kaisa dikhta hai — figure padho. Figure mein x ko 21x tak scale kiya gaya hai (chhota, same direction), aur do arrows tip-to-tail add kiye gaye hain. Ek baar aap stretch aur add kar sakte hain, toh aap koi bhi mix θx+(1−θ)y bana sakte hain: x ko θ se scale karo, y ko 1−θ se scale karo, phir do scaled arrows add karo.
Topic ko iski zaroorat kyun hai. Har convex combination, har gradient step, har chord literally "scale, phir add" hai. Yahi do moves hain; chapter ka baaki hissa bas clever numbers choose karta hai scale karne ke liye.
Ab is poore chapter ka sabse important construction: do points ke beech ka line segment, ek knob θ ke saath likha gaya jise aap slide kar sakte hain. Yeh purely Section 1 ke scale-and-add operations se bana hai.
Yeh kaisa dikhta hai — figure padho. Jaise θ0 se 1 tak slide karta hai:
θ=0 par: point 0⋅x+1⋅y=y hai (aap y par khadhe hain),
θ=1 par: point 1⋅x+0⋅y=x hai (aap x par pahunch gaye),
θ=21 par: point 21x+21y hai, exact midpoint.
Toh formula y se x tak ke straight segment ko trace karta hai, aur θ us par aapki position hai. Do weights θ aur 1−θ hamesha 1 mein add hote hain — yahi "adds to 1" exactly aapko segment par rakhta hai aur kabhi usne door nahi hone deta.
Topic ko iski zaroorat kyun hai. "Koi dent nahi, koi hole nahi" — yeh symbols mein kehna hoga. Iske liye ek hi tool hai: do points lo, unke beech ka straight segment chalo, poochho ki segment andar rehta hai ya nahi. Yahi sawaal convexity hai.
Yeh kaisa dikhta hai. Arrow a fix karo. Equation a⊤x=b (ek fixed number b ke liye) ek flat wall draw karta hai — 2-D mein ek line, 3-D mein ek plane — a ke "right angles" par. b upar-neeche slide karne se woh wall parallel mein shift ho jaati hai. Figure dekho: arrow a wall ke aaar-paar point karta hai, aur a⊤x maapata hai ki point xa ki direction mein kitna dur gaya hai.
Topic ko iski zaroorat kyun hai. Half-space flat boundary wala sabse simple possible convex region hai. Bahut saare stack karo ("intersect" karo) aur tum ek polyhedron nikaalte ho — har linear program ka feasible region. Isliye a⊤x≤b woh atom hai jisse convex feasible regions bante hain. Dot product norms aur inner products mein aur gradient (Section 6) mein bhi aata hai.
Yeh kaisa dikhta hai.{x:∥x∥≤r} = "centre se r distance ke andar saare points" = ek filled ball (2-D mein disk). {x:∥x∥=r} = "exactlyr distance par points" = sirf rim. Same r, wildly different sets — filled disk convex hai, rim nahi.
Topic ko iski zaroorat kyun hai. Balls convex set ka standard example hain, aur norm function f(x)=∥x∥triangle inequality se bana convex function ka standard example hai:
∥u+v∥≤∥u∥+∥v∥("detour kabhi seedha jaane se chhota nahi hota").
Yahi picture hai "every norm is convex" ke peeche, aur yeh seedha Norms and Inner Products se link karta hai.
Yeh kaisa dikhta hai — figure padho. Bowl-shaped graph par do points lo aur unke beech chord draw karo. Convex function ke liye chord curve ke upar ya curve par baitta hai (bowl kabhi apni khud ki strings se upar bulge nahi karta). Epigraph — curve ke upar ki sand — toh ek dent-free region hai, yaani ek convex set. Yahi is poore topic ka deep secret hai: ek function convex hai exactly tab jab uska "above-region" ek convex set hai. Ek idea, do hats.
Topic ko iski zaroorat kyun hai. Yeh inequality is poore chapter ka engine hai: yeh "koi fake dips nahi" force karti hai, isliye convex function ka exactly ek bottom hota hai.
Calculus se convexity test karne ke liye humein landscapes ke liye "slope" aur "curvature" chahiye.
Second derivative kyun, first kyun nahi? Convexity bending ke baare mein hai, tilting ke nahi. Ek straight ramp tilt karta hai (f′=0) lekin bend nahi karta (f′′=0) — aur ek ramp convex hai. Sirf second derivative bend dekhta hai, jo exactly "bowl-shaped" ka matlab hai. Isliye curvature test f′′ use karta hai, f′ nahi.
Isliye first-order convexity test f(y)≥f(x)+∇f(x)⊤(y−x) is tarah dikhta hai: right-hand side flat tangent plane ka prediction hai, aur convex ka matlab hai true surface hamesha us flat prediction ke upar baitta hai. Yeh woh object bhi hai jise Gradient Descent downhill follow karta hai (∇f ke against chalo).
Topic ko iski zaroorat kyun hai. Ek se zyada dimension mein ek surface ek axis ke along upar aur doosre ke along neeche curve kar sakti hai (saddle). Ek single number yeh capture nahi kar sakta; Hessian aur test ⪰0 kar sakta hai, direction by direction, v⊤Mv ke through.