Comonotone approximation and interpolation by entire functions II

Abstract

A theorem of Hoischen states that given a positive continuous function :R, an integer n≥ 0, and a closed discrete set E⊂eqR, any Cn function f:R can be approximated by an entire function g so that for k=0,…,n, and x∈R, |Dkg(x)-Dkf(x)|<(x), and if x∈ E then Dkg(x)=Dkf(x). The approximating function g is entire and hence piecewise monotone. Building on earlier work, for n≤ 3, we determine conditions under which when f is piecewise monotone we can choose g to be comonotone with f (increasing and decreasing on the same intervals), and under which the derivatives of g can be taken to be comonotone with the corresponding derivatives of f if the latter are piecewise monotone. The proof for n≤ 3 establishes the theorem for all n, assuming a conjecture (shown in previous work with Haris and Madhavendra to hold for n≤ 3) regarding the set of 2(n+1)-tuples (f(0),Df(0),…,Dnf(0),f(1),Df(1),…,Dnf(1)) of the values at the endpoints of the derivatives of a Cn function f on [0,1] for which Dnf is increasing and not constant.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…