Approximation and interpolation by entire functions with restriction of the values of the derivatives

A theorem of Hoischen states that given a positive continuous function ε:Rn→Rε:Rn→R, an unbounded sequence 0≤c1≤c2≤…0≤c1≤c2≤… and a closed discrete set T⊆RnT⊆Rn, any C∞C∞ function g:Rn→Rg:Rn→R can be approximated by an entire function f   so that for k=0,1,2,…k=0,1,2,… , for all x∈Rnx∈Rn such that |x|≥ck|x|≥ck, and for each multi-index α   such that |α|≤k|α|≤k,(a)|(Dαf)(x)−(Dαg)(x)|<ε(x)|(Dαf)(x)−(Dαg)(x)|<ε(x);(b)(Dαf)(x)=(Dαg)(x)(Dαf)(x)=(Dαg)(x) if x∈Tx∈T. In this paper, we show that if C⊆Rn+1C⊆Rn+1 is meager, A⊆RnA⊆Rn is countable and disjoint from T, and for each multi-index α   and p∈Ap∈A we are given a countable dense set Ap,α⊆RAp,α⊆R, then we can require also that(c)(Dαf)(p)∈Ap,α(Dαf)(p)∈Ap,α for p∈Ap∈A and α any multi-index;(d)if x∉Tx∉T, q=(Dαf)(x)q=(Dαf)(x) and there are values of p∈Ap∈A arbitrarily close to x   for which q∈Ap,αq∈Ap,α, then there are values of p∈Ap∈A arbitrarily close to x   for which q=(Dαf)(p)q=(Dαf)(p);(e)for each α  , {x∈Rn:(x,(Dαf)(x))∈C}{x∈Rn:(x,(Dαf)(x))∈C} is meager in RnRn. Clause (d) is a surjectivity property whose full statement in the text also allows for finding solutions in A   to equations of the form q=h⁎(x,(Dαf)(x))q=h⁎(x,(Dαf)(x)) under similar assumptions, where h(x,y)=(x,h⁎(x,y))h(x,y)=(x,h⁎(x,y)) is one of countably many given fiber-preserving homeomorphisms of open subsets of Rn+1≅Rn×RRn+1≅Rn×R.We also prove a weaker corresponding result with “meager” replaced by “Lebesgue null.” In this context, the approximating function is C∞C∞ rather than entire, and we do not know whether it can be taken to be entire. The first result builds on earlier work of the author which deduced special cases of it from forcing theorems using absoluteness arguments. The proofs here do not use forcing.