OctoInformBeta

OpenAI preprint, September 2026 · §8. Counting polars of a smooth hypersurface

Proposition 8.3: Selected zeros of ambient polar systems for affine determinant limits obey a mixed coefficient bound

Simple polar zeros constrain determinant size.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

The section coordinates and the derivative directions belong to different spaces.

Let σ\sigma and κ\kappa be finite sets, with N=|σ|N=|\sigma| and K=|κ|K=|\kappa|. The ambient polynomial ring is ℂ[xv:v∈σ]\mathbb C[x_v:v\in\sigma].✦ For complex n×nn\times n matrices A0A_0 and AvA_v, the determinant of their affine pencil is pA(x)=det⁡(A0+∑v∈σxvAv).p_A(x)=\det\!\left(A_0+\sum_{v\in\sigma}x_vA_v\right).(1)✦ A polynomial P∈ℂ[xv:v∈σ]P\in\mathbb C[x_v:v\in\sigma] has a border determinantal representation of size nn, denoted HasBorderDeterminant⁡(n,P)\operatorname{HasBorderDeterminant}(n,P), when n>0n>0 and there is a sequence of pencils of the form (1), with unrestricted complex matrix entries, satisfying (2): [xα]pA(j)→[xα]P(j→∞),α∈ℕσ.[x^\alpha]p_{A^{(j)}}\longrightarrow[x^\alpha]P \quad(j\longrightarrow\infty),\qquad \alpha\in\mathbb N^\sigma.(2)

Put τ={*}⊔κ\tau=\{\ast\}\sqcup\kappa and identify ℂτ\mathbb C^\tau with ℂ×ℂκ\mathbb C\times\mathbb C^\kappa by separating the distinguished coordinate.✦ An affine section is a map ψ(z)=b+Lz\psi(z)=b+Lz, where b∈ℂσb\in\mathbb C^\sigma and L:ℂτ→ℂσL:\mathbb C^\tau\to\mathbb C^\sigma is complex-linear. For coefficients BvaB_{va}, affine substitution is the ℂ\mathbb C-algebra homomorphism Sb,B:ℂ[xv:v∈σ]→ℂ[za:a∈τ],xv↦bv+∑a∈τBvaza.S_{b,B}:\mathbb C[x_v:v\in\sigma]\longrightarrow \mathbb C[z_a:a\in\tau],\qquad x_v\longmapsto b_v+\sum_{a\in\tau}B_{va}z_a.(3)✦ The section substitution SψS_\psi from ambient polynomials to section polynomials is the complex algebra homomorphism (3) with Bva=(Lea)vB_{va}=(Le_a)_v, where eae_a is the standard basis vector. The scalar and vector decomposition is the complex-linear isomorphism from ℂτ\mathbb C^\tau to ℂ×ℂκ\mathbb C\times\mathbb C^\kappa that sends a section point to its distinguished coordinate together with its κ\kappa-indexed coordinates.

For constant ambient directions hi∈ℂσh_i\in\mathbb C^\sigma, i∈κi\in\kappa, the directional derivatives and affine polar operators are the linear maps ∂hi=∑v∈σ(hi)v∂∂xv,𝒯*=Sψ,𝒯i=Sψ∘∂hi.\partial_{h_i}=\sum_{v\in\sigma}(h_i)_v\frac{\partial}{\partial x_v}, \qquad \mathcal T_\ast=S_\psi,\qquad \mathcal T_i=S_\psi\circ\partial_{h_i}.(4) The ambient polar system of a complex-valued function FF is the map ΦF,ψ,h(z)=(F(ψ(z)),(dFψ(z)(hi))i∈κ)∈ℂ×ℂκ.\Phi_{F,\psi,h}(z)= \bigl(F(\psi(z)),(dF_{\psi(z)}(h_i))_{i\in\kappa}\bigr) \in\mathbb C\times\mathbb C^\kappa.(5)✦ For a polynomial PP, the subscript PP in (5) means its evaluation function.

For linear maps Λa\Lambda_a from ambient polynomials to section polynomials, the polynomial evaluation system is GΛ,P(z)=((ΛaP)(z))a∈τ.G_{\Lambda,P}(z)=\bigl((\Lambda_aP)(z)\bigr)_{a\in\tau}.(6)✦ A simple polynomial zero of (6) is a section point zz satisfying the condition denoted by SimpleZero⁡(GΛ,P,z)⇔GΛ,P(z)=0anddGΛ,P|zis invertible.\operatorname{SimpleZero}(G_{\Lambda,P},z) \quad\Longleftrightarrow\quad G_{\Lambda,P}(z)=0\ \text{and}\ dG_{\Lambda,P}|_z\ \text{is invertible}.(7)✦ A simple zero zz of (5) is a section point at which the system vanishes and its derivative between the identified section and target spaces is invertible.

Mixed Coefficients

For a finite equation set EE and two maps u,vu,v from EE to a set of variable groups, with an indeterminate TgT_g for each group gg, the mixed Bézout polynomial is Mu,v(T)=∏e∈E(Tu(e)+Tv(e)).M_{u,v}(T)=\prod_{e\in E}\bigl(T_{u(e)}+T_{v(e)}\bigr).(8) For q≥0q\ge0, take three groups named H,U,VH,U,V, with dimensions (K+1,q,q)(K+1,q,q). The bilinear equation set is the disjoint union of q+1q+1 equations assigned the pair (H,U)(H,U), qq equations assigned (H,V)(H,V), and equations indexed by κ\kappa assigned (U,V)(U,V); the maps u,vu,v select the first and second entries of these pairs. The mixed coefficient of (8) at these dimensions is CK,q=[HK+1UqVq]Mu,v(H,U,V).C_{K,q}=[H^{K+1}U^qV^q]M_{u,v}(H,U,V).(9) The parameter qq here corresponds to matrix size q+1q+1.

The Claim

Theorem 1. Let II be a finite set with D=|I|D=|I|, and suppose N,D≥1N,D\ge1. Let P∈ℂ[xv:v∈σ]P\in\mathbb C[x_v:v\in\sigma] satisfy HasBorderDeterminant⁡(n,P)\operatorname{HasBorderDeterminant}(n,P). Fix an affine section ψ\psi and ambient directions hih_i as above. Suppose zjz_j, j∈Ij\in I, are distinct zeros of ΦP,ψ,h\Phi_{P,\psi,h} at which its derivative is invertible. Then D≤[HK+1Un−1Vn−1](H+U)n(H+V)n−1(U+V)K≤2K(2n−1K+1),K+14exp⁡(1)D1/(K+1)≤n.\begin{gathered} D\le [H^{K+1}U^{n-1}V^{n-1}] (H+U)^n(H+V)^{n-1}(U+V)^K \le 2^K\binom{2n-1}{K+1},\\ \frac{K+1}{4\exp(1)}D^{1/(K+1)}\le n. \end{gathered}(10)✦

In the paper, the result reads: for N,n,D≥1N,n,D\ge1 and K≥0K\ge0, if P∈ℂ[x1,…,xN]P\in\mathbb C[x_1,\ldots,x_N] is a coefficientwise limit of size-nn affine determinants, ψ:ℂK+1→ℂN\psi:\mathbb C^{K+1}\to\mathbb C^N is affine, and h1,…,hK∈ℂNh_1,\ldots,h_K\in\mathbb C^N are constant directions for which the equations P(ψ(z))=0P(\psi(z))=0 and (∂hiP)(ψ(z))=0(\partial_{h_i}P)(\psi(z))=0 have at least DD distinct simple zeros, then D≤[HK+1Un−1Vn−1](H+U)n(H+V)n−1(U+V)K≤2K(2n−1K+1)D\le[H^{K+1}U^{n-1}V^{n-1}](H+U)^n(H+V)^{n-1}(U+V)^K \le2^K\binom{2n-1}{K+1} and n≥(K+1)D1/(K+1)/(4exp⁡(1))n\ge (K+1)D^{1/(K+1)}/(4\exp(1)), with the binomial coefficient zero when K+1>2n−1K+1>2n-1.

What Is Checked

The ambient bounds (10) and persistence assertion (11) are stated over finite ambient polynomial rings, sequential border representations, and selected injective families of zeros satisfying the simple-zero condition (7).

Theorem 2. Let σ,κ,I\sigma,\kappa,I be finite sets, put K=|κ|K=|\kappa| and D=|I|D=|I|, and let PP satisfy HasBorderDeterminant⁡(n,P)\operatorname{HasBorderDeterminant}(n,P). For an affine section ψ\psi and constant directions hih_i, with operators (4), suppose zjz_j, j∈Ij\in I, are distinct simple zeros of ΦP,ψ,h\Phi_{P,\psi,h}. There are complex n×nn\times n matrices A0,AvA_0,A_v and an injective family y:I→ℂτy:I\to\mathbb C^\tau such that SimpleZero⁡(G𝒯,pA,yj)(j∈I).\operatorname{SimpleZero}(G_{\mathcal T,p_A},y_j) \qquad(j\in I).(11)✦ For n=q+1n=q+1, the mixed count (12) uses the coefficient (9): D≤CK,q.D\le C_{K,q}.(12)✦ For every K,q≥0K,q\ge0, the literal coefficient identity (13) is [HK+1UqVq](H+U)q+1(H+V)q(U+V)K=CK,q.[H^{K+1}U^qV^q](H+U)^{q+1}(H+V)^q(U+V)^K=C_{K,q}.(13)✦ For any nonnegative integers r,k,dr,k,d satisfying d≤2k(max⁡(2r−1,0)k+1)d\le2^k\binom{\max(2r-1,0)}{k+1}, the numerical bound (14) is k+14exp⁡(1)d1/(k+1)≤r.\frac{k+1}{4\exp(1)}d^{1/(k+1)}\le r.(14)✦