With , substitute into the plane constraints. They become and , giving
The Pythagorean theorem for the two orthogonal terms in then gives the closest distance
Zero values of either scalar are allowed, including zero distance if both planes contain the origin.
The squared Euclidean distance along the line is
Its minimum occurs at exactly when its derivative there vanishes, so . Since are independent, their linear span is the two-dimensional orthogonal complement of . Consequently
for unique real . This is the closest point on the intersection of two planes; the positive quadratic coefficient proves that the stationary distance is a strict global minimum.
Apply the vector triple product identity and the two plane constraints:
Put . If is one intersection point, subtraction gives , so is parallel to . Conversely, adding any multiple of preserves both plane constraints because is orthogonal to both normal vectors. The whole intersection is therefore
Such an exists: choose and solve the two-by-two linear system with determinant . This also proves sufficiency rather than assuming a nonempty intersection.
The nonzero vectors are normal vectors to the two planes. If , then for some nonzero real . Their equations are therefore and .
When , the planes coincide and their intersection is an entire plane. Otherwise they are distinct parallel planes and have no intersection. Neither case has exactly a line as its intersection. Hence is necessary for intersection in a line. It means that the two normal vectors are not parallel; in that case it is also sufficient.
The integrating factor is , giving . The required antiderivative is
After dividing by , the general solution is the oscillatory term plus . The initial condition fixes , so
The real, nonzero parameters ensure ; direct substitution verifies both the equation and .
Let and . Their cross partial derivatives agree: . More directly, construct the scalar function
This exhibits the expression as an exact differential. Along a solution of the differential equation,
Thus the general solution is
For , the graph also extends smoothly through and satisfies the original, undivided equation there. Nonzero cannot extend through zero as a finite-valued differentiable solution. The extra vertical component of the implicit zero-level equation is not a graph on an interval and is not an additional solution of this ordinary differential equation.
Work on an interval with . The homogeneous first-order differential equation becomes a separable differential equation under : substituting gives , hence .
For , integration gives . Renaming the arbitrary constant produces
For the nonzero family the denominator must remain nonzero, so take any connected interval avoiding both and . The zero solution must be restored after division by ; by the Picard-Lindelöf theorem away from , a solution cannot switch between zero and a nonzero branch there.
Using the exponential definition of hyperbolic cosine, multiply by the nonzero quantity . This yields , hence .
If , its complex modulus requires , so ; its phase then requires . Thus all complex solutions are
There are no real solutions, since real .
Set , so . The binomial theorem gives
Use and to obtain
This is a finite Fourier sine series, with only odd harmonics.
Write a square root as , with real. Equating the real part and imaginary part of its square gives and . Taking complex modulus also gives . Therefore
Since , the signs agree. The two roots are
The changes both signs together, rather than independently.
For , orthogonality to the image of a matrix would require
The second component forces , but then the third component is . Equivalently, the last two required zero components always sum to . Therefore there are no such values of .
Use orthogonality to the image of a matrix. For , the condition is , since must vanish for every nonzero input. Direct multiplication gives
Each coefficient must vanish; choosing the three coordinate basis vectors as inputs already proves necessity. Solve , to obtain
These values make every output have zero dot product with , including any zero output. Here orthogonality is understood in this algebraic sense; no direction is assigned to the zero vector.
With , , , substitute into the matrix equations. The equations reduce to and , with the latter repeated. Taking gives the complete null space
The two independent rows impose two constraints on three unknowns, leaving exactly one free parameter. This also includes the zero solution at .
Collecting the coefficients gives the coefficient matrix
A square homogeneous linear system has a nonzero solution precisely when its matrix is a singular matrix. Expanding the determinant down the first column,
Hence the necessary and sufficient condition is or or . A zero determinant gives a nontrivial kernel of a linear map; otherwise multiplication by the matrix inverse would force the zero solution.
Multiply the two displayed equations by and subtract the one with indices reversed. The product terms combine into the Lagrange identity for a Sturm-Liouville operator:
Integrating from zero to infinity gives
All factors are polynomials. The endpoint term at zero vanishes because of the factor , and the one at infinity vanishes because the exponential function dominates every polynomial. Therefore, if ,
The integral is absolutely convergent. This is orthogonality in the weighted inner product with weight ; the boundary cancellation is the self-adjoint mechanism behind the Laguerre differential operator on polynomials.
Differentiating gives . Applying the Leibniz rule times to this identity gives
Only two terms survive on each side because the multiplying factors are linear. Rearranging yields . Since , the next two derivatives are and . Substituting and cancelling gives
This is deriving the Laguerre equation from Rodrigues' formula, exhibiting as an eigenfunction of the Laguerre differential operator on polynomials.

There are unlisted articles, also show them or only show them.