Submission date: 18 November 2022

Abstract:

Let R be a real closed field. Given a closed and bounded semi-algebraic set A ⊆ R^n and semi-algebraic continuous functions f,g:A → R, such that f^{-1}(0) ⊆ g^{-1}(0), there exist N and c ∈ R, such that the inequality (Łojasiewicz inequality) |g(x)|^N ≤ c . |f(x)| holds for all x ∈ A. In this paper we consider the case when A is defined by a quantifier-free formula with atoms of the form P = 0, P >0, P ∈ P for some finite subset of polynomials P ⊆ R[X_1, ... ,X_n]_{≤ d}, and the graphs of f,g are also defined by quantifier-free formulas with atoms of the form Q = 0, Q >0, Q ∈ Q, for some finite set Q ⊆ R[X_1, ... ,X_n,Y]_{≤ d}. We prove that the Łojasiewicz exponent N in this case is bounded by (8 d)^{2(n+7)}. Our bound depends on d and n, but is independent of the combinatorial parameters, namely the cardinalities of P and Q. As a consequence we improve the current best error bounds for polynomial systems under some conditions. Finally, as an abstraction of the notion of independence of the Łojasiewicz exponent from the combinatorial parameters occurring in the descriptions of the given pair of functions, we prove a version of Łojasiewicz inequality in polynomially bounded o-minimal structures. We prove the existence of a common Łojasiewicz exponent for certain combinatorially defined infinite (but not necessarily definable) families of pairs of functions.

Mathematics Subject Classification: Primary 14P10, Secondary 03C64, 90C23

Keywords and phrases:

Full text arXiv 2211.10034: pdf, ps.