The name comes from the original problem: among all closed curves of fixed perimeter (K= length =ℓ), find the one enclosing maximum area (J= area). Answer: a circle. "Iso-perimetric" = "same perimeter".
Recall WHY can't we just use the plain Euler–Lagrange equation?
Because plain E–L finds the stationary point over all admissible functions. Here we are only allowed to wander on the surfaceK[y]=ℓ. Free E–L would walk off that surface. We need to restrict variations to those that keep K fixed — that's exactly what the multiplier handles.
We want δJ=0 for variations δy that also keep K fixed, i.e. δK=0.
Step 1 — Use a TWO-parameter family. A single ϵη(x) won't work: one knob can't both vary J and respect the constraint. So take
y(x)=yˉ(x)+ϵ1η1(x)+ϵ2η2(x),
with η1(a)=η1(b)=η2(a)=η2(b)=0 (boundary values are fixed, so the bumps vanish at the ends).
Why this step? Two parameters give us enough freedom: we'll spend one degree of freedom satisfying the constraint and still have one left to demand stationarity.
Step 2 — Reduce to ordinary calculus. Now J and K become ordinary functions of two numbers:
Φ(ϵ1,ϵ2)=J[y],Ψ(ϵ1,ϵ2)=K[y].
At yˉ we sit at ϵ1=ϵ2=0. We want Φ stationary subject toΨ=ℓ. This is now a finite-dimensional constrained extremum — solved by ordinary Lagrange multipliers!
Why this step? We've converted a hard calculus-of-variations constraint into the familiar 2-variable multiplier problem we already know.
Step 3 — Apply ordinary multiplier rule. There exists λ such that
∇(Φ−λΨ)=0at (0,0),
i.e.
∂ϵi∂(Φ−λΨ)0=0,i=1,2.
Step 4 — Compute the derivatives. Using ∂ϵi∂f=fyηi+fy′ηi′ and integrating fy′ηi′ by parts (boundary terms die because ηi vanish at ends):
∂ϵi∂Φ0=∫ab(fy−dxdfy′)ηidx,
and similarly for Ψ with g. So the condition ∂ϵi(Φ−λΨ)=0 reads
∫ab[(fy−dxdfy′)−λ(gy−dxdgy′)]ηidx=0.
Step 5 — Fundamental Lemma. Define F=f−λg. The bracket is (Fy−dxdFy′). Since η2 is essentially arbitrary (after η1 is used to fix the constraint), the fundamental lemma of CoV forces the bracket to vanish everywhere.
A chain of fixed length ℓ hangs between two posts. It settles to minimise potential energy∝ height of centre of mass, i.e. minimise
J=∫aby1+y′2dxsubject to lengthK=∫ab1+y′2dx=ℓ.
Step 1 — Augment.f=y1+y′2, g=1+y′2, so
F=f−λg=(y−λ)1+y′2.Why?F folds the constraint in; now we solve unconstrained.
Step 2 — Use Beltrami (since F has no explicit x).F−y′Fy′=C. Compute Fy′=(y−λ)1+y′2y′, so
(y−λ)1+y′2−(y−λ)1+y′2y′2=1+y′2y−λ=C.Why Beltrami? It's a first integral that saves us one integration whenever x is absent.
Step 3 — Solve.y−λ=C1+y′2. Separate and integrate to get
y(x)=λ+Ccosh(Cx−x0).
The shape is a catenary (a cosh). Constants λ (vertical shift), C, x0 are fixed by the two endpoints and the length condition ∫1+y′2=ℓ.
Among curves y(x) from (−a,0) to (a,0) of fixed arc-length ℓ, maximise enclosed area
J=∫−aaydxsubject toK=∫−aa1+y′2dx=ℓ.
Step 1 — Augment.F=y−λ1+y′2.
Why?f=y, g=1+y′2.
Step 2 — Beltrami (x absent): F−y′Fy′=C.
Fy′=−λ1+y′2y′, so
y−λ1+y′2+λ1+y′2y′2=y−1+y′2λ=C.
Step 3 — Solve.1+y′2λ=y−C. Let u=y−C. Then 1+y′2=λ2/u2⇒y′2=(λ2−u2)/u2, giving
λ2−u2udu=±dx⇒−λ2−u2=±(x−x0).
Square: (x−x0)2+(y−C)2=λ2. A circular arc!Why this confirms intuition: fixed perimeter → maximum area → circle, exactly the classic isoperimetric result. The multiplier λ turned out to be the radius.
Imagine you have a fixed length of string and you want to enclose the biggest possible playground. You try squares, triangles, blobs… and it turns out a perfect circle wins every time. Now, how does math find that? There's a clever trick: instead of carefully keeping your string length exactly right while you search (hard!), you pretend there's a "fine" λ for every extra bit of string used. You add this fine to the thing you're maximising, then you're allowed to search freely. After finding the best shape, you tune the fine λ until the string length comes out exactly right. That fine is the Lagrange multiplier, and the free search is just the ordinary Euler–Lagrange equation.
Dekho, isoperimetric problem ka matlab simple hai: tumhe ek functional J[y]=∫fdx ko maximise ya minimise karna hai, lekin ek constraint ke saath — doosra integral K[y]=∫gdx fixed rehna chahiye (jaise rope ki length fixed, ya perimeter fixed). Classic example: utni hi fence se sabse bada khet banao — answer hamesha circle aata hai.
Ab trick yeh hai — constraint ko zabardasti maintain karte hue search karna mushkil hai. Toh hum bribe karte hain: ek number λ (Lagrange multiplier) leke, naya integrand banate hain F=f−λg. Iske baad bilkul normal Euler–Lagrange equation laga do: Fy−dxdFy′=0. Bas! Constraint apne aap handle ho jaata hai. Yeh same Lagrange multiplier idea hai jo tumne functions ke max-min me dekha tha, bas yahan points ki jagah poore function pe kaam kar raha hai.
Counting bhi yaad rakho: solution me teen unknown aayenge — do constants (C1,C2) aur ek λ. Inhe fix karne ke liye teen condition: do boundary condition aur ek constraint ∫gdx=ℓ. λ ka physical matlab "shadow price" hai — agar tum budget ℓ thoda badhao, toh optimum kitna improve hoga, woh rate λ batata hai.
Do mast examples: (1) chain hang karti hai fixed length ke saath, energy minimise karke shape catenary (cosh) banta hai. (2) Fixed perimeter me area maximise karo, toh circle (arc) milta hai — multiplier λ to seedha radius nikalta hai! Jab bhi F me explicit x na ho, Beltrami identityF−y′Fy′=C use karke ek integration bacha lo. Mnemonic: Bribe, Apply EL, Boundary, Constraint = BAB-C.