Continuous Regular Functions
Logic in Computer Science
2023-06-22 v3 Logic
Abstract
Following Chaudhuri, Sankaranarayanan, and Vardi, we say that a function is -regular if there is a B\"{u}chi automaton that accepts precisely the set of base representations of elements of the graph of . We show that a continuous -regular function is locally affine away from a nowhere dense, Lebesgue null, subset of . As a corollary we establish that every differentiable -regular function is affine. It follows that checking whether an -regular function is differentiable is in . 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}
}