OurBigBook
About
$
Donate
Sign in
Sign up
Chebyshev polynomial domination lemma
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Analysis
Numerical analysis
Chebyshev polynomial
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
If
f
has degree at most
n
and
∣
f
∣
<
1
on
[
−
1
,
1
]
, alternation at the extrema of
T
n
implies
∣
f
(
t
)
∣
<
∣
T
n
(
t
)
∣
outside that interval.
Ancestors
(6)
Chebyshev polynomial
Numerical analysis
Analysis
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version