Next Article in Journal
Federated Learning with Efficient Aggregation via Markov Decision Process in Edge Networks
Previous Article in Journal
Analysis of Shielded Harmonic and Biharmonic Systems by the Iterative Extension Method
Previous Article in Special Issue
A Maximally Split and Adaptive Relaxed Alternating Direction Method of Multipliers for Regularized Extreme Learning Machines
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Matrix Spectral Factorization with Symmetry and Construction of Quasi-Tight Framelets over Algebraic Number Fields

Department of Mathematics, Hohai University, Nanjing 211100, China
Mathematics 2024, 12(6), 919; https://doi.org/10.3390/math12060919
Submission received: 20 February 2024 / Revised: 16 March 2024 / Accepted: 18 March 2024 / Published: 20 March 2024
(This article belongs to the Special Issue Matrix Factorization for Signal Processing and Machine Learning)

Abstract

:
The rational field Q is highly desired in many applications. Algorithms using the rational number field Q algebraic number fields use only integer arithmetics and are easy to implement. Therefore, studying and designing systems and expansions with coefficients in Q or algebraic number fields is particularly interesting. This paper discusses constructing quasi-tight framelets with symmetry over an algebraic field. Compared to tight framelets, quasi-tight framelets have very similar structures but much more flexibility in construction. Several recent papers have explored the structure of quasi-tight framelets. The construction of symmetric quasi-tight framelets directly applies the generalized spectral factorization of 2 × 2 matrices of Laurent polynomials with specific symmetry structures. We adequately formulate the latter problem and establish the necessary and sufficient conditions for such a factorization over a general subfield F of C , including algebraic number fields as particular cases. Our proofs of the main results are constructive and thus serve as a guideline for construction. We provide several examples to demonstrate our main results.

1. Introduction

1.1. Backgrounds

In many science and engineering applications, people often digitalize data and use particular devices to process and analyze them. Quite commonly, data are stored in integers or rational numbers for machine processes, such as an 8-bit grayscale image or audio in a digital recorder. Therefore, the rational field Q , or any of its finite extensions (also known as algebraic number fields), are desired in many scientific computing applications. Implementing algorithms using algebraic number fields is quite efficient since only integer arithmetics are involved. Consequently, studying and designing systems and expansions over algebraic number fields is of great interest.
Over the past decades, wavelets and framelets have been extensively studied and applied in numerous applications, such as signal processing and numerical algorithms. Several excellent properties, such as sparse multi-scale representations and fast discrete transforms, make wavelets and framelets perform well in the applications above. As a generalization of wavelets, framelets not only preserve almost all the good properties of wavelets but also offer the new feature of redundancy, which gives framelets robustness under data corruption or quantization. Over the past few years, framelets with attractive properties, such as symmetry and high-order vanishing moments, have been well-investigated (see e.g., [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]). One of the fascinating topics is to design symmetric (or anti-symmetric) framelets (or framelet filter banks) whose coefficients belong to Q or an algebraic number field. The properties and examples of such framelets have been extensively explored in papers such as [2,8,11,15,16,24,25,26].
Motivated by the work described above, in this paper, we focus on (dyadic) quasi-tight framelets with coefficients over an algebraic number field. The notion of a quasi-tight framelet generalizes a tight framelet. It is well-known that a tight framelet filter bank is often derived from a refinement filter/mask that satisfies the sub-QMF condition. However, many refinement filters fail to meet the sub-QMF condition, and we cannot obtain a tight framelet filter bank in such cases. Therefore, we hope to obtain something similar to a tight framelet filter bank from an arbitrary refinement filter, thus motivating the introduction of a quasi-tight framelet filter bank. The notion of quasi-tight framelets was first introduced in [25] and was then investigated in several subsequent recent papers, such as [2,25,26,27]. Existing studies have demonstrated the advantages of quasi-tight framelets over tight framelets. On the one hand, quasi-tight and tight framelets behave almost identically. On the other hand, compared to tight framelets, quasi-tight framelets have much more flexibility and are much easier to construct. Therefore, it is natural and necessary to consider quasi-tight framelets. The main goal of this paper is to provide a characterization and, more importantly, algorithms for constructing quasi-tight framelets with symmetry and coefficients in an algebraic number field.

1.2. Generalized Matrix Spectral Factorization with Symmetry

The construction of a symmetric quasi-tight framelet filter bank is closely related to generalized matrix spectral factorization with symmetry. To properly formulate this problem, we must first introduce some notations and concepts.
Throughout this paper, F C is a field that satisfies
x ¯ F whenever x F ,
where x ¯ denotes the complex conjugate of x. The condition (1) is mild and normal when constructing wavelet and framelet filter banks. The most commonly used fields C , R , Q and algebraic number fields, such as Q ( 2 ) , Q ( i ) , Q ( 2 3 , 3 3 ) , all satisfy (1). A Laurent polynomial with coefficients from a field F takes the form
u ( z ) = k Z u [ k ] z k , z C { 0 } ,
where its coefficient sequence u = { u [ k ] } k Z has only finitely many non-zero terms (in such cases, we say that u is finitely supported) and u [ k ] F for all k Z . Denote F [ z , z 1 ] , the set (ring) of all Laurent polynomials with coefficients in F . Throughout this paper, we use the sans serif font style letters to denote (matrices of) Laurent polynomials and the normal/regular font style letters to denote the corresponding coefficient sequence of the Laurent polynomial.
We say that u F [ z , z 1 ] has symmetry if
u ( z ) = ϵ z c u ( z 1 ) ,
for some ϵ { 1 , 1 } and c Z . It is trivial to see that (2) is equivalent to
u [ k ] = ϵ u [ c k ] , k Z .
If u F [ z , z 1 ] is not the zero polynomial and has symmetry, we define
S u ( z ) : = u ( z ) u ( z 1 ) , z C { 0 } .
The operator S is known as a symmetry operator in wavelet and framelet analysis. Denote Sym F , the set of Laurent polynomials with symmetry and coefficients in F . It is easy to see that (2) holds if, and only if, S u ( z ) = ϵ z c is a monomial. For u Sym F , we call the monomial S u ( z ) the symmetry type of u . For convenience, if u = 0 is the zero polynomial, then u  has any symmetry type.
Let P ( z ) = k Z P [ k ] z k be a t × r matrix of Laurent polynomials, where P [ k ] F t × r for all k Z , we define the Hermitian conjugate of P via
P H ( z ) : = P ( z 1 ¯ ) ¯ T = k Z P [ k ] ¯ T z k , z T : = { ζ C : | ζ | = 1 } .
When P ( z ) is a 1 × 1 matrix, that is, P ( z ) is a Laurent polynomial, then the Hermitian conjugate P H ( z ) is just the conjugate of P ( z ) for all z T . In this case, we denote P * ( z ) : = P H ( z ) . Note that if F R , then P H ( z ) = P ( z 1 ) T . For an n × n matrix P of Laurent polynomials, we say that P is Hermitian if P H = P . If all entries of P ( F [ z , z 1 ] ) t × r have symmetry, then we can define its symmetry type S P . For a t × r matrix P : = P ( z ) whose entries are Laurent polynomials in Sym F , define the t × r matrix of monomials S P through [ S P ( z ) ] j , k : = S [ P j , k ] ( z ) for all 1 j t and 1 k r .
Next, we discuss how the symmetry property behaves under matrix operations. Let P , Q , and R be t × r , t × r , and r × s matrices of Laurent polynomials in Sym F . We have the following definitions:
  • If S P = S Q , then P ± Q have symmetry with S [ P + Q ] = S [ P Q ] = S P = S Q .
  • We say that the symmetry type of P is compatible or P has compatible symmetry if
    S P ( z ) = S η 1 H ( z ) S η 2 ( z )
    holds for some 1 × r and 1 × s row vectors of Laurent polynomials η 1 and η 2 with symmetry. For convenience, denote Sym F r × s , the set of all r × s matrices P : = P ( z ) with entries in Sym F and have compatible symmetry.
  • We say that the multiplication P R is compatible if
    S P ( z ) = S η 1 H ( z ) S η 2 ( z ) , S R ( z ) = S η 2 H ( z ) S η 3 ( z ) ,
    for some 1 × r , 1 × s , and 1 × t row vectors η 1 , η 2 , and η 3 of Laurent polynomials in Sym F . It is obvious that in this case, P R has compatible symmetry with
    S [ P R ] ( z ) = S P ( z ) S R ( z ) = S η 1 H ( z ) S η 3 ( z ) .
We are ready to formulate the generalized matrix spectral factorization problem with symmetry. Let M ( z ) Sym F r × r be such that M = M H and S M = S η H S η for some 1 × r vector η of Laurent polynomials with symmetry. By Diag ( x 1 , , x r ) , we mean the r × r diagonal matrix whose diagonal elements are (ordered) x 1 , , x r . A generalized spectral factorization of M with symmetry over the field F is of the form
M ( z ) = U ( z ) D Diag ( ϵ 1 , , ϵ s ) D H U H ( z ) ,
where U Sym F r × s , D = Diag ( c 1 , , c s ) for some c 1 , , c s C with | c 1 | 2 , , | c s | 2 F , ϵ 1 , , ϵ s { 1 , 1 } , and all multiplications in (6) are compatible. When the underlying field F = C , then we may choose D : = I s , which is the s × s identity matrix and thus (6) reduces to
M ( z ) = U ( z ) Diag ( ϵ 1 , , ϵ s ) U H ( z ) .
In particular, we are interested in the case when r = s = 2 because it is related to constructing (dyadic) quasi-tight or tight framelet filter banks with two generators that we will discuss later. In this case, the generalized spectral factorization becomes
M ( z ) = U ( z ) D Diag ( ϵ 1 , ϵ 2 ) D H U H ( z ) ,
for some U Sym F 2 × 2 and D : = Diag ( c 1 , c 2 ) .

1.3. Related Work

When ϵ 1 = ϵ 2 = 1 in (7), the factorization is known as a spectral factorization of M . The spectral factorization problem and the construction of tight framelets have been well-investigated in several pieces of work. For instance, refs. [6,9] studied the case when F = C ; ref. [15] addressed the case when F = Q and specifically studied how to construct tight framelets with rational coefficients; ref. [16] investigated the case when F C is any field that satisfies (1). If we drop the symmetry requirements of U in (7) and let ϵ 1 = ϵ 2 = 1 , then we have the well-known matrix Fejér–Riesz lemma (see [28]) in the literature.
On the other hand, the case when ϵ 1 ϵ 2 in (7) is much more complicated and different from the case ϵ 1 = ϵ 2 , as we no longer have the positive semi-definite property M ( z ) 0 for all z T . Some recent related papers, such as [2,26], investigated (7) with or without symmetry for the case when F = C and ϵ 1 ϵ 2 . Our goal is to complete the picture of the generalized spectral factorization problem by resolving the unsolved general case when F C is an arbitrary field that satisfies (1).

1.4. Our Contributions and Paper Structure

Here, we summarize our contributions. First, we completely solve the generalized spectral factorization of 2 × 2 matrices with symmetry over a general subfield F of C that is closed under complex conjugation. In particular, we are interested in Hermitian matrices M Sym F 2 × 2 with symmetry type S M = 1 S M 1 , 2 S M 1 , 2 * 1 , as these matrices are particularly concerned with framelet constructions. We establish the necessary and sufficient conditions for such a matrix M to admit a factorization as in (7) with ϵ 1 ϵ 2 . Next, we apply the theory of generalized spectral factorization to construct symmetric quasi-tight framelets with two generators. We consider how to derive the high-pass filters with symmetry and coefficients in an algebraic number field from a refinement filter a that fails to satisfy the sub-QMF condition. Moreover, our construction guarantees that the high-pass filters achieve the highest possible order of vanishing moments.
The paper is organized as follows: In Section 2, we establish the first main result Theorem 1 on the generalized spectral factorization of 2 × 2 matrices with symmetry over a general field F that satisfies (1). Our proof is constructive and thus can serve as a factorization algorithm. Next, in Section 3, we briefly review the basic concepts of framelets and demonstrate the connection between constructing quasi-tight framelets and the generalized spectral factorization. Then, we apply the results from Section 2 to deduce our second main result Theorem 3 on constructing quasi-tight framelets with symmetry and coefficients over the general field F . Finally, Section 4 provides several examples of quasi-tight framelets with symmetry.

2. Generalized Spectral Factorization with Symmetry over Algebraic Number Fields

In this section, we establish the first main result of the paper on generalized matrix spectral factorization of Laurent polynomial matrices with symmetry over a field F that satisfies (1).
For simplicity, define
HS F , 2 : = M Sym F 2 × 2 : M = M H and S M = 1 S M 1 , 2 S M 1 , 2 * 1 .
Any M HS F , 2 is Hermitian and has compatible symmetry. Here is the main theorem on the generalized spectral factorization with symmetry over F :
Theorem 1.
Let M HS F , 2 be such that S M 1 , 2 ( z ) = ϵ z c for some ϵ { 1 , 1 } and c Z . Suppose gcd ( M 1 , 1 , M 1 , 2 , M 1 , 2 * , M 2 , 2 ) = 1 , then the following two statements are equivalent:
(1) 
det ( M ( z ) ) = | C | 2 d ( z ) d * ( z ) for some C C with | C | 2 F and some d Sym F ;
(2) 
there exist U Sym F 2 × 2 and D : = Diag ( c 1 , c 2 ) for some c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F such that
M ( z ) = U ( z ) D Diag ( 1 , 1 ) D H U H ( z ) ,
and the symmetry type of U satisfies
S U 1 , 1 ( z ) S U 2 , 1 ( z ) = S U 1 , 2 ( z ) S U 2 , 2 ( z ) = ϵ z c ;
Proof. 
(2) ⇒ (1): Suppose (2) holds, then take d : = det ( U ) and C : = c 1 c 2 , we have item (1).
(1) ⇒ (2): Suppose (1) holds, then a desired matrix factorization of M that satisfies both (8) and (9) can be obtained by performing the following steps:
  • Step 1. Construct M ˚ HS F , 2 and U 1 Sym F 2 × 2 such that
    (i)
    gcd ( M ˚ 1 , 1 , M ˚ 1 , 2 ) = gcd ( M ˚ 1 , 2 , M ˚ 2 , 2 ) = 1 ;
    (ii)
    det ( M ˚ ( z ) ) = | C | 2 d ˚ ( z ) d ˚ * ( z ) for some d ˚ Sym F ;
    (iii)
    M ( z ) = U 1 ( z ) M ˚ ( z ) U 1 H ( z ) and all multiplications are compatible.
  • Step 2. Construct B HS F , 2 and U 2 Sym F 2 × 2 such that
    (i)
    det ( B ( z ) ) = | C | 2 ;
    (ii)
    M ˚ ( z ) = U 2 ( z ) B ( z ) U 2 H ( z ) and all multiplications are compatible.
  • Step 3. Construct U 3 Sym F 2 × 2 and D : = Diag ( c 1 , c 2 ) with c 1 , c 2 C and | c 1 | 2 , | c 2 | 2 F such that B = U 3 D Diag ( 1 , 1 ) D H U 3 H and all multiplications are compatible.
