Bombieri norm

In mathematics, the Bombieri norm, named after Enrico Bombieri, is a norm on homogeneous polynomials with coefficient in ${\displaystyle \mathbb {R} }$ or ${\displaystyle \mathbb {C} }$ (there is also a version for non homogeneous univariate polynomials). This norm has many remarkable properties, the most important being listed in this article.

Bombieri scalar product for homogeneous polynomials

To start with the geometry, the Bombieri scalar product for homogeneous polynomials with N variables can be defined as follows using multi-index notation:

by definition different monomials are orthogonal, so that if ${\displaystyle \alpha \neq \beta ,}$

while

by definition

In the above definition and in the rest of this article the following notation applies:

if

write and and

Bombieri inequality

The fundamental property of this norm is the Bombieri inequality:

let ${\displaystyle P,Q}$ be two homogeneous polynomials respectively of degree ${\displaystyle d^{\circ }(P)}$ and ${\displaystyle d^{\circ }(Q)}$ with ${\displaystyle N}$ variables, then, the following inequality holds:

${\displaystyle {\frac {d^{\circ }(P)!d^{\circ }(Q)!}{(d^{\circ }(P)+d^{\circ }(Q))!}}\|P\|^{2}\,\|Q\|^{2}\leq \|P\cdot Q\|^{2}\leq \|P\|^{2}\,\|Q\|^{2}.}$

Here the Bombieri inequality is the left hand side of the above statement, while the right side means that the Bombieri norm is an algebra norm. Giving the left hand side is meaningless without that constraint, because in this case, we can achieve the same result with any norm by multiplying the norm by a well chosen factor.

This multiplicative inequality implies that the product of two polynomials is bounded from below by a quantity that depends on the multiplicand polynomials. Thus, this product can not be arbitrarily small. This multiplicative inequality is useful in metric algebraic geometry and number theory.

Invariance by isometry

Another important property is that the Bombieri norm is invariant by composition with an isometry:

let ${\displaystyle P,Q}$ be two homogeneous polynomials of degree ${\displaystyle d}$ with ${\displaystyle N}$ variables and let ${\displaystyle h}$ be an isometry of ${\displaystyle \mathbb {R} ^{N}}$ (or ${\displaystyle \mathbb {C} ^{N}}$). Then we have ${\displaystyle \langle P\circ h|Q\circ h\rangle =\langle P|Q\rangle }$. When ${\displaystyle P=Q}$ this implies ${\displaystyle \|P\circ h\|=\|P\|}$.

This result follows from a nice integral formulation of the scalar product:

${\displaystyle \langle P|Q\rangle ={d+N-1 \choose N-1}\int _{S^{N}}P(Z){\overline {Q(Z)}}\,d\sigma (Z)}$

where ${\displaystyle S^{N}}$ is the unit sphere of ${\displaystyle \mathbb {C} ^{N}}$ with its canonical measure ${\displaystyle d\sigma (Z)}$.

Other inequalities

Let ${\displaystyle P}$ be a homogeneous polynomial of degree ${\displaystyle d}$ with ${\displaystyle N}$ variables and let ${\displaystyle Z\in \mathbb {C} ^{N}}$. We have:

• ${\displaystyle |P(Z)|\leq \|P\|\,\|Z\|_{E}^{d}}$
• ${\displaystyle \|\nabla P(Z)\|_{E}\leq d\|P\|\,\|Z\|_{E}^{d}}$

where ${\displaystyle \|\cdot \|_{E}}$ denotes the Euclidean norm.

The Bombieri norm is useful in polynomial factorization, where it has some advantages over the Mahler measure, according to Knuth (Exercises 20-21, pages 457-458 and 682-684).

See also

• Grassmann manifold
• Hardy space
• Homogeneous polynomial
• Plücker embedding

References

• Beauzamy, Bernard; Bombieri, Enrico; Enflo, Per; Montgomery, Hugh L. (1990). "Products of polynomials in many variables" (PDF). Journal of Number Theory. 36 (2): 219–245. doi:10.1016/0022-314X(90)90075-3. hdl:2027.42/28840. MR 1072467.
• Beauzamy, Bernard; Enflo, Per; Wang, Paul (October 1994). "Quantitative estimates for polynomials in one or several variables: From analysis and number theory to symbolic and massively parallel computation" (PDF). Mathematics Magazine. 67 (4): 243–257. doi:10.2307/2690843. JSTOR 2690843. MR 1300564.
• Bombieri, Enrico; Gubler, Walter (2006). Heights in Diophantine geometry. Cambridge U. P. ISBN 0-521-84615-3. MR 2216774.
• Knuth, Donald E. (1997). "4.6.2 Factorization of polynomials". Seminumerical algorithms. The Art of Computer Programming. Vol. 2 (Third ed.). Reading, Massachusetts: Addison-Wesley. pp. 439–461, 678–691. ISBN 0-201-89684-2. MR 0633878.