The function to be minimized is the square of the distance
f(x,y,z)=x2+y2+z2 subject to the constraints
g(x,y,z)=x+y+z=1 and
h(x,y,z)=x2+y2=1.
The first thing I would notice is that, since
x2+y2=1, the function to be minimized reduces to
f(z)=1+z2. That is minimized when z= 0. And the condition that x+ y+ z= 1 means that x+ y= 1 so y= 1- x. Using, again,
x2+y2=1, we have
x2+1−2x+x2=2x2−2x+1=1. So
2x2−2x=2x(x−1)=0.
x=0, in which case
y=1 or
x=1, in which case
y=0.
The solutions are
(0,1,0) or
(1,0,0).