The justifications of Steps 1–3 are long and technical, so we postpone them to later subsections. Once we have finished the above three steps, define U : = U 1 U 2 U 3 and let D be the same as in Step 3; all claims of the item (2) follow immediately. The proof is complete. □
Remark 1.
To obtain a generalized factorization, we need to shrink the length (see the definition in Section 2.1) of det ( M ( z ) ) . More specifically, we need to find a matrix B HS F , 2 whose determinant is a constant and W Sym F 2 × 2 so that M ( z ) = W ( z ) B ( z ) W H ( z ) with all multiplications being compatible. For the case when F = C , which has been studied in [2], the approach of [2] to achieve this relies on a matrix normal form with compatible symmetry (see [Theorem 3.9 [2]]) and splitting det ( M ( z ) ) into a product of linear factors over C (see [Lemma 3.12 [2]]). Some linear factors of det ( M ( z ) ) are used to construct a desired matrix W Sym F 2 × 2 that help shrink the length of det ( M ( z ) ) . However, we cannot adopt the same approach to the general case (i.e., when F C is an arbitrary subfield). When M HS F , 2 such that F C is an arbitrary subfield and z z 0 is a linear factor of det ( M ( z ) ) , then it may happen that z 0 F . As a result, to ensure that all entries of W ( z ) have coefficients in F , we cannot use the z z 0 if it is not in F [ z , z 1 ] . When working on the proof of Theorem 1, everything (e.g., factorizing polynomials) must be performed over F , not C , which is why difficulties arise. Consequently, we provide a new approach that consists of steps 1 and 2 in our proof, in which we show some new techniques.
When factorizing the matrix B in Step 3, several steps involve taking square roots of numbers to obtain the matrix U 3 as required. For the case when F = C , there is no problem because C is closed under taking square roots. But for a general subfield F of C , we must be careful with this as we have to ensure that all entries of U 3 are in F . Therefore, though we can borrow some ideas from [2] to justify Step 3, our proof will have new elements and tools to overcome the difficulties of taking square roots.

2.1. On the Symmetry Property of Laurent Polynomials

Before we justify steps 1–3, let us review some important facts about the symmetry property of Laurent polynomials.
For u ( z ) = k Z u [ k ] z k F [ z , z 1 ] { 0 } , define
  • the lower degree of u by
    ldeg ( u ) : = min { k Z : u [ k ] 0 } ;
  • the degree of u by
    deg ( u ) : = max { k Z : u [ k ] 0 } ;
  • the length of u by
len ( u ) : = deg ( u ) ldeg ( u ) .
If u = 0 , then we define len ( 0 ) : = .
The following proposition can be verified by direct computation:
Proposition 1.
Suppose u , v Sym F such that S u ( z ) = ϵ u z c u and S v ( z ) = ϵ v z c v for some ϵ u , ϵ v { 1 , 1 } and c u , c v Z . Then,
(1) 
if S u = S v , then u ± v Sym F with S [ u ± v ] ( z ) = S u = ϵ u z c u ;
(2) 
u v Sym F with S [ u v ] ( z ) = ϵ u ϵ v z c u + c v ;
(3) 
if v divides u , then u / v Sym F with S [ u / v ] ( z ) = ϵ u ϵ v z c u c v ;
(4) 
u * Sym F with S [ u * ] ( z ) = [ S u ] * ( z ) = ϵ u z c u .
If in addition u 0 , then S [ u H ] = S u 1 , c u = ldeg ( u ) + deg ( u ) , and prt ( len ( u ) ) = prt ( c u ) , where prt ( k ) is defined for every k Z as
prt ( k ) : = 0 , if k 2 Z , 1 , if k 2 Z .
To characterize the symmetry property of a Laurent polynomial, we need to analyze the multiplicities of its roots. Denote Z ( u , z 0 ) the multiplicity of the root of u at z 0 . The following result is well-known (see e.g., [Proposition 2.2 [6]] and [Lemma 3.2 [2]]).
Lemma 1.
Let u F [ z , z 1 ] .
(1) 
u Sym F if, and only if, Z ( u , z 0 ) = Z ( u , z 0 1 ) for all z 0 C { 0 } .
(2) 
If u Sym F is a non-zero Laurent polynomial with symmetry type S u ( z ) = ϵ z c for some ϵ { ± 1 } and c Z , then ϵ = ( 1 ) Z ( u , 1 ) and prt ( c ) = prt ( Z ( u , 1 ) + Z ( u , 1 ) ) .
Next, we discuss some properties of matrices of Laurent polynomials with compatible symmetry. Suppose P Sym F r × s that satisfies (5) for some 1 × r and 1 × s row vectors of Laurent polynomials η 1 and η 2 with symmetry. We can tell the symmetry relations between the rows and columns of P ( z ) from S η 1 ( z ) and S η 2 ( z ) :
S P j , l ( z ) S P k , l ( z ) = [ S η 1 H ( z ) ] j [ S η 1 H ( z ) ] k , S P l , j ( z ) S P l , k ( z ) = [ S η 2 ( z ) ] j [ S η 2 ( z ) ] k , l = 1 , , s , j , k = 1 , , r .
For a matrix P Sym F n × n , we can prove by induction that det ( P ) Sym F with
S [ det ( P ) ] ( z ) = j = 1 n [ S η 1 H ( z ) ] j [ S η 2 ( z ) ] j = j = 1 n S P j , j ( z ) .
If in addition P is strongly invertible, that is, det ( P ( z ) ) = c z k for some c F { 0 } and k Z , then P 1 Sym F n × n . In this case, as P 1 = det ( P ) 1 adj ( P ) , where adj ( P ) is the adjugate matrix of P , and
[ S [ adj ( P ) ] ( z ) ] j , k = 1 l n , l k 1 m n , m j [ S η 1 H ( z ) ] l [ S η 2 ( z ) ] m = S [ det ( P ) ] ( z ) [ S η 1 ( z ) ] k [ S η 2 H ( z ) ] j ,
we see that P 1 Sym F n × n and it has symmetry type
S [ P 1 ] ( z ) = S η 2 H ( z ) S η 1 ( z ) .
From the above discussion, if P Sym F n × n is strongly invertible, then for Q Sym F n × m and R Sym F m × n , if the multiplication P Q = : M (resp. R P = : B ) is compatible, then so is the multiplication P 1 M (resp. B P 1 ).

2.2. Justification of Step 1 in the Proof of Theorem 1

To find the desired matrices M ˚ HS F , 2 and U 1 Sym F 2 × 2 in Step 1, we need to take out all the common divisors of the entries of M . We first introduce the following lemma which generalizes [Lemma 3.15 [2]]:
Lemma 2.
Let u , v Sym F be such that v v * divides u u * . Then, there exists s Sym F such that
s ( z ) s * ( z ) = u ( z ) u * ( z ) v ( z ) v * ( z ) .
Moreover, for any s Sym F that satisfies (14), we have S s ( z ) = z 2 k S u ( z ) S v ( z ) for some k Z .
Proof. 
Define q ( z ) : = u ( z ) u * ( z ) v ( z ) v * ( z ) . By the assumptions on u and v , we have q Sym F with S q = 1 . Suppose w F [ z , z 1 ] is an irreducible factor of q that does not have symmetry. By the symmetry of q ( z ) , we see that w ( z 1 ) is another irreducible factor of q ( z ) and is coprime to w . Thus, w 0 ( z ) : = w ( z ) w ( ( z ) 1 ) divides q ( z ) . Moreover, w divides u or u * . By the symmetry of u , we conclude that w 0 divides u or u * and thus w 0 w 0 * divides u u * . By the choice of w 0 , we see that it does not divide v . Consequently, w 0 w 0 * divides q .
From the above discussion, we can write
q ( z ) = | β | 2 j = 1 t w j ( z ) w j * ( z ) ,
where β F and w 1 , , w t Sym F . By letting s : = β j Λ w j , we have M Sym F and (14) holds.
Now, let s Sym F be arbitrary such that (14) holds. Denote S s ( z ) = ϵ s z c s , S u ( z ) = ϵ u z c u and S v ( z ) = ϵ v z c v for some ϵ s , ϵ u , ϵ v { ± 1 } and c s , c u , c v Z . By Lemma 1, we have ϵ s = ( 1 ) Z ( d , 1 ) = ( 1 ) Z ( u , 1 ) Z ( v , 1 ) = ϵ u / ϵ v . Moreover, by Proposition 1, we obtain
prt ( c s ) = prt ( len ( s ) ) = prt ( len ( u ) len ( v ) ) = prt ( c u c v ) .
Therefore, we can find k Z such that S s ( z ) = z 2 k S u ( z ) S v ( z ) . □
Remark 2.
[Lemma 3.15 [2]] is a special case of Lemma 2 with F = C . The original proof of [Lemma 3.15 [2]] relies on [Theorem 2.9 [6]] and is over-complicated from our point of view. Hence, we presented the above simpler self-contained proof.
Next, we have the following lemma that allows us to further take out the common factors of entries of M . For p , q F [ z , z 1 ] , by gcd ( p , q ) , we mean the greatest common divisor of p and q in F [ z , z 1 ] .
Lemma 3.
Let M HS F , 2 be such that det ( M ( z ) ) = | C | 2 d ( z ) d * ( z ) for some d Sym F and some C C with | C | 2 F . Define h 1 : = gcd ( M 1 , 1 , M 1 , 2 M 1 , 2 * ) and h 2 : = gcd ( M 2 , 2 , M 1 , 2 M 1 , 2 * ) . If gcd ( M 1 , 1 , M 1 , 2 , M 1 , 2 * , M 2 , 2 ) = 1 , then there exist r 1 , r 2 Sym F that both divide M 1 , 2 and satisfy
h 1 ( z ) = α 1 z n 1 r 1 ( z ) r 1 * ( z ) and h 2 ( z ) = α 2 z n 2 r 2 ( z ) r 2 * ( z ) ,
for some α 1 , α 2 F and n 1 , n 2 Z . Moreover, gcd ( r 1 , r 2 ) = gcd ( M 1 , 1 , M 1 , 2 , M 2 , 2 ) .
Proof. 
Define q : = gcd ( M 1 , 1 , M 1 , 2 , M 2 , 2 ) . As all entries of M have symmetry, so is q . Moreover, we have gcd ( q , q * ) = gcd ( M 1 , 1 , M 1 , 2 , M 1 , 2 * , M 2 , 2 ) = 1 . Thus by letting M ˜ : = Diag ( q * , 1 ) M Diag ( q 1 , 1 ) , we see that M ˜ HS F , 2 , gcd ( M ˜ 1 , 1 , M ˜ 1 , 2 , M ˜ 2 , 2 ) = 1 and det ( M ˜ ) = | C | 2 d ˜ d ˜ * , where d ˜ : = d q Sym F . Observe that q q * divides h 1 and h 2 , so h ˜ 1 : = h 1 q q * and h ˜ 2 : = h 2 q q * are well-defined Laurent polynomials in F [ z , z 1 ] .
We prove that
h ˜ 1 = α 1 z n 1 r ˜ 1 ( z ) r ˜ 1 * ( z ) ,
for some α 1 F , n 1 Z and r ˜ 1 Sym F that divides M ˜ 1 , 2 . First, note that if M ˜ 2 , 2 = 0 , then gcd ( M ˜ 1 , 1 , M ˜ 1 , 2 ) = 1 , so h ˜ 1 1 and the claim clearly holds.
Now, assume M ˜ 2 , 2 0 . We first prove that gcd ( h ˜ 1 , M ˜ 2 , 2 ) = 1 . Let p F [ z , z 1 ] be an irreducible element such that p divides both h ˜ 1 and M ˜ 2 , 2 . By the choice of h ˜ 1 , we see that p divides M ˜ 1 , 1 and M ˜ 1 , 2 * M ˜ 1 , 2 . Because p is irreducible, we must have either p or p * divides M ˜ 1 , 2 . Moreover, as M ˜ 1 , 1 and M ˜ 2 , 2 are Hermitian, both must be divisible by p * . Consequently, p or p * divides all M ˜ 1 , 1 , M ˜ 1 , 2 and M ˜ 2 , 2 . By the assumption gcd ( M ˜ 1 , 1 , M ˜ 1 , 2 , M ˜ 2 , 2 ) = 1 , up to a monomial, we must have p = 1 . Next, we show that if h F [ z , z 1 ] is irreducible and divides h ˜ 1 , then h h * must divide h ˜ 1 . Indeed, if h is an irreducible factor of h ˜ 1 , then by using a similar argument of the proof of the previous claim, either h or h * divides M ˜ 1 , 2 and thus h h * divides M ˜ 1 , 2 M ˜ 1 , 2 * . On the other hand, as | C | 2 d ˜ d ˜ * = det ( M ˜ ) = M ˜ 1 , 1 M ˜ 2 , 2 M ˜ 1 , 2 M ˜ 1 , 2 * , we see that h divides d ˜ d ˜ * . Using the irreducibility of h , we see that h h * divides d ˜ d ˜ * . Now, using the fact that gcd ( h ˜ 1 , M ˜ 2 , 2 ) = 1 and M ˜ 1 , 1 = M ˜ 1 , 2 M ˜ 1 , 2 * | C | 2 d ˜ d ˜ * M ˜ 2 , 2 , we conclude that h h * divides M ˜ 1 , 1 . Consequently, we have h h * divides h ˜ 1 .
We now analyze the symmetry of the factors of h ˜ 1 . Let w F [ z , z 1 ] be an irreducible factor of h ˜ 1 that has no symmetry. Then, w ( z 1 ) must be relatively prime to w . By the definition of h ˜ 1 , we see that w must divide d ˜ or d ˜ * . Noting that d ˜ has symmetry, we must have v ( z ) : = w ( z ) w ( z 1 ) divides d ˜ or d ˜ * and thus v v * divides det ( M ˜ ) . Similarly, we have v v * divides M ˜ 1 , 2 M ˜ 1 , 2 * . As gcd ( h ˜ 1 , M ˜ 2 , 2 ) = 1 , we conclude that v v * divides M ˜ 1 , 1 and thus v v * divides h ˜ 1 . Consequently, we can write
h ˜ 1 ( z ) = c 1 z n 1 j = 1 t w j ( z ) w j * ( z ) ,
such that c 1 C , n 1 Z , and all w 1 , w t Sym F . By letting r ˜ 1 ( z ) : = j = 1 t w j ( z ) , we have r ˜ 1 Sym F and h ˜ 1 ( z ) = c 1 z n 1 r ˜ 1 ( z ) r ˜ 1 * ( z ) . Observe that each polynomial w j in (17) either divides M ˜ 1 , 2 or M ˜ 1 , 2 * . Therefore, without loss of generality, we may assume that all w j ’s divide M ˜ 1 , 2 . As a result, we have r ˜ 1 | M ˜ 1 , 2 .
Similarly, we can show that there exists r ˜ 2 Sym F that divides M ˜ 1 , 2 and satisfies h ˜ 2 ( z ) = c 2 z n 2 r ˜ 2 ( z ) r ˜ 2 * ( z ) for some c 2 z n 2 F [ z , z 1 ] . Furthermore, by the choices of h ˜ 1 , h ˜ 2 and the fact that gcd ( M ˜ 1 , 1 , M ˜ 1 , 2 , M ˜ 2 , 2 ) = 1 , we must have gcd ( r ˜ 1 , r ˜ 2 ) = 1 .
Finally, by letting r 1 : = q r ˜ 1 and r 2 : = q r ˜ 2 , all claims of the lemma hold and the proof is complete. □
Remark 3.
Let M Sym F 2 × 2 be such that det ( M ( z ) ) = | C | 2 d ( z ) d * ( z ) for some d Sym F and C C with | C | 2 F . Suppose gcd ( M 1 , 1 , M 1 , 2 , M 1 , 2 * , M 2 , 2 ) = 1 , then by Lemma 3, we can define the following sets for convenience:
G 1 ( M ) : = { r 1 Sym F : r 1 divides M 1 , 2 and gcd ( M 1 , 1 , M 1 , 2 M 1 , 2 * ) = α 1 z n 1 r 1 r 1 * for some α 1 C , n 1 Z } ,
G 2 ( M ) : = { r 2 Sym F : r 2 divides M 1 , 2 and gcd ( M 2 , 2 , M 1 , 2 M 1 , 2 * ) = α 2 z n 2 r 2 r 2 * for some α 2 C , n 2 Z } .
For any r 1 G 1 ( M ) and r 2 G 2 ( M ) , we have gcd ( r 1 , r 2 ) = gcd ( M 1 , 1 , M 1 , 2 , M 2 , 2 ) .
Now, we have all the tools to justify Step 1.
Justification of Step 1 in the Proof of Theorem 1.
As M satisfies all assumptions of Lemma 3, we can define G 1 ( M ) as in (18) and G 2 ( M ) as in (19). Choose r 1 G 1 ( M ) and r 2 G 2 ( M ) . Define
U 1 : = Diag ( r 1 , r 2 ) , M ˚ : = U 1 1 M U 1 H .
It is trivial that M ˚ HS F , 2 satisfies item (i) in Step 1.
Next, we have M = U 1 M ˚ U 1 H ,
S M ˚ ( z ) = 1 S M 1 , 2 * ( z ) S r 1 ( z ) S r 2 * ( z ) 1 S M 1 , 2 ( z ) S r 1 * ( z ) S r 2 ( z ) ,
and
S U 1 ( z ) = S r 1 ( z ) S M 1 , 2 * ( z ) S r 1 ( z ) 1 S M 1 , 2 ( z ) S r 1 * ( z ) S r 2 ( z ) .
Thus, it is easy to see that item (iii) in Step 1 holds.
Finally, since
det ( M ˚ ( z ) ) = det ( M ( z ) ) det ( U 1 ( z ) ) det ( U 1 ( z ) ) * = | C | 2 d ( z ) d * ( z ) det ( U 1 ( z ) ) det ( U 1 ( z ) ) * ,
then by Lemma 2, there exists d ˚ Sym F such that det ( M ˚ ) = | C | 2 d ˚ d ˚ * . This justifies item (ii) in Step 1. □

