Peter Franek
Skip Abstract Section
Abstract
We study the problem of robust satisfiability of systems of nonlinear equations, namely, whether for a given continuous function f:K → Rn on a finite simplicial complex K and α>0, it holds that each function g:K → Rn such that ║g−f║∞ ≤ α, has a root in K. Via a reduction to the extension problem of maps into a sphere, we particularly show that this problem is decidable in polynomial time for every fixed n, assuming dim K ≤ 2n−3. This is a substantial extension of previous computational applications of topological degree and related concepts in numerical and interval analysis.
Via a reverse reduction, we prove that the problem is undecidable when dim K ≥ 2n−2, where the threshold comes from the stable range in homotopy theory.
For the lucidity of our exposition, we focus on the setting when f is simplexwise linear. Such functions can approximate general continuous functions, and thus we get approximation schemes and undecidability of the robust satisfiability in other possible settings.
- M. Arkowitz. 2011. Introduction to Homotopy Theory. Springer, New York. http://books.google.cz/books?id=5nSCRSN51aoC.Google Scholar
- Thomas Beelitz, Andreas Frommer, Bruno Lang, and Paul Willems. 2005. Symbolic-numeric techniques for solving nonlinear systems. Proc. Appl. Math. Mech. 5, 1, 705--708.Google ScholarCross Ref
- A. Ben-Tal, L.E. Ghaoui, and A. Nemirovski. 2009. Robust Optimization. Princeton University Press. http://books.google.cz/books?id=DttjR7IpjUEC.Google Scholar
- Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. 2010. The robustness of level sets. In Algorithms--ESA 2010, Mark Berg and Ulrich Meyer, Eds., Lecture Notes in Computer Science, vol. 6346, Springer, 1--10. DOI: http://dx.doi.org/10.1007/978-3-642-15775-2_1. Google ScholarCross Ref
- R. Brooks. 1973. Certain subgroups of the fundamental group and the number of roots of f(x) = a. Amer. J. Math. 95, 4, 720--728. http://www.jstor.org/stable/2373695.Google ScholarCross Ref
- R. Brown and H. Schirmer. 2001. Nielsen root theory and Hopf degree theory. Pacific J. Math. 198, 49--80.Google ScholarCross Ref
- M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, and U. Wagner. 2014a. Extendability of continuous maps is undecidable. Discr. Comput. Geom. 51, 1, 24--66.Google ScholarDigital Library
- M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, and U. Wagner. 2014b. Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension. SIAM J. Comput. 43, 5, 1728--1780.Google ScholarDigital Library
- G. Carlsson. 2009. Topology and data. Bull. Amer. Math. Soc. (N.S.) 46, 2, 255--308.Google ScholarCross Ref
- F. Chazal, A. Patel, and P. Škraba. 2012a. Computing the robustness of roots. Appl. Math. Lett. 25, 11, 1725--1728. http://ailab.ijs.si/primoz_skraba/papers/fp.pdf.Google ScholarCross Ref
- Frédéric Chazal, Primož Škraba, and Amit Patel. 2012b. Computing well diagrams for vector fields on Rn. Appl. Math. Lett. 25, 11, 1725--1728. DOI: http://dx.doi.org/10.1016/j.aml.2012.01.046.Google ScholarCross Ref
- P. Collins. 2008. Computability and representations of the zero set. Electron. Notes Theor. Comput. Sci. 221, 37--43. DOI: http://dx.doi.org/10.1016/j.entcs.2008.12.005. Google ScholarDigital Library
- J. Cronin. 1964. Fixed Points and Topological Degree in Nonlinear Analysis. American Mathematical Society. http://www.google.cz/books?id=Zcyv3fHHd3wCGoogle Scholar
- M. de Longueville. 2012. A Course in Topological Combinatorics. Springer. http://books.google.cz/books?id=L3KMSTHvigwC.Google Scholar
- Jianwei Dian and R. B. Kearfott. 2003. Existence verification for singular and nonsmooth zeros of real nonlinear systems. Math. Comput. 72, 242, 757--766. Google ScholarDigital Library
- H. Edelsbrunner and J. Harer. 2008. Persistent homology---a survey. In Surveys on Discrete and Computational Geometry, Contemporary Mathematics, vol. 453, American Mathematical Society, Providence, RI, 257--282.Google Scholar
- Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. 2011. Quantifying transversality by measuring the robustness of intersections. Found. Computat. Mathe. 11, 3, 345--361. DOI: http://dx.doi.org/10.1007/s10208-011-9090-8. Google ScholarDigital Library
- David Eisenbud, Harold I Levine, and Bernard Teissier. 1977. An algebraic formula for the degree of a C∞ map germ. Ann. Mathe 106, 1, 19--44.Google ScholarCross Ref
- Robin Forman. 2002. A user’s guide to discrete Morse theory. Sém. Lothar. Combin 48, B48c.Google Scholar
- Peter Franek and Stefan Ratschan. 2015. Effective topological degree computation based on interval arithmetic. Math. Comp. 84, 1265--1290.Google ScholarCross Ref
- P. Franek, S. Ratschan, and P. Zgliczynski. 2015. Quasi-decidability of a fragment of the analytic first-order theory of real numbers. Preprint arXiv:1309.6280.Google Scholar
- A. Frommer, F. Hoxha, and B. Lang. 2007. Proving the existence of zeros using the topological degree and interval arithmetic. J. Comput. Appl. Math. 199, 397--402. Google ScholarDigital Library
- A. Frommer and B. Lang. 2005. Existence tests for solutions of nonlinear equations using Borsuk’s theorem. SIAM J. Numer. Anal. 43, 3, 1348--1361. DOI: http://dx.doi.org/10.1137/S0036142903438148. Google ScholarDigital Library
- A. Frommer, B. Lang, and M. Schnurr. 2004. A comparison of the Moore and Miranda existence tests. Computing 72, 3--4, 349--354. DOI: http://dx.doi.org/10.1007/s00607-004-0064-4. Google ScholarDigital Library
- W. Fulton. 1995. Algebraic Topology: A First Course. Springer-Verlag. http://books.google.cz/books?id=4khJg2wSxeMC.Google ScholarCross Ref
- Daciberg Gonalves and Peter Wong. 2005. Wecken property for roots. Proc. Amer. Math. Soc. 133, 9, 2779--2782. http://www.jstor.org/stable/4097644.Google ScholarCross Ref
- F. Goudail and P. Réfrégier. 2004. Statistical Image Processing Techniques for Noisy Images: An Application-Oriented Approach. Kluwer Academic/Plenum Publishers. http://books.google.cz/books?id=zkV45S0V3GUC. Google ScholarDigital Library
- A. Hatcher. 2001. Algebraic Topology. Cambridge University Press, Cambridge, UK. http://www.math.cornell.edu/~hatcher/AT/ATpage.html.Google Scholar
- N. J. Higham. 2002. Accuracy and Stability of Numerical Algorithms. 2nd Ed. SIAM. http://books.google.cz/books?id=epilvM5MMxwC. Google ScholarDigital Library
- S. T. Hu and V. Hu. 1959. Homotopy Theory. Elsevier Science. http://books.google.cz/books?id=iVhMPU0X2G4C.Google Scholar
- R. Baker Kearfott and Jianwei Dian. 2004. Existence verification for higher degree singular zeros of nonlinear systems. SIAM J. Numer. Anal. 41, 6, 2350--2373. http://www.jstor.org/stable/4101205 Google ScholarDigital Library
- U. Koschorke. 2006. Nielsen coincidence theory in arbitrary codimensions. Journal fur die reine und angewandte Mathematik 596, 211--236. DOI: http://dx.doi.org/10.1515/CRELLE.2006.075Google ScholarCross Ref
- Ulrich Koschorke. 2007. Selfcoincidences and roots in Nielsen theory. J. Fixed Point Theory Appl. 2, 2, 241--259. DOI: http://dx.doi.org/10.1007/s11784-007-0046-1.Google ScholarCross Ref
- S. V. Matveev. 2006. Lectures on Algebraic Topology. European Mathematical Society. http://books.google.cz/books?id=8vu6sCdyAykC.Google Scholar
- Ramon E. Moore, R. Baker Kearfott, and Michael J. Cloud. 2009. Introduction to Interval Analysis. SIAM. Google ScholarDigital Library
- R. E. Mosher and M. C. Tangora. 1968. Cohomology Operations and Applications in Homotopy Theory. Harper & Row Publishers, New York. x+214 pages.Google Scholar
- A. Neumaier. 1990. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, UK.Google Scholar
- V. V. Prasolov. 2007. Elements of Homology Theory. American Mathematical Society.Google Scholar
- L. Rall. 1980. A comparison of the existence theorems of Kantorovich and Moore. SIAM J. Numer. Anal. 17, 1, 148--161. DOI: http://dx.doi.org/10.1137/0717015.Google ScholarDigital Library
- J. J. Rotman. 1988. An Introduction to Algebraic Topology. Springer. http://books.google.at/books?id=waq9mwUmcQgC.Google Scholar
- C. P. Rourke and B. J. Sanderson. 1982. Introduction to Piecewise-Linear Topology. Springer-Verlag. http://books.google.cz/books?id=NkPvAAAAMAAJ.Google Scholar
- A. Schrijver. 1986. Theory of Linear and Integer Programming. Wiley, New York. Google ScholarDigital Library
- P. Škraba, B. Wang, Ch. Guoning, and P. Rosen. 2014. 2D vector field simplification based on robustness. In Proceedings of the IEEE Pacific Visualization Symposium (PacificVis). IEEE, 49--56. Google ScholarDigital Library
- Andrew Paul Smith. 2012. Enclosure methods for systems of polynomial equations and inequalities. Dissertation thesis. http://kops.ub.uni-konstanz.de/bitstream/handle/urn:nbn:de:bsz:352-208986/Diss_Smith.pdf?sequence=1.Google Scholar
- E.H. Spanier. 1994. Algebraic Topology. Springer. http://books.google.cz/books?id=h-wc3TnZMCcC.Google Scholar
- Zbigniew Szafraniec. 1999. Topological degree and quadratic forms. J. Pure Appl. Algebra 141, 3, 299--314.Google ScholarCross Ref
- L. Vokřínek. 2014. Decidability of the extension problem for maps into odd-dimensional spheres. ArXiv e-prints.Google Scholar
- Paul S. Wang. 1974. The undecidability of the existence of zeros of real elementary functions. J. ACM 21, 4, 586--589. DOI: http://dx.doi.org/10.1145/321850.321856. Google ScholarDigital Library
Index Terms
- Robust Satisfiability of Systems of Equations
Recommendations
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiabilityWe present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSATCNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Linear CNF formulas and satisfiability
In this paper, we study linear CNF formulas generalizing linear hypergraphs under combinatorial and complexity theoretical aspects w.r.t. SAT. We establish NP-completeness of SAT for the unrestricted linear formula class, and we show the equivalence of ...
Interval satisfiability
SAICSIT '04: Proceedings of the 2004 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countriesBoolean Satisfiability (SAT) solvers based on local search and backtracking search algorithms have been used to solve many computational search problems, with recent advances making them competitive with alternative specialist constraint satisfaction ...
Comments