English

Approximations of Mappings

Combinatorics 2018-05-15 v1 Logic

Abstract

We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem of the construction of a continuous limit for first-order convergent sequences of finite mappings. We solve the approximation problem and, consequently, the full characterization of limit objects for mappings for first-order (i.e. FO{\rm FO}) convergence and local (i.e. FOlocal{\rm FO}^{\rm local}) convergence. This work can be seen both as a first step in the resolution of inverse problems (like Aldous-Lyons conjecture) and a strengthening of the classical decidability result for finite satisfiability in Rabin class (which consists of first-order logic with equality, one unary function, and an arbitrary number of monadic predicates). The proof involves model theory and analytic techniques.

Keywords

Cite

@article{arxiv.1805.04834,
  title  = {Approximations of Mappings},
  author = {Jaroslav Nesetril and Patrice Ossona de Mendez},
  journal= {arXiv preprint arXiv:1805.04834},
  year   = {2018}
}
R2 v1 2026-06-23T01:53:10.270Z