2.3. Justification of Step 2 in the Proof of Theorem 1

To justify Step 2, we need the following Euclidean algorithm compatible with the symmetry property. We have the following lemma, which is a straightforward generalization of [Theorem 3.9 [2]].
Lemma 4.
(Extended Euclidean Algorithm for Laurent polynomials in Sym F ). Let a , b Sym F and define r : = gcd ( a , b ) . There exist u , v Sym F such that
a ( z ) u ( z ) + b ( z ) v ( z ) = r ( z ) .
Furthermore, S a ( z ) S u ( z ) = S b ( z ) S v ( z ) = S r ( z ) and gcd ( u , v ) = 1 .
Justification of Step 2 in the Proof of Theorem 1.
Let M ˚ HS F , 2 and d ˚ Sym F be the same as in Step 1. By Lemma 4, there exist u , v Sym F such that
u ( z ) M ˚ 1 , 2 ( z ) + v ( z ) M ˚ 2 , 2 ( z ) = 1 , S u ( z ) S M ˚ 1 , 2 ( z ) = S v ( z ) S M ˚ 2 , 2 ( z ) = 1 , gcd ( u , v ) = 1 .
Define
V 1 : = M ˚ 2 , 2 M ˚ 1 , 2 u v , B ˚ : = V 1 M ˚ V 1 H .
Then, V 1 Sym F 2 × 2 , det ( V 1 ) = 1 and thus det ( B ˚ ) = det ( M ˚ ) . Furthermore, direct calculation shows that
B ˚ = det ( M ˚ ) M ˚ 2 , 2 det ( M ˚ ) u * det ( M ˚ ) u u u * M ˚ 1 , 1 + v u * M ˚ 1 , 2 * + v * u M ˚ 1 , 2 + v v * M ˚ 2 , 2 .
By letting
V 2 : = Diag ( d ˚ , 1 ) , B : = | C | 2 M ˚ 2 , 2 | C | 2 d ˚ * u * | C | 2 d ˚ u B ˚ 2 , 2 , U 2 : = V 1 1 V 2 ,
we have M ˚ = U 2 B U 2 H and det ( B ) = | C | 2 . Moreover, the symmetry relations in (21) yields S u = S M ˚ 1 , 2 * and S v = 1 . By calculation, we have
S B ( z ) = 1 S d ˚ * ( z ) S u * ( z ) S d ˚ ( z ) S u ( z ) 1 = S d ˚ * ( z ) S u ( z ) S d ˚ ( z ) S u * ( z ) ,
S U 2 ( z ) = S d ˚ ( z ) S u * ( z ) S d ˚ ( z ) S u ( z ) 1 = 1 S u ( z ) S d ˚ ( z ) S u * ( z ) .
Therefore, U 2 Sym F 2 × 2 , B HS F , 2 , and the matrix multiplications in M ˚ = U 2 B U 2 * are compatible. This completes the justification of Step 2. □

2.4. Justification of Step 3 in the Proof of Theorem 1

Justifying Step 3 is the most technical part of the proof of Theorem 1. Let B be the same as in Step 2. The symmetry type of the entry B 1 , 2 is critical in justifying Step 3. Denote S B 1 , 2 ( z ) : = ϵ b z c b for some ϵ b { 1 , 1 } and c b Z . Consider the following two cases:
  • Case 1.  ϵ b = 1 or ϵ b = 1 and c b 2 Z + 1 ;
  • Case 2.  ϵ b = 1 and c b 2 Z .
First, we work on the justification for case 1, which relies heavily on the long division with symmetry. We have two auxiliary lemmas.
Lemma 5.
Let u , v Sym F be such that len ( u ) > len ( v ) and v 0 . Then, there exist q , r Sym F such that u = v q + r , len ( r ) < len ( u ) and S u = S r = S v S q .
Proof. 
Define M u : = deg ( u ) , m u : = ldeg ( u ) , M v : = deg ( v ) and m v : = ldeg ( v ) , so we write
u ( z ) = k = m u M u u [ k ] z k , v ( z ) = n = m v M v v [ n ] z n ,
where u [ k ] , v [ n ] F are coefficients for all k = m u , , M u and n = m v , , M v . Denote S u ( z ) = ϵ u z c u and S v ( z ) = ϵ v z c v for some ϵ u , ϵ v { 1 , 1 } and c u , c v Z . It follows that
u [ m u ] = ϵ u u [ M u ] , M u + m u = c u , v [ m v ] = ϵ v v [ M v ] , M v + m v = c v .
Define
q ( z ) : = u [ M u ] v [ M v ] z M u M v + u [ m u ] v [ m v ] z m u m v .
Direct calculation yields
q ( z 1 ) = u [ M u ] v [ M v ] z M v M u + u [ m u ] v [ m v ] z m v m u = ϵ u ϵ v u [ m u ] v [ m v ] z m u m v ( c u c v ) + ϵ u ϵ v u [ M u ] v [ M v ] z M u M v ( c u c v ) .
Therefore,
S q ( z ) = q ( z ) q ( z 1 ) = ϵ u ϵ v z c u c v = S u ( z ) S v ( z ) ,
and thus q Sym F . Moreover, by letting r : = u v q , it is trivial that r Sym F and S u = S r = S v S q .
Next, we show that len ( r ) < len ( u ) . As len ( u ) > len ( v ) , we have M u M v > m u m v . So ldeg ( q ) = m u m v and deg ( q ) = M u M v , which implies ldeg ( v q ) = m u and deg ( v q ) = M u . Hence, len ( r ) len ( u v q ) M u m u = len ( u ) . Furthermore, observe that the coefficient of the z M u term in v q is u ( M u ) . This implies deg ( r ) = deg ( u v q ) < M u and thus len ( r ) < len ( u ) . This completes the proof. □
Lemma 6.
Let u , v Sym F be such that v 0 . Then, there exist q , r Sym F such that len ( r ) len ( v ) ,
u = v q + r and S u = S r = S v S q .
Moreover, if S u ( z ) S v ( z ) z 2 k for all k Z , then r can be chosen such that len ( r ) < len ( v ) .
Proof. 
The case when len ( u ) < len ( v ) is trivial, we just choose q : = 0 and r : = u . So, we assume that len ( u ) len ( v ) and the rest of the proof will be for this case.
We construct w , q 1 Sym F such that
u = v q 1 + w , len ( w ) len ( v ) and S u = S w = S v S q 1 .
Here is how such w and q 1 are constructed:
  • If len ( u ) = len ( v ) , simply choose w = u and q 1 = 0 .
  • If len ( u ) > len ( v ) , set u ( 0 ) : = u . Starting from l = 0 , whenever len ( u ( l ) ) > len ( v ) , apply Lemma 5 to find u ( l + 1 ) , q ( l ) Sym F such that u ( l + 1 ) = u ( l ) v q ( l ) , S u ( l + 1 ) = S u ( l ) = S v S q ( l ) and len ( u ( l + 1 ) ) < len ( u ( l ) ) . As len ( u ) is finite, this iterative process must stop at some point. In particular, at some l = N , we must have len ( u ( N ) ) len ( v ) < len ( u ( N 1 ) ) . Define
    q 1 : = l = 0 N 1 q ( l ) , w : = u ( N ) .
    Clearly len ( w ) len ( v ) . Moreover, by the definition of w and q 1 above, together with the fact that
    S u ( l + 1 ) = S u , S q ( l ) = S u ( l + 1 ) S v = S u S v , l = 0 , , N 1 ,
    it is easy to see that w , q 1 Sym F and (22) holds.
If S u ( z ) S v ( z ) = z 2 k for some k Z , then let r : = w and q : = q 1 , we have r , q Sym F , len ( r ) len ( v ) and (22) holds.
Suppose S u ( z ) S v ( z ) z 2 k for all k Z . Denote S u ( z ) = ϵ u z c u and S v ( z ) = ϵ v z c v for some ϵ u , ϵ v { 1 , 1 } and c u , c v Z . We consider the following two cases:
  • S u ( z ) S v ( z ) = ϵ z 2 k + 1 for some ϵ { 1 , 1 } and k Z : In this case, we must have prt ( c u ) prt ( c v ) . Then, by Proposition 1, we have len ( u ) len ( v ) and thus len ( u ) > len ( v ) . Define r : = w and q : = q 1 , where q 1 , w Sym F are defined as in (24). We see that (22) holds. Moreover, we have S r ( z ) = S u ( z ) = ϵ u z c u and thus it follows from Proposition 1 that
    prt ( len ( r ) ) = prt ( c u ) prt ( len ( c v ) ) = prt ( len ( v ) ) .
    Therefore, len ( r ) len ( v ) and thus len ( r ) < len ( v ) .
  • S u ( z ) S v ( z ) = z 2 k for some k Z : In this case, we have ϵ u = ϵ v . Let w , q 1 Sym F be such that (23) holds. If len ( w ) < len ( v ) , then simply let r : = w and q : = q 1 , we see that len ( r ) < len ( v ) and (22) holds. Otherwise, if len ( w ) = len ( v ) , define
    M w : = deg ( w ) , m w : = ldeg ( w ) , M v : = deg ( v ) , m v : = ldeg ( v ) .
    Then, it is trivial that M w M v = m w m v . Write
    w ( z ) = k = m w M w w [ k ] z k , v ( z ) = n = m v M v v [ n ] z n ,
    for some coefficients w [ k ] , v [ n ] F for all k = m w , , M w and n = m v , , M v . Define
    q 2 ( z ) : = w [ M w ] v [ M v ] z M w M v = w [ M w ] v [ M v ] z m w m v , r : = w v q 2 .
    It is trivial that deg ( v q 2 ) = M w , ldeg ( v q 2 ) = m w and the coefficient of the z M w term in v q 2 is w ( M w ) . Therefore, we have deg ( r ) < M w , deg ( r ) m w and thus len ( r ) < len ( w ) = len ( v ) . On the other hand, using Proposition 1, direct calculation yields
    S v ( z ) S q 2 ( z ) = [ ϵ v z c v ] [ z 2 M w 2 M v ] = ϵ v z ( c v M v ) M v z 2 M w = ϵ v z m v M v z 2 M w = ϵ w z m w M w z 2 M w = S w ( z ) .
    By letting q : = q 1 + q 2 , it is now straightforward to verify that r , q Sym F and (22) holds.
