New coins from old, smoothly

Abstract

Given a (known) function f:[0,1] (0,1), we consider the problem of simulating a coin with probability of heads f(p) by tossing a coin with unknown heads probability p, as well as a fair coin, N times each, where N may be random. The work of Keane and O'Brien (1994) implies that such a simulation scheme with the probability p(N<∞) equal to 1 exists iff f is continuous. Nacu and Peres (2005) proved that f is real analytic in an open set S ⊂ (0,1) iff such a simulation scheme exists with the probability p(N>n) decaying exponentially in n for every p ∈ S. We prove that for α>0 non-integer, f is in the space Cα [0,1] if and only if a simulation scheme as above exists with p(N>n) C (n(p))α, where n(x) \x(1-x)/n,1/n \. The key to the proof is a new result in approximation theory: Let n be the cone of univariate polynomials with nonnegative Bernstein coefficients of degree n. We show that a function f:[0,1] (0,1) is in Cα [0,1] if and only if f has a series representation Σn=1∞ Fn with Fn ∈ n and Σk>n Fk(x) C(n(x))α for all x ∈ [0,1] and n 1. We also provide a counterexample to a theorem stated without proof by Lorentz (1963), who claimed that if some φn ∈ n satisfy |f(x)-φn(x)| C (n(x))α for all x ∈ [0,1] and n 1, then f ∈ Cα [0,1].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…