Solve for $a,b,c,d \in \Bbb R$, given that $a^2+b^2+c^2+d^2-ab-bc-cd-d+\frac 25 =0$ Today, I came across an equation in practice mock-test of my coaching institute, aiming for engineering entrance examination (The course for the test wasn't topic-specific, it was a test of complete high school mathematics). It was having four variables and only one equation. While analyzing my test paper, this is the only problem I (and my friends too) couldn't figure out even after giving this problem several hours. So I came here for some help.

Question : Solve for $a,b,c,d \in \Bbb R$, given that $$a^2+b^2+c^2+d^2-ab-bc-cd-d+\frac 25 =0$$

Since only one equation is given, there must be involvement of making of perfect squares, such that they all add up to $0$. Thus, resulting in few more equations. But how to?
I tried a lot of things, such as making $(a-b)^2 $ by adding the missing terms and subtracting again, but got no success.
Thanks!

Multiply by $2$ and rearrange to \begin{align*}(a-b)^2 + (b-c)^2 + (c-d)^2 + (d-a)^2 + 2ad - 2d + \frac{4}{5} = 0. \tag{$\star$}\end{align*} For fixed $a$ and $d$, the minimum value of $(a-b)^2 + (b-c)^2 + (c-d)^2$ is $\frac{(d - a)^2}{3}$,  with equality if and only if $a, b, c, d$ is an arithmetic progression by the lemma below, so the LHS of $(\star)$ is at least $$\frac{4}{3} (d-a)^2 + 2ad - 2d + \frac{4}{5} = \frac{4}{3} \left( a - \frac{d}{4} \right)^2 + \frac{5}{4} \left( d - \frac{4}{5}\right)^2 \tag{$\dagger$}.$$
But $(\dagger)$ is clearly non-negative, and it is zero if and only if $d = 4/5$ and $a = d/4 = 1/5$, but the LHS of $(\star)$ must be zero. From this, $b = 2/5$ and $c = 3/5$ follow, and there can be no other solution.
Lemma. For fixed $x_0$ and $x_n$, the sum $\sum_{i=1}^n (x_i - x_{i-1})^2$ is minimized when the $x_i$ form an arithmetic progression $x_i = \frac{n-i}{n} x_0 + \frac{i}{n} x_n$.
Proof. For $n = 2$, $(x_0 - x_1)^2 + (x_1 - x_2)^2$ can be rearranged as $$ \left( x_1 - \frac{x_0 + x_2}{2} \right)^2 +x_0^2 + x_2^2 - \frac{(x_0 + x_2)^2}{4}. $$
For $n > 2$, if some $x_k$ is not the midpoint of $x_{k-1}$ and $x_{k+1}$, then $(x_k - x_{k-1})^2 + (x_{k+1} - x_k)^2$ can be reduced by moving $x_k$ to the midpoint, leaving the other terms of $\sum_{i=1}^n (x_i - x_{i-1})^2$ alone. So if a minimum exists, it must have evenly spaced $x_i$. And proving that a minimum exists is simple: the possible values of $x_1, \ldots, x_{n-1}$ that can minimize $f(x_1, \ldots, x_{n-1}) = \sum_{i=1}^n (x_i - x_{i-1})^2$ can be bounded in some closed interval $[-R, R]$, and the image of a connected compact set $[-R, R]^n$ under a continuous function $f$ must be compact and connected (that is, a closed bounded interval).
This lemma can be interpreted physically as stating that the potential energy of a chain of $n$ identical springs with unstretched length zero, with the endpoints of the whole chain anchored, is minimized (and thus the forces at each spring endpoint are in equilibrium) when each spring is stretched equally. Here, $x_0$ and $x_n$ are the fixed endpoints, and $x_{i-1}$ and $x_i$ are the endpoints of the $i$th spring.