The proof is now complete. □
Justification of Step 3 in the Proof of Theorem 1, Case 1.
There are two major steps in the constructions of U 3 and D that are required:
(SS1) 
Find W 1 Sym F 2 × 2 such that W 1 is strongly invertible, B ˜ : = W 1 B W 1 H has at least one zero entry, and all multiplications are compatible.
(SS2) 
Factorize B ˜ :
B ˜ = W 2 Diag ( | c 1 | 2 , | c 2 | 2 ) W 2 ,
such that W 2 Sym F 2 × 2 , c 1 , c 2 C satisfy | c 1 | 2 , | c 2 | 2 F , and all matrix multiplications are compatible. By letting U 3 : = W 1 1 W 2 and D : = Diag ( c 1 , c 2 ) , all claims of Step 3 hold.
We first justify (SS1). The case when B has one zero entry is trivial; choose W 1 : = I 2 . So, we only need to justify the case when B has no zero entry. Set B ( 0 ) : = B . In this case, as det ( B ) is a constant and det ( B ) = B 1 , 1 B 2 , 2 B 1 , 2 B 1 , 2 * , we must have ldeg ( B 1 , 1 B 2 , 2 ) = ldeg ( B 1 , 2 B 1 , 2 * ) and deg ( B 1 , 1 B 2 , 2 ) = deg ( B 1 , 2 B 1 , 2 * ) . Therefore,
len ( B 1 , 1 ) + len ( B 2 , 2 ) = len ( B 1 , 1 B 2 , 2 ) = len ( B 1 , 2 B 1 , 2 * ) = 2 len ( B 1 , 2 ) .
As a result, either len ( B 1 , 1 ) len ( B 1 , 2 ) or len ( B 2 , 2 ) len ( B 1 , 2 ) .
We now claim that there exists W 1 ( 0 ) Sym F 2 × 2 such that W 1 ( 0 ) is strongly invertible, all multiplications in B ( 1 ) : = W 1 ( 0 ) B ( 0 ) W 1 ( 0 ) H are compatible, and len ( B 1 , 2 ( 1 ) ) < len ( B 1 , 2 ( 0 ) ) . Let j { 1 , 2 } and suppose len ( B j , j ) len ( B 1 , 2 ) . As S B j , j = 1 , we have S B j , j S B 1 , 2 = ϵ b z c b . By the assumptions that ϵ b = 1 or ϵ b = 1 and c b 2 Z + 1 , we can apply Lemma 6 to find r ( 0 ) , q ( 0 ) Sym F such that len ( r ( 0 ) ) < len ( B j , j ) , B 1 , 2 = B j , j q ( 0 ) + r ( 0 ) and S B 1 , 2 = S r ( 0 ) = S B j , j S q ( 0 ) = S q ( 0 ) . Define
W 1 ( 0 ) ( z ) : = 1 0 q ( 0 ) * ( z ) 1 , if j = 1 , 1 q ( 0 ) ( z ) 0 1 , if j = 2 .
In either case, W 1 0 is strongly invertible and W 1 ( 0 ) Sym F 2 × 2 with
S W 1 ( 0 ) ( z ) = 1 S q ( 0 ) * ( z ) 1 S q ( 0 ) ( z ) = 1 S r ( 0 ) * ( z ) 1 S r ( 0 ) ( z ) ,
for some B 1 , 1 ( 1 ) , B 2 , 2 ( 1 ) Sym F with S B 1 , 1 ( 1 ) ( z ) = S B 2 , 2 ( 1 ) ( z ) = 1 . Furthermore, we have
B ( 1 ) ( z ) : = W 1 ( 0 ) ( z ) B ( 0 ) ( z ) W 1 ( 0 ) H ( z ) = B 1 , 1 ( 1 ) ( z ) r ( 0 ) ( z ) r ( 0 ) * ( z ) B 2 , 2 ( 1 ) ( z ) .
Therefore, len ( B 1 , 2 ( 1 ) ) < len ( B 1 , 2 ( 0 ) ) , B ( 1 ) HS F , 2 has symmetry type S B ( 1 ) = S W 1 ( 0 ) and thus all multiplications in (27) are compatible. This proves the claim.
If the matrix B ( 1 ) has one zero entry, then we just let W 1 : = W 1 ( 0 ) , B ˜ : = B ( 1 ) and go to step 2. Otherwise, apply the process in the above claim. To be specific, for j N , if B ( j ) has no zero entry, then construct W 1 ( j ) Sym F 2 × 2 such that W 1 ( j ) is strongly invertible, all multiplications in B ( j + 1 ) : = W 1 ( j ) B ( j ) W 1 ( j ) H are compatible, and len ( B 1 , 2 ( j + 1 ) ) < len ( B 1 , 2 ( j ) ) . By performing this iterative process, we obtain a sequence of matrices B ( 0 ) , B ( 1 ) , B ( 2 ) , such that len ( B 1 , 2 ( 0 ) ) > len ( B 1 , 2 ( 1 ) ) > len ( B 1 , 2 ( 2 ) ) > . Hence, the sequence must have finite length; that is, the iterative process terminates at some j = N , and B ( N ) has one zero entry. By letting
W 1 : = W 1 ( N 1 ) W 1 ( 1 ) W 1 ( 0 ) , B ˜ : = W 1 B W 1 ,
we have W 1 Sym F 2 × 2 and is strongly invertible, B ˜ = B ( N ) HS F , 2 and has one zero entry, and all multiplications above are compatible. This justifies (SS1).
Once we have obtained B ˜ HS F , 2 that has one zero entry, we move on to (SS2). Here, we consider three cases and define W 2 for each.
  • If B ˜ 1 , 1 = 0 , define W 2 : = B ˜ 1 , 2 B ˜ 1 , 2 ( B ˜ 2 , 2 + 1 ) / 2 ( B ˜ 2 , 2 1 ) / 2 . Then, S W 2 Sym F 2 × 2 with S W 2 = 1 S B ˜ 1 , 2 * S B ˜ 1 , 2 S B ˜ 1 , 2 and (26) holds with c 1 = c 2 = 1 .
  • If B ˜ 1 , 2 = 0 , then B ˜ 1 , 2 * = 0 and thus B ˜ is a diagonal matrix. Note that det ( B ˜ ) is a non-positive constant and B ˜ = B ˜ H . It follows that B ˜ 1 , 1 = λ 1 and B ˜ 2 , 2 = λ 2 for some constants λ 1 , λ 2 F R with λ 1 λ 2 = det ( B ˜ ) 0 . Then,
    if λ 1 0 and λ 2 0 , define W 2 : = 0 1 1 0 , we have W 2 Sym F 2 × 2 with S W 2 = 1 S B ˜ 1 , 2 * S B ˜ 1 , 2 1 and (26) holds with c 1 = λ 2 and c 2 = λ 1 .
    if λ 1 0 and λ 2 0 , define W 2 : = I 2 , we have W 2 Sym F 2 × 2 with S W 2 = 1 S B ˜ 1 , 2 * 1 S B ˜ 1 , 2 and (26) holds with c 1 = λ 1 , c 2 = λ 2 . .
  • If B ˜ 2 , 2 = 0 , define W 2 : = ( B ˜ 1 , 1 + 1 ) / 2 ( B ˜ 1 , 1 1 ) / 2 B ˜ 1 , 2 * B ˜ 1 , 2 * . Then, W 2 Diag ( 1 , 1 ) W 2 H = B ˜ and S W 2 Sym F 2 × 2 with S W 2 = 1 S B ˜ 1 , 2 * 1 1 and (26) holds with c 1 = c 2 = 1 .
Define U 3 : = W 1 1 W 2 and D : = Diag ( c 1 , c 2 ) . It is trivial that B = U 3 D Diag ( 1 , 1 ) D H U 3 H holds. Moreover, as the multiplications in B ˜ = W 1 B W 1 H are compatible and S B ˜ = 1 S B ˜ 1 , 2 * 1 S B ˜ 1 , 2 , we see that the symmetry type of W 1 can be written as S W 1 = 1 S B ˜ 1 , 2 * S η 1 for some 1 × 2 vector η 1 of Laurent polynomials in Sym F . Therefore, by (13), we have S [ W 1 1 ] = S η 1 * 1 S B ˜ 1 , 2 , which implies that W Sym F 2 × 2 with symmetry type
S U 3 = S η 1 * S η 2 for some S η 2 S B ˜ 1 , 2 S B ˜ 1 , 2 , S B ˜ 1 , 2 1 , 1 S B ˜ 1 , 2 , 1 1 .
Finally, observe that any 2 × 2 constant diagonal matrix has symmetry type S η 2 * S η 2 for any S η 2 in the set above. This shows that all multiplications in B = U 3 D Diag ( 1 , 1 ) D H U 3 H are compatible and finishes the justification of (SS2). □
For case 2, the proof is much more tedious than case 1.
Justification of Step 3 in the Proof of Theorem 1, Case 2.
First, consider the case when det ( B ) = 0 . Since S B 1 , 2 ( z ) = z c b with c b 2 Z , it follows from Lemma 1 that prt ( Z ( B 1 , 2 , 1 ) ) , prt ( Z ( B 1 , 2 , 1 ) ) 2 Z + 1 . This means B 1 , 2 has a factor ( 1 z ) . Furthermore, because det ( B ) = B 1 , 1 B 2 , 2 B 1 , 2 B 1 , 2 * and S B 1 , 1 = S B 2 , 2 = 1 , we see that ( 1 z ) ( 1 z 1 ) must divide B 1 , 1 or B 2 , 2 . Therefore, there exists B ˚ HS F , 2 such that B = W 1 B ˚ W 1 H , where W 1 = Diag ( 1 z , 1 ) or Diag ( 1 , 1 z 1 ) . Furthermore, det ( B ˚ ) = 0 and S B ˚ 1 , 2 ( z ) = z c b 1 . Therefore, B ˚ satisfies all assumptions of case 1, and all claims follow.
Now assume that det ( B ) = | C | 2 0 . Observe that B 1 , 1 0 , as otherwise | C | 2 = det ( B ) = B 1 , 2 B 1 , 2 * and thus B 1 , 2 is a non-zero monomial, which can never have symmetry type z c b with c b 2 Z . Now, we see from S B 1 , 1 = 1 that ldeg ( B 1 , 1 ) = deg ( B 1 , 1 ) : = m for some m N 0 . Let Q 1 ( z ) : = j = 0 m Q 1 [ j ] z j and Q 2 ( z ) : = j = 0 m Q 2 [ j ] z j be two Laurent polynomials in F [ z , z 1 ] , where Q 1 [ 0 ] , , Q 1 [ m ] , Q 2 [ 0 ] , , Q 2 [ m ] F are some unknown parameters. Define k : = c b 2 . Using long division, there are Q 3 , Q 4 F [ z , z 1 ] such that
B 1 , 2 * ( z ) Q 1 ( z ) + z m k Q 2 * ( z ) = B 1 , 1 ( z ) Q 3 ( z ) + Q 4 ( z ) ,
and m ldeg ( Q 4 ) deg ( Q 4 ) m . By setting Q 4 = 0 , (28) induces a system of 2 m + 1 homogeneous linear equations with 2 m + 2 variables. Therefore, the set S : = { ( Q 1 [ 0 ] , , Q 1 [ m ] , Q 2 [ 0 ] , , Q 2 [ m ] ) : (28) holds with Q 4 = 0 } F 2 m + 2 has a non-zero element, say ( q 1 [ 0 ] , , q 1 [ m ] , q 2 [ 0 ] , , q 2 [ m ] ) . By letting
W ˜ 1 , 1 ( z ) : = j = 0 m q 1 [ j ] z j , W ˜ 1 , 2 ( z ) : = j = 0 m q 2 [ j ] z j ,
we have
B 1 , 2 * ( z ) W ˜ 1 , 1 ( z ) + z m k W ˜ 1 , 2 * ( z ) = B 1 , 1 ( z ) W ˜ 2 , 1 ( z ) ,
for some W ˜ 2 , 1 ( z ) F [ z , z 1 ] . By S B 1 , 1 ( z ) = 1 and S B 1 , 2 * ( z ) = z 2 k , we deduce from (29) that
z m B 1 , 2 * ( z ) W ˜ 1 , 1 ( z 1 ) + z k W ˜ 1 , 2 * ( z 1 ) = z m 2 k B 1 , 1 ( z ) W ˜ 2 , 1 ( z 1 ) .
Define
W ˚ 1 , 1 ( z ) : = W ˜ 1 , 1 ( z ) , if S W ˜ 1 , 1 ( z ) = z m and S W ˜ 1 , 2 ( z ) = z m , W ˜ 1 , 1 ( z ) z m W ˜ 1 , 1 ( z 1 ) 2 , otherwise ,
W ˚ 1 , 2 ( z ) : = W ˜ 1 , 2 ( z ) , if S W ˜ 1 , 1 ( z ) = z m and S W ˜ 1 , 2 ( z ) = z m , W ˜ 1 , 2 ( z ) + z m W ˜ 1 , 2 ( z 1 ) 2 , otherwise ,
W ˚ 2 , 1 ( z ) : = W ˜ 2 , 1 ( z ) , if S W ˜ 1 , 1 ( z ) = z m and S W ˜ 1 , 2 ( z ) = z m , W ˜ 2 , 1 ( z ) + z m 2 k W ˜ 2 , 1 ( z 1 ) 2 otherwise .
Then, W ˚ 1 , 1 , W ˚ 1 , 2 , W ˚ 2 , 1 Sym F with
S W ˚ 1 , 1 ( z ) = ϵ w z m , S W ˚ 1 , 2 ( z ) = ϵ w z m , S W ˚ 2 , 1 ( z ) = ϵ w z m 2 k ,
for some ϵ w { 1 , 1 } . Moreover, W ˚ 1 , 1 and W ˚ 1 , 2 are not both 0 and satisfy
B 1 , 2 * ( z ) W ˚ 1 , 1 ( z ) + z m k W ˚ 1 , 2 * ( z ) = B 1 , 1 ( z ) W ˚ 2 , 1 ( z ) .
It follows that
B 1 , 2 ( z ) [ B 1 , 2 * ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k W ˚ 1 , 1 * ( z ) ] = [ B 1 , 1 ( z ) B 2 , 2 ( z ) + | C | 2 ] W ˚ 1 , 2 ( z ) + | C | 2 z m k W ˚ 1 , 1 * ( z ) = B 1 , 1 ( z ) B 2 , 2 ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k [ z k m W ˚ 1 , 2 ( z ) + B 1 , 2 ( z ) W ˚ 1 , 1 * ( z ) ] = B 1 , 1 ( z ) B 2 , 2 ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k B 1 , 1 * ( z ) W ˚ 2 , 1 * ( z ) = B 1 , 1 ( z ) [ B 2 , 2 ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k W ˚ 2 , 1 * ( z ) ] .
Since det ( B ) is a non-zero constant, we have gcd ( B 1 , 1 , B 1 , 2 ) = 1 . Thus, we conclude from the above calculation that B 1 , 1 ( z ) divides B 1 , 2 * ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k W ˚ 1 , 1 * ( z ) . This means there exists W ˚ 2 , 2 Sym F with S W ˚ 2 , 2 ( z ) = ϵ w z m 2 k such that
B 1 , 2 * ( z ) W ˚ 1 , 2 ( z ) + | C | 2 z m k W ˚ 1 , 1 * ( z ) = B 1 , 1 ( z ) W ˚ 2 , 2 ( z ) .
Combining (31) and (32), we obtain the following technical identity:
W ˚ 2 , 2 ( z ) W ˚ 1 , 2 ( z ) W ˚ 2 , 1 ( z ) W ˚ 1 , 1 ( z ) B 1 , 1 ( z ) B 1 , 2 * ( z ) = z m k | C | 2 W ˚ 1 , 1 * ( z ) W ˚ 1 , 2 * ( z ) .
With (33), we can now try to write all entries of B in terms of W ˚ 1 , 1 , W ˚ 1 , 2 , W ˚ 2 , 1 and W ˚ 2 , 2 :
  • B 1 , 1 and B 1 , 2 : By left multiplying W ˚ 1 , 2 * | C | 2 W ˚ 1 , 1 * to both sides of (33), we have
    [ | C | 2 W ˚ 1 , 1 * W ˚ 1 , 1 W ˚ 1 , 2 * W ˚ 1 , 2 ] B 1 , 2 * = [ | C | 2 W ˚ 1 , 1 * W ˚ 2 , 1 W ˚ 1 , 2 * W ˚ 2 , 2 ] B 1 , 1 .
    As gcd ( B 1 , 1 , B 1 , 2 ) = 1 , we have B 1 , 1 divides | C | 2 W ˚ 1 , 1 * W ˚ 1 , 1 W ˚ 1 , 2 * W ˚ 1 , 2 . Recall that 0 ldeg ( W ˜ 1 , 1 ) deg ( W ˜ 1 , 1 ) m , it follows from the definition of W ˚ 1 , 1 that 0 ldeg ( W ˚ 1 , 1 ) deg ( W ˚ 1 , 1 ) m . Similarly 0 ldeg ( W ˚ 1 , 2 ) deg ( W ˚ 1 , 2 ) m . Hence,
    m ldeg ( | C | 2 W ˚ 1 , 1 W ˚ 1 , 1 * W ˚ 1 , 2 W ˚ 1 , 2 * )   deg ( | C | 2 W ˚ 1 , 1 W ˚ 1 , 1 * W ˚ 1 , 2 W ˚ 1 , 2 * )   m .
    Moreover, it is easy to see from the symmetry types of W ˚ 1 , 1 and W ˚ 1 , 2 that Z ( W ˚ 1 , 1 , 1 ) Z ( W ˚ 1 , 2 , 1 ) . Therefore, Z ( W ˚ 1 , 1 W ˚ 1 , 1 * , 1 ) Z ( W ˚ 1 , 2 W ˚ 1 , 2 * , 1 ) and | C | 2 W ˚ 1 , 1 W ˚ 1 , 1 * W ˚ 1 , 2 W ˚ 1 , 21 * 0 . Consequently, we must have
    B 1 , 1 ( z ) = α [ | C | 2 W ˚ 1 , 1 ( z ) W ˚ 1 , 1 * ( z ) W ˚ 1 , 2 ( z ) W ˚ 1 , 2 * ( z ) ]
    for some α F R with α 0 , and it follows from (34) that
    B 1 , 2 ( z ) = α [ | C | 2 W ˚ 1 , 1 ( z ) W ˚ 2 , 1 * ( z ) W ˚ 1 , 2 ( z ) W ˚ 2 , 2 * ( z ) ] .
  • By left multiplying W ˚ 1 , 1 W ˚ 1 , 2 to both sides of (33), direct calculation and (33) together yield
    det ( W ˚ ( z ) ) B 1 , 1 ( z ) = α 1 z m k B 1 , 1 ( z ) ,
    where
    W ˚ ( z ) : = W ˚ 1 , 1 ( z ) W ˚ 1 , 2 ( z ) W ˚ 2 , 1 ( z ) W ˚ 2 , 2 ( z ) .
    Thus, det ( W ˚ ( z ) ) = α 1 z m k .
    Next, by left multiplying W ˚ 2 , 2 * | C | 2 W ˚ 2 , 1 * to both sides of (33) and using (36), we have
    [ W ˚ 2 , 2 * ( z ) W ˚ 2 , 2 ( z ) | C | 2 W ˚ 2 , 1 * ( z ) W ˚ 2 , 1 ( z ) ] B 1 , 1 ( z ) + α 1 B 1 , 2 * ( z ) B 1 , 2 ( z ) = | C | 2 z m k det ( W ˚ ( z ) ) * = α 1 det ( B ( z ) ) .
    It follows that
    B 2 , 2 ( z ) = α [ | C | 2 W ˚ 2 , 1 * ( z ) W ˚ 2 , 1 ( z ) W ˚ 2 , 2 * ( z ) W ˚ 2 , 2 ( z ) ] .
