Next Article in Journal
Comparative Analysis of Some Methods and Algorithms for Traffic Optimization in Urban Environments Based on Maximum Flow and Deep Reinforcement Learning
Previous Article in Journal
Improved Probability-Weighted Moments and Two-Stage Order Statistics Methods of Generalized Extreme Value Distribution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Positive Semi-Definite and Sum of Squares Biquadratic Polynomials

1
School of Mathematical Sciences, Beihang University, Beijing 100191, China
2
Jiangsu Provincial Scientific Research Center of Applied Mathematics, Nanjing 211189, China
3
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
4
School of Mathematics, Southeast University, Nanjing 211189, China
5
Nanjing Center for Applied Mathematics, Nanjing 211135, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(14), 2294; https://doi.org/10.3390/math13142294
Submission received: 24 June 2025 / Revised: 14 July 2025 / Accepted: 15 July 2025 / Published: 17 July 2025

Abstract

Hilbert proved in 1888 that a positive semi-definite (PSD) homogeneous quartic polynomial of three variables always can be expressed as the sum of squares (SOS) of three quadratic polynomials, and a psd homogeneous quartic polynomial of four variables may not be sos. Only after 87 years, in 1975, Choi gave the explicit expression of such a psd-not-sos (PNS) homogeneous quartic polynomial of four variables. An m × n biquadratic polynomial is a homogeneous quartic polynomial of m + n variables. In this paper, we show that an m × n biquadratic polynomial can be expressed as a tripartite homogeneous quartic polynomial of m + n 1 variables. Therefore, by Hilbert’s theorem, a 2 × 2 PSD biquadratic polynomial can be expressed as the sum of squares of three quadratic polynomials. This improves the result of Calderón in 1973, who proved that a 2 × 2 biquadratic polynomial can be expressed as the sum of squares of nine quadratic polynomials. Furthermore, we present a necessary and sufficient condition for an m × n psd biquadratic polynomial to be sos, and show that if such a polynomial is sos, then its sos rank is at most m n . Then we give a constructive proof of the sos form of a 2 × 2 psd biquadratic polynomial in three cases.

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) N = 2 ; (ii) M = 2 ; (iii) M = 4 ; and N = 3 , 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 M = 2 K 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:
f M ( x ) = x 3 6 + x 1 2 x 2 4 + x 1 4 x 2 2 3 x 1 2 x 2 2 x 3 2 ,
where M = 6 and N = 3 . Thus, the remaining case with small M and N is that M = N = 4 . In 1977, Choi and Lam [4] gave such a PNS polynomial:
f C L ( x ) = x 1 2 x 2 2 + x 1 2 x 3 2 + x 2 2 x 3 2 4 x 1 x 2 x 3 x 4 + x 4 4 .
Also, see [5,6] for PNS homogeneous polynomials. In 2017, Goel et al. [7] showed that a symmetric PSD polynomial with M = N = 4 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 m × n biquadratic polynomial can be expressed as follows:
f ( x ^ , y ^ ) = i , j = 1 m k , l = 1 n a i j k l x i x j y k y l ,
where x ^ = ( x 1 , , x m ) and y ^ = ( y 1 , , y n ) . 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 m n 2 . Thus, an m × n biquadratic polynomial is a quartic homogeneous polynomial of m + n variables, i.e., M = 4 and N = m + n . However, we will show that for the PSD-SOS problem, this value of m + n can be reduced by one. In Section 2, we show that for an m × n biquadratic polynomial f, there exists a special quartic homogeneous polynomial h, which we call a tripartite quartic polynomial, with N = m + n 1 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 2 × 2 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 2 × 2 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 m × n PSD biquadratic polynomial to be SOS. We show that if an m × n PSD biquadratic polynomial is SOS, than its SOS rank is at most m n .
For a 2 × 2 PSD biquadratic polynomial, we may explicitly construct its SOS representation in some cases. A 2 × 2 biquadratic polynomial f has four half-cross terms and one full-cross term. In Section 4, we show that for a 2 × 2 PSD biquadratic polynomial f, there is another 2 × 2 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 2 × 2 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 m × n biquadratic polynomial f, expressed by (2), with m n 2 . Then there is a tripartite homogeneous quartic polynomial h ( x , y , z ) of m + n 1 variables, where x = ( x 1 , , x m 1 ) and y = ( y 1 , , y n 1 ) , 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 2 × 2 PSD biquadratic polynomial is always SOS of three quadratic polynomials.
Proof. 
Let x m = 1 and y n = 1 for j = 1 , , n 1 . Then we have a non-homogeneous quartic polynomial g ( x , y ) , of m + n 2 variables x 1 , , x m 1 , y 1 , , y n 1 , 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 m + n 1 variables, by adding an additional z in the position of x m and y n , i.e., h is obtained by replacing x m and y n 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 h ( x , y , z ) 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 h ( x , y , z ) can be written as follows:
h ( x , y , z ) = h 0 z 4 + h 1 ( x , y ) z 3 + h 2 ( x , y ) z 2 + h 3 ( x , y ) z + h 4 ( x , y ) ,
where h 0 is a constant coefficient; h 4 ( x , y ) is an ( m 1 ) × ( n 1 ) biquadratic polynomial; h 1 ( x , y ) is a linear homogeneous polynomial of ( x , y ) ; h 2 ( x , y ) is the sum of a quadratic homogeneous polynomial of x , a quadratic homogeneous polynomial of y , and a bilinear polynomial of ( x , y ) ; and h 3 ( x , y ) is the sum of a linear quadratic polynomial and a quadratic-linear polynomial of ( x , y ) . We have the following theorem.
Theorem 2. 
Suppose that we have a tripartite quartic polynomial h ( x , y , z ) , expressed by (3), where x R m 1 , y R n 1 , z R and m n 2 . Then there is an m × n biquadratic polynomial f ( x ^ , y ^ ) , where x ^ = ( x 1 , , x m ) and y ^ = ( y 1 , , y n ) , 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 z = 1 . Then we have a non-homogeneous quartic polynomial g ( x , y ) , of m + n 2 variables x 1 , , x m 1 , y 1 , , y n 1 , 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 m × n biquadratic polynomial f ( x ^ , y ^ ) , by adding an additional variable x m or x m 2 , 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 y n or y n 2 , 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 m × n biquadratic polynomials is equivalent to the PSD-SOS problem of tripartite quartic polynomials of m + n 1 variables.
To consider the PSD-SOS problem of tripartite quartic polynomials, we have the following theorem.
Theorem 3. 
Suppose that h ( x , y , z ) is a tripartite quartic polynomial, expressed by (3). If h ( x , y , z ) is PSD, then h 0 0 and h 4 ( x , y ) is PSD.
Furthermore, if h 0 = 0 , then the tripartite quartic polynomial h ( x , y , z ) is PSD if and only if (i) h 1 ( x , y ) 0 , (ii) h 2 ( x , y ) , h 4 ( x , y ) and 4 h 2 ( x , y ) h 4 ( x , y ) h 3 ( x , y ) 2 are PSD.
Proof. 
Assume that h is PSD. Let x-variables and y-variables be zero and z = 1 . Since h is PSD, we have h 0 0 . Let z = 0 . Since h is PSD, h 4 ( x , y ) should be PSD.
Suppose now that h 0 = 0 .
First, we assume that h is PSD. Since h 1 ( x , y ) is a linear homogeneous polynomial of ( x , y ) , if h 1 ( x , y ) 0 , we may choose adequate values of ( x , y ) such that h 1 takes a negative value. Let z goes to infinity. Then, we have h ( x , y , z ) < 0 , contradicting with the assumption that f is PSD. Thus, h 1 ( x , y ) 0 . Similarly, if h 0 = 0 , we can show that h 2 ( x , y ) is PSD. Furthermore, if 4 h 2 ( x , y ) h 4 ( x , y ) h 3 ( x , y ) 2 is not PSD, then there are some values ( x * , y * ) such that the function 4 h 2 ( x * , y * ) h 4 ( x * , y * ) h 3 ( x * , y * ) 2 < 0 . Then, h ( x * , y * , z ) is an indeterminate quadratic polynomial of z. There is a value z * such that h ( x * , y * , z * ) < 0 , contradicting to the assumption that h is PSD. Thus, 4 h 2 ( x , y ) h 4 ( x , y ) h 3 ( x , y ) 2 must be PSD.
On the other hand, assume that conditions (i) and (ii) hold. Then for any value ( x * , y * ) , h ( x * , y * , z ) is a PSD quadratic polynomial of z. Then we always have h ( x , y , z ) 0 , 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 h 0 = 1 and h 4 ( x , y ) is PSD in (3). We call such a tripartite quartic polynomial a nondegenerated tripartite quartic polynomial. Another type is that h 0 = 0 , h 1 ( x , y ) 0 , h 2 ( x , y ) , h 4 ( x , y ) and 4 h 2 ( x , y ) h 4 ( x , y ) h 3 ( x , y ) 2 are PSD in (3). We call such a tripartite quartic polynomial a degenerated tripartite quartic polynomial.
In fact, h 0 = 0 holds if and only if a m n m n = 0 . Moreover, in the construction of the function g in Theorem 1, the choice of indices i { 1 , , m } and j { 1 , , n } is arbitrary. Consequently, h is degenerated whenever there exist i and j such that a i j i j = 0 .
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 A = ( a i j k l ) be an m × n symmetric biquadratic tensor [10] that satisfies a i j k l = a k l i j . We can rewrite the m × n biquadratic polynomial as follows:
f ( x , y ) = i , k = 1 m j , l = 1 n a i j k l x i y j x k y l = z T ( B + P ( Γ ) ) z : = z T M ( Γ ) z ,
where z = x y R m n , the matrix B = ( b s t ) R m n × m n is obtained by flattening the fourth-order tensor A 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,
B = B 11 B 12 B 1 m B 21 B 22 B 2 m B m 1 B m 2 B m m , B i k = a i 1 k 1 a i 1 k 2 a i 1 k n a i 2 k 1 a i 2 k 2 a i 2 k n a i n k 1 a i n k 2 a i n k n .
Here, each element is given by b s t = a i j k l = a k l i j , where s = ( i 1 ) n + j and t = ( k 1 ) n + l .
While the coefficients of diagonal (where i = k and j = l ) and half-cross (where i = k or j = l ) terms are uniquely determined by the symmetry of B, the full-cross terms (where i k and j l ) exhibit non-uniqueness, as evidenced by the identity:
a i j k l + a k l i j + a k j i l + a i j k l x i y j x k y l = 2 a i j k l + γ x i y j x k y l + 2 a k j i l γ x i y j x k y l
for any γ R . Specifically, let us define the index mappings s 1 = ( i 1 ) n + j , t 1 = ( k 1 ) n + l , and s 2 = ( k 1 ) n + j , t 2 = ( i 1 ) n + l . The quadratic form remains invariant under the transformation b s 1 t 1 b s 1 t 1 + γ and b s 2 t 2 b s 2 t 2 γ . Therefore, we use Γ = ( γ t i t j ) R m 2 × n 2 to represent a free parameter that captures the degrees of freedom in expressing the full cross terms, and construct P ( Γ ) = ( P i j ( Γ ) ) R m n × m n as follows:
P i j ( Γ ) = γ t i t j , if i 1 < i 2 , j 1 < j 2 s . t . i = n i 1 j 1 , j = n i 2 j 2 , t i = t i 1 i 2 , t j = t j 1 j 2 ; γ t i t j , if i 1 > i 2 , j 1 > j 2 s . t . i = n i 1 j 1 , j = n i 2 j 2 , t i = t i 1 i 2 , t j = t j 1 j 2 ; γ t i t j , if i 1 < i 2 , j 1 > j 2 s . t . i = n i 1 j 1 , j = n i 2 j 2 , t i = t i 1 i 2 , t j = t j 1 j 2 ; γ t i t j , if i 1 > i 2 , j 1 < j 2 s . t . i = n i 1 j 1 , j = n i 2 j 2 , t i = t i 1 i 2 , t j = t j 1 j 2 ; 0 , otherwise .
Here, m 2 = m ( m 1 ) 2 , n i 1 j 1 = ( i 1 1 ) n + j 1 , t i 1 i 2 = ( i 1 1 ) ( i 1 2 ) 2 + i 2 if i 1 > i 2 and t i 1 i 2 = ( i 2 1 ) ( i 2 2 ) 2 + i 1 if i 1 < i 2 .
For instance, when m = n = 2 , it holds that z = [ x 1 y 1 , x 1 y 2 , x 2 y 1 , x 2 y 2 ] ,
B = a 1111 a 1112 a 1121 a 1122 a 1211 a 1212 a 1221 a 1222 a 2111 a 2112 a 2121 a 2122 a 2211 a 2212 a 2221 a 2222 and P ( γ ) = γ γ γ γ .
Then we have the following theorem.
Theorem 4. 
Suppose that the m × n 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 m n , and the coefficients can be orthogonal to each other;
(ii) 
there exists Γ = ( γ t i t j ) R m 2 × n 2 such that M ( Γ ) is PSD;
(iii) 
the following condition holds,
max Γ R m 2 × n 2 min z z = 1 z M ( Γ ) z 0 .
Proof. ( i ) ( i i ) If f is SOS, then there exists T > 0 such that f = t = 1 T f t 2 ( x , y ) . By Theorem 1 in [6], we obtain that supp ( f t ) 1 2 New ( f ) , t = 1 , , T . Here, New ( f ) is the Newton polytope of f. Therefore, we deduce that each f t must be of the linear form f t = c t z , where c t is a coefficient vector and z = x y . Let C = [ c 1 , , c T ] R m n × T denote the coefficient matrix. This immediately gives the quadratic representation f = z C C z . Consequently, there exists Γ such that M ( Γ ) = C C is PSD.
( i i ) ( i ) Since M ( Γ ) is PSD, it admits a Cholesky decomposition. Specifically, there exists a matrix C R m n × m n such that M ( Γ ) = C C . Therefore, f = t = 1 m n ( c t z ) 2 is an SOS of tetranomials, with SOS rank at most m n , and the coefficients are orthogonal to each other.
( i i ) ( i i i ) Since M ( Γ ) is symmetric, its positive semidefiniteness is equivalent to the nonnegativity of all its eigenvalues. In particular, M ( Γ ) is PSD if and only if its smallest eigenvalue λ min = min z z = 1 z M ( Γ ) z is nonnegative.
This completes the proof. □
Next, we use the 2 × 2 example in page 358 of Qi et al. [10] to demonstrate that B is not PSD, yet there exists γ such that f ( x , y ) is SOS.
Example 1. 
Given a 2 × 2 biquadratic tensor A with the following components: a 1111 = 1 , a 1112 = 2 , a 1122 = 4 , a 1212 = 12 , a 2121 = 12 , a 1222 = 1 , a 1121 = 2 , a 2122 = 1 , and a 2222 = 2 . The associated biquadratic polynomial can be expressed as follows:
f ( x , y ) = x 1 2 y 1 2 + 4 x 1 2 y 1 y 2 + 12 x 1 2 y 2 2 + 4 x 1 x 2 y 1 2 + 16 x 1 x 2 y 1 y 2 + 2 x 1 x 2 y 2 2 + 12 x 2 2 y 1 2 + 2 x 2 2 y 1 y 2 + 2 x 2 2 y 2 2 .
Then we can obtain
B = a 1111 a 1112 a 1121 a 1122 a 1211 a 1212 a 1221 a 1222 a 2111 a 2112 a 212 a 2122 a 2211 a 2212 a 2221 a 2222 = 1 2 2 4 2 12 4 1 2 4 12 1 4 1 1 2 .
The matrix B fails to be PSD, as evidenced by its smallest eigenvalue of 2.6110 . However, by selecting γ = 3 , we obtain a modified matrix M ( γ ) that is PSD, with its smallest eigenvalue now being M ( γ ) is 0.2069 . This positive semidefiniteness is further confirmed by the existence of the following Cholesky decomposition
M ( γ ) = 1 2 2 1 2 12 7 1 2 7 12 1 1 1 1 2 = C C , with C = 1 0 0 0 2 2.8284 0 0 2 1.0607 2.6220 0 1 0.3536 0.2384 0.9045
Consequently, f ( x , y ) admits the following SOS expression
f ( x , v y ) = ( x 1 y 1 + 2 x 1 y 2 + 2 x 2 y 1 + x 2 y 2 ) 2 + ( 2.8284 x 1 y 2 + 1.0607 x 2 y 1 0.3536 x 2 y 2 ) 2 + ( 2.6220 x 2 y 1 0.2384 x 2 y 2 ) 2 + 0.9045 x 2 y 2 2 .
Theorem 4 shows that if an m × n PSD biquadratic polynomial is SOS, then its SOS rank is at most m n , and the coefficients can be orthogonal to each other.
It may be insightful to examine f in relation to the PSDness of M ( Γ ) . Define
S m n = { z : z = x y , x R m , y R n } .
Suppose that f is PSD, then there exists Γ such that z M ( Γ ) z 0 for all z S m n . Denote e i ( m n ) as the i-th standard basis in R m n . It follows from e 1 ( m n ) , , e m n ( m n ) S m n that dim ( S m n ) = m n . However, S m n is not a convex set. Consequently, the PSD property of f does not necessarily guarantee that f is SOS, in general.

