Connectivity of wavelets

Dengfeng LI

Front. Math. China ›› 2023, Vol. 18 ›› Issue (2) : 95 -104.

PDF (475KB)
Front. Math. China ›› 2023, Vol. 18 ›› Issue (2) : 95 -104. DOI: 10.3868/s140-DDD-023-0009-x
SURVEY ARTICLE
SURVEY ARTICLE

Connectivity of wavelets

Author information +
History +
PDF (475KB)

Abstract

In this paper, path-connectivity of the set of some special wavelets in L2(R), which is the topological geometric property of wavelets, is introduced. In particular, the main progress of wavelet connectivity in the past twenty years is reviewed and some unsolved problems are listed. The corresponding results of high dimension case and other cases are also briefly explained.

Keywords

Wavelet / MRA wavelet / S–elementary wavelet / frame wavelet / path-connectivity

Cite this article

Download citation ▾
Dengfeng LI. Connectivity of wavelets. Front. Math. China, 2023, 18(2): 95-104 DOI:10.3868/s140-DDD-023-0009-x

登录浏览全文

4963

注册一个新账户 忘记密码

1 Introduction

The path-connectivity of the set composed of some special wavelets as a subset of L2(R) is one of the important research topics of wavelet theory in L2(R). International famous mathematician Weiss’s research team [20, 21] and Dai and Larson [12] independently put forward the research content for the first time and emphasized its research significance. Subsequently, the research team led by Weiss and some members of the research team led by Dai and Larson (including visiting scholars and their students) joined the research on this topic. In 1998, the two teams jointly published the results obtained in the name of “The Wutam Consortium” for the first time [39]: the set composed of all MRA wavelets is a path-connected subset in L2(R) (Theorem 1.1). The research methods of the two teams are different, the former focuses on the method of Fourier analysis, while the latter focuses on the means of functional analysis. In the past two decades, many advances have been made in this field, but many even the most basic problems remain unsolved. This paper will review the main progress of this research, list some unsolved problems and briefly explain the corresponding results of the high dimension case and other cases.

Definition 1.1 Suppose that ψL2(R) and ψj,k(x)=2j2ψ(2jxk), where R denotes the real number set, j,kZ and Z is the integer set. If there are constants α>0 and β< such that

αf||2j,kZ|f,ψj,k|2βf2,fL2(R).

Then the function family {ψj,k(x)|j,kZ} is called a wavelet frame basis for L2(R) with bounds α and β, abbreviated as the wavelet frame. Accordingly, the function ψ is called a wavelet frame generation function, which is called a frame wavelet for short.

If only the right inequality holds in (1.1), then {ψj,k(x)|j,kZ} is called a Bessel sequence for L2(R) with bound β, and ψ is called the generator of this Bessel sequence. If α=β in (1.1), then {ψj,k(x)|j,kZ} is called a tight wavelet frame, and ψ is called a tight frame wavelet with constant α. In particular, If α=β=1 in (1.1), then {ψj,k(x)|j,kZ} is called a Parseval wavelet frame, and ψ is called a Parseval frame wavelet. If {ψj,k(x)|j,kZ} is a Riesz basis (an orthonormal basis) for L2(R), then the function ψ is called a Riesz wavelet (wavelet).

Over the past decade, the research on wavelet, wavelet frame and their applications has been very active in the fields of applied mathematics, computational mathematics and information processing, and the results are also quite rich. See [5, 18, 24, 27].

Set

   WB={ψ|ψisthegeneratorofaBesselsequence},

   WF={ψ|ψisaframewavelet},

   WTF={ψ|ψisatightframewavelet},

   WPF={ψ|ψisaParsevalframewavelet},

   WRB={ψ|ψisaRieszwavelet},

   WONB={ψ|ψisawavelet}.

Then WONB is a subset of the unit sphere in L2(R), WPF is a subset of the unit ball in L2(R) and the 6 sets have the following inclusion relationships [12]:

   WNBWRBWFWB,

   WNBWPFWTFWFWB.

The wavelet connectivity problem considered in this paper refers to the path-connectivity of the six sets and their special subsets as L2(R) subsets, where the path-connectivity of the subset is defined by the following definition.

Definition 1.2 Given a subset S in L2(R). If f,gS, there exists γ(t):

γ:[0,1]S,

such that γ(t) is continuous in L2(R)-norm sense and γ(0)=f, γ(1)=g, then S is called a subset of path-connectivity in topology sense of L2(R)-norm.

2 Path-connectivity of wavelets

We begin to discuss the set WONB firstly.

Problem 2.1 Is WONB a path-connected subset in L2(R)?

