TOPICS
Search

Haar Condition


The Haar condition holds for a set of vectors in Euclidean n-space if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each selection of n vectors from such a set is a basis for n-space.

In the function-space setting, let V be a vector space of finite dimension n>=1 consisting of real-valued continuous functions on an interval [a,b] with a<b. For a basis f_1,...,f_n of V and n distinct points x_1,...,x_n in [a,b], let the matrix M=(f_i(x_j))_(i,j=1)^n. The Haar condition requires the determinant to satisfy

 detM!=0

for every such choice of points. Equivalently, every nonzero function in V has at most n-1 distinct zeros in [a,b] (Powell 1981, pp. 313-316). Thus the evaluation vectors (f_1(x_j),...,f_n(x_j)) at n distinct arguments form a basis for R^n.

A system of functions satisfying the Haar condition is sometimes termed a Tchebycheff system (Cheney 1999).


Portions of this entry contributed by Ronald M. Aarts

Explore with Wolfram|Alpha

References

Cheney, E. W. Introduction to Approximation Theory, 2nd ed. Providence, RI: Amer. Math. Soc., 1999.Powell, M. J. D. "The Haar Condition." Appendix A in Approximation Theory and Methods. Cambridge, England: Cambridge University Press, pp. 313-316, 1981. https://doi.org/10.1017/CBO9781139171502.026.

Referenced on Wolfram|Alpha

Haar Condition

Cite this as:

Weisstein, Eric W., with contributions by Ronald M. Aarts. "Haar Condition." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HaarCondition.html

Subject classifications