In this section we will look at trying to find a function $y(x)$ within $[a,b]$ which minimizes a quantity

💃 Example: the shortest distance from $(0,0)$ to $(1,1)$

<aside> 🍍

Functional: An operator which takes as input a function and outputs a number

</aside>


🗒️ Note: more generally to solve we apply small variations to minimise the path

💃 Example: Consider $y=x+\epsilon x(1-x)$ for the bounds $(0,0)$ to $(1,1)$ then here $\epsilon$ is our small varying parameter and $\eta(x)=x(1-x)$ is our varying function. If we derive the expression w.r.t to $\epsilon$ we see that setting $\epsilon$ to 0 recovers the differential equation for $y_\text{min}(x)$ which is of course our straight line from $(0,0)$ to $(1,1)$: $y=x$

image.png


Putting this into proper formalism we can look at the following

💼 Case: consider a path $y(x)$ which satisfies endpoint point constraints at $(a,y(a))$ and $(b,y(b))$ and another path $\eta (x)$ for which $\eta(a)=\eta(b)=0$


💼 Case: going back to considering our path length problem $F$ doesn't\ depend on $x$ or $y$ so


Now this is very useful and we can use it for many problems, here is what to consider

🗒️ Notes: