A SULUTION IN A NUTSHELL
Firstly lets put some order to this chaos of points and lines and.. planes...
Let A(0,0,0) and B(0,1,1) be the points of the "dashed line" which from now on we will call it line L1,
and C(0,1,0) and D( 1,0,0) be the points of the " dotted line" which from now on we will call it line L2.
The directing vector u of line L1 is u = <0,1,1> and a vector valued function of the line L1
is f (t) = < 0,t,t > , t ∈ ℜ
The directing vector v of line L2 is v = <1, -1 ,0 > and a vector valued function of the line L2
is g (s) = < 1+s, -s ,0 > , s ∈ ℜ
Any arbitrarily chosen point K on the line L1 is of the form K ( 0,t,t) and any arbitrarily chosen point Ω
on line L2 must be of the form Ω ( 1+s, -s ,0 ).
The distance d of points K and Ω is a real function of two variables t and s.
That is d (s, t ) = [ (1 +s)2 + (t +s)2 + t2 ]1/2
To minimize d suffices to minimize ζ (s, t ) = (1 +s)2 + (t +s)2 + t2
∂ ζ / ∂s = 4s +2t +2
∂ ζ / ∂t = 2s +4t
Solving the system 4s +2t +2=0 and 2s +4t =0 we obtain the critical point (s, t ) = (-2/3 , 1/3 )
Using the Second Derivative test we can safely conclude that at (-2/3 , 1/3 ) the function ζ has a minimum.
Therefore the function d (s, t ) has a minimum at ( -2/3, 1/3 ).
d( -2/3, 1/3 )= [ 1/9 + 1/9 +1/9 ] 1/2 = √3 /3
In addition we can be pinpoint the " points" K and Ω as being K ( 0, 1/3, 1/3 ) and Ω ( 1/3, 2/3, 0 ) that make
the distance between L1 and L2 the smallest .
Additionally calculating the vector KΩ = < 1/3 , 1/3, - 1/3 > easily can be verified that
KΩ is orthogonal to both u and v.

Dayv O.
nice work09/14/21