Therefore, it follows from (35), (36) and (38) that
B ( z ) = W ˚ ( z ) Diag ( α | C | 2 , α ) W ˚ H ( z ) .
Finally, define
U 3 : = W ˚ , if α > 0 , W ˚ 0 1 1 0 , if α < 0 , D : = Diag ( α | C | , α ) if α > 0 , Diag ( α , α | C | ) if α < 0 .
It is trivial that B = U 3 D Diag ( 1 , 1 ) D H U 3 H . Furthermore,
  • if α > 0 , then
    S U 3 ( z ) = 1 z 2 k ϵ w z m ϵ w z m ,
    S D ( z ) = S [ Diag ( 1 , 1 ) ] ( z ) = ϵ w z m ϵ w z m ϵ w z m ϵ w z m ,
  • if α < 0 , then
    S U 3 ( z ) = 1 z 2 k ϵ w z m ϵ w z m ,
S D ( z ) = S [ Diag ( 1 , 1 ) ] ( z ) = ϵ w z m ϵ w z m ϵ w z m ϵ w z m .
In either case, all multiplications are compatible. This completes the justification. □

3. Quasi-Tight Framelets with Symmetry

In this section, we apply the main result Theorem 1 to construct quasi-tight framelets with symmetry.

3.1. Basics on Framelets

We first recall some basic concepts and facts about framelets.
For p [ 1 , ) , denote L p ( R ) , the linear space of functions f that satisfies
f p : = R | f ( x ) | p d x 1 p < .
When p = 2 , the space L 2 ( R ) is a Hilbert space with the following inner product:
f , g : = R f ( x ) g ( x ) ¯ d x , f , g L 2 ( R ) .
Let f : R C be a function. For any real number c and any positive number λ , define
f λ ; c ( x ) : = λ f ( λ x c ) , x R .
For ϕ , ψ 1 , , ψ s L 2 ( R ) , we say that { ϕ ; ψ 1 , , ψ s } is a framelet (i.e., a wavelet frame) in L 2 ( R ) if there exist positive constants C 1 , C 2 > 0 such that
C 1 f L 2 ( R ) 2 k Z | f , ϕ 1 ; k | 2 + = 1 s j = 0 k Z | f , ψ 2 j ; k | 2 C 2 f L 2 ( R ) 2 , f L 2 ( R ) .
For ϕ , ψ 1 , , ψ s L 2 ( R ) and ϵ 1 , , ϵ s { ± 1 } , we say that { ϕ ; ψ 1 , , ψ s } ( ϵ 1 , , ϵ s ) is a quasi-tight framelet in L 2 ( R ) if { ϕ ; ψ 1 , , ψ s } is a framelet in L 2 ( R ) and
f = k Z f , ϕ 1 ; k ϕ 1 ; k + = 1 s j = 0 k Z ϵ f , ψ 2 j ; k ψ 2 j ; k , f L 2 ( R ) ,
with the above series converging unconditionally in L 2 ( R ) . It is well-known that (40) implies that { ψ 1 , , ψ s } ( ϵ 1 , , ϵ s ) is a homogeneous quasi-tight framelet in L 2 ( R ) , that is,
f = = 1 s j Z k Z ϵ f , ψ 2 j ; k ψ 2 j ; k , f L 2 ( R ) ,
with the above series converging unconditionally in L 2 ( R ) . If in addition, ϵ 1 = = ϵ s = 1 , then { ϕ ; ψ 1 , , ψ s } ( ϵ 1 , , ϵ s ) is called a tight framelet in L 2 ( R ) . In this case, { ψ 1 , , ψ s } is a homogeneous tight framelet in L 2 ( R ) .
To reduce computational complexity in applications, we hope the framelet functions are compactly supported, and such framelets are often derived from compactly supported refinable functions from extension principles. To better discuss this in more detail, we introduce some notations here. First, for any integrable function f L 1 ( R ) , recall that its Fourier transform is defined via R f ( x ) e i x ξ d x . The definition of the Fourier transform can be extended to L 2 ( R ) functions and tempered distributions. Next, denote l 0 ( Z ) , the set (space) of all finitely supported sequences u : Z C ; that is, every u = { u [ k ] } k Z l 0 ( Z ) only has finitely many non-zero terms. For every u l 0 ( Z ) , its symbol is the Laurent polynomial u that is defined by
u ( z ) : = k Z u [ k ] z k , z C { 0 } .
Suppose we have a finitely supported filter a l 0 ( Z ) such that a ( 1 ) = 1 . It is well-known in wavelet and framelet theory that one can define a compactly supported distribution ϕ through
ϕ ^ ( ξ ) : = j = 1 a ( e i 2 j ξ ) , ξ R .
The distribution ϕ defined as (42) is called the standard refinable function associated with the finitely supported filter a, and we call a the refinement filter associated with ϕ . It is easy to verify that the following refinement equation holds:
ϕ ( x ) = 2 k Z a [ k ] ϕ ( 2 x k ) , x R , o r   e q u i v a l e n t l y , ϕ ^ ( 2 ξ ) = a ( e i ξ ) ϕ ^ ( ξ ) , ξ R .
To construct a compactly supported quasi-tight framelet, one can apply the unitary extension principle (UEP) (see e.g., [8,23,29,30]). Here, we state the quasi-tight framelet version of the UEP.
Theorem 2.
Let a l 0 ( Z ) be such that a ( 1 ) = 1 and define the standard refinable function ϕ associated with a as in (42). If
(1) 
ϕ L 2 ( R ) ;
(2) 
there exist ϵ 1 , , ϵ s { 1 , 1 } and finitely supported filters b 1 , , b s l 0 ( Z ) such that
  • b 1 ( 1 ) = = b s ( 1 ) = 0 , where b is the symbol of b for all = 1 , , s ;
  • { a ; b 1 , , b s } ( ϵ 1 , , ϵ s ) forms a quasi-tight framelet filter bank, i.e., the symbols a , b 1 , , b s satisfy
    a * ( z ) a ( z ) + = 1 s ϵ b * ( z ) b ( z ) = 1 , z C { 0 } ,
    a * ( z ) a ( z ) + = 1 s ϵ b * ( z ) b ( z ) = 0 , z C { 0 } ,
then, by letting
ψ : = 2 k Z b ( k ) ϕ ( 2 · k ) ,
{ ϕ ; ψ 1 , , ψ s } ( ϵ 1 , , ϵ s ) is a quasi-tight framelet in L 2 ( R ) .
In a quasi-tight framelet filter bank { a ; b 1 , , b s } ( ϵ 1 , , ϵ s ) , a is called the low-pass filter and b 1 , , b s are called the high-pass filters.
Let us make some comments on Theorem 2. First, to verify if ϕ defined in (42) is an element of L 2 ( R ) , one can check the L 2 -smoothness exponent of the refinement filter a, denoted by sm ( a ) . The quantity sm ( a ) is technical; we refer the readers to [(5.6.44) [8]] for its definition and [Corollary 5.8.5 [8]] for the method to compute it. According to [Theorem 6.3.3 [8]], if sm ( a ) > 0 , then
ϕ H τ ( R ) 2 : = R | ϕ ^ ( ξ ) | 2 ( 1 + | ξ | 2 ) τ d ξ <
holds for every τ [ 0 , sm ( a ) ) . In other words, ϕ belongs to the Sobolev space H τ ( R ) and thus ϕ L 2 ( R ) .
Next, we see from Theorem 2 that the construction of a quasi-tight framelet essentially reduces to the design of an underlying quasi-tight framelet filter bank { a ; b 1 , , b s } ( ϵ 1 , , ϵ s ) that satisfies (44) and (45). Define
M a ( z ) : = 1 a * ( z ) a ( z ) a * ( z ) a ( z ) a * ( z ) a ( z ) 1 a * ( z ) a ( z ) .
To construct a quasi-tight framelet filter bank, it suffices to find b = ( b 1 , , b s ) T ( l 0 ( Z ) ) s × 1 and ϵ 1 , , ϵ s { ± 1 } such that b 1 ( 1 ) = = b s ( 1 ) = 0 and
M a ( z ) = b ( z ) b ( z ) * Diag ( ϵ 1 , , ϵ s ) b ( z ) , b ( z ) .
When ϵ 1 = = ϵ s = 1 , then (48) becomes a spectral factorization of the matrix M a . In this case, the refinement filter a necessarily satisfies the sub-QMF condition:
det ( M a ( z ) ) = 1 a * ( z ) a ( z ) a * ( z ) a ( z ) 0 , z T .
Unfortunately, many refinement filters fail to satisfy (49). For example, consider the refinement filter a l 0 ( Z ) with
a ( z ) = 1 16 ( z 2 + 4 z + 10 + 4 z 1 z 2 ) ,
we have
1 a * ( z ) a ( z ) a * ( z ) a ( z ) = ( z z 1 ) 4 128 0 , z T .
Therefore, constructing a tight framelet is impossible in such cases, and we must work with the quasi-tight framelets. In fact, with the refinement filter a given in (50), we have the first observed example of a quasi-tight framelet filter bank in [Example 3.2.2 [8]].

3.2. Vanishing Moments and Symmetry

Two highly desired features for quasi-tight framelets are high-order vanishing moments and symmetry on the generators. Let us briefly discuss them here.
The orders of vanishing moments of the framelet generators ψ , = 1 , , s reflect the sparsity of the framelet expansion (40). To better understand this, let us introduce some notations. For a finitely supported filter u l 0 ( Z ) and m N 0 , we say that
  • u has order m sum rules if
    u ( z ) = ( 1 + z ) m u ˜ ( z ) , z C { 0 } ,
    for some Laurent polynomial u ˜ . Denote sr ( u ) : = m with m being the largest positive integer such that (51) holds;
  • u has order m vanishing moments if
    u ( z ) = ( 1 z ) m v ( z ) , z C { 0 } ,
    for some Laurent polynomial v . Denote vm ( u ) : = m with m being the largest positive integer such that (52) holds.
