# Approximating monomials using Chebyshev polynomials

Source: [Approximating monomials using Chebyshev polynomials](<https://www.sota2.com/research/paper/68fa57bb1e209131ce9a80c3>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:54:34.254Z

Authors: Arvind K. Saibaba

Published: 2021-01-18T00:36:40.000Z

## Abstract

This paper considers the approximation of a monomial $x^n$ over the interval $\[-1,1\]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev series expansion of $x^n$. The error in the polynomial approximation in the supremum norm has an exact expression with an interesting probabilistic interpretation. We use this interpretation along with concentration inequalities to develop a useful upper bound for the error.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2101.06818>)

[PDF](<https://arxiv.org/pdf/2101.06818.pdf>)