The problem has not been solved yet, but it has been confirmed that WONB has two subsets that are path-connected: the set of MRA wavelets [39] and the set of S-elementary wavelets [38].

The MRA wavelet is introduced below. MRA (multiresolution analysis) is a general method for constructing wavelets. “Almost all” wavelets can be constructed by multiresolution analysis. “A few” wavelets do not come from MRA. Therefore, multirelosution analysis is one of the milestone achievements in the history of wavelet theory. Another landmark achievement is the Daubechies wavelet constructed by multiresolution analysis (See [13, 24]).

Defintion 2.1 A sequence {Vj}jZ of closed subspaces of L2(R) is called a multiresolution analysis (MRA) for L2(R) if

(1) VjVj+1,jZ; fVj if and only if f(2)Vj+1,jZ;

(2) jZVj={0}; jZVj¯=L2(R);

(3) there exists φV0 such that {φ(k)|kZ} is an orthonormal basis for V0, where φ is called a scaling function for this MRA. We write the MRA as {Vj,φ}jZ.

For the MRA {Vj,φ}jZ, it is affirmative that there is a funciton ψV1V0 such that ψ is a wavelet for L2(R) [13, 24], and ψ is called an MRA wavelet. Let the set of all MRA wavelets be WMONB.

Theorem 2.1 [39]  WMONB is a path-connected subset in L2(R).

The proof of Theorem 2.1 mainly depends on the characterization of wavelet and wavelet multiplier.

Now let's turn to S-elementary wavelet.

Defintion 2.2 If ψ is a wavelet for L2(R) and |ψ^|=χE, then ψ is called an S-elementary wavelet, where ψ^ is the Fourier transform of ψ, E is a measurable subset in R and χE denotes the characteristic function of E. Accordingly, E is called a wavelet set. Similarly, frame wavelet set, tight frame wavelet set and Parseval frame wavelet set can be defined.

Because the S-elementary wavelet has the smallest frequency support, it is also called the minimum support frequency (MSF) wavelet in [20, 21]. Let the set of all S-elementary wavelets be WSONB.

Theorem 2.2 [38]  WSONB is a path-connected subset in L2(R).

The proof of Theorem 2.2 strongly depends on the characterization of a wavelet set.

It was shown in [12] that WSONB is not a subset of WMONB and

WMONBWSONB.

Problem 2.2 Is WMONBWSONB a path-connected subset in L2(R)?

Problem 2.2 has not been solved yet, but it has been confirmed that WMONBWSONB has a path-connected subset [37].

For the Riesz wavelet, the following question was proposed by Larson.

Problem 2.3 [23] Is WRB a path-connected subset in L2(R)?

Problem 2.3 has not been solved yet, but the results in [4] are relevant to this problem.

3 Path-connectivity of frame wavelets

The path-connectivity problem of the set WF has been completely solved.

Theorem 3.1 [3, 19]  WF is a path-connected subset in L2(R).

The proofs of Theorem 3.1 were established by different methods in [3] and [19], respectively. The former fully uses Fourier analysis technique, while the latter uses the orthogonality of frame, Bessel sequence and the properties of wavelet Bessel multiplier.

For the tight frame wavelet set WTF, we propose the following questions.

Problem 3.1 Is WTF a path-connected subset in L2(R)?

For Problem 3.1, we have not referred to the relevant literatures.

Similarly, for the Parseval wavelet frame set WPF, we have the following problem.

Problem 3.2 Is WPF a path-connected subset in L2(R)?

Although Problem 3.2 has not been solved yet, it has been proved that at least four subsets of WPF are path-connected: the three sets composed of the Parseval frame wavelets satisfying certain conditions under Fourier transform and S-elementary Parseval frame wavelet set.

This section only describes the path-connectivity of three sets composed of the Parseval frame wavelets satisfying certain conditions under Fourier transform, and the path-connectivity of the S-elementary Parseval frame wavelet set will be introduced in the next section.

First of all, assume that ψL2(R), and the following two conditions are given:

(1) there exists ϵ(0,π] such that

|n|11|n||(suppψ^)(2nπ+(ϵ,ϵ))|<,

here suppψ^={ξ|ψ^(ξ)0} and |E| is the Lebesgue measure of the set E;

(2) there exists ϵ(0,π] such that

|lim supn12n((suppψ^)2nJ0ϵ)|=0,

where J0ϵ=(ϵ,ϵ2][ϵ2,ϵ).

Based on conditions (3.1) and (3.2), we have the following results.

Theorem 3.2 [16] (1) Kτ={ψ|ψisaParsevalframewaveletsatisfing(3.1)} is a path-connected subset in L2(R).