For a function ψ L 2 ( R ) , we say that ψ has order m vanishing moments if
ψ ^ ( j ) ( 0 ) = 0 , j = 0 , 1 , , m 1 .
Denote vm ( ψ ) : = m with m being the largest positive integer such that (53) holds. Suppose { ϕ ; ψ 1 , , ψ s } ( ϵ 1 , , ϵ s ) is a quasi-tight framelet that is derived through the UEP from an underlying quasi-tight framelet filter bank { a ; b 1 , , b s } ( ϵ 1 , , ϵ s ) . It is easy to show from (44), (45) and the definition of ψ in (46) that
min { vm ( b 1 ) , , vm ( b s ) } = min { vm ( ψ 1 ) , , vm ( ψ s ) } min sr ( a ) , 1 2 vm u a ,
where u a l 0 ( Z ) is the filter whose symbol is given by
u a ( z ) : = 1 a * ( z ) a ( z ) .
We always try to make n : = min { vm ( ψ 1 ) , , vm ( ψ s ) } as large as possible.
On the other hand, the symmetry of the framelet generators is critically important in handling boundary artifacts in many applications. To derive a symmetric quasi-tight framelet, we start with a refinement filter a l 0 ( Z ) such that a ( 1 ) = 1 and a Sym F . Then, the matrix M a defined in (47) is an element of HS F , 2 . To construct the high-pass filters b 1 , , b s with symmetry, we must find a generalized matrix spectral factorization of M a as in (48) and ensure that all multiplications preserve the symmetry structure. It is well-known that a framelet filter bank with symmetry necessarily has s 2 high-pass filters. Quite often, we hope to have fewer high-pass filters in a framelet filter bank to make algorithms using framelet transforms efficient. For the construction of symmetric tight framelet filter banks, we refer the readers to [1,7,10] for the construction of symmetric tight framelet filter banks with s = 3 and [6,9] for symmetric tight framelet filter banks with s = 2 . The construction of symmetric quasi-tight framelets is much less investigated. To the best of the author’s knowledge, [2] is the only existing paper that studies symmetric quasi-tight framelets but with coefficients in the field F = C .

3.3. The Main Theorem

