All iterated function systems are Lipschitz up to an equivalent metric
Micha{\l} Pop{\l}awski

TL;DR
This paper proves that any finite family of continuous selfmaps on a metric space can be re-metrized with an equivalent metric so that all maps become Lipschitz, extending the concept beyond contractive systems.
Contribution
The authors construct a new equivalent metric under which any finite family of continuous maps becomes Lipschitz, addressing a question about remetrization of non-contractive iterated function systems.
Findings
Any finite family of continuous selfmaps can be made Lipschitz via an equivalent metric.
The construction applies even to some infinite families of continuous functions.
The result generalizes the understanding of iterated function systems beyond contractive cases.
Abstract
A finite family of continuous selfmaps of a given metric space is called an iterated function system (shortly IFS). In a case of contractive selfmaps of a complete metric space is well-known that IFS has an unique attractor \cite{Hu}. However, in \cite{LS} authors studied highly non-contractive IFSs, i.e. such families of continuous selfmaps that for any remetrization of each function has Lipschitz constant They asked when one can remetrize that is Lipschitz IFS, i.e. all are Lipschitz (not necessarily contractive), . We give a general positive answer for this problem by constructing respective new metric (equivalent to the original one) on , determined by a given family of continuous selfmaps of . However,…
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
TopicsComputability, Logic, AI Algorithms