(2) Kd={ψ|ψisaParsevalframewaveletsatisfing(3.2)} is a path-connected subset in L2(R).

It is easy to see that conditions (3.1) and (3.2) are the size conditions imposed on Fourier transform of the Parseval frame wavelet, where condition (3.1) involves the shifts of 2π integer multiple of the interval with the length of 2ϵ, and condition (3.2) involves the dilations of 2n multiple of the interval with the length of 2ϵ. The necessary and sufficient conditions of Parseval frame wavelet set and analysis skills were used for many times in the proof of Theorem 3.2. In addition, if suppψ^ of the Parseval frame wavelet ψ is bounded, then ψKτKd. This shows that Kτ and Kd include “more considerable” Parseval frame wavelets.

As an extension of the result in [16], it obtained in [15] that a larger set of the Parseval frame wavelets containing Kτ and Kd is path-connected.

In order to present the results in [15], we need to make some preparations.

Definition 3.1 Suppose that JR. If {2jJ}jZ is a partition of R{0} (a.e.), then J is called a Calderón set.

Example 3.1 (An example of Calderón set) Shannon set S=[2π,π)(π,2π].

Assume that J,KR. Let

[J]=jZ2jJ,[J]=j02jJ,τK(J)=kZ{0}(J+2kπ)K.

Definition 3.2 Suppose that J0 is a bounded Calderón set, Jj=2jJ0 and KR is measurable. If there is an MZ such that correspondence between sets

I[JM]=lM2lJ0L(I)=LK(I)=[τK(I)]S

is continuous in the sense of measure algebra, that is, η>0, there exists δ>0 such that |L(I)|<η for every I[JM] with |I|<δ, then K is said to belong to the set M(J0).

The corresponding result is as follows.

Theorem 3.3 [15]  Suppose that J0[π,π] is a Calderón set. Then

K(J0)={ψ|ψisaParsevalframewaveletandsuppψ^M(J0)}

is a path-connected subset in L2(R).

At the same time, it was shown in [15] that KτKdK(S), RM(J0), where J0 is a bounded Calderón set. RM(J0) implies that K(J0)WPF.

The previous Section 2 introduced the MRA wavelet, and naturally it comes to mind: is there an MRA Parseval frame wavelet? First, the definition of FMRA (frame multiresolution analysis) is listed.

Definition 3.3 [2] A sequence {Vj}jZ of closed subspaces of L2(R) is called an FMRA for L2(R) if

(1) VjVj+1,jZ; fVj if and only if f(2)Vj+1,jZ;

(2) jZVj={0}; jZVj¯=L2(R);

(3) there exists φV0 such that {φ(k)|kZ} is a frame for V0, where φ is called a scaling function for this FMRA. We write the FMRA as {Vj,φ}jZ.

If (3) becomes the following condition:

(3′) there exists φV0 such that {φ(k)|kZ} is a Parseval frame for V0,

then this FMRA is called a Parseval FMRA.

Obviously, an MRA {Vj,φ}jZ is a Parseval FMRA, but the reverse is not true [8].

For the Parseval FMRA {Vj,φ}jZ, there must exist a function ψV1V0 such that ψ is a Parseval wavelet for L2(R), and ψ is called an MRA Parseval wavelet. Let WMPF be the set of all MRA Parseval frame wavelets. Then we raise the following question.

Problem 3.3 Is WMPF a path-connected subset in L2(R)?

For Problem 3.3, we have not consulted the relevant literature. There is also another definition of the so-called MRA Parseval frame wavelet, which defined the set of MRA Parseval frame wavelets contains WMPF, and this set is a path-connected subset in L2(R) [35, 36].

4 Path-connectivity of S-elementary frame wavelets

The following three sets are the main subsets of S-elementary frame wavelets.

   WSF={ψ|ψisanSelementaryframewavelet},

   WSTF={ψ|ψisanSelementarytightframewavelet},

   WSTF(k)={ψ|ψisanSelementarytightframewaveletwithconstantk},

where k is a positive integer. It should be noted that the constants of S-elementary frame wavelets must be positive integers [7].

It is clear to see that

WSTF(k)WSTFWSF,

and if k=1, then WSTF(k)=WSPF, here

WSPF={ψ|ψisanSelementaryParsevalframewavelet}.

Therefore, based on the feature descriptions of frame wavelet sets and tight frame wavelet sets, the following results were obtained in [9] and [6], respectively.

Theorem 4.1 [9]  WSF is a path-connected subset in L2(R).

Theorem 4.2 [6]  WSTF(k) is a path-connected subset in L2(R), but WSTF is not connected.

Similar to Problem 2.2, we have the following problem.