From the previous discussion, we see that the smaller the number of generators is, the better. Therefore, we focus on symmetric quasi-tight framelet filter banks with two generators. Specifically, we work on characterizing and designing a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) such that a Sym F , b j = c j b ˘ j for some b ˘ 1 , b ˘ 2 Sym F and c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F . Moreover, we want our high-pass filters to have the highest possible order of vanishing moments. The construction of such a quasi-tight framelet filter bank will directly apply Theorem 1.
Before we present our main theorem, let us provide a brief guideline on constructing a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) . Let a l 0 ( Z ) be such that a ( 1 ) = 1 and a F [ z , z 1 ] . Define M a as in (47). To derive a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) with high-order vanishing moments, it suffices to find b : = ( b 1 , b 2 ) T ( l 0 ( Z ) ) 2 × 1 such that
M a ( z ) = b ( z ) b ( z ) H Diag ( 1 , 1 ) b ( z ) b ( z ) ,
and min { vm ( b 1 ) , vm ( b 2 ) } is as large as possible. Choose n N with n min { sr ( a ) , 1 2 vm ( u a ) } , where u a l 0 ( Z ) is defined as in (54). Define
M a , n ( z ) : = 1 a * ( z ) a ( z ) ( 1 z 1 ) n ( 1 z ) n a * ( z ) a ( z ) ( 1 z 1 ) n ( 1 + z ) n a * ( z ) a ( z ) ( 1 + z 1 ) n ( 1 z ) n 1 a * ( z ) a ( z ) ( 1 + z 1 ) n ( 1 + z ) n .
By the choice of n, it is easy to see that all entries of M a , n are Laurent polynomials in F [ z , z 1 ] and M a , n H = M a , n . Define
a ˜ ( z ) : = 1 a * ( z ) a ( z ) , b ˜ ( z ) : = a * ( z ) a ( z ) ,
a ˚ ( z ) : = a ˜ ( z ) ( 1 z 1 ) n ( 1 z ) n , b ˚ ( z ) : = b ˜ ( z ) ( 1 z 1 ) n ( 1 + z ) n .
Then, we have M a ( z ) : = a ˜ ( z ) b ˜ ( z ) b ˜ ( z ) a ˜ ( z ) and M a , n ( z ) : = a ˚ ( z ) b ˚ ( z ) b ˚ ( z ) a ˚ ( z ) , where M a is defined as in (47). Note that
det ( M a ( z ) ) = a ˜ ( z ) + a ˜ ( z ) 1 ,
from which it is not hard to see that gcd ( a ˜ , b ˜ , b ˜ ( · ) , a ˜ ( · ) ) = 1 . Therefore, we conclude that gcd ( a ˚ , b ˚ , b ˚ ( · ) , a ˚ ( · ) ) = 1 .
For any Laurent polynomial u ( z ) : = k Z u ( k ) z k F [ z , z 1 ] , define u [ 0 ] , u [ 1 ] F [ z , z 1 ] via
u [ 0 ] ( z ) : = k Z u ( 2 k ) z k , u [ 1 ] ( z ) : = k Z u ( 2 k + 1 ) z k .
It is trivial to see that
u [ 0 ] ( z 2 ) : = u ( z ) + u ( z ) 2 , u [ 1 ] ( z 2 ) : = u ( z ) u ( z ) 2 z .
Define
N a , n ( z ) = 1 2 a ˚ [ 0 ] ( z ) + b ˚ [ 0 ] ( z ) a ˚ [ 1 ] ( z ) b ˚ [ 1 ] ( z ) z a ˚ [ 1 ] ( z ) + b ˚ [ 1 ] ( z ) a ˚ [ 0 ] ( z ) b ˚ [ 0 ] ( z ) = : p ( z ) r ( z ) r * ( z ) q ( z ) .
It is easy to verify that
N a , n ( z 2 ) : = 1 4 F ( z ) M a , n ( z ) F ( z ) H , where F ( z ) : = 1 1 z z .
Now, to construct a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) , it suffices to find a matrix U ( z ) = U 1 , 1 ( z ) U 1 , 2 ( z ) U 2 , 1 ( z ) U 2 , 2 ( z ) of Laurent polynomials in F [ z , z 1 ] and a diagonal matrix D = Diag c 1 , c 2 for some c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F such that N a , n = U D Diag ( 1 , 1 ) D H U H . Once this is done, define b : = ( b 1 , b 2 ) T ( l 0 ( Z ) ) 2 × 1 via
b 1 ( z ) : = c 1 ( 1 z ) n [ U 1 , 1 * ( z 2 ) + z U 2 , 1 * ( z 2 ) ] , b 2 ( z ) : = c 2 ( 1 z ) n [ U 1 , 2 * ( z 2 ) + z U 2 , 2 * ( z 2 ) ] ,
then it is easy to verify that { a ; b 1 , b 2 } ( 1 , 1 ) is a quasi-tight framelet filter bank such that min { vm ( b 1 ) , vm ( b 2 ) } n . Moreover, by letting
b ˘ 1 ( z ) : = ( 1 z ) n [ U 1 , 1 * ( z 2 ) + z U 2 , 1 * ( z 2 ) ] , b ˘ 2 ( z ) : = ( 1 z ) n [ U 1 , 2 * ( z 2 ) + z U 2 , 2 * ( z 2 ) ] ,
we have b ˘ j F [ z , z 1 ] and b j = c j b ˘ j for j = 1 , 2 .
Theorem 3.
Let a l 0 ( Z ) be such that a ( 1 ) = 1 and a Sym F with S a ( z ) = z c for some c Z . Let n N be such that n min { sr ( a ) , 1 2 vm ( u a ) } where u a is defined as in (54). Define M a , n as in (56) and N a , n as in (60). The following statements are equivalent:
(1) 
det ( N a , n ( z ) ) = | C | 2 d n ( z ) d n * ( z ) for some d n Sym F and C C with | C | 2 F ;
(2) 
there exist b 1 , b 2 l 0 ( Z ) such that
(i) 
{ a ; b 1 , b 2 } ( 1 , 1 ) is a quasi-tight framelet filter bank;
(ii) 
b 1 ( z ) = c 1 b ˘ 1 ( z ) and b 2 ( z ) = c 2 b ˘ 2 ( z ) for some b ˘ 1 , b ˘ 2 Sym F and c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F ;
(iii
min { vm ( b 1 ) , vm ( b 2 ) } = n .
Define ϕ ^ ( ξ ) : = j = 1 a ( e i 2 j ξ ) for all ξ R . If in addition ϕ L 2 ( R ) , define
ψ ( x ) : = 2 k Z b ( k ) ϕ ( 2 x k ) , x R , = 1 , 2 ,
then { ϕ ; ψ 1 , ψ 2 } ( 1 , 1 ) is a quasi-tight framelet in L 2 ( R ) such that all ϕ , ψ 1 , ψ 2 have symmetry and min ( vm ( ψ 1 ) , vm ( ψ 2 ) ) n .
Proof. 
(2) ⇒ (1): Denote S b ˘ j ( z ) = ϵ ˘ j z k j where ϵ ˘ j { 1 , 1 } and k j Z for j = 1 , 2 . We first show that prt ( k 1 ) = prt ( k 2 ) = prt ( c ) . Assume otherwise, say prt ( k 1 ) = prt ( k 2 ) prt ( c ) . Since { a ; b 1 , b 2 } ( 1 , 1 ) is a quasi-tight framelet filter bank, we have
a * ( z ) a ( z ) = | c 1 | 2 b ˘ 1 * ( z ) b ˘ 1 ( z ) + | c 2 | 2 b ˘ 2 * ( z ) b ˘ 2 ( z ) = 0 .
As S [ a * a ( · ) ] ( z ) = ( 1 ) c , S [ | c 1 | 2 b ˘ 1 * b ˘ 1 ( · ) ] ( z ) = ( 1 ) k 1 and S [ | c 2 | 2 b ˘ 2 * b ˘ 2 ( · ) ] ( z ) = ( 1 ) k 2 , we conclude that ( 1 ) c = ( 1 ) k 1 = ( 1 ) k 2 , which is a contradiction. Therefore, prt ( k 1 ) = prt ( k 2 ) prt ( c ) cannot happen. Similarly prt ( k 1 ) prt ( k 2 ) = prt ( c ) and prt ( k 2 ) prt ( k 1 ) = prt ( c ) cannot happen either. Consequently, we must have prt ( k 1 ) = prt ( k 2 ) = prt ( c ) .
By items (ii) and (iii), there exist v 1 , v 2 Sym F such that
b ˘ j ( z ) = ( 1 z ) n v j ( z ) , j = 1 , 2 ,
and S v j ( z ) = ( 1 ) n ϵ ˘ j z k j + n for j = 1 , 2 . Define V ( z ) : = v 1 ( z ) v 1 ( z ) v 2 ( z ) v 2 ( z ) . As { a ; b 1 , b 2 } ( 1 , 1 ) is a quasi-tight framelet filter bank, it is easy to derive from (55) that
M a , n ( z ) = V H ( z ) Diag ( c 1 , c 2 ) Diag ( 1 , 1 ) Diag ( c 1 , c 2 ) H V ( z ) ,
where M a , n is defined as (56). Now, let F be the same as in (61), we have
N a , n ( z 2 ) = 1 4 F ( z ) M a , n ( z ) F ( z ) H = V ˜ H ( z 2 ) Diag ( c 1 , c 2 ) Diag ( 1 , 1 ) Diag ( c 1 , c 2 ) H V ˜ ( z 2 ) ,
where
V ˜ ( z ) : = v 1 [ 0 ] ( z ) v 1 [ 1 ] ( z ) v 2 [ 0 ] ( z ) v 2 [ 1 ] ( z ) .
We show that det ( V ˜ ) Sym F . Consider the following two cases:
  • c + n 2 Z : In this case, we have prt ( n ) = prt ( c ) = prt ( k 1 ) = prt ( k 2 ) . Thus, k 1 + k 2 + 2 n 2 Z and direct calculation yields
    S v 1 ( z ) S v 2 ( z ) = S v 1 ( z ) S v 2 ( z ) = S v 1 ( z ) S v 2 ( z ) = S v 1 ( z ) S v 2 ( z ) = ϵ ˘ 1 ϵ ˘ 2 z k 1 + k 2 + 2 n .
    Therefore, S [ det ( V ˜ ) ] ( z ) = ϵ ˘ 1 ϵ ˘ 2 z ( k 1 + k 2 ) / 2 + n 1 and thus det ( V ˜ ) Sym F .
  • c + n 2 Z + 1 : In this case, we have prt ( n ) prt ( c ) = prt ( k 1 ) = prt ( k 2 ) . Let F be the same as in (61). Direct calculation yields
    V ˜ ( z 2 ) F ( z 2 ) = ( 1 + z ) v 1 ( z ) + ( 1 z ) v 1 ( z ) ( 1 z ) v 1 ( z ) + ( 1 + z ) v 1 ( z ) ( 1 + z ) v 2 ( z ) + ( 1 z ) v 2 ( z ) ( 1 z ) v 2 ( z ) + ( 1 + z ) v 2 ( z ) ,
    and
    S [ V ˜ F ] ( z 2 ) = ( 1 ) n ϵ ˘ 1 z k 1 + n + 1 ( 1 ) n + 1 ϵ ˘ 1 z k 1 + n + 1 ( 1 ) n ϵ ˘ 2 z k 2 + n + 1 ( 1 ) n + 1 ϵ ˘ 2 z k 2 + n + 1 .
    It follows that S [ det ( V ˜ F ) ] ( z ) = ϵ ˘ 1 ϵ ˘ 2 z ( k 1 + k 1 ) / 2 + n + 1 and thus det ( V ˜ ) Sym F with S [ det ( V ˜ ) ] ( z ) = ϵ ˘ 1 ϵ ˘ 2 z ( k 1 + k 1 ) / 2 + n 1 .
Now, by letting d n ( z ) : = det ( V ˜ ( z ) ) Sym F and C : = c 1 c 2 , we see that item (1) holds.
(1) ⇒ (2): Define a ˜ , b ˜ as in (57) and a ˚ , b ˚ as in (58). Write N a , n = p r r * q as in (60). By (61) and the fact that gcd ( a ˚ , b ˚ , b ˚ ( · ) , a ˚ ( · ) ) = 1 , it is not difficult to see that gcd ( p , r , r * , q ) = 1 .
By the symmetry type of a , we have S a ˚ ( z ) = 1 and S b ˚ ( z ) = ( 1 ) c + n . Consider the following two cases:
  • c + n 2 Z : In this case, we have S b ˚ ( z ) = 1 . Using (59) and the definition of N a , n in (60), it is easy to see that S [ N a , n ] ( z ) = 1 z 1 z 1 . Hence, N a , n HS F , 2 satisfies all assumptions of Theorem 1. Therefore, there exist U = U 1 , 1 U 1 , 2 U 2 , 1 U 2 , 2 Sym F 2 × 2 and c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F such that
    N a , n ( z ) = U ( z ) Diag ( c 1 , c 2 ) Diag ( 1 , 1 ) Diag ( c 1 , c 2 ) H U H ( z ) ,
    and
    S U 1 , 1 ( z ) S U 2 , 1 ( z ) = S U 1 , 2 ( z ) S U 2 , 2 ( z ) = S r ( z ) = z 1 .
    Define b 1 , b 2 l 0 ( Z ) via (62). It is straightforward to verify that { a ; b 1 , b 2 } ( 1 , 1 ) is a quasi-tight framelet filter bank with min { vm ( b 1 ) , vm ( b 2 ) } n . Moreover, we have b j = c j b ˘ j , where b ˘ j is defined in (63), and it follows from (66) that b ˘ 1 , b ˘ 2 Sym F with S b ˘ 1 ( z ) = ( 1 ) n z n S U 1 , 1 * ( z ) and S b ˘ 2 ( z ) = ( 1 ) n z n S U 1 , 2 * ( z ) .
  • c + n 2 Z + 1 : In this case, we have S b ˚ ( z ) = 1 . Define P : = 1 1 1 1 and N ( z ) : = P N a , n ( z ) P H . Direct calculation yields N ( z ) = N 1 , 1 ( z ) N 1 , 2 ( z ) N 2 , 1 ( z ) N 2 , 2 ( z ) , where
    N 1 , 1 ( z ) : = a ˚ [ 0 ] ( z ) + 1 2 ( z + 1 ) a ˚ [ 1 ] ( z ) + 1 2 ( z 1 ) b ˚ [ 1 ] ( z ) ,
    N 1 , 2 ( z ) : = b ˚ [ 0 ] ( z ) + 1 2 ( z + 1 ) b ˚ [ 1 ] ( z ) + 1 2 ( z 1 ) a ˚ [ 1 ] ( z ) ,
    N 2 , 1 ( z ) : = b ˚ [ 0 ] ( z ) 1 2 ( z + 1 ) b ˚ [ 1 ] ( z ) 1 2 ( z 1 ) a ˚ [ 1 ] ( z ) ,
    N 2 , 2 ( z ) : = a ˚ [ 0 ] ( z ) 1 2 ( z + 1 ) a ˚ [ 1 ] ( z ) 1 2 ( z 1 ) b ˚ [ 1 ] ( z ) .
    Using (59) and the definition of N a , n in (60), we see that S N ( z ) = 1 1 1 1 . Hence, N HS F , 2 . Moreover, since det ( N ) = 4 det ( N a , n ) , we see that gcd ( N 1 , 1 , N 1 , 2 , N 2 , 1 , N 2 , 2 ) = 1 . Therefore, N satisfies all assumptions of Theorem 1, and thus there exist V = V 1 , 1 V 1 , 2 V 2 , 1 V 2 , 2 Sym F 2 × 2 and c 1 , c 2 C with | c 1 | 2 , | c 2 | 2 F such that
    N ( z ) = V ( z ) Diag ( c 1 , c 2 ) Diag ( 1 , 1 ) Diag ( c 1 , c 2 ) H V H ( z ) ,
    and
    S V 1 , 1 ( z ) S V 2 , 1 ( z ) = S V 1 , 2 ( z ) S V 2 , 2 ( z ) = S N 1 , 2 ( z ) = 1 .
    It follows that
    N a , n ( z ) = U ( z ) Diag ( c 1 , c 2 ) Diag ( 1 , 1 ) Diag ( c 1 , c 2 ) H U H ( z ) ,
    where U : = P 1 V = U 1 , 1 U 1 , 2 U 2 , 1 U 2 , 2 . Now, define b 1 , b 2 l 0 ( Z ) via (62) and b ˘ 1 , b ˘ 2 via (63). It is clear that items (i) and (iii) hold. Moreover, direct calculation yields
    b ˘ 1 ( z ) = ( 1 z ) n 2 [ ( 1 + z ) V 1 , 1 * ( z 2 ) + ( 1 z ) V 2 , 1 * ( z 2 ) ] ,
    b ˘ 2 ( z ) = ( 1 z ) n 2 [ ( 1 + z ) V 1 , 2 * ( z 2 ) + ( 1 z ) V 2 , 2 * ( z 2 ) ] .
    Therefore, using (67), we conclude that b ˘ 1 , b ˘ 2 Sym F with S b ˘ 1 ( z ) = ( 1 ) n z n + 1 S V 1 , 1 * ( z ) and S b ˘ 2 ( z ) = ( 1 ) n z n + 1 S V 1 , 2 * ( z ) . This proves item (ii).
To this end, we have finished the proofs of (i)–(iii) in item (2).
If in addition ϕ L 2 ( R ) , where ϕ ^ ( ξ ) : = j = 1 a ( e i 2 j ξ ) , define ψ 1 and ψ 2 as in (64). It follows from Theorem 2 that { ϕ ; ψ 1 , ψ 2 } ( 1 , 1 ) is a quasi-tight framelet in L 2 ( R ) . Moreover, we have min { vm ( ψ 1 ) , vm ( ψ 2 ) } = min { vm ( b 1 ) , vm ( b 2 ) } n . Finally, the symmetry of ϕ , ψ 1 and ψ 2 follows immediately from the symmetry of a , b 1 and b 2 . □

4. Illustrative Examples

This section presents several examples to illustrate our main theorems on the generalized spectral factorization and quasi-tight framelets with symmetry.
Example 1.
Let F = Q and consider the refinement filter a l 0 ( Z ) with
a ( z ) : = ( 1 + z ) 3 16 z 2 ( z 2 4 z + 1 ) .
Define u a as in (54). We have S a ( z ) = z 3 , sr ( a ) = 3 and vm ( u a ) = 2 . Let n = 1 , define M a , 1 via (56) and N a , 1 via (60). Specifically, we have
N a , 1 ( z ) : = 1 256 z 2 16 z + 30 16 z 1 + z 2 16 ( 1 + z 1 ) 16 ( 1 + z ) 0 = : p ( z ) r ( z ) r * ( z ) q ( z ) ,
and
det ( N a , 1 ) ( z ) = 1 256 d 1 * ( z ) d 1 * ( z ) where d 1 ( z ) : = 1 + z .
Hence, by Theorem 3, we obtain a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) such that b 1 , b 2 have symmetry and at least order 1 vanishing moments.
We follow the steps in the proof of Theorem 1 to factorize N a , 1 :
Step 1.
Note that gcd ( p , r ) = gcd ( r , q ) = 1 , so the entries of N a , 1 are already mutually coprime and we move on to step 2.
Step 2.
Define U 1 ( z ) : = Diag ( 1 , 1 + z ) . Clearly U 1 Sym Q 2 × 2 . Moreover, by letting
B ( z ) : = U 1 ( z ) 1 N a , 1 ( z ) U 1 ( z ) H = 1 256 z 2 16 z + 30 16 z 1 + z 2 16 16 0 ,
We have B HS Q , 2 and det ( B ) = 1 256 .
Step 3.
Note that S B 1 , 2 ( z ) = 1 , so we follow the justification of step 3 for case 1 and define
U 2 ( z ) : = B 1 , 1 ( z ) + 1 2 B 1 , 1 ( z ) 1 2 B 1 , 2 * ( z ) B 1 , 2 * ( z ) = 1 512 z 2 16 z + 286 16 z 1 + z 2 z 2 16 z 226 16 z 1 + z 2 32 32 .
Then, U 2 ( z ) = 1 1 1 1 and thus U 2 Sym Q 2 × 2 . Moreover, we have U 2 Diag ( 1 , 1 ) U 2 H = B .
Define
U ( z ) : = U 1 ( z ) U 2 ( z ) = 1 512 z 2 16 z + 286 16 z 1 + z 2 z 2 16 z 226 16 z 1 + z 2 16 ( 1 + z ) 16 ( 1 + z ) ,
We see that S U ( z ) = 1 1 z z and thus U Sym Q 2 × 2 . Moreover, we have N a , 1 = U Diag ( 1 , 1 ) U H . Finally, derive the high-pass filters b 1 , b 2 via (62) with c 1 = c 2 = 1 and n = 1 , we have
b 1 ( z ) = 1 512 ( 1 z ) ( z 4 16 z 2 32 z + 286 32 z 1 16 z 2 + z 4 ) ,
b 2 ( z ) = 1 512 ( 1 z ) ( z 4 16 z 2 32 z 226 32 z 1 16 z 2 + z 4 ) .
Note that vm ( b 1 ) = vm ( b 2 ) = 1 and S b 1 ( z ) = S b 2 ( z ) = z .
Define ϕ via (42). As sm ( a ) 1.4408 , we have ϕ L 2 ( R ) . Hence, by letting ψ as in (46) for = 1 , 2 , we see that { ϕ ; ψ 1 , ψ 2 } ( 1 , 1 ) is a quasi-tight framelet in L 2 ( R ) . Moreover, ϕ , ψ 1 , ψ 2 all have symmetry and vm ( ψ 1 ) = vm ( ψ 2 ) = 1 .
Example 2.
Let F = Q and consider the refinement filter a l 0 ( Z ) with
a ( z ) : = 1 1024 ( z 6 + 18 z 4 32 z 3 63 z 2 + 288 z + 604 + 288 z 1 63 z 2 32 z 3 + 18 z 4 z 6 ) .
Define u a as in (54). We have S a ( z ) = 1 , sr ( a ) = 4 and vm ( u a ) = 8 . Let n = 4 , define M a , 4 via (56) and N a , 4 via (60). Specifically, we have
N a , 4 ( z ) : = p ( z ) r ( z ) r * ( z ) q ( z ) ,
where
p ( z ) : = 1 1 048 576 ( z 4 + 16 z 3 156 z 2 + 2800 z + 1850 + 2800 z 1 156 z 2 + 16 z 3 z 4 ) ,
r ( z ) : = 1 262 144 ( z 3 + 13 z 2 81 z + 2245 + 2245 z 1 81 z 2 + 13 z 3 z 4 ) ,
q ( z ) : = 1 65 536 ( z 3 + 10 z 2 15 z + 1996 15 z 1 + 10 z 2 z 3 ) .
Note that
det ( N a , 4 ) ( z ) = 1 2 097 152 d 4 * ( z ) d 4 * ( z ) , where d 4 ( z ) : = z 14 + z 1 .
Hence, by Theorem 3, we obtain a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) such that b 1 , b 2 have symmetry and at least order 4 vanishing moments.
We follow the steps in the proof of Theorem 1 to factorize N a , 4 :
Step 1.
Note that gcd ( p , r ) = gcd ( r , q ) = 1 , so the entries of N a , 4 are already mutually coprime and we move on to step 2.
Step 2.
Define U 1 ( z ) : = p 1 ( z ) r ( z ) s 1 ( z ) q ( z ) where
p 1 ( z ) : = 1 32 ( z 2 14 z + 1 ) 1 375 343 ( z 9 + z 9 ) 17 801 154 ( z 8 + z 8 ) + 110 390 161 ( z 7 + z 7 ) 3 081 371 452 ( z 6 + z 6 ) 3 263 011 343 ( z 5 + z 5 ) 76 359 874 ( z 4 + z 4 ) 24 287 153 ( z 3 + z 3 ) ,
s 1 ( z ) : = 1 8 ( z 2 14 z + 1 ) 1 375 343 ( z 9 + z 8 ) 13 675 125 ( z 8 + z 7 ) + 19 852 438 ( z 7 + z 6 ) 2 744 063 146 ( z 6 + z 5 ) 135 589 845 ( z 5 + z 4 ) 23 238 577 ( z 4 + z 3 ) .
We have S U 1 ( z ) = z 2 z 1 z 3 1 and thus U 1 Sym Q 2 × 2 . Moreover, we have B : = U 1 1 N a , 4 U 1 H HS Q , 2 and det ( B ) = 1 2 097 152 .
Step 3.
Note that S B 1 , 2 ( z ) = z 3 , so we follow the justification of step 3 for case 1 and define
U 2 ( z ) : = p 2 ( z ) 1 q 2 ( z ) s 2 ( z ) ,
where
p 2 ( z ) : = 1 2 097 152 ( 1 + 5 z 1 + 5 z 2 z 3 ) ,
q 2 ( z ) : = 1 256 1 375 343 ( z 8 + z 8 ) + 26 053 212 ( z 7 + z 7 ) 89 290 186 ( z 6 + z 6 ) 95 839 588 ( z 5 + z 5 ) + 20 617 137 ( z 4 + z 4 ) 262 144 ( z 3 + z 3 ) ,
s 2 ( z ) : = 8192 1 375 343 ( z 8 + z 5 ) 19 176 497 ( z 7 + z 4 ) + 284 416 ( z 6 + z 3 ) + 38 408 ( z 5 + z 2 ) + 640 ( z 4 + z 1 ) + 128 ( z 3 + 1 ) .
Then, S U 2 ( z ) = z 3 1 1 z 3 and thus U 2 Sym Q 2 × 2 . Moreover, we have
B = U 2 Diag ( 32 , 1 67 108 864 ) U 2 H .
Define
U ( z ) : = U 1 ( z ) U 2 ( z ) = 1 128 ( 1 + z 1 ) 8 z 3 + 64 z 2 368 z + 64 8 z 1 1 32 32 z 3 + 160 z 2 + 160 z 32 ,
we see that S U ( z ) = z 1 z 2 1 z 3 and thus U Sym Q 2 × 2 . By letting D : = Diag ( 32 , 1 67 108 864 ) = Diag ( 4 2 , 1 8192 ) , we have N a , 4 ( z ) = U ( z ) D Diag ( 1 , 1 ) D H U H ( z ) . Finally, derive the high-pass filters b 1 , b 2 via (62) with c 1 : = 4 2 , c 2 = 1 8192 and n = 4 , we have
b 1 ( z ) = 2 32 ( 1 z ) 4 ( z 2 + 4 z + 1 ) ,
b 2 ( z ) = z 2 1024 ( 1 z ) 4 ( z 4 4 z 3 + 8 2 + 20 z 46 + 20 z 1 + 8 z 2 4 z 3 z 4 ) .
Note that vm ( b 1 ) = vm ( b 2 ) = 4 , S b 1 ( z ) = z 6 and S b 2 ( z ) = 1 .
Define ϕ via (42). As sm ( a ) 1.6821 , we have ϕ L 2 ( R ) . Hence, by letting ψ as in (46) for = 1 , 2 , we see that { ϕ ; ψ 1 , ψ 2 } ( 1 , 1 ) is a quasi-tight framelet in L 2 ( R ) . Moreover, ϕ , ψ 1 , ψ 2 all have symmetry and vm ( ψ 1 ) = vm ( ψ 2 ) = 4 .
Example 3.
Let F = Q ( 226 ) and consider the refinement filter a l 0 ( Z ) with
a ( z ) : = 1 4096 z 4 ( 1 + z ) 3 2 226 ( z 1 ) 6 86 z 6 + 198 z 5 426 z 4 396 z 3 426 z 2 + 198 z 86 .
Define u a as in (54). We have S a ( z ) = z , sr ( a ) = 3 and vm ( u a ) = 6 . Let n = 3 , define M a , 3 via (56) and N a , 3 via (60). Specifically, we have
N a , 3 ( z ) : = p ( z ) r ( z ) r * ( z ) q ( z ) ,
where
p ( z ) : = 1 16 777 216 ( 172 226 + 2753 ) ( z 3 + z 3 ) + ( 1320 226 22 710 ) ( z 2 + z 2 ) ( 9876 226 + 203 343 ) ( z + z 1 ) 48 080 226 + 821 068 ,
r ( z ) : = 1 4 194 304 ( 645 30 226 ) ( z 2 + z 3 ) + ( 218 226 5767 ) ( z + z 2 ) + ( 120 834 4284 226 ) ( 1 + z 1 ) ,
q ( z ) : = 1 1 048 576 225 ( z 2 + z 2 ) 1920 ( z + z 1 ) + 61 246 .
Note that
det ( N a , 3 ) ( z ) = 5679 + 396 226 16 777 216 d 3 * ( z ) d 3 * ( z ) where d 3 ( z ) : = z 1 .
Hence, by Theorem 3, we obtain a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) such that b 1 , b 2 have symmetry and at least order 3 vanishing moments.
We follow the steps in the proof of Theorem 1 to factorize N a , 3 :
Step 1.
Note that gcd ( p , r ) = gcd ( r , q ) = 1 , so the entries of N a , 3 are already mutually coprime and we move on to step 2.
Step 2.
Define U 1 ( z ) : = p 1 ( z ) r ( z ) s 1 ( z ) q ( z ) , where
p 1 ( z ) : = 1 3 603 993 750 ( 1 091 704 285 875 + 9 791 074 100 226 ) ) ( z 7 z 6 ) ( 13 257 411 426 695 + 398 623 540 340 226 ) ( z 6 z 5 ) + ( 281 188 303 563 542 + 9 390 986 903 768 226 ) ) ( z 5 z 4 ) + ( 2 552 371 608 810 80 926 623 996 226 ) ) ( z 4 z 3 ) ( 282 308 839 799 417 + 9 410 777 977 868 226 ) ) ( z 3 z 2 ) + ( 10 733 871 767 885 + 1 207 889 780 300 226 ) ) ( z 2 z 1 ) ,
s 1 ( z ) : = z 1 801 996 875 ( 1 774 249 199 550 + 96 330 944 700 226 ) ( z 6 z 6 ) ( 16 934 499 950 460 + 921 952 067 640 226 ) ( z 5 z 5 ) + ( 498 282 206 778 368 + 27 077 560 570 112 226 ) ( z 4 z 4 ) ( 503 642 983 325 828 + 28 049 119 633 352 226 ) ( z 3 z 3 ) + ( 20 521 027 298 370 + 1 797 180 186 180 226 ) ( z 2 + z 2 ) .
We have S U 1 ( z ) = z z 1 z 2 1 and thus U 1 Sym Q ( 226 ) 2 × 2 . Moreover, we have B : = U 1 1 N a , 3 U 1 H HS Q ( 226 ) , 2 and det ( B ) = 5679 16 777 216 99 226 4 , 194 304 .
Step 3.
Note that S B 1 , 2 ( z ) = z 2 , so we follow the justification of step 3 for case 2 and define
U 2 ( z ) : = p 2 ( z ) r 2 ( z ) q 2 ( z ) s 2 ( z ) ,
where
p 2 ( z ) : = 45 226 180 32 768 ( 1 z 2 ) ,
r 2 ( z ) : = z 2 482 + 32 226 15 z + 1 ,
q 2 ( z ) : = z 2 381 375 ( 44 226 631 ) ( 6 166 090 041 856 312 570 426 944 226 ) ( z 5 + z 5 ) + ( 273 675 365 504 226 5 615 090 615 296 ) ( z 4 + z 4 ) + ( 351 399 233 984 226 6 722 543 842 816 ) ( z 3 + z 3 ) + ( 5 618 397 085 696 273 472 815 104 226 ) ( z 2 + z 2 ) + ( 560 749 608 960 39 101 399 040 226 ) ( z + z 1 ) ,
s 2 ( z ) : = z 2 5 405 990 625 ( 24 805 801 715 564 544 + 1 346 804 222 263 296 226 ) ( z 5 z 5 ) + ( 9 759 344 745 565 388 226 + 1 471 517 599 115 247 616 ) ( z 4 z 4 ) ( 99 799 177 382 330 368 226 + 1 504 645 431 213 162 496 ) ( z 3 z 3 ) + ( 51 856 679 217 659 904 + 3 179 890 706 743 296 226 ) ( z 2 z 2 ) + ( 6 076 954 595 819 520 + 372 643 442 196 480 226 ) ( z z 1 ) .
Then, S U 2 ( z ) = z 2 z 2 z 4 z 4 and thus U 2 Sym Q ( 226 ) 2 × 2 . Moreover, we have
U 2 Diag ( | c 1 | 2 , | c 2 | 2 ) U 2 H = B where
c 1 : = 16 226 256 , c 2 : = ( 631 2 88 113 ) ( 7033 508 226 ) 7033 + 508 226 206 438 400 000 .
Note that | c 1 | 2 , | c 2 | 2 Q ( 226 ) .
Define U ( z ) : = U 1 ( z ) U 2 ( z ) = U 1 , 1 ( z ) U 1 , 2 ( z ) U 2 , 1 ( z ) U 2 , 2 ( z ) , where
U 1 , 1 ( z ) : = 1 2640 226 37 860 ( 47 021 3154 226 ) ( z 3 + 1 ) + ( 23 835 + 210 226 ) ( z 2 + z ) ,
U 1 , 2 ( z ) : = 1 75 ( 9216 + 384 226 ) ( z 3 1 ) + ( 31 744 + 2176 226 ) ( z 2 z ) ,
U 2 , 1 ( z ) : = z 3 + 1016 226 + 14 066 660 226 9465 z 2 z ,
U 2 , 2 ( z ) : = 86 528 226 + 1 411 072 2925 ( z 3 z ) .
We see that S U ( z ) = z 3 z 3 z 4 z 4 and thus U Sym Q ( 226 ) 2 × 2 . By letting D : = Diag ( c 1 , c 2 ) , we have N a , 3 ( z ) = U ( z ) D Diag ( 1 , 1 ) D H U H ( z ) . Finally, derive the high-pass filters b 1 , b 2 via (62) with n = 3 , we obtain a quasi-tight framelet filter bank { a ; b 1 , b 2 } ( 1 , 1 ) such that vm ( b 1 ) = vm ( b 2 ) = 3 , S b 1 ( z ) = z 3 and S b 2 ( z ) = z 3 .
Define ϕ via (42). As sm ( a ) 1.4635 , we have ϕ L 2 ( R ) . Hence, by letting ψ as in (46) for = 1 , 2 , we see that { ϕ ; ψ 1 , ψ 2 } ( 1 , 1 ) is a quasi-tight framelet in L 2 ( R ) . Moreover, ϕ , ψ 1 , ψ 2 all have symmetry and vm ( ψ 1 ) = vm ( ψ 2 ) = 3 .

