This paper explores the algebraic isomorphism of scaling functions in Parseval frame wavelets, establishing conditions under which different matrices produce equivalent wavelet systems, with implications for their classification.
Contribution
It demonstrates that for any given scaling function associated with a matrix, there exists an algebraically isomorphic scaling function linked to another matrix, highlighting the role of solution finiteness.
Findings
01
Existence of algebraically isomorphic scaling functions for different matrices.
02
Finiteness of solutions is essential for the isomorphism to hold.
03
Counterexample shows the necessity of the finiteness assumption.
Abstract
Two scaling functions φA and φB for Parseval frame wavelets are algebraically isomorphic, φA≃φB, if they have matching solutions to their (reduced) isomorphic systems of equations. Let A and B be d×d and s×s \thematrix matrices with d,s≥1 respectively and let φA be a scaling function associated with matrix A and generated by a finite solution. There always exists a scaling function φB associated with matrix B such that \begin{equation*} \varphi_B \simeq \varphi_A. \end{equation*} An example shows that the assumption on the finiteness of the solutions can not be removed.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage and Signal Denoising Methods · Mathematical Analysis and Transform Methods
Full text
Key words and phrases:
Parseval frame wavelets and Isomorphism and High Dimension and Scaling function
Two scaling functions φA and φB for Parseval frame wavelets are algebraically isomorphic, φA≃φB,
if they have matching solutions to their (reduced) isomorphic systems of equations.
Let A and B be d×d and s×s expansive dyadic integral matrices with d,s≥1 respectively
and let φA be a scaling function associated with matrix A and generated by a finite solution.
There always exists a scaling function φB associated with matrix B such that
[TABLE]
An example shows that the assumption on the finiteness of the solutions can not be removed.
1. Introduction
For a vector ℓ∈Rd,
the translation operatorTℓ is defined as
[TABLE]
Let A be a d×d integral matrix with eighenvalues β1,⋯,βd. A is called expansive if min{∣β1∣,⋯,∣βd∣}>1. A is called dyadic if ∣det(A)∣=2.
We define the operator DA as
[TABLE]
The operators Tℓ and DA are unitary operators on L2(Rd).
Definition 1.1**.**
Let A be an expansive dyadic integral matrix.
A function ψA∈L2(Rd) is called a Parseval frame wavelet associated with A, if the set
[TABLE]
forms a normalized tight frame for L2(Rd).
That is
[TABLE]
If the set is also orthogonal, then ψA is an orthonormal wavelet for L2(Rd) associated with A.
Consider the following system of equations (1.1) associated with an expansive dyadic integral matrix A:
[TABLE]
Let S={sn∣n∈Zd} be a solution.
The set Λ={n∈Zd∣sn=0} is called the support of S.
We will say the solution is finite if its support is a finite set.
Define the operator Ψ on L2(Rd) as
[TABLE]
Bownik [3] and Lawton [18] proved that
the iterated sequence
[TABLE]
converges in the L2(Rd)-norm.
The limit is the scaling function φA associated with matrix A.
It induces a Parseval frame wavelet ψA associated with matrix A.
The scaling function φA satisfies the following two-scale relation (1.3):
[TABLE]
We will say that φA is derived from the solution S.
This scaling function associated with matrix A is generated by a solution S={sn} to the system of equations (1.1).
By Mallat’s idea [21], a (orthogonal) scaling function (in L2(R) when A is the 1×1 matrix [2]) yields a (orthogonal) Parseval frame wavelet ψA.
A classical work [10] by Daubechies provided a deep insight on this and related topics including the closed formula for related wavelet function ψA.
Lawton [18] shows how to get a compact supported Parseval frame wavelet from a solution to the system of equations (1.1) when d=1.
Bownik [3] proved that the sequence defined in (1.2) converges in L2(Rd) in general,
the limit φA is a scaling function and it produces a Parseval frame wavelet ψA associated with matrix A.
The scaling function φ in this paper is not necessarily orthogonal. So the wavelets and scaling functions we discuss in this paper fit the definition of the
frame multi-resolution analysis (FMRA) by J. Benedetto and S. Li [6] and it also fits the definition of the general multi-resolution analysis (GMRA) by
L. Baggett, H. Medina and K. Merrill [4].
Many authors worked on the construction of Parseval wavelets with coefficients satisfying the two-scale relation. This includes more general unitary extension principle (UEP) of Ron and Shen [11] [22].
We say that two scaling functions φA and φB
are algebraically isomorphic (see Definition 2.3), φA≃φB,
if they have matching solutions to their (reduced) isomorphic systems of equations (see Definition 2.2).
Definition 1.2**.**
Let W0(A,d) be the collection of all scaling functions in L2(Rd) associated with a given d×d expansive dyadic integral matrix A
and generated by finite solutions to (1.1).
Let W0(d) be the union of W0(A,d) for all d×d expansive dyadic integral matrix A.
Let W0 be the union of W0(d) for d≥1.
Our main result in this paper is:
Theorem 1.1**.**
Let A and B be d×d and s×s expansive dyadic integral matrices with d,s≥1 respectively and let
φA be a scaling function in W0(A,d). There always exists a scaling function φB∈W0(B,s) such that
[TABLE]
Scaling functions in W0 have compact supports since they are generated by finite solutions.
B. Han and R. Jia made an extended discussion on this in [14].
The key technique in the proof of Theorem 1.1 is provided by Lemma 4.5 which shows that there exists a pair of “local lattice isomorphisms” between special bounded subsets of lattice Zd and its corresponding bounded subsets of Z.
This algebraic isomorphism is an equivalence relation on W0 (see Lemma 2.5),
hence an equivalence relation on W0(A,d) and on W0(d) as well.
So there is a natural one-to-one mapping from ≃W0(A,d) onto ≃W0(B,s).
Also, there is a natural one-to-one mapping from
≃W0(d) onto ≃W0(s).
Q. Gu and D. Han [17] proved that, if an integral expansive matrix is associated with single function orthogonal wavelets with multi-resolution analysis (MRA), then the matrix must be dyadic. Our results could be generalized to multi-wavelets (see C. Cabrelli, C. Heil and U. Molter [7]).
This paper is organized as follows. In Section 2, we collect general definitions, Lemmas and Propositions. In Section 3, we present a special basis for Zd that simplifies the format of AZd. Section 4 is devoted to the proof of Theorem 1.1.
In Section 5, we present an example which shows that in Theorem 1.1 the condition on finiteness of the solutions can not be removed.
2. Definitions and Lemmas
Definition 2.1**.**
Let A be a d×d expansive dyadic integral matrix and ΛA∈Zd.
A reduced system of equations E(ΛA,A,d) is obtained from system of equations (1.1) as following:
**Step 1: **
Replace all variables hn in (1.1) by [math], where n∈/ΛA;
**Step 2: **
Remove all trivial equations “0=0”.
We denote the family of all such reduced systems of equations by E.
For vector k∈AZd,
if there exists at least one element vector n∈ΛA such that
the the vector n+k is also in ΛA,
then the equation ∑n∈ΛAhnhn+k=δ0k is non-trivial and hence is in E(ΛA,A,d).
We say this equation is generated by k.
A solution to the system has support contained in ΛA.
It is clear we have:
Lemma 2.1**.**
The following statements are equivalent:
**(A): **
k∈AZd* generates a non-trivial equation n∈ΛA∑hnhn+k=δ0k in E(ΛA,A,d).*
**(B): **
ΛA∩(ΛA−k)=∅.
**(C): **
ΛA∩(ΛA+k)=∅.
We say that two elements k1,k2∈AZd are related, k1∼k2, if the equation
∑n∈ΛAhnhn+k1=δ0,k1
is the same as either
∑n∈ΛAhnhn+k2=δ0,k2,
or its conjugate
∑n∈ΛAhnhn+k2=δ0,k2.
This is an equivalence relation on AZd and it leads to a partition of AZd.
We denote the partition by PΛA≡{P∅,ΛA,P0,ΛA,P1,ΛA,⋯}.
[TABLE]
P∅,ΛA contains all elements that generate the trivial equation ‘‘0=0".
It is an infinite set.
P0,ΛA contains only one element 0, which generates the equation ∑n∈ΛA∣hn∣2=1.
Each set Pj,ΛA,j>0, collects all elements that generate the same equation in E(ΛA,A,d). In some special cases of ΛA, the part ∪˙{Pj,ΛA∣j>0,Pj,ΛA∈PΛA} could be empty. However
the next Lemma 2.2 shows that each set Pj,ΛA,j>0, if nonempty, has exactly two elements.
Lemma 2.2**.**
If k1,k2∈AZd generate non-trivial equations in E(ΛA,A,d), then k1∼k2 if and only if k1=±k2.
Proof.
Let k1,k2∈AZd generate non-trivial equations in E(ΛA,A,d).
(⇒) If k1∼k2 , then we have two cases:
(A) ∑n∈ΛAhnhn+k1=δ0,k1 and ∑n∈ΛAhnhn+k2=δ0,k2 are the same.
Then there exists one common term hn1hn1+k1 and hn2hn2+k2 for some n1,n2∈ΛA.
So n1=n2 and n1+k1=n2+k2, thus k1=k2.
(B) ∑n∈ΛAhnhn+k1=δ0,k1 and ∑n∈ΛAhnhn+k2=δ0,k2 are the same.
Then there exists one common term hn1hn1+k1 and hn2hn2+k2 for some n1,n2∈ΛA.
So n1=n2+k2 and n1+k1=n2, thus k1=−k2.
(⇐) It is obvious when k1=k2.
So we only need to show that, if k∈AZd generates a non-trivial equation in E(ΛA,A,d), then k∼−k, i.e. k and −k generate the same equation.
The equation generated by k is
[TABLE]
On the other hand, −k generates
[TABLE]
Replacing n=m+k in (2.2), we have ∑m∈(ΛA−k)∩ΛAhm+khm=δ0,−k.
The conjugate of this equation is
By the Axiom of Choice, there exists a choice function from {Pj,ΛA∣j≥0}→AZd with range {0,k1,k2,...},
where kj∈Pj,ΛA.
We call each of these choices an index set for the system of equations.
It is clear that the following lemma characterizes index sets:
Lemma 2.3**.**
A subset E of AZd is an index set for the system E(ΛA,A,d) if and only if it satisfies the following conditions (A)-(C):
**(A): **
Every element k in the set E generates a (non-trivial) equation in E(ΛA,A,d).
**(B): **
Two distinct elements k1,k2 in the set E generate two distinct equations in E(ΛA,A,d).
**(C): **
Each equation in E(ΛA,A,d) has its generator in E.
Let ΛAE be one of the index sets.
The system E(ΛA,A,d) has the form:
[TABLE]
Lemma 2.4**.**
For Λ′⊆Λ⊂Zd, every index set for E(Λ,A,d) contains one and only one index set for E(Λ′,A,d).
Proof.
Let ΛE be an index set for E(Λ,A,d).
Given any equation in E(Λ′,A,d), if it is generated by an element k∈AZd, then by Lemma 2.1, Λ′∩(Λ′−k)=∅.
Since Λ′⊆Λ, Λ∩(Λ−k)=∅.
This k generates an equation in E(Λ,A,d), by Lemma 2.1 again.
Hence by Lemma 2.2, ΛE contains k or −k, but not both.
Collect all elements in ΛE that generate equations in E(Λ′,A,d).
This is an index set for E(Λ′,A,d).
∎
Let B be an s×s expansive dyadic integral matrix, and ΛB⊂Zs.
And
[TABLE]
Definition 2.2**.**
E(ΛA,A,d),E(ΛB,B,s)∈E* are isomorphic,
E(ΛA,A,d)∼E(ΛB,B,s)
if there exist*
**(A): **
a bijection θ:ΛA→ΛB and
**(B): **
a bijection η from an index set ΛAE of E(ΛA,A,d) onto an index set ΛBE of E(ΛB,B,s)
with the following properties:
for each k∈ΛAE, the equation in E(ΛB,B,s) generated by ℓ≡η(k) is obtained
by replacing hn by hθ(n)′ and δ0k by δ0ℓ in the equation in E(ΛA,A,d) generated by k.
Proposition 2.1**.**
The isomorphism defined in Definition 2.2 is an equivalence relation on E.
Proof.
(Reflexivity) It is obvious that the relation is reflexive.
(Symmetry) Let E(ΛA,A,d)∼E(ΛB,B,s) with θ,η as the bijections.
It is easy to verify that θ−1,η−1 are the bijections for E(ΛB,B,s)∼E(ΛA,A,d).
(Transitivity) Let E(ΛA,A,d),E(ΛB,B,s),E(ΛC,C,t)∈E,
and E(ΛA,A,d)∼E(ΛB,B,s) with θ1,η1 as the bijections,
E(ΛB,B,s)∼E(ΛC,C,t) with θ2,η2 as the bijections.
The reader can verify that the mappings θ≡θ2∘θ1 and η≡η2∘η1 are the bijections from ΛA to ΛC and from ΛAE to ΛCE, respectively.
Then when we replace variables hn by hθ(n)′ and replace δ0k by δ0,η(k) in equations of E(ΛA,A,d), we will obtain all equations in E(ΛC,C,t).
∎
The next Proposition 2.2 provides sufficient conditions for this isomorphism.
Proposition 2.2**.**
Let E(ΛA,A,d) and E(ΛB,B,s) be elements in E with index sets ΛAE and ΛBE, respectively.
Assume there exist bijections
[TABLE]
with properties that an extension of θ to new domain Zd (denoted as Θ) satisfies
[TABLE]
Then E(ΛA,A,d) and E(ΛB,B,s) are isomorphic.
Notice that this extension Θ is required to be neither one-to-one nor onto.
Proof.
We will prove by definition.
(A) The equation Σn∈ΛAhn=2 is in E(ΛA,A,d).
We replace hn by hθ(n)′ to obtain Σn∈ΛAhθ(n)′=2.
Notice that θ(ΛA)=ΛB,
we have the equation Σm∈ΛBhm′=2 in E(ΛB,B,s).
(B) Let k∈ΛAE and denote ℓ=η(k)∈ΛBE.
k generates the equation in E(ΛA,A,d)
[TABLE]
Notice that the non-trivial products in this equation are those with indices n,n+k∈ΛA.
By assumption, θ(n+k)=Θ(n+k)=θ(n)+η(k)=θ(n)+ℓ.
So replacing hn by hθ(n)′, hn+k by hθ(n+k)′=hθ(n)+ℓ′ and δ0k by δ0,η(k)=δ0ℓ,
the above equation becomes
[TABLE]
This is the equation in E(ΛB,B,s) generated by ℓ, i.e.
∑m∈ΛBhm′hm+ℓ′=δ0ℓ.
Since η is an onto mapping, we obtained all equations in E(ΛB,B,s).
∎
Definition 2.3**.**
Let φA be derived from (SA,E(ΛA,A,d)) where SA={an∣n∈ΛA},
and φB be derived from (SB,E(ΛB,B,s)) where SB={bm∣m∈ΛB}.
φA,φB are algebraically isomorphic, φA≃φB, if the following conditions are satisfied:
**(A): **
E(ΛA,A,d)* and E(ΛB,B,s) are isomorphic in E.*
**(B): **
bθ(n)=an,∀n∈ΛA,
where θ is the bijection from ΛA onto ΛB in the isomorphism in (A).
The reader will verify that following lemma is immediate from Definitions 2.2 and 2.3.
Lemma 2.5**.**
For isomorphic systems E(ΛA,A,d) and E(ΛB,B,s) with bijection θ from ΛA to ΛB,
if SA={an∣n∈ΛA} is a solution to E(ΛA,A,d),
then the set SB≡{bm=aθ−1(m)∣m∈ΛB} is a solution to E(ΛB,B,s).
Moreover, the scaling functions derived from (SA,E(ΛA,A,d)) and (SB,E(ΛB,B,s))
are algebraically isomorphic.
Let φ0 be a scaling function derived from the solution S0={an∣n∈Λ0} to E(Λ0,A,d)
with index set Λ0E.
Let n0∈Zd,
S1≡{bm=am−n0∣m∈Λ0+n0} and Λ1≡Λ0+n0.
Then the set S1 is a solution to E(Λ1,A,d)
with the same index set Λ0E.
We call the new scaling function φ1 generated by S1the scaling function of φ0 after shifting n0.
It is easy to verify that the mappings θ and η defined by θ(n)≡n+n0,n∈Λ0 and η(k)≡k,k∈Λ0E are the bijections that satisfy the conditions in Proposition 2.2,
hence E(Λ0,A,d)∼E(Λ1,A,d) and φ0≃φ1.
So we have
Proposition 2.3**.**
The scaling function of φ0 after shifting n0 is algebraically isomorphic to φ0.
And their reduced system of equations are isomorphic.
Note that one can choose n0 so that the new support contains 0.
3. Matrix and Basis
Let d≥1 be a natural number and A a d×d expansive dyadic integral matrix.
We will need the following Smith Normal Form for integral matrices [2].
Lemma 3.1**.**
For any expansive dyadic integral matrix A, we have A=UDV, where U,V are integral matrices of determinant ±1, and D a diagonal matrix with the last diagonal entry 2 and all other diagonal entries 1.
Let e1,...,ed be the standard basis for Zd. Note that VZd=Zd and UZd=Zd.
[TABLE]
So we have
Proposition 3.1**.**
Let d≥1 be a natural number and A a d×d expansive dyadic integral matrix. Then
[TABLE]
Define F={fj=Uej∣j=1,...,d}.
This is a new basis for Zd and matrix U maps the standard basis to F.
We have
[TABLE]
This proves
Proposition 3.2**.**
Let d≥1 be a natural number and A a d×d expansive dyadic integral matrix. Then
Rd has a basis {fj∣j=1,...,d} with properties that, under this new basis,
a vector k is in AZd if and only if the last coordinate of k is an even number.
That is, under this new basis, we have
In this section, d>1 and N≥1 are fixed natural numbers.
Let A be a d×d expansive dyadic integral matrix.
By Proposition 3.2, we use a new basis for Rd such that AZd={(x,2n)∣x∈Zd−1,n∈Z}.
Define
[TABLE]
The set Λd,N contains 2dN elements in Zd.
So E(Λd,N,A,d) is a well-defined element in E.
For vector n=(n1,n2,⋯,nd−1,nd)∈Zd, define the function σd,N:Zd→Z as :
[TABLE]
Lemma 4.1**.**
Let n∈(−2N,2N)d∩Zd. Then
**(A): **
σd,N* is an injection from (−2N,2N)d∩Zd into Z.*
**(B): **
σd,N(n)=0* if and only if n=0;*
**(C): **
σd,N(n)>0* if and only if the right most non-zero coordinate of n is positive;*
**(D): **
σd,N(n)<0* if and only if the right most non-zero coordinate of n is negative;*
Proof.
Let a,b be distinct elements in (−2N,2N)d∩Zd and j0 be the largest index where aj0=bj0.
Without loss of generality, we assume aj0−bj0≥1.
By definition of σd,N in (4.2), we have
[TABLE]
Hence (A) is proved and it follows that (B) is also true.
Next, let a=(a1,⋯,ad)∈(−2N,2N)d∩Zd and j0 be the largest index where aj=0.
By definition of σd,N, we have
[TABLE]
So
[TABLE]
[TABLE]
[TABLE]
It is clear that σd,N(a) and aj0 have the same sign.
Hence (C) and (D) are proved.
∎
Define fd,N:Zd→Z:
[TABLE]
where ⌊2y⌋ gives the greatest integer that is less than or equal to 2y.
It is clear that fd,N has the following properties:
fd,N* defined in (4.3) is an injection from (−2N,2N)d∩Zd into Z.*
Proof.
Let (x+z,y+w),(x,y) be two distinct elements in (−2N,2N)d∩Zd.
Without loss of generality, we can further assume w≥0.
Denote Δ=fd,N(x+z,y+w)−fd,N(x,y).
We only need to show that Δ=0 when z=0 or w>0.
By Lemma 4.2, we have
[TABLE]
When w is even, we have the following two cases:
(A) w=2j,j≥1. Notice that 2(2d−3)N+2>2σd−1,N(z),
so Δ=2σd−1,N(z)+j⋅2(2d−3)N+2>0.
(B) w=0,z=0. Δ=2σd−1,N(z)=0, by Lemma 4.1 (B).
When w is odd, we have:
[TABLE]
So we have the following two cases:
(C) w=2j+1,j=0. Then
\Delta=2\sigma_{{}_{d-1,N}}({\vec{z}})+\left\{\begin{array}[]{ll}1&y\text{ even}\\
2^{(2d-3)N+2}-1&y\text{ odd}\end{array}\right.
is an odd number, thus not zero for either case of y.
(D) w=2j+1,j≥1. Then Δ>2σd−1,N(z)+j⋅2(2d−3)N+2>0.
∎
Λd,N, Ed,N are subsets of (−2N,2N)d∩Zd. So we have
Lemma 4.4**.**
fd,N* defined in (4.3) is an injection from Λd,N into Z and is also an injection from Ed,N into Z.*
Proposition 4.1**.**
The set Ed,N defined in (4.4) is an index set for E(Λd,N,A,d).
We define Λd,NE≡Ed,N.
Proof.
We verify that this set Ed,N
satisfies the conditions in Lemma 2.3. Let k0=(k1,...,kd−1,kd) be a vector in Ed,N.
(A) Define a vector n0=(n1,...,nd) by
nj=−kj when kj≤0 and nj=0 when kj>0.
Then both n0,n0+k0∈Λd,N.
So each element in Ed,N generates an equation in E(Λd,N,A,d) by Lemma 2.1.
(B) If k0=0, this vector generates the equation ∑n∈Λd,N∣hn∣2=1.
If k0=0,
by Lemma 2.2 the only other vector generates the same equation as k0 does is −k0. This vector is not in Ed,N since its right most coordinate is a negative number (Lemma 4.1).
(C) If k is not in (−2N,2N)d∩Zd, then one of its coordinate’s absolute value is greater than or equal to 2N.
For all n∈Λd,N, n+k∈/Λd,N,
so every k that generates an equation in E(Λd,N,A,d) must be in (−2N,2N)d∩Zd, by Lemma 2.1.
By Lemma 2.2, ±k will generate the same equation.
However, one of k and −k must be in Ed,N by its definition. So Ed,N generates all equations.
∎
Define mappings θd,N and ηd,N as follows:
[TABLE]
By Lemma 4.4, θd,N,ηd,N are injections on Λd,N and Λd,NE respectively.
Remark 4.1**.**
Given a d×d expansive dyadic integral matrix A,
the new basis F={fj∣j=1,...,d} as discussed in Section 3 Proposition 3.2 is not unique in general.
The related sets Λd,N,Λd,NE, the mappings θd,N,ηd,N and then the images θd,N(Λd,N),ηd,N(Λd,NE)
are all well-defined and are related to the matrix A as well as the new basis.
Thus different basis gives different sets, mappings and images.
However, for the sake of simplicity of notation system, we will use the above notations without mentioning A or the new basis F.
Lemma 4.5**.**
Let k∈Λd,NE and n∈Λd,N. Then
[TABLE]
Proof.
Denote n=(u,nd),k=(v,kd) where u,v∈Zd−1 and kd∈2Z.
[TABLE]
∎
Define
[TABLE]
Λ1,N is a subset of Z and E(Λ1,N,[2],1) is an element in E.
Λ1,N* contains the consecutive integers {0,1,⋯,2N+1−1}.*
Proposition 4.2**.**
ηd,N(Λd,NE)* is an index set for E(Λ1,N,[2],1).*
We denote ηd,N(Λd,NE) as Λ1,NE.
Proof.
We will verify that the set ηd,N(Λd,NE) satisfies the three conditions in Lemma 2.3.
(A) Let ℓ=ηd,N(k) for some k∈Λd,NE.
By Lemma 2.1, Λd,N∩(Λd,N−k)=∅.
Let n0∈Λd,N∩(Λd,N−k).
So θd,N(n0)∈Λ1,N. Since n0∈Λd,N−k,
n0+k∈Λd,N hence θd,N(n0+k)∈Λ1,N.
By Lemma 4.5, θd,N(n0+k)=fd,N(n0+k)=θd,N(n0)+θd,N(k)=θd,N(n0)+ℓ.
This implies
θd,N(n0)∈Λ1,N−ℓ.
So
[TABLE]
By Lemma 2.1, every element ℓ∈ηd,N(Λd,NE) generates an equation in E(Λ1,N,[2],1).
(B) Let ℓ1,ℓ2 be distinct elements in ηd,N(Λd,NE).
By part (A), ℓ1 and ℓ2 generate equations in E(Λ1,N,[2],1).
By Lemma 4.6 (c), ℓ1,ℓ2 are non-negative, hence ℓ1=ℓ2.
So by Lemma 2.2, the two elements ℓ1,ℓ2 must generate different equations.
(C) Given an equation in E(Λ1,N,[2],1) generated by an element ℓ∈2Z.
By Lemma 2.2, we can further assume that ℓ≥0.
It suffices to show that ℓ∈ηd,N(Λd,NE).
By Lemma 2.1, we have Λ1,N∩(Λ1,N−ℓ)=∅.
There exists a vector n0∈Λ1,N such that n0+ℓ∈Λ1,N.
By definition of Λ1,N, there exist
n1=(x1,y1)∈Λd,N and n2=(x2,y2)∈Λd,N such that
[TABLE]
Since ℓ is even, by Equation (4.3) y2−y1 must be even.
We have
[TABLE]
Denote k=(x2−x1,y2−y1).
It is clear that k∈(Λd,N−Λd,N)⊆(−2N,2N)d∩Zd.
It is left to show that σd,N(k)≥0.
Since fd,N(k)=ℓ≥0, by (4.3) we must have y2−y1≥0.
If y2−y1>0, by Lemma 4.1σd,N(k)≥0.
If y2−y1=0, then the above calculation gives σd,N(k)=σd−1,N(x2−x1)=21fd,N(k)=2ℓ≥0.
Proposition 4.2 is proved.
∎
We summarize the above discussions. For an integer N≥1, we first define Λd,N in (4.1). So E(Λd,N,A,d)
is well defined. We prove that the set defined in (4.4) is an index set for E(Λd,N,A,d).
Secondly, we define mappings θd,N,ηd,N in (4.5) and (4.6), respectively.
Thirdly, we define Λ1,N in (4.7).
So E(Λ1,N,[2],1) is well-defined.
At last, we prove that Λ1,NE≡ηd,N(Λd,NE) is an index set for E(Λ1,N,[2],1) in Proposition 4.2.
By Lemma 4.4, θd,N is a bijection from Λd,N onto Λ1,N,
and ηd,N is a bijection from Λd,NE onto Λ1,NE.
Therefore, by Lemma 4.5 and Proposition 2.2 we have
Proposition 4.3**.**
The systems of equations E(Λd,N,A,d) and E(Λ1,N,[2],1) are isomorphic,
[TABLE]
Next, let Λd be a non-empty subset of Λd,N.
By Lemma 2.4, Λd,NE contains an index set ΛdE for system E(Λd,A,d).
Define Λ1≡θd,N(Λd).
The mapping θd,N is a bijection from Λd onto Λ1.
Since Λ1 is a subset of Λ1,N, by Lemma 2.4 again, Λ1,NE contains an index set for system E(Λ1,[2],1).
Proposition 4.4**.**
Let
Λd be a non-empty subset of Λd,N and denote Λ1≡θd,N(Λd).
Then
[TABLE]
Proof.
Since Λd is a subset of Λd,N,
by Lemma 2.4, Λd,NE contains exactly one subset which is an index set for E(Λd,A,d).
We denote it by ΛdE.
Also, since Λ1≡θd,N(Λd) is a subset of Λ1,N,
by Lemma 2.4 again, Λ1,NE contains exactly one subset which is an index set for E(Λ1,[2],1).
We denote it by Λ1E.
We claim the following equality holds:
[TABLE]
Let k∈ΛdE, then k∈Λd,NE. So ηd,N(k)∈Λ1,NE.
Also, there exists n0∈Λd such that n0+k∈Λd.
So θd,N(n0)∈θd,N(Λd)=Λ1 and θd,N(n0+k)∈θd,N(Λd)=Λ1.
By Lemma 4.5, θd,N(n0+k)=θd,N(n0)+ηd,N(k)∈Λ1.
Notice that θd,N(n0)∈Λ1, then ηd,N(k) is in an index set for E(Λ1,[2],1).
By Lemma 2.4, ηd,N(k) must be in Λ1E,
i.e. ηd,N(ΛdE)⊆Λ1E.
Let ℓ∈Λ1E, then ℓ∈Λ1,NE.
So there exists k∈Λd,NE such that ℓ=ηd,N(k).
Also, there exists m0∈Λ1 such that m0+ℓ∈Λ1.
Let n0∈Λd such that θd,N(n0)=m0.
We have
[TABLE]
So n0+k∈Λd, hence k is in an index set for E(Λd,A,d).
By Lemma 2.4, k∈ΛdE⊆Λd,NE.
Therefore Λ1E⊆ηd,N(ΛdE).
The claim is proved.
So ηd,N is an bijection from ΛdE onto Λ1E=ηd,N(ΛdE), when restricted to ΛdE.
And it is clear that θd,N is a bijection from Λd onto Λ1, when restricted to Λd.
Since ΛdE
and Λd are subsets of Λd,NE,Λd,N respectively.
We have
[TABLE]
Hence E(Λd,A,d) is isomorphic to E(Λ1,[2],1).
Proposition 4.4 is proved.
∎
We will first prove the following theorem and this will lead to the proof of Theorem 1.1.
Theorem 4.1**.**
For every scaling function φd in W0(d), there exists a scaling function φ1 in
W0(1) such that
[TABLE]
Proof.
Let A be a d×d expansive dyadic integral matrix,
and φd∈W0(A,d) be a scaling function derived from (Sd,E(Λd,A,d)),
where Sd≡{an,n∈Λd} is a solution with finite support Λd.
(A) Define n0≡(x1,...,xd),xj=min{nj∣n=(n1,...,nd)∈Λd}.
It’s clear that all coordinates of elements in the set Λ≡Λd−n0 are non-negative.
Define θ0(n)≡n−n0,∀n∈Λd and η0(k)=k,∀k∈ΛdE.
By Proposition 2.3, we have E(Λd,A,d)∼E(Λ,A,d) with the related bijections θ0 and η0.
(B) Let N be a natural number such that Λd,N contains Λ.
Let θd,N,ηd,N as defined in (4.5) and (4.6), and Λ1≡θd,N(Λ).
By Proposition 4.4, E(Λ,A,d)∼E(Λ1,[2],1) with associated bijections θd,N,ηd,N.
By (A)(B) and Proposition 2.1, E(Λd,A,d)∼E(Λ1,[2],1).
Note that θ≡θd,N∘θ0,η≡ηd,N∘η0 are the bijections in this isomorphism and Λ1=θ(Λd).
Define S1≡{bm=aθ−1(m)∣m∈Λ1}.
By Lemma 2.5, S1 is a solution to E(Λ1,[2],1).
Let φ1 be the scaling function derived from (S1,E(Λ1,[2],1)).
By Lemma 2.5 again, we have
[TABLE]
It is clear that φ1∈W0(1).
Theorem 4.1 is proved.
∎
Theorem 4.2**.**
Let B be an s×s expansive dyadic integral matrix.
For every scaling function φ1 in W0(1), there exists a scaling function φs in W0(B,s) associated with B such that
[TABLE]
Proof.
φ1 is derived from a solution S1={an∣n∈Λ1} to E(Λ1,[2],1) where Λ1 is a finite set.
By Proposition 2.3φ1 is algebraically isomorphic to the scaling function after shifting by minΛ1.
Without loss of generalization we will simply assume that minΛ1=0.
Let B be an s×s expansive dyadic integral matrix.
By Proposition 3.2, we can choose a basis for Rs such that
[TABLE]
Let N′ be the smallest natural number such that
[TABLE]
Define Λs,N′≡[0,2N′)s∩Zs as in (4.1).
By Proposition 4.1 the set
[TABLE]
is an index set for the system of equations E(Λs,N′,B,s).
Define
By Lemma 4.6 (D) and (4.8), the set Λ1 is a subset of Λ1,N′.
Define
[TABLE]
It is clear that Λs is a subset of Λs,N′. By Proposition 4.4
[TABLE]
with bijections which are θs,N′ and ηs,N′ restricted to Λs and Λ1 respectively.
By Lemma 2.5, the set Ss≡{bm=aθs,N′−1(m)∣m∈Λs} is a solution to E(Λs,B,s),
and the scaling function φs derived from (Ss,E(Λs,B,s)) and φ1 are algebraically isomorphic.
It is clear that φs∈W0(B,s).
Theorem 4.2 is proved.
∎
Proof of Theorem 1.1
Let A be a d×d expansive dyadic integral matrix with d≥1 and φA be a scaling function in W0(d)
associated with A.
By Theorem 4.1, there exists a scaling function φ1 in W0(1)
such that φA≃φ1.
Let B be an s×s expansive dyadic integral matrix with s≥1.
By Theorem 4.2 there is a scaling function φB∈W0(B,s) associated with B such that φ1≃φB.
Since the relation ≃ in W0 is an equivalence relation and hence transitive, so
In this section, we provide an example of (orthogonal) scaling function φc in L2(R2) with the property that the support of its associated solution, Λc is infinite and also that φc is not algebraically isomorphic to any scaling function in L2(R). So the finiteness assumption (on scaling functions in W0) in Theorem 1.1 can not be removed.
Proposition 5.1**.**
Let A be a 2×2 dyadic integral expansive matrix and
let φ0 be a scaling function derived from a solution {an} to
E(Λ2,A,2). Assume further that the support
Λ2 contains the set L, a sublattice of Z2,
[TABLE]
Then there is no scaling function in L2(R) algebraically isomorphic to φ0.
Proof.
We prove by contradiction.
Let φ1 be a scaling function in L2(R) derived from its solution {bn∣n∈Λ1} to its reduced system of equations E(Λ1,[2],1) with the index set Λ1E.
Assume that φ0≃φ1.
By definition we have
E(Λ2,A,2)∼E(Λ1,[2],1) with bijections θ and η, Λ1=θ(Λ2) and η(Λ2E)=Λ1E.
Without loss of generality, by Proposition 2.3 we can further assume that
0 is in Λ2 and [math] is in Λ1, and that θ maps 0 to [math].
Note that since L={n=(m,n)∈Z2∣m+n∈2Z}⊂Λ2, by Lemma 2.1
each element ℓ in E≡A(2Z2) will generate an equation
in the reduced system of equations of E(Λ2,A,2) hence by Lemma 2.2
one of ±ℓ must be in Λ2E. Since E⊂L and L is a sublattice of Z2, we have
[TABLE]
Let k∈E∩Λ2E. Since E(Λ2,A,2)∼E(Λ1,[2],1), the equation
[TABLE]
in E(Λ2,A,2) generated by k, corresponds to
[TABLE]
in E(Λ1,[2],1) generated by η(k)∈Λ1E.
On the other hand, by Definition 2.2, when we replace n,n+k by θ(n),θ(n+k) and δ0k by δ0η(k) in Equation (5.1), we obtain
[TABLE]
which is the same as Equation (5.2).
So θ(n+k)−θ(n) is a constant η(k) independent of n, in particular
Let {e1,e2} be the standard basis of Z2.
Let k1 be one of ±A(2e1) that is in E∩Λ2E and k2 be one of ±A(2e2) that is in E∩Λ2E.
Denote c=θ(k1),d=θ(k2).
Since θ is injection, c and d are not zero. We have
[TABLE]
So θ maps two distinct elements ck2 and dk1 in Λ2 to the same element cd∈Z. A contradiction. Proposition 5.1 is proved.
∎
Let A=\left[\begin{array}[]{cc}1&1\\
-1&1\end{array}\right]. Define φc by
[TABLE]
where the Fourier Transform of φc is defined as φ^c(s)≡2π1∫R2φc(t)e−it⋅sdμ.
The function φc is an orthogonal scaling function associated with matrix A [20] which satisfies the two-scale relation
[TABLE]
The set {sn} is a solution to the system of equations (1.1). Let Λc denote the support of {sn},
E(Λc,A,2) denote the reduced system of equations and ΛcE its index set.
We claim
**Claim: **
L+e1={n=(n,m)∈Z2∣m+n∈2Z−1}⊆Λc.
Proof of Claim
Assume that ℓ=(m,n)∈Z2 and m+n be odd.
Denote the transpose of A as Aτ.
Since φc is an orthogonal scaling function, we have
[TABLE]
The claim is proved.
So sℓ=0 for ℓ∈{n=(n,m)∈Z∣m+n∈2Z−1}=L+e1.
Denote the scaling function of φc after shifting e1 as φ1.
By Proposition 2.3, φ1≃φc.
φ1 is derived from a solution to E(Λ1,A,2), with support Λ1≡Λc−e1.
Thus Λ1 contains the infinite set L.
By Proposition 5.1, the scaling function φ1 can not be algebraically isomorphic to a scaling function in L2(R).
Hence φc can not be algebraically isomorphic to a scaling function in L2(R).
6. Acknowledgements
The authors thank Qing Gu for comments that greatly improved the manuscript.
Bibliography24
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Baeth N. et al. Number theory of matrix semigroups , Linear Algebra and its Applications, 434, 694-711, 2011.
2[2] D. Bakić, I. Krishtal and E. Wilson, Parseval frame wavelets with E n ( 2 ) superscript 𝐸 𝑛 2 E^{n}(2) -dilations , Appl. Comput. Harmon. Anal. 19, 3, 386-431, 2005
3[3] M. Bownik, Tight frames of multidimensional wavelets , J. Fourier Anal. Appl. 3, no. 5, 525-542, 1997
4[4] L. Baggett, H. Medina and K. Merrill, Generalized multi-resolution analyses and a construction procedure for all wavelet sets in ℝ n superscript ℝ 𝑛 \mathbb{R}^{n} , J. Fourier Anal. Appl. 5, 6, 563-573, 1999
5[5] E. Belogay and Y. Wang, Arbitrarily Smooth Orthogonal Nonseparable Wavelets in ℝ 2 superscript ℝ 2 \mathbb{R}^{2} , SIAM J. Math. Anal. 30, 3, 678-697, 1999
6[6] J. Benedetto and S. Li, The theory of multiresolution analysis frames and applications to filter banks , Appl. Comput. Harmon. Anal. 5, 4, 389-427, 1998
7[7] C. Cabrelli, C. Heil and U. Molter, Self-similarity and Multiwavelets in Higher Dimensions , Memoir of AMS, Number 807, 2004
8[8] O. Christensen, An Introduction to Frames and Riesz Bases , Appl. Numer. Harmon. Anal., 2003