Problem 4.1 Is WMPFWSPF a path-connected subset in L2(R)?

Since every element ψ in set WMPFWSPF is an MRA Parseval frame wavelet, there must be a scaling function ϕ corresponding to ψ. Under very “natural” condition imposed to the scaling function, the following theorem was obtained.

Theorem 4.3 [11]  WMPFWSPF is a path-connected subset in L2(R).

The “natural” condition here refers to the scaling function maintaining the “path”, as detailed in [11].

5 High dimension cases

Suppose that A is a d×d real dilation matrix (matrix elements are real numbers and the modulus of the every eigenvalue of the matrix is greater than 1). For fL2(Rd), The dilation operator and shift operator are defined as follows, respectively.

DAf(t)=|detA|f(At),Tkf(t)=f(tk),kZd.

ψ in L2(Rd) is called a frame wavelet for L2(Rd) if there are positive constants α and β such that

fL2(Rd),αf||2jZ,kZd|f,DAjTkψ|2βf2.

Terms such as high dimension Bessel sequence generators, tight frame wavelets, Parseval frame wavelets, Risez wavelets and wavelets can be similarly defined. Accordingly, we can discuss the path-connectivity problem of these wavelet classes in L2(Rd). Due to the complexity of high dimension space geometric structure and the dilation matrix, only a part of the previously stated results can be obtained in high dimension cases.

In [31, 32], Theorem 2.1 was extended to high dimension cases, but it is necessary to assume that A is a d×d integer dilation matrix and |detA|=2. The method in [31] works for all high dimension cases.

The high dimension cases were also discussed while obtaining Theorem 2.2, Theorem 3.1, and Theorem 4.1 in [38], [3, 19], and [9], respectively.

In [11], the same result as in Theorem 4.3 was obtained for high dimension arbitrary real dilation matrices.

For a 2×2 integer dilation matrix A with |detA|=2, A can be divided into six equivalence classes, each of which has a simple representative element. Moreover, this kind of dilation plane wavelets is more useful. So the papers [25, 26, 28, 32] reported its path-connectivity. For d>2, although a d×d integer dilation matrix A with |detA|=2 is complex, some results have been obtained (see [29, 34]).

6 Other cases

For path-connectivity of super frame wavelets and multiwavelets, see [14, 30, 33]. In addition, there also exist the following problems.

Problem 6.1 Can the path constructed by proving path-connectivity be a direct path?

This question was raised and discussed in [1]. See [1, 10] for relevant results.

Problem 6.2 Is the previously listed every subset of path-connectivity uniformly path-connected?

For the discussion of Problem 6.2, see [12, 17].

Finally, we give the results of Gabor wavelet connectivity.

Theorem 6.1 [22]  The sets of functions that generate the Gabor frame, the Gabor Parseval frame and the Gabor orthonormal basis are all path-connected subsets in L2(R), respectively.

References

[1]

Azoff E, Ionascu E, Larson D. . Direct paths of wavelets. Houston J Math 2003; 29: 737–756

[2]

Benedetto J, Li S D. The theory of multiresolution analysis frames and applications to filter banks. Appl Comput Harmonic Anal 1998; 5(4): 389–427

[3]

Bownik M. Connectivity and density in the set of framelets. Math Res Lett 2007; 14: 285–293

[4]

Cabrelli C, Molter U. Density of the set of generators of wavelet systems. Constr Approx 2007; 26: 65–81

[5]

ChristensenO. An Introduction to Frames and Riesz Bases. 2nd ed. Boston: Birkhäuser, 2016

[6]

Dai X D, Diao Y N. The path-connectivity of s-elementary tight frame wavelets. J Appl Func Anal 2007; 2(4): 309–316

[7]

Dai X D, Diao Y N, Gu Q. Frame wavelet sets in R. Proc Amer Math Soc 2001; 129(7): 2045–2055

[8]

Dai X D, Diao Y N, Gu Q, Han D G. Wavelets with frame multiresolution analysis. J Fourier Anal Appl 2003; 9(1): 39–48

[9]

Dai X D, Diao Y N, Gu Q, Han D G. The s-elementary frame wavelets are path-connected. Proc Amer Math Soc 2004; 132(9): 2567–2575

[10]

Dai X D, Diao Y N, Guo X X. On the direct path problem of s-elementary frame wavelets. Sci China Math 2010; 53(12): 3187–3196

[11]

Dai X D, Diao Y N, Li Z Y. The path-connectivity of s-elementary frame wavelets with frame MRA. Acta Appl Math 2009; 107: 203–210

[12]

