OctoInformBeta

OpenAI preprint, September 2026 · §2. Border models and smooth homogeneous forms

Theorem 2.3: An explicit lower bound from the degree and the number of variables

Projectively smooth forms constrain border 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

Fix a finite variable set σ\sigma of cardinality dd. The polynomial ring ℂ[𝒙]=ℂ[xv∣v∈σ]\mathbb C[\mathbf x]=\mathbb C[x_v\mid v\in\sigma] consists of multivariate polynomials with complex coefficients.✦ The question is which matrix sizes allow affine determinants to approach a homogeneous polynomial with smooth projective zero set coefficient by coefficient.

For a nonnegative integer nn, let A0A_0 and AvA_v, v∈σv\in\sigma, be arbitrary matrices in Mat⁡n(ℂ)\operatorname{Mat}_n(\mathbb C), and put A=(Av)v∈σA=(A_v)_{v\in\sigma}. The determinant of their affine pencil is the polynomial Δ(A0,A;𝒙)∈ℂ[𝒙]\Delta(A_0,A;\mathbf x)\in\mathbb C[\mathbf x] defined by (1). Δ(A0,A;𝒙)=det⁡(A0+∑v∈σxvAv).\Delta(A_0,A;\mathbf x) =\det\left(A_0+\sum_{v\in\sigma}x_vA_v\right).(1)✦

For g∈ℂ[𝒙]g\in\mathbb C[\mathbf x] and α∈ℕσ\alpha\in\mathbb N^\sigma, write [𝒙α]g[\mathbf x^\alpha]g for the coefficient of the monomial 𝒙α\mathbf x^\alpha in gg. A border determinantal representation of f∈ℂ[𝒙]f\in\mathbb C[\mathbf x] of positive size nn is a sequence of affine pencils with unrestricted matrices A0(j),Av(j)∈Mat⁡n(ℂ)A_0^{(j)},A_v^{(j)}\in\operatorname{Mat}_n(\mathbb C), indexed by j∈ℕj\in\mathbb N and v∈σv\in\sigma, satisfying (2); its existence is denoted HasBorderDeterminant⁡(n,f)\operatorname{HasBorderDeterminant}(n,f). limj→∞[𝒙α]Δ(A0(j),A(j);𝒙)=[𝒙α]ffor every α∈ℕσ,A(j)=(Av(j))v∈σ.\lim_{j\to\infty} [\mathbf x^\alpha]\Delta(A_0^{(j)},A^{(j)};\mathbf x) =[\mathbf x^\alpha]f \qquad\text{for every }\alpha\in\mathbb N^\sigma, \quad A^{(j)}=(A_v^{(j)})_{v\in\sigma}.(2)✦

A polynomial f∈ℂ[𝒙]f\in\mathbb C[\mathbf x] is homogeneous of degree r∈ℕr\in\mathbb N if every monomial with nonzero coefficient has total degree rr. A homogeneous polynomial f∈ℂ[𝒙]f\in\mathbb C[\mathbf x] is projectively smooth when it and all its first partial derivatives have only the zero common affine zero, as in (3). {y∈ℂσ:f(y)=0,(∂f∂xv)(y)=0 for every v∈σ}={0}.\left\{y\in\mathbb C^\sigma: f(y)=0,\quad \left(\frac{\partial f}{\partial x_v}\right)(y)=0 \text{ for every }v\in\sigma\right\}=\{0\}.(3)

The Claim

Theorem 1. Let d≥2d\ge2 and r≥2r\ge2. Let f∈ℂ[𝒙]f\in\mathbb C[\mathbf x] be a projectively smooth homogeneous polynomial of degree rr, and suppose that HasBorderDeterminant⁡(n,f)\operatorname{HasBorderDeterminant}(n,f) holds. The representation size satisfies (4). (r−1)(d−1)4exp⁡(1)≤n.\frac{(r-1)(d-1)}{4\exp(1)}\le n.(4)✦

In the paper, the result reads: if a nonzero homogeneous form f∈ℂ[𝒙]f\in\mathbb C[\mathbf x] of degree r≥2r\ge2 in d≥2d\ge2 variables has smooth projective zero set, then every border determinantal representation of ff has size at least (r−1)(d−1)/(4exp⁡(1))(r-1)(d-1)/(4\exp(1)).

What Is Checked

The claim is stated over the complex polynomial ring ℂ[xv∣v∈σ]\mathbb C[x_v\mid v\in\sigma], with border representations defined by (2) and projective smoothness by (3).