School of Technology and Computer Science Seminars

Weierstrass Polynomial Approximation Theorem for C[0,1] via Weak Law of Large Numbers

by Krishna B. Athreya (Iowa State University, USA)

Monday, July 25, 2016 from to (Asia/Kolkata)
at A-201 (STCS Seminar Room)
Description
Karl Wierstrass showed that given a continuous function f on [0, 1] and an epsilon positive there is a polynomial p such that it is uniformly epsilon close to f on [0, 1]. In this talk we give a proof  of this using coin tossing.  We then generalize this to the case of simplexes and hyper cubes. We also discuss approximation by C infinity functions using Gauss kernels.