Funding

This research was funded by the National Natural Science Foundation of China under grants 12201178 and 12271140.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Chui, C.K.; He, W. Compactly supported tight frames associated with refinable functions. Appl. Comput. Harmon. Anal. 2000, 8, 293–319. [Google Scholar] [CrossRef]
  2. Diao, C.; Han, B.; Lu, R. Generalized matrix spectral factorization with symmetry and applications to symmetric quasi-tight framelets. Appl. Comput. Harmon. Anal. 2023, 65, 67–111. [Google Scholar] [CrossRef]
  3. Dong, B.; Shen, Z. Pseudo-splines, wavelets and framelets. Appl. Comput. Harmon. Anal. 2007, 22, 78–104. [Google Scholar] [CrossRef]
  4. Dong, B.; Shen, Z. MRA-based wavelet frames and applications, Mathematics in image processing. In IAS/Park City Mathematics Series; American Mathematical Society: Providence, RI, USA, 2013; Volume 19, pp. 9–158. [Google Scholar]
  5. Feng, Y.; Li, Y.; Shen, Y.; Yang, S. Construction of nonseparable symmetric tight wavelet frames of L2( R n). J. Comput. Anal. Appl. 2013, 15, 300–307. [Google Scholar]
  6. Han, B. Matrix splitting with symmetry and symmetric tight framelet filter banks with two high-pass filters. Appl. Comput. Harmon. Anal. 2013, 35, 200–227. [Google Scholar] [CrossRef]
  7. Han, B. Symmetric tight framelet filter banks with three high-pass filters. Appl. Comput. Harmon. Anal. 2014, 37, 140–161. [Google Scholar] [CrossRef]
  8. Han, B. Framelets and wavelets: Algorithms, analysis and applications. In Applied and Numerical Harmonic Analysis; Birkhäuser/Springer: Cham, Switzerland, 2017; 724p. [Google Scholar]
  9. Han, B.; Mo, Q. Splitting a matrix of Laurent polynomials with symmetry and its application to symmetric framelet filter banks. SIAM J. Matrix Anal. Appl. 2004, 26, 97–124. [Google Scholar] [CrossRef]
  10. Han, B.; Mo, Q. Symmetric MRA tight wavelet frames with three generators and high vanishing moments. Appl. Comput. Harmon. Anal. 2005, 18, 67–93. [Google Scholar] [CrossRef]
  11. Han, B.; Zhuang, X. Matrix extension with symmetry and its application to symmetric orthonormal multiwavelets. SIAM J. Math. Anal. 2010, 42, 2297–2317. [Google Scholar] [CrossRef]
  12. Jiang, Q.T. Parameterizations of masks for tight affine frames with two symmetric/antisymmetric generators. Adv. Comput. Math. 2003, 18, 247–268. [Google Scholar] [CrossRef]
  13. Jiang, Q.T.; Shen, Z. Tight wavelet frames in low dimensions with canonical filters. J. Approx. Theory 2015, 196, 55–78. [Google Scholar] [CrossRef]
  14. Krivoshein, A.; Protasov, V.; Skopina, M. Multivariate wavelet frames. In Industrial and Applied Mathematics; Springer: Singapore, 2016. [Google Scholar]
  15. Mo, Q.; Li, S. Symmetric tight wavelet frames with rational coefficients. Appl. Comput. Harmon. Anal. 2011, 31, 249–263. [Google Scholar] [CrossRef]
  16. Mo, Q.; Zhuang, X. Matrix splitting with symmetry and dyadic framelet filter banks over algebraic number fields. Linear Algebra Appl. 2012, 437, 2650–2679. [Google Scholar] [CrossRef]
  17. Ron, A.; Shen, Z. Affine systems in L2( R d): The analysis of the analysis operator. J. Funct. Anal. 1997, 148, 408–447. [Google Scholar] [CrossRef]
  18. Antolín, A.S.; Zalik, R.A. Compactly supported Parseval framelets with symmetry associated to E d ( 2 ) ( Z ) matrices. Appl. Math. Comput. 2018, 325, 179–190. [Google Scholar]
  19. Selesnick, I.W. Smooth wavelet tight frames with zero moments. Appl. Comput. Harmon. Anal. 2001, 10, 163–181. [Google Scholar] [CrossRef]
  20. Selesnick, I.W.; Abdelnour, A.F. Symmetric wavelet tight frames with two generators. Appl. Comput. Harmon. Anal. 2004, 17, 211–225. [Google Scholar] [CrossRef]
  21. Shen, Y.; Li, S. Wavelets and framelets from dual pseudo splines. Sci. China Math. 2011, 54, 1233–1242. [Google Scholar] [CrossRef]
  22. Zhuang, X. Matrix extension with symmetry and construction of biorthogonal multiwavelets with any integer dilation. Appl. Comput. Harmon. Anal. 2012, 33, 159–181. [Google Scholar] [CrossRef]
  23. Chui, C.K.; He, W.; Stöckler, J. Compactly supported tight and sibling frames with maximum vanishing moments. Appl. Comput. Harmon. Anal. 2002, 13, 224–262. [Google Scholar] [CrossRef]
  24. Daubechies, I. Ten lectures on wavelets. In CBMS-NSF Series in Applied Mathematics; SIAM: Philadelphia, PA, USA, 1992; Volume 61. [Google Scholar]
  25. Diao, C.; Han, B. Quasi-tight framelets with high vanishing moments derived from arbitrary refinable functions. Appl. Comput. Harmon. Anal. 2020, 49, 123–151. [Google Scholar] [CrossRef]
  26. Diao, C.; Han, B. Generalized matrix spectral factorization and quasi-tight framelets with minimum number of generators. Math. Comp. 2020, 89, 2867–2911. [Google Scholar] [CrossRef]
  27. Han, B.; Lu, R. Compactly supported quasi-tight multiframelets with high balancing orders and compact framelet transform. Appl. Comput. Harmon. Anal. 2021, 51, 295–332. [Google Scholar] [CrossRef]
  28. Hardin, D.P.; Hogan, T.A.; Sun, Q. The matrix-valued Riesz lemma and local orthonormal bases in shift-invariant spaces. Adv. Comput. Math. 2004, 20, 367–384. [Google Scholar] [CrossRef]
  29. Daubechies, I.; Han, B.; Ron, A.; Shen, Z. Framelets: MRA-based constructions of wavelet frames. Appl. Comput. Harmon. Anal. 2003, 14, 1–46. [Google Scholar] [CrossRef]
  30. Fan, Z.; Ji, H.; Shen, Z. Dual Gramian analysis: Duality principle and unitary extension principle. Math. Comp. 2016, 85, 239–270. [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

Lu, R. Generalized Matrix Spectral Factorization with Symmetry and Construction of Quasi-Tight Framelets over Algebraic Number Fields. Mathematics 2024, 12, 919. https://doi.org/10.3390/math12060919

AMA Style

Lu R. Generalized Matrix Spectral Factorization with Symmetry and Construction of Quasi-Tight Framelets over Algebraic Number Fields. Mathematics. 2024; 12(6):919. https://doi.org/10.3390/math12060919

Chicago/Turabian Style

Lu, Ran. 2024. "Generalized Matrix Spectral Factorization with Symmetry and Construction of Quasi-Tight Framelets over Algebraic Number Fields" Mathematics 12, no. 6: 919. https://doi.org/10.3390/math12060919

APA Style

Lu, R. (2024). Generalized Matrix Spectral Factorization with Symmetry and Construction of Quasi-Tight Framelets over Algebraic Number Fields. Mathematics, 12(6), 919. https://doi.org/10.3390/math12060919

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