OctoInformBeta

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

Lemma 8.2: A mixed coefficient counts choices and bounds common zeros with invertible local derivatives

Counting simple zeros across projective charts.

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

A finite collection of common zeros of equations in projective coordinate blocks can be described using a separate normalization at each point. The coordinates in a block are compared up to scalar multiplication, while simplicity is expressed by the invertibility of a derivative in the normalized coordinates.

Let II be a finite set of blocks, and let aj≥0a_j\geq 0 be the dimension of block jj. The projective block variables are indexed by the set Σa={(j,r):j∈I,0≤r≤aj}.\Sigma_a=\{(j,r):j\in I,\ 0\leq r\leq a_j\}.(1)✦ The block multidegree assigns to the variable Xj,rX_{j,r} in (1) the jjth unit vector εj∈ℤI\varepsilon_j\in\mathbb Z^I.✦ Thus a polynomial of multidegree εu+εv\varepsilon_u+\varepsilon_v is homogeneous of that degree for this assignment, where the block indices u,vu,v may coincide.

Two block coordinate vectors p,q∈ℂΣap,q\in\mathbb C^{\Sigma_a} are block separated if ∃j∈I∃r,s∈{0,…,aj},pj,rqj,s≠pj,sqj,r.\exists j\in I\ \exists r,s\in\{0,\ldots,a_j\},\qquad p_{j,r}q_{j,s}\neq p_{j,s}q_{j,r}.(2)✦

The Mixed Polynomial

For a finite set EE and maps u,v:E→Iu,v:E\to I, the bilinear Bézout polynomial is Bu,v(H)=∏e∈E(Hu(e)+Hv(e))∈ℕ[Hj:j∈I].B_{u,v}(H)=\prod_{e\in E}\bigl(H_{u(e)}+H_{v(e)}\bigr) \in\mathbb N[H_j:j\in I].(3)✦ Write Ha=∏j∈IHjajH^a=\prod_{j\in I}H_j^{a_j} and [Ha]Bu,v[H^a]B_{u,v} for its coefficient in (3). A binary choice c:E→{0,1}c:E\to\{0,1\} selects the block ηc(e)(e)\eta_{c(e)}(e) at ee, where η0=u\eta_0=u and η1=v\eta_1=v.

Normalized Coordinates

Set M=∑j∈IajM=\sum_{j\in I}a_j and take E={1,…,M}E=\{1,\ldots,M\}. Let F1,…,FM∈ℂ[Xj,r:(j,r)∈Σa]F_1,\ldots,F_M\in\mathbb C[X_{j,r}:(j,r)\in\Sigma_a] be polynomials, and let LL be a finite set indexing the selected points. Take an MM-dimensional complex normed vector space VV and continuous complex linear isomorphisms ei:ℂM→Ve_i:\mathbb C^M\to V for i∈Li\in L.

For each i∈Li\in L, choose a coordinate bij∈{0,…,aj}b_{ij}\in\{0,\ldots,a_j\} in every block jj. A normalized coordinate map ϕi:V→ℂΣa\phi_i:V\to\mathbb C^{\Sigma_a} is a C1C^1 map satisfying ϕi(z)j,bij=1(z∈V,j∈I).\phi_i(z)_{j,b_{ij}}=1 \qquad(z\in V,\ j\in I).(4) For points xi∈Vx_i\in V, write pi=ϕi(xi)p_i=\phi_i(x_i). The local equation map associated with ϕi\phi_i and eie_i is Gi:V→V,Gi(z)=ei((Fℓ(ϕi(z)))ℓ=1M).G_i:V\longrightarrow V,\qquad G_i(z)=e_i\bigl((F_\ell(\phi_i(z)))_{\ell=1}^M\bigr).(5)

The Claim

Theorem 1. Let I,EI,E be finite sets, let a∈ℕIa\in\mathbb N^I, and let u,v:E→Iu,v:E\to I. The coefficient of HaH^a in the bilinear Bézout polynomial is [Ha]Bu,v=#{c:E→{0,1}:#{e∈E:ηc(e)(e)=j}=aj for every j∈I}.[H^a]B_{u,v} =\#\left\{c:E\to\{0,1\}: \#\{e\in E:\eta_{c(e)}(e)=j\}=a_j \text{ for every }j\in I\right\}.(6)✦

Now take E={1,…,M}E=\{1,\ldots,M\} with M=∑j∈IajM=\sum_{j\in I}a_j, and suppose that FℓF_\ell is homogeneous of block multidegree εu(ℓ)+εv(ℓ)\varepsilon_{u(\ell)}+\varepsilon_{v(\ell)} for every ℓ\ell. Let the maps ϕi\phi_i satisfy (4), and use the local equation maps of (5). Suppose the vectors pip_i are pairwise block separated in the sense of (2), each pip_i is a common zero of F1,…,FMF_1,\ldots,F_M, and DGi(xi)DG_i(x_i) is invertible for every i∈Li\in L. Then |L|≤[Ha]Bu,v.|L|\leq [H^a]B_{u,v}.(7)✦

In the paper, the result reads: for Y=∏j=1sℙajY=\prod_{j=1}^s\mathbb P^{a_j} with aj≥0a_j\geq0 and M=∑j=1saj≥1M=\sum_{j=1}^s a_j\geq1, if F1,…,FMF_1,\ldots,F_M have degree one in each of two distinct coordinate groups u(ℓ),v(ℓ)u(\ell),v(\ell) and degree zero in the others, then any finite collection of distinct simple common zeros has cardinality at most [H1a1⋯Hsas]∏ℓ=1M(Hu(ℓ)+Hv(ℓ))[H_1^{a_1}\cdots H_s^{a_s}]\prod_{\ell=1}^M(H_{u(\ell)}+H_{v(\ell)}), with other zeros and components of any dimension allowed.

What Is Checked

The coefficient identity (6) is stated over finite index sets and polynomials over ℕ\mathbb N, while the point bound (7) is stated over complex multihomogeneous equations in normalized C1C^1 coordinate maps, with block separation and invertible local derivatives as hypotheses.