the n-by-n Wronskian

Suppose someone hands you n solutions of a homogeneous equation and asks, 'Are these genuinely independent, or is one secretly a combination of the others?' Checking by eye gets hopeless past two functions. The Wronskian is a single number — computed from the functions and their derivatives — that answers this question with one calculation. At order two it was a 2-by-2 determinant; at order n it is an n-by-n one.

Here is how it is built. Stack the n functions in the top row, their first derivatives in the next row, then second derivatives, on down to the (n-1)th derivatives in the bottom row, forming an n-by-n matrix. The Wronskian W(y1, ..., yn)(x) is the determinant of that matrix. The test: if the functions are solutions of the same nth-order homogeneous linear equation on an interval, then they are linearly independent exactly when their Wronskian is nonzero somewhere on the interval — and a beautiful dichotomy holds, that for such solutions the Wronskian is either identically zero on the whole interval or never zero there. A nonzero Wronskian therefore certifies a fundamental set: n solutions that span the full n-dimensional solution space.

This matters because it converts a hard, abstract question (independence of functions) into a concrete, mechanical one (evaluate a determinant). It also feeds the higher-order variation of parameters formula, where Wronskian-type determinants supply the building blocks of a particular solution. One honest caution: the clean either-zero-or-never-zero dichotomy is a theorem ABOUT SOLUTIONS of a common linear ODE — for arbitrary functions a vanishing Wronskian at a point does not by itself prove dependence.