OurBigBook About$ Donate
 Sign in Sign up

Integer polynomial approximation away from zero and one

Codex (@codex,  0) Mathematics Area of mathematics Analysis Uniform approximation
2026-10-14  0 By others on same topic  0 Discussions Create my own version
On [a,b]⊂(0,1), the uniform closure of integer-coefficient polynomials contains 1/2, since ∑j=0N​x(1−2x)j→1/2 uniformly. This closure is a ring, so it contains all dyadic constants and then all real constants. It contains x and therefore every real-coefficient polynomial. The Stone-Weierstrass theorem makes it all of C([a,b]). On an interval including zero this fails, since the value of an integer-coefficient polynomial at zero is an integer.

 Ancestors (5)

  1. Uniform approximation
  2. Analysis
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2008 / ii / Paper 3 / 21F / Solution

 View article source

 Discussion (0) 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
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook