OctoInformBeta

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

Lemma 2.1: Multiplication by any complex scalar, including zero, preserves the same fixed size

Affine changes preserve 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

Let σ\sigma and τ\tau be finite sets, and let ℂ[𝒙]\mathbb C[\mathbf x] and ℂ[𝒚]\mathbb C[\mathbf y] be the complex polynomial rings in variables 𝒙=(xv)v∈σ\mathbf x=(x_v)_{v\in\sigma} and 𝒚=(yw)w∈τ\mathbf y=(y_w)_{w\in\tau}.✦ The question concerns the determinant size needed when a polynomial is evaluated on affine linear forms and multiplied by a complex scalar.

For an integer n≥0n\geq 0 and matrices A0,Av∈Mat⁡n(ℂ)A_0,A_v\in\operatorname{Mat}_n(\mathbb C), v∈σv\in\sigma, the determinant of the corresponding affine pencil is the polynomial PA0,A(𝒙)=det⁡(A0+∑v∈σxvAv).P_{A_0,A}(\mathbf x) =\det\left(A_0+\sum_{v\in\sigma}x_vA_v\right).(1)✦ For each multi-index d∈ℕσd\in\mathbb N^\sigma, [𝒙d][\mathbf x^d] denotes the coefficient of the monomial 𝒙d\mathbf x^d; coefficient limits are taken in ℂ\mathbb C. A polynomial p∈ℂ[𝒙]p\in\mathbb C[\mathbf x] has a border determinantal representation of size nn, written HasBorderDeterminant⁡(n,p)\operatorname{HasBorderDeterminant}(n,p), if n>0n>0 and there are sequences of complex matrices A0(j),Av(j)A_0^{(j)},A_v^{(j)} of size nn such that the determinants in (1) satisfy limj→∞[𝒙d]PA0(j),A(j)=[𝒙d]pfor every d∈ℕσ.\lim_{j\to\infty} [\mathbf x^d]P_{A_0^{(j)},A^{(j)}} =[\mathbf x^d]p \qquad\text{for every }d\in\mathbb N^\sigma.(2)✦

An affine substitution is the ℂ\mathbb C-algebra homomorphism from ℂ[𝒙]\mathbb C[\mathbf x] to ℂ[𝒚]\mathbb C[\mathbf y] induced by an affine map A:ℂτ→ℂσA:\mathbb C^\tau\to\mathbb C^\sigma with coefficients bv,Bvw∈ℂb_v,B_{vw}\in\mathbb C: (A(𝒚))v=bv+∑w∈τBvwyw,p↦p∘A.(A(\mathbf y))_v=b_v+\sum_{w\in\tau}B_{vw}y_w, \qquad p\longmapsto p\circ A.(3)✦

The Claim

Theorem 1. Let p∈ℂ[𝒙]p\in\mathbb C[\mathbf x] have a border determinantal representation of size nn. Let A:ℂτ→ℂσA:\mathbb C^\tau\to\mathbb C^\sigma be an affine map as in (3), and let a∈ℂa\in\mathbb C. Then HasBorderDeterminant⁡(n,p∘A).\operatorname{HasBorderDeterminant}(n,p\circ A).(4)✦ Scalar multiplication gives HasBorderDeterminant⁡(n,ap).\operatorname{HasBorderDeterminant}(n,a\,p).(5)✦ The scaled substitution satisfies HasBorderDeterminant⁡(n,a(p∘A)).\operatorname{HasBorderDeterminant}(n,a\,(p\circ A)).(6)✦

In the paper, the result reads: for a complex polynomial pp, an affine map AA into its variable space, and a nonzero complex scalar aa, the border determinantal complexity satisfies bdc⁡(a(p∘A))≤bdc⁡(p)\operatorname{bdc}(a\,(p\circ A))\leq\operatorname{bdc}(p).

What Is Checked

The statements (4), (5) and (6) are over complex polynomial rings in finite variable sets, positive representation sizes, arbitrary affine maps and arbitrary complex scalars.