2000 character limit reached
The distance between two limit $q$-Bernstein operators (1708.07669v2)
Published 25 Aug 2017 in math.FA
Abstract: For $q\in(0,1),$ let $B_q$ denote the limit $q$-Bernstein operator. In this paper, the distance between $B_q$ and $B_r$ for distinct $q$ and $r$ in the operator norm on $C[0,1]$ is estimated, and it is proved that $1\leqslant |B_q-B_r|\leqslant 2,$ where both of the equalities can be attained. To elaborate more, the distance depends on whether or not $r$ and $q$ are rational powers of each other. For example, if $rj\neq qm$ for all $j,m\in \mathbb{N},$ then $|B_q-B_r|=2,$ and if $r=qm, m\in \mathbb{N},$ then $|B_q-B_r|=2(m-1)/m.$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.