The Müntz–Szász theorem is a basic result of approximation theory, proved by Herman Müntz in 1914 and Otto Szász (1884–1952) in 1916. Roughly speaking, the theorem shows to what extent the Weierstrass theorem on polynomial approximation can have holes dug into it, by restricting certain coefficients in the polynomials to be zero. The form of the result had been conjectured by Sergei Bernstein before it was proved.

The theorem, in a special case, states that a necessary and sufficient condition for the monomials

${\displaystyle x^{n},\quad n\in S\subset \mathbb {N} }$

to span a dense subset of the Banach space C[a,b] of all continuous functions with complex number values on the closed interval [a,b] with a > 0, with the uniform norm, is that the sum

${\displaystyle \sum _{n\in S}{\frac {1}{n}}\ }$

of the reciprocals, taken over S, should diverge, i.e. S is a large set. For an interval [0, b], the constant functions are necessary: assuming therefore that 0 is in S, the condition on the other exponents is as before.

More generally, one can take exponents from any strictly increasing sequence of positive real numbers, and the same result holds. Szász showed that for complex number exponents, the same condition applied to the sequence of real parts.

There are also versions for the L_p spaces.

See also

• Erdős conjecture on arithmetic progressions

References

• Müntz, Ch. H. (1914). "Über den Approximationssatz von Weierstrass". H. A. Schwarz's Festschrift. Berlin. pp. 303–312.{{cite book}}: CS1 maint: location missing publisher (link) Scanned at University of Michigan
• Szász, O. (1916). "Über die Approximation stetiger Funktionen durch lineare Aggregate von Potenzen". Math. Ann. 77 (4): 482–496. doi:10.1007/BF01456964. S2CID 123893394. Scanned at digizeitschriften.de
• Shen, Jie; Wang, Yingwei (2016). "Müntz-Galerkin methods and applications to mixed Dirichlet-Neumann boundary value problems". SIAM Journal on Scientific Computing. 38 (4): A2357–A2381. Bibcode:2016SJSC...38A2357S. doi:10.1137/15M1052391.