A cardinal number connected to the solvability of systems of difference equations in a given function class
M\'arton Elekes, Mikl\'os Laczkovich

TL;DR
This paper introduces the concept of solvability cardinal for function classes, analyzing when systems of difference equations solvable in finite subsystems extend to the entire system, revealing complex behaviors across various function classes.
Contribution
It defines the solvability cardinal for function classes and determines it for many classes in analysis, highlighting the irregularities in their solvability properties.
Findings
The solvability cardinal for polynomials is 3.
The solvability cardinal for trigonometric polynomials is ω₁.
The solvability cardinal for continuous functions is ω₁.
Abstract
Let denote the set of real valued functions defined on the real line. A map is a {\it difference operator}, if there are real numbers such that for every and . A {\it system of difference equations} is a set of equations , where is an arbitrary set of indices, is a difference operator and is a given function for every , and is the unknown function. One can prove that a system is solvable if and only if every finite subsystem of 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 such that every finite subsystem of has a solution which is a trigonometric polynomial, but has no such solution. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Functional Equations Stability Results · advanced mathematical theories