Dai X D, Larson D. Wandering vectors for unitary systems and orthogonal wavelets. Memoirs Amer Math Soc 1998; 134(640): (68 pp)

[13]

DaubechiesI. Ten Lectures on Wavelets. Regional Conference Series in Applied Mathematics, Vol 61. Philadelphia, PA: SIAM, 1992

[14]

Diao Y N, Li Z Y. On S-elementary super frame wavelets and their path-connectedness. Acta Appl Math 2011; 116: 157–171

[15]

Garrigós G, Hernández E, Šikić H, Soria F. Further results on the connectivity of Parseval frame wavelets. Proc Amer Math Soc 2006; 134(11): 3211–3221

[16]

Garrigós G, Hernández E, Šikić H., Soria F, Weiss G. Connectivity in the set of tight frame wavelets (TFW). Glas Mat 2003; 38(58): 75–98

[17]

Gu Q. On interpolation families of wavelets. Proc Amer Math Soc 2000; 128(10): 2973–2979

[18]

HanB. Framelets and Wavelets: Algorithms, Analysis, and Applications. Cham: Birkhäuser, 2017

[19]

Han D G, Larson D. On the orthogonality of frames and the density and connectivity of wavelet frames. Acta Appl Math 2009; 107: 211–222

[20]

Hernández E, Wang X, Weiss G. Smoothing minimally supported frequency wavelets I. J Fourier Anal Appl 1996; 2(4): 329–340

[21]

Hernández E, Wang X, Weiss G. Smoothing minimally supported frequency wavelets II. J Fourier Anal Appl 1997; 3(1): 23–41

[22]

Labate D, Wilson E. Connectivity in the set of Gabor frames. Appl Comput Harmonic Anal 2005; 18(1): 123–136

[23]

LarsonD. Unitary systems and wavelets sets. In: Qian T, Vai M I, Xu Y, eds. Wavelet Analysis and Applications. Appl Numer Harmonic Anal, Basel: Birkhäuser, 2007, 143–171

[24]

LiD F. Mathematical Theory of Wavelet Analysis. Beijing: Science Press, 2017 (in Chinese)

[25]

Li D F, Cheng J F. Some applications of E-wavelet multipliers. Chinese Quart J Math 2004; 19(3): 292–299

[26]

Li D F, Cheng J F. Construction of MRA E-tight frame wavelets, multipliers and connectivity properties. Int J Wavelets Multiresolut Inf Process 2011; 9(5): 713–729

[27]

LiD FXueM Z. Bases and Frames in Banach Spaces. Beijing: Science Press, 2007 (in Chinese)

[28]

Li Y Z. On a class of bidimensional nonseparable wavelet multipliers. J Math Anal Appl 2002; 270: 543–560

[29]

Li Y Z, Xue Y Q. The equivalence between seven classes of wavelet multipliers and arcwise connectivity they induce. J Fourier Anal Appl 2013; 19: 1060–1077

[30]

Li Z Y, Dai X D, Diao Y N. Intrinsic s-elementary Parseval frame multiwavelets in L2(Rd). J Math Anal App 2010; 367: 677–684

[31]

Li Z Y, Dai X D, Diao Y N, Huang W. The path-connectivity of MRA wavelets in L2(Rd). Illinois J Math 2010; 54: 601–620

[32]

Li Z Y, Dai X D, Diao Y N, Xin J G. Multipliers, phases and connectivity of MRA wavelets in L2(R2). J Fourier Anal Appl 2010; 16: 155–176

[33]

Li Z Y, Shi X L. On Parseval super frame wavelets. Appl Math J Chinese Univ 2012; 27(2): 192–204

[34]

Li Z Y, Shi X L. Parseval frame wavelet multipliers in L2(Rd). Chin Ann Math Ser B 2012; 33: 949–960

[35]

Paluszyński M, Šikić H, Weiss G, Xiao S. Generalized low pass filters and MRA frame wavelets. J Geom Anal 2001; 11: 311–342

[36]

Paluszyński M, Šikić H, Weiss G, Xiao S. Tight frame wavelets, their dimension functions, MRA tight frame wavelets and connectivity properties. Adv Comput Math 2003; 18: 297–327

[37]

Singh D. Path-connectivity of two-interval MSF wavelets. Kyungpook Math J 2011; 51: 293–300

[38]

Speegle D. S-elementary wavelets are path-connected. Proc Amer Math Soc 1999; 127(1): 223–233

[39]

The Wutam Consortium. Basic properties of wavelets. J Fourier Anal Appl 1998; 4: 575–594

RIGHTS & PERMISSIONS

Higher Education Press 2023

AI Summary AI Mindmap
PDF (475KB)

548

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/