Abstract

In [M.R. Burke, Large entire cross-sections of second category sets in Rn+1, Topology Appl. 154 (2007) 215–240], a model was constructed in which for any everywhere second category set A⊆Rn+1 there is an entire function f:Rn→R which cuts a large section through A in the sense that {x∈Rn:(x,f(x))∈A} is everywhere second category in Rn. Moreover, the function f can be taken so that its derivatives uniformly approximate those of a given CN function g in the sense of a theorem of Hoischen. In the theory of the approximation of CN functions by entire functions, it is often possible to insist that the entire function interpolates the restriction of the CN function to a closed discrete set. In the present paper, we show how to incorporate a closed discrete interpolation set into the above mentioned theorem. When the set being sectioned is sufficiently definable, an absoluteness argument yields a strengthening of the Hoischen theorem in ZFC. We get in particular the following: Suppose g:Rn→R is a CN function, ε:Rn→R is a positive continuous function, T⊆Rn is a closed discrete set, and G⊆Rn+1 is a dense Gδ set. Let A⊆Rn be a countable dense set disjoint from T and for each x∈A, let Bx⊆R be a countable dense set. Then there is a function f:Rn→R which is the restriction of an entire function Cn→C such that the following properties hold. (a) For all multi-indices α of order at most N and all x∈Rn, |(Dαf)(x)−(Dαg)(x)|<ε(x), and moreover (Dαf)(x)=(Dαg)(x) when x∈T. (b) For each x∈A, f(x)∈Bx. (c) {x∈Rn:(x,f(x))∈G} is a dense Gδ set in Rn.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.