English

Continuous Regular Functions

Logic in Computer Science 2023-06-22 v3 Logic

Abstract

Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function f:[0,1][0,1]f:[0,1] \to [0,1] is rr-regular if there is a B\"{u}chi automaton that accepts precisely the set of base rNr \in \mathbb{N} representations of elements of the graph of ff. We show that a continuous rr-regular function ff is locally affine away from a nowhere dense, Lebesgue null, subset of [0,1][0,1]. As a corollary we establish that every differentiable rr-regular function is affine. It follows that checking whether an rr-regular function is differentiable is in PSPACE\operatorname{PSPACE}. Our proofs rely crucially on connections between automata theory and metric geometry developed by Charlier, Leroy, and Rigo.

Cite

@article{arxiv.1901.03366,
  title  = {Continuous Regular Functions},
  author = {Alexi Block Gorman and Philipp Hieronymi and Elliot Kaplan and Ruoyu Meng and Erik Walsberg and Zihe Wang and Ziqin Xiong and Hongru Yang},
  journal= {arXiv preprint arXiv:1901.03366},
  year   = {2023}
}