English

New coins from old, smoothly

Probability 2011-04-06 v3 Classical Analysis and ODEs

Abstract

Given a (known) function f:[0,1](0,1)f:[0,1] \to (0,1), we consider the problem of simulating a coin with probability of heads f(p)f(p) by tossing a coin with unknown heads probability pp, as well as a fair coin, NN times each, where NN may be random. The work of Keane and O'Brien (1994) implies that such a simulation scheme with the probability p(N<)\P_p(N<\infty) equal to 1 exists iff ff is continuous. Nacu and Peres (2005) proved that ff is real analytic in an open set S(0,1)S \subset (0,1) iff such a simulation scheme exists with the probability p(N>n)\P_p(N>n) decaying exponentially in nn for every pSp \in S. We prove that for α>0\alpha>0 non-integer, ff is in the space Cα[0,1]C^\alpha [0,1] if and only if a simulation scheme as above exists with p(N>n)C(Δn(p))α\P_p(N>n) \le C (\Delta_n(p))^\alpha, where Δn(x)\eqbdmax{x(1x)/n,1/n}\Delta_n(x)\eqbd \max \{\sqrt{x(1-x)/n},1/n \}. The key to the proof is a new result in approximation theory: Let \Bn\B_n be the cone of univariate polynomials with nonnegative Bernstein coefficients of degree nn. We show that a function f:[0,1](0,1)f:[0,1] \to (0,1) is in Cα[0,1]C^\alpha [0,1] if and only if ff has a series representation n=1Fn\sum_{n=1}^\infty F_n with Fn\BnF_n \in \B_n and k>nFk(x)C(Δn(x))α\sum_{k>n} F_k(x) \le C(\Delta_n(x))^\alpha for all x[0,1] x \in [0,1] and n1n \ge 1. We also provide a counterexample to a theorem stated without proof by Lorentz (1963), who claimed that if some ϕn\Bn\phi_n \in \B_n satisfy f(x)ϕn(x)C(Δn(x))α|f(x)-\phi_n(x)| \le C (\Delta_n(x))^\alpha for all x[0,1] x \in [0,1] and n1n \ge 1, then fCα[0,1]f \in C^\alpha [0,1].

Cite

@article{arxiv.0808.1936,
  title  = {New coins from old, smoothly},
  author = {Olga Holtz and Fedor Nazarov and Yuval Peres},
  journal= {arXiv preprint arXiv:0808.1936},
  year   = {2011}
}

Comments

29 pages; final version; to appear in Constructive Approximation

R2 v1 2026-06-21T11:10:14.653Z