OpenAI preprint, September 2026 · §2. Border models and smooth homogeneous forms
Theorem2.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 of cardinality .The polynomial ring 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 , let and ,, be arbitrary matrices in , and put .The determinant of their affine pencil is the polynomial defined by (1). (1)✦
For and , write for the coefficient of the monomial in .A border determinantal representation of of positive size is a sequence of affine pencils with unrestricted matrices , indexed by and , satisfying (2); its existence is denoted .(2)✦
A polynomial is homogeneous of degree if every monomial with nonzero coefficient has total degree . A homogeneous polynomial is projectively smooth when it and all its first partial derivatives have only the zero common affine zero, as in (3). (3)
The Claim
Theorem 1. Let and . Let be a projectively smooth homogeneous polynomial of degree , and suppose that holds. The representation size satisfies (4). (4)✦
In the paper, the result reads: if a nonzero homogeneous form of degree in variables has smooth projective zero set, then every border determinantal representation of has size at least .
What Is Checked
The claim is stated over the complex polynomial ring, with border representations defined by (2) and projective smoothness by (3).