1. Introduction
In 1888, when he was 26, David Hilbert [
1] pointed out that for homogeneous polynomials, only in the following three cases, a positive semi-definite (PSD) polynomial definite is a sum of squares (SOS) polynomial: (i)
; (ii)
; (iii)
; and
, where
M is the degree of the polynomial and
N is the number of variables. Hilbert proved that in all the other possible combinations of
and
N, there are PSD non-SOS (PNS) homogeneous polynomials. Furthermore, Hilbert established that every PSD homogeneous quartic polynomial in three variables admits a representation as an SOS of three quadratic forms. His original proof of this result, demonstrating the equivalence between PSD and SOS for ternary quartics, combines striking conciseness with pioneering topological methods that were remarkably advanced for their era, while mathematically elegant, the proof’s innovative approach proved difficult to fully comprehend, and even modern readers must carefully work through several non-obvious details. Recent literature has witnessed both comprehensive reconstructions of Hilbert’s original proof and the emergence of novel alternative proofs. For instance, in 2012, Pfister and Scheiderer [
2] presented a completely new approach that uses only elementary techniques.
While Hilbert established in 1888 that PSD polynomials coincide with SOS in only three specific cases, the first explicit example of a PNS homogeneous polynomial was not constructed until 77 years later, in 1965, when Motzkin [
3] gave the first PNS homogeneous polynomial:
where
and
. Thus, the remaining case with small
M and
N is that
. In 1977, Choi and Lam [
4] gave such a PNS polynomial:
Also, see [
5,
6] for PNS homogeneous polynomials. In 2017, Goel et al. [
7] showed that a symmetric PSD polynomial with
is SOS. This raises a natural question: Do analogous results hold for nonsymmetric quartic forms under additional structural constraints?
In this paper, we study the PSD-SOS problem of a special class of homogeneous quartic polynomials: biquadratic polynomials. In general, an
biquadratic polynomial can be expressed as follows:
where
and
. Biquadratic polynomials and biquadratic tensors arise in solid mechanics, statistics, quantum physics, spectral graph theory, and polynomial theory [
8]. Biquadratic SOS decompositions enable efficient solutions to non-convex optimization problems via SDP relaxations. In the analysis of nonlinear dynamical systems, stability can be rigorously verified through the construction of Lyapunov functions that admit an SOS decomposition.
Without loss of generality, we may assume that
. Thus, an
biquadratic polynomial is a quartic homogeneous polynomial of
variables, i.e.,
and
. However, we will show that for the PSD-SOS problem, this value of
can be reduced by one. In
Section 2, we show that for an
biquadratic polynomial
f, there exists a special quartic homogeneous polynomial
h, which we call a tripartite quartic polynomial, with
variables, such that
f is PSD if and only if
h is PSD, and
f is SOS if and only if
h is SOS. Then, according to Hilbert’s result, we immediately conclude that a
PSD biquadratic polynomial can be expressed as the sum of squares of three quadratic polynomials. This greatly improves the result of Calderón [
9] in 1973, who proved that a
biquadratic polynomial can be expressed as the sum of squares of nine quadratic polynomials. Furthermore, we present a necessary condition for a tripartite quartic polynomial to be PSD, and a necessary and sufficient condition for it to be PSD under the condition that the coefficient of the quartic power term of the flexible variable is zero.
In
Section 3, we give a sufficient and necessary condition for an
PSD biquadratic polynomial to be SOS. We show that if an
PSD biquadratic polynomial is SOS, than its SOS rank is at most
.
For a
PSD biquadratic polynomial, we may explicitly construct its SOS representation in some cases. A
biquadratic polynomial
f has four half-cross terms and one full-cross term. In
Section 4, we show that for a
PSD biquadratic polynomial
f, there is another
PSD biquadratic polynomial
h, which has at most two half-cross terms, such that if
h has an SOS form, then the SOS form of
f can be explicitly constructed. Then we give a constructive proof of the SOS form of a
PSD biquadratic polynomial
f, if it has either at most one half-cross term, or two half-cross terms but no full-cross term.
Some final remarks and open questions are made and raised in
Section 5.
2. Biquadratic Polynomials and Tripartite Quartic Polynomials
The following theorem is one main result of this paper.
Theorem 1. Suppose that we have an biquadratic polynomial f, expressed by (2), with . Then there is a tripartite homogeneous quartic polynomial of variables, where and , such that f is PSD if and only if h is PSD, and f is SOS if and only if h is SOS. In particular, a PSD biquadratic polynomial is always SOS of three quadratic polynomials. Proof. Let and for . Then we have a non-homogeneous quartic polynomial , of variables , , such that f is PSD if and only if g is PSD, and f is SOS if and only if g is SOS.
Now, we may convert
g to a homogeneous quartic polynomial
h of
variables, by adding an additional
z in the position of
and
, i.e.,
h is obtained by replacing
and
by
z. Then
g is PSD if and only if
h is PSD, and
g is SOS if and only if
h is SOS. The final conclusion now follows from the 1888 Hilbert result [
1]. The proof is complete. □
We call a tripartite homogeneous quartic polynomial, as it has the following property: in any term of h, the total degree of x-variables is at most 2, and the total degree of y-variables is also at most 2. We call z the flexible variable. Only the flexible variable can have degree four in h.
A tripartite quartic homogeneous polynomial
can be written as follows:
where
is a constant coefficient;
is an
biquadratic polynomial;
is a linear homogeneous polynomial of
;
is the sum of a quadratic homogeneous polynomial of
, a quadratic homogeneous polynomial of
, and a bilinear polynomial of
; and
is the sum of a linear quadratic polynomial and a quadratic-linear polynomial of
. We have the following theorem.
Theorem 2. Suppose that we have a tripartite quartic polynomial , expressed by (3), where , and . Then there is an biquadratic polynomial , where and , such that h is PSD if and only if f is PSD, and h is SOS if and only if f is SOS. Proof. In (
3), let
. Then we have a non-homogeneous quartic polynomial
, of
variables
, such that
h is PSD if and only if
g is PSD, and
h is SOS if and only if
g is SOS.
Now, we may convert g to an biquadratic polynomial , by adding an additional variable or , if needed, to terms of g to make the total degrees of x-variables of all terms of g as 2, and an additional variable or , if needed, to terms of g to make the total degrees of y-variables of all terms of g as 2. Then g is PSD if and only if f is PSD, and g is SOS if and only if f is SOS. The proof is complete. □
Thus, the PSD-SOS problem of biquadratic polynomials is equivalent to the PSD-SOS problem of tripartite quartic polynomials of variables.
To consider the PSD-SOS problem of tripartite quartic polynomials, we have the following theorem.
Theorem 3. Suppose that is a tripartite quartic polynomial, expressed by (3). If is PSD, then and is PSD. Furthermore, if , then the tripartite quartic polynomial is PSD if and only if (i) , (ii) , and are PSD.
Proof. Assume that h is PSD. Let x-variables and y-variables be zero and . Since h is PSD, we have . Let . Since h is PSD, should be PSD.
Suppose now that .
First, we assume that h is PSD. Since is a linear homogeneous polynomial of , if , we may choose adequate values of such that takes a negative value. Let z goes to infinity. Then, we have , contradicting with the assumption that f is PSD. Thus, . Similarly, if , we can show that is PSD. Furthermore, if is not PSD, then there are some values such that the function . Then, is an indeterminate quadratic polynomial of z. There is a value such that , contradicting to the assumption that h is PSD. Thus, must be PSD.
On the other hand, assume that conditions (i) and (ii) hold. Then for any value , is a PSD quadratic polynomial of z. Then we always have , i.e., h is PSD. The proof is complete. □
Thus, to consider the PSD-SOS problem of tripartite quartic polynomials, we only need to investigate two types of tripartite quartic polynomials. One type is that
and
is PSD in (
3). We call such a tripartite quartic polynomial a nondegenerated tripartite quartic polynomial. Another type is that
,
,
and
are PSD in (
3). We call such a tripartite quartic polynomial a degenerated tripartite quartic polynomial.
In fact, holds if and only if . Moreover, in the construction of the function g in Theorem 1, the choice of indices and is arbitrary. Consequently, h is degenerated whenever there exist i and j such that .
Note that a degenerated tripartite quartic polynomial is PSD. A natural question is as follows: Is a degenerated tripartite quartic polynomial always SOS?
3. SOS Biquadratic Polynomials
Let
be an
symmetric biquadratic tensor [
10] that satisfies
. We can rewrite the
biquadratic polynomial as follows:
where
, the matrix
is obtained by flattening the fourth-order tensor
into a two-dimensional representation, where the first two dimensions of the tensor are arranged as matrix rows and the last two dimensions as matrix columns. Namely,
Here, each element is given by
, where
and
.
While the coefficients of diagonal (where
and
) and half-cross (where
or
) terms are uniquely determined by the symmetry of
B, the full-cross terms (where
and
) exhibit non-uniqueness, as evidenced by the identity:
for any
. Specifically, let us define the index mappings
,
, and
,
. The quadratic form remains invariant under the transformation
and
. Therefore, we use
to represent a free parameter that captures the degrees of freedom in expressing the full cross terms, and construct
as follows:
Here,
,
,
if
and
if
.
For instance, when
, it holds that
,
Then we have the following theorem.
Theorem 4. Suppose that the biquadratic polynomial f expressed by (4) is PSD. Then the following three statements are equivalent. - (i)
f is SOS, with its SOS rank at most , and the coefficients can be orthogonal to each other;
- (ii)
there exists such that is PSD;
- (iii)
the following condition holds,
Proof. If
f is SOS, then there exists
such that
. By Theorem 1 in [
6], we obtain that
,
. Here, New
is the Newton polytope of
f. Therefore, we deduce that each
must be of the linear form
, where
is a coefficient vector and
. Let
denote the coefficient matrix. This immediately gives the quadratic representation
. Consequently, there exists
such that
is PSD.
Since is PSD, it admits a Cholesky decomposition. Specifically, there exists a matrix such that . Therefore, is an SOS of tetranomials, with SOS rank at most , and the coefficients are orthogonal to each other.
Since is symmetric, its positive semidefiniteness is equivalent to the nonnegativity of all its eigenvalues. In particular, is PSD if and only if its smallest eigenvalue is nonnegative.
This completes the proof. □
Next, we use the
example in page 358 of Qi et al. [
10] to demonstrate that
B is not PSD, yet there exists
such that
is SOS.
Example 1. Given a biquadratic tensor with the following components: , , , , , , , , and . The associated biquadratic polynomial can be expressed as follows:Then we can obtain The matrix B fails to be PSD, as evidenced by its smallest eigenvalue of . However, by selecting , we obtain a modified matrix that is PSD, with its smallest eigenvalue now being is . This positive semidefiniteness is further confirmed by the existence of the following Cholesky decompositionConsequently, admits the following SOS expression Theorem 4 shows that if an PSD biquadratic polynomial is SOS, then its SOS rank is at most , and the coefficients can be orthogonal to each other.
It may be insightful to examine
f in relation to the PSDness of
. Define
Suppose that
f is PSD, then there exists
such that
for all
. Denote
as the
i-th standard basis in
. It follows from
that
. However,
is not a convex set. Consequently, the PSD property of
f does not necessarily guarantee that
f is SOS, in general.
4. Biquadratic Polynomials
Given a
biquadratic polynomials as follows:
where the first four terms are called diagonal terms, the fifth term is called the full-cross term, and the last four terms are called half-cross terms. In
Section 2, we have shown that a
PSD biquadratic polynomial is always SOS. In this section, we present some SOS forms of
PSD biquadratic polynomials.
We first show that a
PSD biquadratic polynomial
f expressed by (
7) can be reformulated equivalently to another PSD
biquadratic polynomial with two neighbor half-cross terms and one full-cross terms.
Proposition 1. Suppose that the biquadratic polynomial f expressed by (7) is PSD. Then , andFurthermore, there is a PSD biquadratic polynomial g with only three half-cross terms:such that if g has an SOS form, then the SOS form of f can be resulted. Proof. Let and . Then we obtain that . Similarly, we derive that . Next, setting and leads to the inequality . Similar arguments establish the remaining conditions: , and .
Suppose . It follows from that . Then f has only three half-cross terms itself.
Now suppose that
. Let
,
,
,
and
. Then
g has only three half-cross terms as follows:
which is in the form of (
8). This completes the proof. □
Proposition 2. Suppose that the biquadratic polynomial g expressed by (8) is PSD. Then, there is a PSD biquadratic polynomial h containing only two half-cross terms are in neighbor positions as follows:such that if h has an SOS form, then the SOS form of g can be resulted. Proof. Suppose . It follows from that . Then g itself has only two half-cross terms, which are in neighbor positions.
Now suppose that
. Let
,
,
and
. Then
h has only two half-cross terms, which are in neighbor positions, i.e.,
which is in the form of (
9). This completes the proof. □
Combining Propositions 1 and 2, we obtain the following theorem.
Theorem 5. Suppose that the biquadratic polynomial f expressed by (7) is PSD. Then , andFurthermore, there is a PSD biquadratic polynomial h with only two half-cross terms as expressed by (9), such that if h has an SOS form, then the SOS form of f can be resulted. By Theorem 1, any
PSD biquadratic polynomial admits an SOS decomposition. Thus, in the remaining part of this section, we consider a
PSD biquadratic polynomial
f, with the form
to identify its concrete SOS form. In
Section 4.1,
Section 4.2 and
Section 4.3, we give constructive proofs for the SOS form of a
PSD biquadratic polynomials, in three cases: I.
f has no half-cross terms; II.
f has only one half-cross term; III.
f has two neighbor half-cross terms and no full-cross terms. The case that the
bipartite polynomial with one full-cross term along with two neighbor half-cross terms is somewhat complicated. We do not consider this case here.
4.1. Case I: No Half-Cross Terms
If f has no cross terms at all, the case is trivial. In this subsection, we assume that f has one full-cross term but no half-cross terms.
Lemma 1. LetThen the following three statements are equivalent: - (a)
is PSD.
- (b)
is SOS.
- (c)
The parameters satisfy
Proof. Since
f is PSD when
and
, we obtain
. Similarly,
. If
, then
By analogous reasoning, if
, then
Now we assume that
and
. It follows from
f is PSD when
,
, and
that
. Following similar methodology, we obtain that
. By direct computation, we derive that
When the first two terms vanish, the PSD condition of
f implies
.
follows directly from the above three reformulations of f.
is obvious. □
Building upon Lemma 1, we now establish the following theorem.
Theorem 6. LetThen, the following three statements are equivalent: - (a)
is PSD.
- (b)
is SOS.
- (c)
The parameters satisfy
4.2. Case II: Only One Half-Cross Term
In this subsection, we assume that f has one half-cross term and one full-cross term.
Lemma 2. Suppose thatThen, the following three statements are equivalent: - (a)
is PSD.
- (b)
is SOS.
- (c)
There exist and such that , , , and .
Proof. If , then the conclusion follows from Lemma 1. Thus, we may assume that .
(a) ⇒ (c) Because
f is PSD when
, we obtain that
. Therefore, there exist
and
such that
,
, and
. In the following, we show
. Let
and
. Then,
Since
f is PSD, we see that
and
cannot be both zero, and
and
cannot be both zero. We consequently classify three scenarios based on the parameters
and
:
Case (i)
and
. It follows from
f is PSD when
,
,
, and
that
. By selecting the parameters as
,
,
, we obtain
and
Let
,
,
and
. Then
. It follows from
f is PSD that
. Consequently, we conclude that there exist parameters
satisfying condition (c).
Case (ii) and . This can be proved similarly as Case (i).
Case (iii)
and
. Note that
and
cannot both be zero. Suppose
. If
, condition (c) hold directly. Suppose that
. Then it follows from
f is PSD that
and
Let
,
,
and
. Then the first two terms are zeros. Furthermore, define
It follows from
,
, and
that
is a function of
. Since
, it yields that
. When
, we derive that
and
. When
, we obtain that
and
. Thus, there is
such that
. Then by setting
,
, we obtain that
. It follows from
f is PSD that
. Consequently, we derive that there exist parameters
, specifically chosen as
,
, that satisfy (c).
The case when follows by an analogous argument with .
(c) ⇒ (b) follows directly from the above reformulations of f.
(b) ⇒ (a) follows directly from the definitions.
This completes the proof. □
Furthermore, we establish an equivalent condition based on Lemma 2 that depends solely on the coefficients of f.
Theorem 7. Suppose thatLetand be the unique parameter such that the derivative . Then the following three statements are equivalent: - (a)
is PSD.
- (b)
is SOS.
- (c)
It holds that .
Proof. Based on Lemma 2, we obtain that
,
,
, and
For any
, we may derive the derivative of
g as follows:
Here, the first term
is monotonously increasing to infinity and the second term
is monotonously decreasing from infinity. Therefore, there is one unique parameter
such that
. Furthermore,
is monotonously increasing in
and then monotonously decreasing in
. Consequently,
. Therefore, if
f is PSD, then it holds that
. □
4.3. Case III: Two Neighbor Half-Cross Terms and No Full-Cross Terms
In this subsection, we study the case of
biquadratic polynomials with two half-cross terms in the neighbor sides and no full-cross term. The case that the two half-cross terms in the opposite sides and no full-cross term is somewhat trivial. Consider
Here, we denote
and
to simplify our notation. Suppose that
and
, and
f is PSD. Then we derive that
and
.
For simplicity, we may replace
and
by
and
, respectively, and assume that
, i.e.,
We also may assume
(resp.
), since otherwise we could replace
with
(resp.
with
). Without loss of generality, assume that
.
If
, then
which gives the SOS form of
f explicitly.
When
,
is not PSD for any
. This can be seen by letting
,
,
and
Theorem 8. Suppose that the biquadratic polynomial f is expressed by (14), where , , and . Then the following three statements are equivalent: - (a)
is PSD.
- (b)
is SOS.
- (c)
where is the root of function defined by the following equation
Proof. We assume that
f has the following SOS decomposition:
where parameters
and
. By comparing (
14) and (
16), we observe that
The polynomial
f admits an SOS decomposition if the system of Equation (
17) admits solutions
satisfying
and
. Combining Equations (
17c) and (
17d) yields
. In the case where
, either
or
. We therefore proceed by analyzing two distinct cases separately: (i)
and (ii)
. The former case is subsequently divided into subcases (i1) and (i2) for detailed examination.
Case (i1):
and
. By setting
and
, we can simplify Equations (
17a)–(
17e) to
Combining Equations (
18a) and (
18c) yields
Therefore, we obtain that
and
. It follows from
that the quadratic equation in
admits two distinct real roots
. By the fact that
, only the root
is feasible. Consequently, in Case (i1), if
then
f is SOS.
Case (i2):
and
. By setting
and
, we can simplify (
17a)–(
17e) to
By direct computation, we obtain
,
, and
. Consequently, we derive the following quadratic equation with respective to
:
It follows from
that (
20) admits two real solutions, which derives that (
19) is feasible. Hence, in Case (i2), if
then
f is SOS.
Case (ii):
and
. Then we obtain that
, and
. It follows from (17b)–(17e) that
Consequently, Equation (
15) is derived directly from (
17a). By the inequalities
and
, we conclude that there exists a solution
such that
. Subsequently, we obtain the corresponding values of
and
by (
21). Furthermore, it follows directly from
and
that
, and from
that
. Consequently,
. Thus, if
then
f is SOS.
In both Cases (i) and (ii), if
, then
f is not PSD. This can be seen by letting
and
in (
16). This completes the proof. □
Example 2. Let , , . The corresponding biquadratic polynomial is given by:We could verify that and . According to Theorem 8, these conditions guarantee that f is an SOS. By YALMIP and SDPT4 within the MATLAB 2024a environment, we obtain an explicit SOS decomposition as follows: 5. Conclusions and Open Questions
In his seminal 1888 work [
1], Hilbert demonstrated the existence of PSD homogeneous quartic polynomials in four variables that cannot be expressed as SOS. Nearly a century later, Choi and Lam (1977) [
4] constructed an explicit example of such a PNS quartic polynomial. In the present work, we establish that despite being four-variable quartic polynomials, all
PSD biquadratic polynomials admit an SOS representation. The key technique is that an
biquadratic polynomial can be expressed as a tripartite homogeneous quartic polynomial of
variables. Furthermore, we established a necessary and sufficient condition for an
PSD biquadratic polynomial to admit an SOS representation, and demonstrated that the SOS rank of such polynomials was bounded above by
. Subsequently, we provided a constructive proof for obtaining the SOS decomposition of
PSD biquadratic polynomials in three specific cases.
In general, an
biquadratic polynomial can be written as
In 1973, Calderón [
9] proved that an
PSD biquadratic polynomial can be expressed as the sum of squares of
quadratic polynomials. In this paper, we proved that a
PSD biquadratic polynomial can be expressed as the sum of squares of three quadratic polynomials. An open question is what is the SOS rank for an
PSD biquaratic polynomial for
. In 1975, Choi [
11] gave a
PNS biquadratic polynomial. Another open question is: What is the maximum SOS rank of an
SOS biquadratic polynomial for
. An even more challenging question is to determine a given
PSD biquadratic polynomial is SOS or not numerically.