We prove that if is an uniformly bounded orthonormal system, then for all there is an estimate for its Kolmogorov widths: , . In the regime this provides the lower bound with a sharp exponent . Besides that, it follows that a good approximation of such ONS requires the dimension . Our second result is an approximation theorem for Fourier matrices of finite abelian groups (this includes the usual DFT matrices). For every there is such that any Fourier matrix of sufficiently large order has an approximation of rank with the row-wise -error at most ; the exponent is sharp. Consequences include the approximation of the same kind for circulant matrices; the approximation of the trigonometric functions , , is symmetric convex, with dimension and an optimal error ; bounds for widths of weighted Wiener classes.

生成讲解博客的中文版本

生成AI智能校验的中文版本