A cardinal number connected to the solvability of systems of difference equations in a given function class

Abstract

Let denote the set of real valued functions defined on the real line. A map D: is a difference operator, if there are real numbers ai, bi \ (i=1,..., n) such that (Df)(x)=Σi=1n ai f(x+bi) for every f∈ and x∈ . A system of difference equations is a set of equations S=Di f=gi : i∈ I, where I is an arbitrary set of indices, Di is a difference operator and gi is a given function for every i∈ I, and f is the unknown function. One can prove that a system S is solvable if and only if every finite subsystem of S is solvable. However, if we look for solutions belonging to a given class of functions, then the analogous statement fails. For example, there exists a system S such that every finite subsystem of S has a solution which is a trigonometric polynomial, but S has no such solution. This phenomenon motivates the following definition. Let F be a class of functions. The solvability cardinal () of F is the smallest cardinal such that whenever S is a system of difference equations and each subsystem of S of cardinality less than has a solution in F, then S itselfhas a solution in F. In this paper we determine the solvability cardinals of most function classes that occur in analysis. As it turns out, the behaviour of ( F) is rather erratic. For example, (polynomials)=3 but (trigonometric polynomials)=ω1, (f: f\ is continuous) = ω1 but (f: f\ is Darboux) =(2ω)+, and ()=ω. We consistently determine the solvability cardinals of the classes of Borel, Lebesgue and Baire measurable functions, and give some partial answers for the Baire class 1 and Baire class α functions.

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…