On the Sharpness of Khovanskii's Bezout-type Bound for Pfaffian Functions

Technical Summary: On the Sharpness of Khovanski˘ı's B´ezout-type Bound for Pfaffian Functions

Problem Statement
Khovanski˘ı's theorem provides a foundational B´ezout-type upper bound on the number of isolated real solutions for a system of $n$ Pfaffian equations in $n$ variables. This bound is expressed in terms of three complexity parameters: the chain-degree $\alpha$ (controlling the degrees of the polynomial differential equations defining the chain), the degrees $\beta_i$ of the Pfaffian functions themselves, and the order $s$ of the underlying Pfaffian chain. While this theorem is central to Pfaffian geometry and o-minimality, the sharpness of the bound with respect to these parameters remains largely uninvestigated. Specifically, it is unclear whether the dependence on $\alpha$, $\beta_i$, and $s$ is optimal, either exactly or asymptotically. The paper addresses the open question of investigating this sharpness from a parameter-by-parameter perspective, analyzing how the number of real zeros scales when individual parameters grow while others remain fixed.

Methodology
The authors employ a constructive approach to establish lower bounds on the number of real zeros, thereby testing the tightness of Khovanski˘ı's upper bound. The methodology is divided into two primary constructions:

1. Sharpness in Chain-Degree ($\alpha$): To demonstrate sharpness in $\alpha$, the authors construct a specific Pfaffian function of format $(\alpha, 1, s)$ in one variable. The construction relies on a carefully designed polynomial $p(x)$ with roots at integers $1, \dots, \alpha$ and a parameter $a$. By defining a function $f_1(x) = e^{ap(x)}$ and analyzing the system $F(x) = f_1(x) - x$, they utilize the Intermediate Value Theorem to locate $\alpha + 1$ distinct nondegenerate zeros. Through an inductive argument involving nested intervals and inverse branches of the function, they show that iterating this process $s$ times yields a system with at least $\alpha^s$ nondegenerate real zeros. This construction ensures that the intervals remain disjoint and free of critical points, guaranteeing the existence of distinct roots.

2. Sharpness in Function Degree ($\beta$): To investigate the dependence on the degree parameters $\beta_i$, the authors utilize a dimension-counting argument within the vector space of Pfaffian functions. They consider a Pfaffian chain $\vec{q}$ whose components are algebraically independent over the field of rational functions. By defining a vector space $V_\beta$ spanned by monomials of total degree at most $\beta$ in the variables and chain components, they calculate the dimension of this space. Using a linear evaluation map that imposes conditions on the values and derivatives of functions at a set of points, they prove the existence of a system of $n$ Pfaffian functions with a number of regular common zeros matching the dimension of the space (scaled by $1/(n+1)$). This results in a lower bound of $\Omega_{n,s}(\beta^{n+s})$.

Key Contributions and Results
The paper establishes the asymptotic sharpness of Khovanski˘ı's bound with respect to the parameters $\alpha$ and $\beta$, while suggesting the bound is likely not sharp with respect to $s$.

• Sharpness in $\alpha$ (Theorem 1.2): For fixed $n$, $\beta$, and $s$, the authors prove that for every $\alpha, s \in \mathbb{N}$, there exists a Pfaffian function of format $(\alpha, 1, s)$ with at least $\alpha^s$ nondegenerate real zeros. This matches the order of growth $\alpha^s$ predicted by Khovanski˘ı's bound (Equation 1.1), confirming that the dependence on the chain-degree is asymptotically sharp.
• Sharpness in $\beta$ (Theorem 1.3 and Corollary 1.4): Assuming the existence of an algebraically independent Pfaffian chain, the authors show that for fixed $n, s,$ and $\alpha$, there exist systems of Pfaffian functions with $\Omega_{n,s}(\beta^{n+s})$ regular common zeros as $\beta \to \infty$. This matches the dominant growth term $(\max \beta_i)^{n+s}$ in Khovanski˘ı's bound, establishing sharpness in the degree parameter regime.
• Combined Construction (Remark 1.5): The authors note that the mechanisms for $\alpha$ and $\beta$ growth can be combined via Cartesian products of disjoint variable sets. This yields a system of format $(\max(\alpha, s), \beta, 2s)$ with $\Omega_{n,s}(\alpha^s \beta^{n+s-1})$ zeros. They pose the open question of whether this can be achieved with the original chain order $s$ rather than $2s$.
• Sharpness in $s$ (Section 3.3): The paper observes that Khovanski˘ı's bound grows exponentially in $s^2$ (specifically $2^{\Theta(s^2)}$). However, the authors' examples and existing literature (e.g., for polynomials in $e^x$) suggest the actual number of zeros grows much slower, likely exponentially in $s$ rather than $s^2$. They note that for small $s$ (e.g., $s=2$), the gap between the bound and observed zeros is significant, though Theorem 1.2 prevents a bound of $o(2^s)$ for fixed $\alpha, \beta, n$.

Significance
The paper initiates a systematic study of the sharpness of Khovanski˘ı's bound, a critical quantitative result in Pfaffian theory and o-minimal geometry. By proving that the dependence on chain-degree $\alpha$ and function degree $\beta$ is asymptotically optimal, the authors clarify the limits of the current bound in these regimes. This work underscores that while Khovanski˘ı's theorem provides a powerful general tool for bounding the complexity of Pfaffian sets (including connected components and Betti numbers), the bound is tight for specific structural parameters. The findings suggest that future improvements to the bound must focus on the dependence on the chain order $s$, where the current quadratic exponent in the exponential term appears to be an overestimate. The paper concludes that these results are relevant not only for theoretical geometry but also for applications in metric geometry and arithmetic settings where Pfaffian sets arise naturally, such as in the study of $\ell_p$ distances and elliptic curves.