4. 2 × 2 Biquadratic Polynomials

Given a 2 × 2 biquadratic polynomials as follows:
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 + b x 1 x 2 y 1 y 2 + c x 1 x 1 2 y 1 y 2 + c x 2 x 2 2 y 1 y 2 + c y 1 x 1 x 2 y 1 2 + c y 2 x 1 x 2 y 2 2 ,
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 2 × 2 PSD biquadratic polynomial is always SOS. In this section, we present some SOS forms of 2 × 2 PSD biquadratic polynomials.
We first show that a 2 × 2 PSD biquadratic polynomial f expressed by (7) can be reformulated equivalently to another PSD 2 × 2 biquadratic polynomial with two neighbor half-cross terms and one full-cross terms.
Proposition 1. 
Suppose that the 2 × 2 biquadratic polynomial f expressed by (7) is PSD. Then a 11 , a 12 , a 21 , a 22 0 , and
4 a 11 a 12 c x 1 2 , 4 a 11 a 21 c y 1 2 , 4 a 12 a 22 c y 2 2 , 4 a 21 a 22 c x 2 2 .
Furthermore, there is a 2 × 2 PSD biquadratic polynomial g with only three half-cross terms:
g ( x , y ) = a ¯ 11 x 1 2 y 1 2 + a ¯ 12 x 1 2 y 2 2 + a ¯ 21 x 2 2 y 1 2 + a ¯ 22 x 2 2 y 2 2 + b ¯ x 1 x 2 y 1 y 2 + c ¯ x 1 x 1 2 y 1 y 2 + c ¯ y 1 x 1 x 2 y 1 2 + c ¯ y 2 x 1 x 2 y 2 2 ,
such that if g has an SOS form, then the SOS form of f can be resulted.
Proof. 
Let x 1 = y 1 = 1 and x 2 = y 2 = 0 . Then we obtain that a 11 0 . Similarly, we derive that a 12 , a 21 , a 22 0 . Next, setting x 1 = 1 and x 2 = 0 leads to the inequality 4 a 11 a 12 c x 1 2 . Similar arguments establish the remaining conditions: 4 a 11 a 21 c y 1 2 , 4 a 12 a 22 c y 2 2 and 4 a 21 a 22 c x 2 2 .
Suppose a 21 = 0 . It follows from 4 a 21 a 22 c x 2 2 that c x 2 = 0 . Then f has only three half-cross terms itself.
Now suppose that a 21 > 0 . Let x ¯ 1 = x 1 , x ¯ 2 = x 2 , y ¯ 2 = y 2 ,
y ¯ 1 = y 1 + c x 2 2 a 21 y 2
and g ( x ¯ , y ¯ ) f ( x , y ) . Then g has only three half-cross terms as follows:
g ( x ¯ , y ¯ ) = f ( x , y ) = a 11 x ¯ 1 2 y ¯ 1 2 + a 11 c x 2 2 4 a 21 2 + a 12 c x 1 c x 2 2 a 21 x ¯ 1 2 y ¯ 2 2 + a 21 x ¯ 2 2 y ¯ 1 2 + a 22 c x 2 2 4 a 21 x ¯ 2 2 y ¯ 2 2 + b c y 1 c x 2 a 21 x ¯ 1 x ¯ 2 y ¯ 1 y ¯ 2 + c x 1 a 11 c x 2 2 a 21 x ¯ 1 2 y ¯ 1 y 2 ¯ + c y 1 x ¯ 1 x ¯ 2 y ¯ 1 2 + c y 2 + c y 1 c x 2 2 4 a 21 2 b c x 2 2 a 21 x ¯ 1 x ¯ 2 y ¯ 2 2 ,
which is in the form of (8). This completes the proof. □
Proposition 2. 
Suppose that the 2 × 2 biquadratic polynomial g expressed by (8) is PSD. Then, there is a 2 × 2 PSD biquadratic polynomial h containing only two half-cross terms are in neighbor positions as follows:
h ( x , y ) = a ^ 11 x 1 2 y 1 2 + a ^ 12 x 1 2 y 2 2 + a ^ 21 x 2 2 y 1 2 + a ^ 22 x 2 2 y 2 2 + b ^ x 1 x 2 y 1 y 2 + c ^ x 1 x 1 2 y 1 y 2 + c ^ y 1 x 1 x 2 y 1 2 ,
such that if h has an SOS form, then the SOS form of g can be resulted.
Proof. 
Suppose a ¯ 22 = 0 . It follows from 4 a ¯ 12 a ¯ 22 c ¯ y 2 2 that c ¯ y 2 = 0 . Then g itself has only two half-cross terms, which are in neighbor positions.
Now suppose that a 22 > 0 . Let x ^ 1 = x ¯ 1 ,
x ^ 2 = x ¯ 2 + c ¯ y 2 2 a ¯ 22 x ¯ 1 ,
y ^ 1 = y ¯ 1 , y ^ 2 = y ¯ 2 and h ( x ^ , y ^ ) g ( x ¯ , y ¯ ) . Then h has only two half-cross terms, which are in neighbor positions, i.e.,
h ( x ^ , y ^ ) = g ( x ¯ , y ¯ ) = a ¯ 11 + a ¯ 21 c ¯ y 2 2 4 a ¯ 22 2 c ¯ y 1 c ¯ y 2 2 a ¯ 22 x ^ 1 2 y ^ 1 2 + a ¯ 12 c ¯ y 2 2 4 a ¯ 22 x ^ 1 2 y ^ 2 2 + a ¯ 21 x ^ 2 2 y ^ 1 2 + a ¯ 22 x ^ 2 2 y ^ 2 2 + b ¯ x ^ 1 x ^ 2 y ^ 1 y ^ 2 + c ¯ x 1 b c ¯ y 2 2 a ¯ 22 x ^ 1 2 y ^ 1 y ^ 2 + c ¯ y 1 a ¯ 21 c ¯ y 2 a ¯ 22 x ^ 1 x ^ 2 y ^ 1 2 ,
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 2 × 2 biquadratic polynomial f expressed by (7) is PSD. Then a 11 , a 12 , a 21 , a 22 0 , and
4 a 11 a 12 c x 1 2 , 4 a 11 a 21 c y 1 2 , 4 a 12 a 22 c y 2 2 , 4 a 21 a 22 c x 2 2 .
Furthermore, there is a 2 × 2 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 2 × 2 PSD biquadratic polynomial admits an SOS decomposition. Thus, in the remaining part of this section, we consider a 2 × 2 PSD biquadratic polynomial f, with the form
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 + b x 1 x 2 y 1 y 2 + c x 1 x 1 2 y 1 y 2 + c y 1 x 1 x 2 y 1 2 ,
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 2 × 2 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 2 × 2 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. 
Let
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 4 x 1 x 2 y 1 y 2 .
Then the following three statements are equivalent:
(a) 
f ( x , y ) is PSD.
(b) 
f ( x , y ) is SOS.
(c) 
The parameters a 11 , a 12 , a 21 , a 22 satisfy
a 11 , a 12 , a 21 , a 22 0 and a 11 a 22 + a 12 a 21 2 .
Proof.  ( a ) ( c ) Since f is PSD when x 1 = y 1 = 1 and x 2 = y 2 = 0 , we obtain a 11 0 . Similarly, a 12 , a 21 , a 22 0 . If a 11 a 22 2 , then
f ( x , y ) = a 11 4 a 22 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + 2 a 22 x 1 y 1 a 22 x 2 y 2 2 .
By analogous reasoning, if a 12 a 21 2 , then
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 4 a 21 x 1 2 y 2 2 + 2 a 21 x 2 y 1 a 21 x 2 y 1 2 + a 22 x 2 2 y 2 2 .
Now we assume that a 11 a 22 < 2 and a 12 a 21 < 2 . It follows from f is PSD when x 2 = y 2 = 1 , a 12 x 1 y 2 = a 21 x 2 y 1 , and x 1 , y 1 that a 11 > 0 . Following similar methodology, we obtain that a 12 , a 21 , a 22 > 0 . By direct computation, we derive that
f ( x , y ) = a 11 x 1 y 2 a 22 x 2 y 1 2 + 2 a 11 a 22 a 21 x 1 y 2 a 21 x 2 y 1 2 + a 12 ( 2 a 11 a 22 ) 2 a 21 x 1 2 y 2 2 .
When the first two terms vanish, the PSD condition of f implies a 11 a 22 + a 12 a 21 2 .
( c ) ( b ) follows directly from the above three reformulations of f.
( b ) ( a ) is obvious. □
Building upon Lemma 1, we now establish the following theorem.
Theorem 6. 
Let
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 b x 1 x 2 y 1 y 2 .
Then, the following three statements are equivalent:
(a) 
f ( x , y ) is PSD.
(b) 
f ( x , y ) is SOS.
(c) 
The parameters a 11 , a 12 , a 21 , a 22 satisfy
a 11 , a 12 , a 21 , a 22 0 , and a 11 a 22 + a 12 a 21 | b | 2 .

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 that
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 4 x 1 y 1 x 2 y 2 c y 1 x 1 x 2 y 1 2 .
Then, the following three statements are equivalent:
(a) 
f ( x , y ) is PSD.
(b) 
f ( x , y ) is SOS.
(c) 
There exist a 111 , a 211 0 and a 112 , a 212 > 0 such that a 11 = a 111 + a 112 , a 21 = a 211 + a 212 , 4 a 112 a 212 = c y 1 2 , and a 111 a 22 + a 12 a 211 2 .
Proof. 
If c y 1 = 0 , then the conclusion follows from Lemma 1. Thus, we may assume that c y 1 0 .
(a) ⇒ (c) Because f is PSD when y 2 = 0 , we obtain that 4 a 11 a 21 c y 1 2 . Therefore, there exist a 111 , a 211 0 and a 112 , a 212 > 0 such that a 11 = a 111 + a 112 , a 21 = a 211 + a 212 , and 4 a 112 a 212 = c y 1 2 . In the following, we show a 111 a 22 + a 12 a 211 2 . Let x 1 = a 212 > 0 and x 2 = sgn ( c y 1 ) a 112 0 . Then,
f ( x , y ) = a 111 a 212 + a 211 a 112 y 1 2 + a 22 a 112 + a 12 a 212 y 2 2 4 sgn ( c y 1 ) a 112 a 212 y 1 y 2 .
Since f is PSD, we see that a 111 and a 211 cannot be both zero, and a 22 and a 12 cannot be both zero. We consequently classify three scenarios based on the parameters a 22 and a 12 :
Case (i) a 22 = 0 and a 12 > 0 . It follows from f is PSD when x 1 = a 21 , x 2 = a 11 , y 2 = 1 , and y 1 that a 21 > c y 1 2 4 a 11 . By selecting the parameters as a 112 = a 11 , a 212 = c y 1 2 4 a 11 , a 211 = a 21 a 212 , we obtain a 211 > 0 and
f ( x , y ) = a 12 4 a 211 x 1 2 y 2 2 + 2 a 211 x 1 y 2 a 211 x 2 y 1 2 + a 11 x 1 sgn ( c y 1 ) a 212 x 2 2 y 1 2 .
Let x 1 = a 212 , x 2 = sgn ( c y 1 ) a 112 , y 2 = a 211 x 2 and y 1 = a 12 x 1 . Then f ( x , y ) = a 12 4 a 211 x 1 2 y 2 2 . It follows from f is PSD that a 12 a 211 2 . Consequently, we conclude that there exist parameters a 111 , a 211 , a 112 , a 212 satisfying condition (c).
Case (ii) a 12 = 0 and a 22 > 0 . This can be proved similarly as Case (i).
Case (iii) a 22 > 0 and a 12 > 0 . Note that a 111 and a 211 cannot both be zero. Suppose a 111 0 . If a 111 a 22 > 2 , condition (c) hold directly. Suppose that a 111 a 22 < 2 . Then it follows from f is PSD that a 211 > 0 and
f ( x , y ) = ( a 111 x 1 y 1 a 22 x 2 y 2 ) 2 + a 12 ( 2 a 111 a 22 ) 2 a 211 x 1 2 y 2 2 + 2 a 111 a 22 a 211 x 1 y 2 a 211 x 2 y 1 2 + a 112 x 1 sgn ( c y 1 ) a 212 x 2 2 y 1 2 .
Let x 1 = a 212 , x 2 = sgn ( c y 1 ) a 112 , y 1 = a 22 x 2 and y 2 = a 111 x 1 . Then the first two terms are zeros. Furthermore, define
ϕ ( a 112 ) = a 111 ( 2 a 111 a 22 ) c y 1 2 4 a 211 a 112 2 a 22 .
It follows from a 111 = a 11 a 112 , a 211 = a 21 a 212 , and a 212 = c y 1 2 4 a 112 that ϕ is a function of a 112 . Since a 212 = c y 1 2 4 a 112 a 21 , it yields that a 112 c y 1 2 4 a 21 , a 11 . When a 112 = c y 1 2 4 a 21 , we derive that a 211 = 0 and ϕ c y 1 2 4 a 21 0 . When a 112 = a 11 , we obtain that a 111 = 0 and ϕ ( a 11 ) 0 . Thus, there is η 0 c y 1 2 4 a 21 , a 11 such that ϕ ( a 112 ) = 0 . Then by setting a 112 = η 0 , a 212 = c y 1 2 4 η 0 , we obtain that f ( x , y ) = a 12 ( 2 a 111 a 22 ) 2 a 211 x 1 2 y 2 2 . It follows from f is PSD that a 111 a 22 + a 12 a 211 2 . Consequently, we derive that there exist parameters a 111 , a 211 , a 112 , a 212 , specifically chosen as a 112 = η 0 , a 212 = c y 1 2 4 η 0 , that satisfy (c).
The case when a 211 0 follows by an analogous argument with a 111 0 .
(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 that
f ( x , y ) = a 11 x 1 2 y 1 2 + a 22 x 2 2 y 2 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 b x 1 y 1 x 2 y 2 c y 1 x 1 x 2 y 1 2 .
Let
g ( a 112 ) = a 11 a 112 a 22 + a 12 a 21 c y 1 2 4 a 112 .
and a 112 * c y 1 2 4 a 21 , a 11 be the unique parameter such that the derivative g ( a 112 * ) = 0 . Then the following three statements are equivalent:
(a) 
f ( x , y ) is PSD.
(b) 
f ( x , y ) is SOS.
(c) 
It holds that g ( a 112 * ) | b | 2 .
Proof. 
Based on Lemma 2, we obtain that a 11 = a 111 + a 112 , a 21 = a 211 + a 212 , 4 a 112 a 212 = c y 1 2 , and
g ( a 112 ) = a 11 a 112 a 22 + a 12 a 21 c y 1 2 4 a 112 = a 111 a 22 + a 12 a 211 .
For any a 112 c y 1 2 4 a 21 , a 11 , we may derive the derivative of g as follows:
g ( a 112 ) = a 22 2 a 11 a 112 + a 12 c y 1 2 4 a 112 2 2 a 21 c y 1 2 4 a 112 .
Here, the first term a 22 2 a 11 a 112 is monotonously increasing to infinity and the second term a 12 c y 1 2 4 a 112 2 2 a 21 c y 1 2 4 a 112 is monotonously decreasing from infinity. Therefore, there is one unique parameter a 112 * c y 1 2 4 a 21 , a 11 such that g ( a 112 * ) = 0 . Furthermore, g ( a 112 ) is monotonously increasing in a 112 c y 1 2 4 a 21 , a 112 * and then monotonously decreasing in a 112 a 112 * , a 11 . Consequently, g ( a 112 * ) = max a 112 c y 1 2 4 a 21 , a 11 g ( a 112 ) . Therefore, if f is PSD, then it holds that g ( a 112 * ) | b | 2 . □

4.3. Case III: Two Neighbor Half-Cross Terms and No Full-Cross Terms

In this subsection, we study the case of 2 × 2 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
f ( x , y ) = a 11 x 1 2 y 1 2 + a 12 x 1 2 y 2 2 + a 21 x 2 2 y 1 2 + a 22 x 2 2 y 2 2 + 2 c x x 1 2 y 1 y 2 + 2 c y x 1 x 2 y 1 2 .
Here, we denote c x = c x 1 2 and c y = c y 1 2 to simplify our notation. Suppose that c x 0 and c y 0 , and f is PSD. Then we derive that
a 11 a 12 c x 2 > 0 , a 11 a 21 c y 2 > 0 ,
a 11 , a 12 , a 21 > 0 and a 22 0 .
For simplicity, we may replace x 2 and y 2 by x ¯ 2 a 21 and y ¯ 2 a 12 , respectively, and assume that a 12 = a 21 = 1 , i.e.,
f ( x , y ) = a 11 x 1 2 y 1 2 + x 1 2 y 2 2 + x 2 2 y 1 2 + a 22 x 2 2 y 2 2 + 2 c x x 1 2 y 1 y 2 + 2 c y x 1 x 2 y 1 2 .
We also may assume c x > 0 (resp. c y > 0 ), since otherwise we could replace y 1 with y 1 (resp. x 1 with x 1 ). Without loss of generality, assume that c x c y > 0 .
If a 11 c x 2 + c y 2 , then
f ( x , y ) = a 11 c x 2 c y 2 x 1 2 y 1 2 + x 1 2 c x y 1 + y 2 2 + c y x 1 + x 2 2 y 1 2 + a 22 x 2 2 y 2 2 ,
which gives the SOS form of f explicitly.
When a 11 = c x 2 , f ( x , y ) is not PSD for any a 22 > 0 . This can be seen by letting y 1 = 1 , y 2 = c x , x 1 = c y and
0 < x 2 < 2 c y 2 1 + a 22 c x 2 .
Theorem 8. 
Suppose that the 2 × 2 biquadratic polynomial f is expressed by (14), where c x 2 < a 11 < c x 2 + c y 2 , a 22 > 0 , and c x c y > 0 . Then the following three statements are equivalent:
(a) 
f ( x , y ) is PSD.
(b) 
f ( x , y ) is SOS.
(c) 
It holds that
a 22 8 c y 3 c y 9 c y 2 4 a 11 3 4 3 c y 9 c y 2 4 a 11 2 , if c x = c y and 5 4 c y 2 a 11 2 c y 2 , 1 a 11 c x 2 4 3 c y 9 c y 2 4 a 11 2 , if c x = c y and c y 2 a 11 5 4 c y 2 , ( γ 1 * ) 2 ( 1 γ 1 * ) ( 2 γ 1 * ) 2 ( ( γ 1 * 1 ) c x + c y ) ( c x + ( γ 1 * 1 ) c y ) , if c x > c y ,
where γ 1 * c x c y c x , 1 is the root of function Ω defined by the following equation
Ω ( γ 1 ) : = a 11 γ 1 2 ( 2 γ 1 ) 2 3 ( 1 γ 1 ) 3 c x c y + 2 ( 1 γ 1 ) 2 ( c x 2 + c y 2 ) + ( 1 γ 1 ) c x c y c x 2 c y 2 = 0 .
Proof. 
We assume that f has the following SOS decomposition:
f ( x , y ) = γ 1 ( α x 1 + x 2 ) 2 y 1 2 + γ 1 x 1 2 ( β y 1 + y 2 ) 2 + γ 2 ( α + β ) x 1 y 1 + x 1 y 2 + x 2 y 1 2 + γ 3 ( α β x 1 y 1 x 2 y 2 ) 2 + a 22 γ 3 x 2 2 y 2 2 ,
where parameters γ 1 , γ 2 0 and 0 γ 3 a 22 . By comparing (14) and (16), we observe that
γ 1 ( α 2 + β 2 ) + γ 2 ( α + β ) 2 + γ 3 α 2 β 2 = a 11 ,
γ 1 + γ 2 = 1 ,
γ 1 β + γ 2 ( α + β ) = c x ,
γ 1 α + γ 2 ( α + β ) = c y ,
γ 2 γ 3 α β = 0 .
The polynomial f admits an SOS decomposition if the system of Equation (17) admits solutions α , β , γ 1 , γ 2 , γ 3 satisfying γ 1 , γ 2 0 and 0 γ 3 a 22 . Combining Equations (17c) and (17d) yields ( α β ) γ 1 = c y c x . In the case where c y = c x , either α = β or γ 1 = 0 . We therefore proceed by analyzing two distinct cases separately: (i) c y = c x and (ii) c y c x . The former case is subsequently divided into subcases (i1) and (i2) for detailed examination.
Case (i1): c y = c x and 5 4 c y 2 a 11 2 c y 2 . By setting α = β 0 and γ 2 = 1 γ 1 , we can simplify Equations (17a)–(17e) to
2 γ 1 α 2 + 4 ( 1 γ 1 ) α 2 + γ 3 α 4 = a 11 ,
γ 1 α + 2 ( 1 γ 1 ) α = c y ,
1 γ 1 γ 3 α 2 = 0 .
Combining Equations (18a) and (18c) yields
α 2 ( 5 3 γ 1 ) = a 11 and ( 2 γ 1 ) α = c y .
Therefore, we obtain that γ 1 = 2 c y α and α 2 3 c y α + a 11 = 0 . It follows from a 11 2 c y 2 that the quadratic equation in α admits two distinct real roots α = 3 c y ± 9 c y 2 4 a 11 2 . By the fact that 0 γ 1 = 2 c y α 1 , only the root α * = 3 c y 9 c y 2 4 a 11 2 is feasible. Consequently, in Case (i1), if
a 22 γ 3 * = c y ( α * ) 4 1 ( α * ) 2 ,
then f is SOS.
Case (i2): c y = c x and c y 2 < a 11 5 4 c y 2 . By setting γ 1 = 0 and γ 2 = 1 , we can simplify (17a)–(17e) to
( α + β ) 2 + α β = a 11 , α + β = c y , and γ 3 = 1 α β .
By direct computation, we obtain β = c y α , c y 2 + α β = a 11 , and γ 3 = 1 a 11 c y 2 . Consequently, we derive the following quadratic equation with respective to α :
α 2 c y α + a 11 c y 2 = 0 .
It follows from c y 2 < a 11 5 4 c y 2 that (20) admits two real solutions, which derives that (19) is feasible. Hence, in Case (i2), if
a 22 γ 3 * = 1 a 11 c x 2 ,
then f is SOS.
Case (ii): c x > c y and c x 2 < a 11 < c x 2 + c y 2 . Then we obtain that α β , and γ 1 0 . It follows from (17b)–(17e) that
γ 2 = 1 γ 1 , γ 3 = 1 γ 1 α β , α = ( γ 1 1 ) c x + c y γ 1 ( 2 γ 1 ) , β = c x + ( γ 1 1 ) c y γ 1 ( 2 γ 1 ) .
Consequently, Equation (15) is derived directly from (17a). By the inequalities Ω ( 1 ) = a 11 c x 2 c y 2 < 0 and Ω c x c y c x = ( c x 2 c y 2 ) 2 c x 4 ( a 11 c x 2 ) > 0 , we conclude that there exists a solution γ 1 * c x c y c x , 1 such that Ω ( γ 1 * ) = 0 . Subsequently, we obtain the corresponding values of γ 2 * , γ 3 * , α * and β * by (21). Furthermore, it follows directly from c x > c y and γ 1 * ( 0 , 1 ) that β * > 0 , and from γ 1 * > c x c y c x that α * > 0 . Consequently, γ 3 * = 1 γ 1 * α * β * > 0 . Thus, if
a 22 γ 3 * = ( γ 1 * ) 2 ( 1 γ 1 * ) ( 2 γ 1 * ) 2 ( ( γ 1 * 1 ) c x + c y ) ( c x + ( γ 1 * 1 ) c y ) > 0 ,
then f is SOS.
In both Cases (i) and (ii), if a 22 < γ 3 * , then f is not PSD. This can be seen by letting x 2 = α x 1 = 1 and y 2 = β y 1 = 1 in (16). This completes the proof. □
Example 2. 
Let a 11 = 1.2 , a 22 = 6 , c x = c y = 1 . The corresponding biquadratic polynomial is given by:
f ( x , y ) = 1.2 x 1 2 y 1 2 + x 1 2 y 2 2 + x 2 2 y 1 2 + 6 x 2 2 y 2 2 2 x 1 2 y 1 y 2 2 x 1 x 2 y 1 2 .
We could verify that c y 2 a 11 5 4 c y 2 and a 22 = 6 > 1 a 11 c x 2 4 3 c y 9 c y 2 4 a 11 2 = 4.8431 . 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:
f ( x , y ) = ( 0.4876 x 1 y 1 + 0.1140 x 1 y 2 + 0.1140 x 2 y 1 + 2.4326 x 2 y 2 ) 2 + ( 0.9781 x 1 y 1 0.9685 x 1 y 2 0.9685 x 2 y 1 + 0.2869 x 2 y 2 ) 2 + ( 0.2181 x 1 y 2 0.2181 x 2 y 1 ) 2 + ( 0.0739 x 1 y 1 + 0.0390 x 1 y 2 + 0.0390 x 2 y 1 + 0.0112 x 2 y 2 ) 2 .

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 2 × 2 PSD biquadratic polynomials admit an SOS representation. The key technique is that an m × n biquadratic polynomial can be expressed as a tripartite homogeneous quartic polynomial of m + n 1 variables. Furthermore, we established a necessary and sufficient condition for an m × n PSD biquadratic polynomial to admit an SOS representation, and demonstrated that the SOS rank of such polynomials was bounded above by m n . Subsequently, we provided a constructive proof for obtaining the SOS decomposition of 2 × 2 PSD biquadratic polynomials in three specific cases.
In general, an m × n biquadratic polynomial can be written as
f ( x , y ) = i , j = 1 m k , l = 1 n a i j k l x i x j y k y l .
In 1973, Calderón [9] proved that an m × 2 PSD biquadratic polynomial can be expressed as the sum of squares of 3 m ( m + 1 ) 2 quadratic polynomials. In this paper, we proved that a 2 × 2 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 m × 2 PSD biquaratic polynomial for m 3 . In 1975, Choi [11] gave a 3 × 3 PNS biquadratic polynomial. Another open question is: What is the maximum SOS rank of an m × n SOS biquadratic polynomial for m , n 3 . An even more challenging question is to determine a given m × n PSD biquadratic polynomial is SOS or not numerically.

Author Contributions

Conceptualization, C.C. and L.Q. and Y.X.; methodology, L.Q., C.C. and Y.X.; formal analysis, C.C., L.Q. and Y.X.; investigation, C.C., L.Q. and Y.X.; writing—original draft, C.C., L.Q. and Y.X.; supervision, L.Q.; project administration, L.Q.; funding acquisition, C.C., L.Q. and Y.X. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported by the National Natural Science Foundation of China (Nos. 12471282 and 12131004), the Research Center for Intelligent Operations Research, The Hong Kong Polytechnic University (4-ZZT8), the R&D project of Pazhou Lab (Huangpu) (Grant no. 2023K0603), the Fundamental Research Funds for the Central Universities (Grant No. YWF-22-T-204), and Jiangsu Provincial Scientific Research Center of Applied Mathematics (Grant No. BK20233002).

Data Availability Statement

No new data were created or analyzed in this study.

Acknowledgments

We would like to thank the editor and all the reviewers for their comments, which have contributed to the enhancement of our paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hilbert, D. Über die darstellung definiter formen als summe von formenquadraten. Math. Ann. 1888, 32, 342–350. [Google Scholar] [CrossRef]
  2. Pfister, A.; Scheiderer, C. An elementary proof of Hilbert’s theorem on ternary quartics. J. Algebra 2012, 371, 1–25. [Google Scholar] [CrossRef]
  3. Motzkin, T.S. The arithmetic geometry inequality. In Proceedings of the Inequalities: Proceedings of a Symposium, Wright-Patterson Air Force Base, OH, USA, 19–27 August 1965; pp. 205–224. [Google Scholar]
  4. Choi, M.-D.; Lam, T.-Y. Extremal positive semi-definite forms. Math. Ann. 1977, 231, 1–18. [Google Scholar] [CrossRef]
  5. Chesi, G. On the gap between positive polynomials and SOS of polynomials. IEEE Trans. Automat. Control 2007, 52, 1066–1072. [Google Scholar] [CrossRef]
  6. Reznick, B. Extremal PSD forms with few terms. Duke Math. J. 1978, 45, 363–374. [Google Scholar] [CrossRef]
  7. Goel, C.; Kuhlmann, S.; Reznick, B. The analogue of Hilbert’s 1888 theorem for even symmetric forms. J. Pure Appl. Algebra 2017, 221, 1438–1448. [Google Scholar] [CrossRef]
  8. Qi, L.; Cui, C. Biquadratic tensors: Eigenvalues and structured tensors. arXiv 2025, arXiv:2502.06447v2. [Google Scholar]
  9. Calderón, A.P. A note on biquadratic forms. Linear Algebra Appl. 1973, 7, 175–177. [Google Scholar] [CrossRef]
  10. Qi, L.; Dai, H.H.; Han, D. Conditions for strong ellipticity and M-eigenvalues. Front. Math. China 2009, 4, 349–364. [Google Scholar] [CrossRef]
  11. Choi, M.-D. Positive semidefinite biquadratic forms. Linear Algebra Appl. 1975, 12, 95–100. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cui, C.; Qi, L.; Xu, Y. Positive Semi-Definite and Sum of Squares Biquadratic Polynomials. Mathematics 2025, 13, 2294. https://doi.org/10.3390/math13142294

AMA Style

Cui C, Qi L, Xu Y. Positive Semi-Definite and Sum of Squares Biquadratic Polynomials. Mathematics. 2025; 13(14):2294. https://doi.org/10.3390/math13142294

Chicago/Turabian Style

Cui, Chunfeng, Liqun Qi, and Yi Xu. 2025. "Positive Semi-Definite and Sum of Squares Biquadratic Polynomials" Mathematics 13, no. 14: 2294. https://doi.org/10.3390/math13142294

APA Style

Cui, C., Qi, L., & Xu, Y. (2025). Positive Semi-Definite and Sum of Squares Biquadratic Polynomials. Mathematics, 13(14), 2294. https://doi.org/10.3390/math13142294

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop