This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)(Learn how and when to remove this template message)
are linearly independent for any choice of n distinct points x1, x2 ... xn in Ω. Equivalently, the collection is unisolvent if the matrix F with entries fi(xj) has nonzero determinant: det(F) ≠ 0 for any choice of distinct xj's in Ω.
- 1, x, x2 is unisolvent on any interval by the unisolvence theorem
- 1, x2 is unisolvent on [0, 1], but not unisolvent on [−1, 1]
- 1, cos(x), cos(2x), ..., cos(nx), sin(x), sin(2x), ..., sin(nx) is unisolvent on [−π, π]
Systems of unisolvent functions are much more common in 1 dimension than in higher dimensions. In dimension d = 2 and higher (Ω ⊂ Rd), the functions f1, f2, ..., fn cannot be unisolvent on Ω if there exists a single open set on which they are all continuous. To see this, consider moving points x1 and x2 along continuous paths in the open set until they have switched positions, such that x1 and x2 never intersect each other or any of the other xi. The determinant of the resulting system (with x1 and x2 swapped) is the negative of the determinant of the initial system. Since the functions fi are continuous, the intermediate value theorem implies that some intermediate configuration has determinant zero, hence the functions cannot be unisolvent.
- Philip J. Davis: Interpolation and Approximation pp. 31–32