This paper investigates the optimal quantization of condensation measures combining self-similar measures and a base measure, establishing sequences for optimal sets and quantization errors, and analyzing the quantization dimension and coefficients.
Contribution
It introduces explicit sequences for optimal quantization sets and errors for a class of condensation measures, and characterizes their quantization dimension and coefficients.
Findings
01
Quantization dimension of P equals max of κ and D(ν).
02
Finite, positive, unequal quantization coefficients when D(ν) > κ.
03
Infinite lower quantization coefficient when D(ν) ≤ κ.
Abstract
We consider condensation measures of the form P:=31P∘S1−1+31P∘S2−1+31ν associated with the system (S,(31,31,31),ν), where S={Si}i=12 are contractions and ν is a Borel probability measure on R with compact support. Let D(μ) denote the quantization dimension of a measure μ if it exists. In this paper, we study self-similar measures ν satisfying D(ν)>κ, D(ν)<κ, and D(ν)=κ, respectively, where κ is the unique number satisfying [31(51)2]2+κκ=21. For each case we construct two sequences a(n) and F(n), which are utilized in determining the optimal sets of F(n)-means and the F(n)th quantization errors for P. We also show that for each measure ν the quantization…
Tables2
Table 1. Table 1.
Case
Case
same,
same,
same,
1 if for
same
same
if
for
Quant. coefficients
Table 2. Table 2.
Contracting factor
Quant. dimensions
Quant. coefficients
vs critical value
finite, positive
infinite
infinite
infinite
Equations350
Vn:=Vn(P)=inf{V(P;α):α⊂Rd, card(α)≤n}.
Vn:=Vn(P)=inf{V(P;α):α⊂Rd, card(α)≤n}.
C:=k≥0∩ω∈Ik∪Tω([a,b]).
C:=k≥0∩ω∈Ik∪Tω([a,b]).
P=3n1∣ω∣=n∑P∘Sω−1+k=0∑n−13k+11∣ω∣=k∑ν∘Sω−1, and ν=2k1ω∈Ik∑ν∘Tω−1,for allk≥1.
P=3n1∣ω∣=n∑P∘Sω−1+k=0∑n−13k+11∣ω∣=k∑ν∘Sω−1, and ν=2k1ω∈Ik∑ν∘Tω−1,for allk≥1.
K\subset(\mathop{\cup}\limits_{\omega\in I^{n}}J_{\omega})\bigcup\Big{(}\mathop{\cup}\limits_{k=0}^{n-1}(\mathop{\cup}\limits_{\omega\in I^{k}}L_{\omega})\Big{)}\subset J.
K\subset(\mathop{\cup}\limits_{\omega\in I^{n}}J_{\omega})\bigcup\Big{(}\mathop{\cup}\limits_{k=0}^{n-1}(\mathop{\cup}\limits_{\omega\in I^{k}}L_{\omega})\Big{)}\subset J.
(\mathop{\cup}\limits_{\omega\in I^{n}}J_{\omega})\bigcup\Big{(}\mathop{\cup}\limits_{k=0}^{n-1}(\mathop{\cup}\limits_{\omega\in I^{k}}L_{\omega})\Big{)}\subset J.
(\mathop{\cup}\limits_{\omega\in I^{n}}J_{\omega})\bigcup\Big{(}\mathop{\cup}\limits_{k=0}^{n-1}(\mathop{\cup}\limits_{\omega\in I^{k}}L_{\omega})\Big{)}\subset J.
\displaystyle\int_{J_{\omega 1}\cup S_{\omega}(T_{1}(L))}(x-a)^{2}dP=\frac{1}{3^{k}}\Big{(}\frac{c^{2k}}{2}V_{2}+\frac{1}{2}(S_{\omega}(a_{1})-a)^{2}\Big{)},\text{ and }
Peer Reviews
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
TopicsAdvanced Data Compression Techniques · Lung Cancer Research Studies
Full text
To appear, Qualitative Theory of Dynamical Systems
Canonical sequences of optimal quantization for condensation measures
We consider condensation measures of the form P:=31P∘S1−1+31P∘S2−1+31ν associated with the system (S,(31,31,31),ν), where S={Si}i=12 are contractions
and ν is a Borel probability measure on R with compact support.
Let D(μ) denote the quantization dimension of a measure μ if it exists. In this paper, we study self-similar measures ν satisfying D(ν)>κ, D(ν)<κ, and D(ν)=κ, respectively, where κ is the unique number satisfying
[31(51)2]2+κκ=21. For each case we construct two sequences a(n) and F(n), which are utilized in determining the optimal sets of F(n)-means and the F(n)th quantization errors for P. We also show that for each measure ν the quantization dimension D(P) of P exists and satisfies D(P)=max{κ,D(ν)}. Moreover, we show that for D(ν)>κ, the D(P)-dimensional lower and upper quantization coefficients are finite, positive and unequal; and for D(ν)≤κ, the D(P)-dimensional lower quantization coefficient is infinity.
The research of the second author was supported by U.S. National Security Agency (NSA) Grant H98230-14-1-0320
1. Introduction
The problem of quantization of probability measures emanated from information theory and has been a subject of intense investigation in the past decades.
Rigorous mathematical treatment of basic quantization theory can be found in [12]; for further results and applications one is referred to [5, 8, 9, 16, 17, 20, 21, 29, 27, 39, 40]. Let P denote a Borel probability measure on Rd with the Euclidean norm ∥⋅∥,d≥1. For a finite set α⊂Rd, the value V(P;α):=∫mina∈α∥x−a∥2dP(x) is often referred to as the cost or distortion error for α with respect to P. Then, the n-th quantization
error for P is defined by
[TABLE]
If ∫∥x∥2dP(x)<∞, then there exists α⊂Rd for which the infimum is achieved (see [1, 10, 11, 12]). A set α for which the infimum is achieved and contains no more than n points, i.e.,
Vn=V(P;α), is called an optimal set of n-means or an optimal set of n-quantizers. Indeed, if the support of P is an infinite set, then an optimal set of n-means always contains exactly n elements (see Theorem 4.12 [12] and Theorem 2.4 [14]).
The limit
D(P):=limn→∞−logVn(P)2logn,
if exists, is called the quantization dimension of P, which measures the speed at which the specified measure of the error tends to zero as n→∞. It turns out that determining the optimal sets of n-means is much more difficult than calculating the quantization dimension of a measure [6, 13, 30, 31, 37]. If D(P):=s exists, we are further concerned with the s-dimensional lower and upper quantization coefficients defined by liminfn→∞ns2Vn(P) and limsupn→∞ns2Vn(P), respectively. These two quantities provide more accurate information for the asymptotics of the quantization error than the quantization dimension. Given a finite subset α⊂Rd, the Voronoi regionM(a∣α) generated by a∈α is defined as the set of points x∈Rd such that a is the nearest point to x than to all other elements in α.
If α is an optimal set and a∈α, then a is the conditional expectation of the random variable X given that X takes values in the Voronoi region of a [9, 12]. Such a point a is also refereed to as the centroid of the Voronoi region M(a∣α) with respect to P.
Let Si:Rd→Rd for i=1,2,⋯,N be contracting similarities, p=(p0,p1,⋯,pN) be a probability vector, and ν be a Borel probability measure on Rd with compact support. A probability measure P on Rd such that P=∑j=1NpjP∘Sj−1+p0ν
is called an inhomogeneous self-similar measure associated with the system (S,p,ν), where S={Si}i=1N. For such an inhomogeneous self-similar measure P, if C is the support of ν, then the support of P is equal to the unique nonempty compact set K:=KC⊂Rd satisfying K=j=1∪NSj(K)∪C.
For details about inhomogeneous self-similar sets and measures one can see [26]. Following [3, 22], we call (S,p,ν) a condensation system. The measure P is also called the condensation measure or the attracting measure for (S,p,ν), and the set K, which is the support of the measure P, is called the attractor of the system.
Consider a condensation measure P such that P=31P∘S1−1+31P∘S2−1+31ν, where ν is a self-similar measure on R and S1,S2 are similarity mappings on R given by S1(x)=cx,S2(x)=cx+r, with 0<c≤31 and c+r=1. Let κ be the number satisfying (3c2)2+κκ=21, which we will call as the critical value of the condensation system (S,p,ν).
In this article our aim is two-fold. The main goal is to study the quantization for condensation measures associated to the system
(S,p,ν); in particular, we show that there exist two sequences {a(n)}n≥1 and {F(n)}n≥1, which we call as canonical sequences, that are instrumental in this study. With the help of canonical sequences, for a variety of self-similar measures ν, we obtain closed formulas for the optimal sets of F(n)-means and the F(n)th quantization errors for the condensation measures P for all n≥1. Once the optimal sets of F(n)-means are known, we develop a simple method to determine the optimal sets of n-means for all n∈N, and calculate quantization dimension D(P) and the D(P)-dimensional quantization coefficients for P.
Hence, we furnish the complete quantization program for the condensation systems under consideration, which was not done before in the literature.
The second aim is to investigate the relationship between the quantization dimension D(P) and the D(P)-dimensional quantization coefficients as the measure ν changes.
It turns out that D(P) satisfies the relation D(P)=max{κ,D(ν)}. Furthermore, we determine that for D(ν)>κ, the D(P)-dimensional lower and upper quantization coefficients are finite, positive and unequal. On the other hand, for D(ν)<κ, and D(ν)=κ, the D(P)-dimensional lower quantization coefficients are infinity.
When p0=0, the inhomogeneous self-similar measure on Rd defined above by P=∑j=1NpjP∘Sj−1+p0ν reduces to the self-similar measure P=∑j=1NpjP∘Sj−1. Quantization dimension for such self-similar measures and self-conformal measures were determined by Graf-Luschgy [15] and Lindsay-Mauldin [23], respectively. Following these, the quantization dimensions were determined for many fractal probability measures [33, 34, 35, 36]. The optimal sets of n-means and the nth quantization errors for the (standard) Cantor self-similar measure were determined by Graf-Luschgy [13]. Due to their intricate structures, condensation measures which are more general than self-similar measures, were not studied widely in the literature; in particular, this is the case for the features investigated in this article.
To the best of the authors’ knowledge, the current article is the first study of the optimal sets of n-means and the nth quantization errors for condensation measures, which include all (Cantor) self-similar measures as a special case. Hence, our results are significant generalization of those in [13]. The novelty in obtaining the quantization for condensation measures is the introduction of canonical sequences and the order ≻ for the associated optimal sets. As a by-product we also derive closed formulas for the quantization errors involved at each step, which lead to direct calculation of the quantization dimensions and study the quantization coefficients for the probability distributions involved.
Techniques utilized in the article can be applied or can further be improved to investigate the optimal sets of n-means and the nth quantization errors for many other (fractal-based) singular probability measures. All these results are new and, while providing some insight into the behavior of such systems, they also bring up several questions for further inquiry. We outline some of these at the end of the paper.
The points in optimal sets, being the centroids of their Voronoi regions, are an evenly spaced distribution of sites
in the domain with minimum distortion error with respect to a given probability measure. Such settings are frequently surface in many fields, such as numerical probability [4, 28], clustering, data compression, optimal mesh generation, signal processing, cellular biology, optimal quadrature, and geographical
optimization [7, 25, 18, 19, 38, 2, 24]. Therefore, the result of the paper have potential for being very useful in addressing problems in these fields.
The arrangement of the paper is as follows: In Section 2 basic definitions, lemmas and propositions are developed. In order to bring some transparency to the arguments and reveal the connections between the quantization dimension D(ν) and the critical value κ, in Subsection 2.2 four important cases that will be focus of the article are outlined. Section 3 provides a thorough investigation of the quantization for the condensation measure P with self-similar measure ν satisfying D(ν)>κ. Also, utilizing canonical sequences, we have determined all the optimal sets of n-means and the associated nth quantization errors, and calculated the quantization dimension of P (Theorem 3.4.1). Furthermore, it is also shown that the quantization coefficient does not exist, and the lower and the upper quantization coefficients are finite and positive (Theorem 3.4.2). Section 4 is devoted to the investigation of quantization for the condensation measure P with self-similar measure ν satisfying D(ν)<κ. Using closed formulas obtained for quantizations errors, we calculate the quantization dimension of P (Theorem 4.4.1), and show that the quantization coefficient is infinity (Theorem 4.4.2). In Section 5, we have considered two condensation measures: one with D(ν)>κ and one with D(ν)<κ; and show that the quantization coefficients in both the cases are infinity. The results in all the above sections lead us to some observations and remarks outlined in Concluding Remarks 5.1 which also contains some open problems to be investigated.
In the sequel, all the arguments will be given for p=(31,31,31) for simplicity.
2. Preliminaries
2.1. Basic definitions, lemmas and propositions
Let P be the condensation measure associated with the condensation system (S,p,ν),
where p=(31,31,31) and S is as defined above. Consider the self-similar measure ν given by ν=21ν∘T1−1+21ν∘T2−1, where T1(x)=sx+a(1−s) and T2(x)=sx+b(1−s) for all x∈R,0<s≤31, and a=31+c,b=32−c. These values are to ensure that the associated Cantor sets are disjoint.
Let I={1,2}. By a word ω of length k over the alphabet I, we mean ω:=ω1ω2⋯ωk∈Ik; a word of length zero is called the empty word and is denoted by ∅. I∗ will denote the set of all words over the alphabet I including the empty word ∅.
For ω,τ∈I∗, their concatenation is denoted by ωτ; i.e., if ω:=ω1ω2⋯ωk and τ:=τ1τ2⋯τℓ, then ωτ:=ω1⋯ωkτ1⋯τℓ.
Set J:=[0,1] and L:=[a,b]. For ω=ω1ω2⋯ωk∈Ik, set Sω:=Sω1∘⋯∘Sωk, Tω:=Tω1∘⋯∘Tωk, Jω:=Sω(J), and Lω:=Sω(L). For ω=∅,S∅ is the identity map on R, J∅=J and L∅=L. If C is the support of ν, then
[TABLE]
Iterating P=31j=1∑2P∘Sj−1+31ν and ν=21ν∘T1−1+21ν∘T2−1, we have
[TABLE]
The measure P is ‘symmetric’ about the point 21, i.e., if two intervals of equal lengths are equidistant from the point 21, then they have the same P-measure. For n≥1, αn:=αn(P) will denote an optimal set of n-means with respect to P, and αn(ν) will represent an optimal set of n-means with respect to the self-similar measure ν. Similarly, Vn:=Vn(P) and Vn(ν) represent the nth quantization error with respect to P and ν, respectively. By P∣L, we denote the conditional probability measure on L, i.e., for any Borel B⊂R,
[TABLE]
Notice that P∣L=ν. Using equation (1), we deduce the following lemma.
Lemma 2.1.1**.**
Let g:R→R+ be Borel measurable and n∈N. Then,
[TABLE]
Lemma 2.1.2**.**
Let K be the support of the condensation measure. Then, for any n≥1,
[TABLE]
Proof.
Notice that J1∪L∪J2⊂J, J11∪L1∪J12⊂J1, and J21∪L2∪J22⊂J2. In fact, for any k≥1, if ω∈Ik, then Jω1∪Lω∪Jω2⊂Jω. Again, notice that for any ω∈I∗, Jω1∪Jω2⊂Jω, and the intervals Lω1,Lω2,Lω are disjoint. Thus, it follows that
[TABLE]
The sets being disjoint, we have
[TABLE]
Again, P(K)=1 and K is the support of P. Hence, K\subset(\mathop{\cup}\limits_{\omega\in I^{n}}J_{\omega})\bigcup\Big{(}\mathop{\cup}\limits_{k=0}^{n-1}(\mathop{\cup}\limits_{\omega\in I^{k}}L_{\omega})\Big{)}.
∎
Let E(ν) and W:=V(ν) represent the expected value and the variance of ν, respectively.
Lemma 2.1.3**.**
For the self-similar measure ν we have
(i)
E(ν)=21* and W=36(1+s)(1−s)(1−2c)2,*
(ii)
for any x0∈R, ∫(x−x0)2dν=(x0−21)2+V(ν).
Proof.
Since
∫xdν=21∫[sx+a(1−s)]dν+21∫[sx+b(1−s)]dν and a+b=1, we have E(ν)=∫xdν=21. Moreover,
[TABLE]
which implies that ∫x2dν=2(1+s)s+(a2+b2)(1−s).
Hence,
[TABLE]
For any x0∈R, ∫(x−x0)2dν=(x0−21)2+V(ν) follows from the standard probability arguments.
∎
Let E(P) and V(P) represent the expected value and the variance of P, respectively.
Lemma 2.1.4**.**
For the condensation measure P, we have
[TABLE]
and, for any x0∈R, ∫(x−x0)2dP=(x0−21)2+V(P).
Proof.
It is straightforward to see that E(P)=21. Now, using (1), we have
[TABLE]
hence,
(1-\frac{2c^{2}}{3})\ \int x^{2}dP=\frac{1}{3}\Big{(}cr+r^{2}+\int x^{2}d\nu\Big{)}. Since c+r=1, this implies that
[TABLE]
Thus, it follows that
[TABLE]
For any x0∈R, ∫(x−x0)2dP=(x0−21)2+V(P) follows from the standard probability arguments.
∎
Note 2.1.5**.**
Let ω∈Ik, k≥0, and let X be the random variable with probability distribution P. Then, by equation (1), it follows that P(Jω)=3k1, P(Lω)=3k+11,
[TABLE]
For any x0∈R,
[TABLE]
On the other hand, for any x0∈R, any ω∈Ik, k≥0,
[TABLE]
Remark 2.1.6**.**
By Lemma 2.1.4, it follows that the optimal set of one-mean for the condensation measure P consists of the expected value 21 and the corresponding quantization error is the variance V(P) of P, i.e., V(P)=V1(P). Notice that by ‘the variance of P’ it is meant the variance of the random variable X with distribution P.
Proposition 2.1.7**.**
(see [13]) For n∈N with n≥2 let ℓ(n) be the unique natural number with 2ℓ(n)≤n<2ℓ(n)+1. Let αn(ν) be an optimal set of n-means for ν, i.e., αn(ν)∈Cn(ν). Then,
[TABLE]
for some I~⊂Iℓ(n) with card(I~)=n−2ℓ(n).
Moreover,
[TABLE]
The following lemma is straightforward; hence, we will state it without proof.
Lemma 2.1.8**.**
Let α be an optimal set of n-means for the condensation measure P. Then, for any ω∈I∗, the set Sω(α):={Sω(a):a∈α} is an optimal set of n-means for the image measure P∘Sω−1. Conversely, if β is an optimal set of n-means for the image measure P∘Sω−1, then Sω−1(β) is an optimal set of n-means for P.
Lemma 2.1.9**.**
If αn(ν) is an optimal set of n-means for ν, then, for any ω∈Ik, k≥0, Sω(αn(ν)) is an optimal set of n-means for the measure ν∘Sω−1. Moreover,
[TABLE]
Proof.
Let αn(ν) be an optimal set of n-means for ν. Then, Sω(αn(ν)) is an optimal set of n-means for the image measure ν∘Sω−1 follows from Lemma 2.1.8. Now, using (1) and Proposition 2.1.7,
[TABLE]
which completes the proof of the lemma.
∎
Next, we will determine the optimal sets of 2 and 3 means which will provide the base needed to determine the optimal sets of F(n)-means and the F(n)th quantization errors for a canonical sequence {F(n)}n≥1.
Proposition 2.1.10**.**
Let α:={a1,a2} be an optimal set of two-means with a1<a2. Then, a_{1}=\frac{2}{3}\Big{(}S_{1}(\frac{1}{2})+\frac{1}{2}T_{1}(\frac{1}{2})\Big{)},a_{2}=\frac{2}{3}\Big{(}S_{2}(\frac{1}{2})+\frac{1}{2}T_{2}(\frac{1}{2})\Big{)}, and the corresponding quantization error is
[TABLE]
Proof.
Due to symmetry of the condensation measure P with respect to the midpoint 21, we can assume that if {a1,a2} is an optimal set of two-means with a1<a2, then a1=E(X:X∈[0,21]) and a2=E(X:X∈[21,1]). Since P(J1∪T1(L))=P(J1)+P(T1(L))=31+31ν(T1(L))=31+61=21, we have
[TABLE]
Similarly, a_{2}=\frac{2}{3}\Big{(}S_{2}(\frac{1}{2})+\frac{1}{2}T_{2}(\frac{1}{2})\Big{)}=1-a_{1}.
The corresponding quantization error is given by
[TABLE]
which completes the proof.
∎
It should be observed that, by symmetry, in the proposition above we also have
[TABLE]
The proof of the following lemma is straightforward.
Lemma 2.1.11**.**
Let ω∈Ik for k≥0. Then,
[TABLE]
From the above lemma we deduce the following corollary.
Corollary 2.1.12**.**
Let ω∈Ik for k≥0. Then, for any a∈R,
[TABLE]
Proposition 2.1.13**.**
Let α:={a1,a2,a3} be an optimal set of three-means with a1<a2<a3. Then, a1=S1(21)=2c, a2=21, and a3=S2(21)=1−2c. The corresponding quantization error is V3=31(2c2V+W).
Proof.
Since both ν and P are symmetric uniform measures with support K, we can assume that a1∈J1,a2∈L and a3=1−a1. Hence, by (3), the quantization error due to this set of three points β:={a1,a2,a3}
is
[TABLE]
The function f(a1,a2)=a12+a22−ca1−a2 attains its minimum at a1=2c and a2=21 with minimum value −31(2c2+41). Therefore, since V3 is the quantization error for three-means, we have V3=31(2c2V+W).
∎
Proposition 2.1.14**.**
Let α be an optimal set of n-means for n≥3 such that α∩J1=∅, α∩J2=∅, and α∩L=∅. Then, for i=1,2, the Voronoi region of any point in α∩Ji does not contain any point from L, and the Voronoi region of any point in α∩L does not contain any point from α∩Ji.
Proof.
Let α:={a1,a2,⋯,an} be an optimal set of n-means for n≥3 such that 0<a1<a2<⋯<an<1. Let j=max{1≤i≤n:ai∈α∩J1}. Then, by the hypothesis, aj≤c. Suppose that the Voronoi region of aj contains points from L. Then, 21(aj+aj+1)>a implying that
[TABLE]
This leads to a contradiction because α∩L=∅. Hence, the Voronoi region of any point in α∩J1 does not contain any point from L. The rest of the statements are proved similarly.
∎
2.2. Set-up for optimal sets of n-means for n≥4
As observed in the previous subsection, the interaction of the measures ν and P leads to rather intricate arguments. In order to bring some transparency to the arguments and reveal the connections between the quantization dimension D(ν) and the critical value κ we will proceed by considering some special cases of the measures P and ν.
Throughout the rest of the article we will assume that c=51. Consequently, a=52,b=53 and
the critical value will be κ=log75−log22log2. Three different
cases of the self-similar measure ν, which will be determined by the values below, are considered.
(i)
s=31, which implies D(ν)=log3log2>κ,
(ii)
s=71, which implies D(ν)=log7log2<κ, and
(iii)
s=156, which implies D(ν)=log75−log22log2=κ.
In order to provide further insight to the question posed at the end of the article, we will also consider s=51, which implies D(ν)=log5log2>κ.
In each case, we will construct the canonical sequences to investigate the quantization for the associated condensation measures while exhibiting the optimal sets of n-means for n≥4 and determining the quantization dimensions.
3. Condensation measure P with self-similar measure ν satisfying D(ν)>κ
In this case s=31; hence, from the general results obtained in the previous section, we have
•
E(ν)=21,W=V(ν)=2001;E(P)=21,V=V(P)=58465,
•
α1={21}, with V1=V(P),
•
α2={9019,9071} with V2=118260032929, and
•
α3={101,21,109} with V3=43800203.
3.1. Essential lemmas and propositions
Lemma 3.1.1**.**
Let β:={c,1}, where 0<c<1. Then,
∫a∈βmin(x−a)2dP=438001517,
and the minimum occurs when c=103.
Proof.
Since 53<21(103+1)=2013<54, the distortion error due to the set β:={103,1} is
[TABLE]
Let α:={a,1} be an optimal set of two-means for which the minimum in the hypothesis occurs, and V~2 is the corresponding quantization error. Then, V~2≤438001517. Suppose that a≤51. Then, since 21(51+1)=53, we have the distortion error as
[TABLE]
which leads to a contradiction. So, we can assume that 51<a. If a≥21, then
[TABLE]
which is a contradiction. Next, if 52≤a<21, then, as 53<21(21+1)=43<54, we have
[TABLE]
which is also a contradiction. So, we can assume that 51<a<52, and then notice that 21(51+1)=53<21(a+1)<21(52+1)<54 yielding the fact that
a=E(X:X∈J1∪L)=P(J1∪L)1(P(J1)S1(21)+P(L)21)=21(101+21)=103, and the corresponding quantization error is V~2=438001517.
∎
Corollary 3.1.2**.**
Let β:={c,51}, where 0<c<51. Then,
∫J1a∈βmin(x−a)2dP=32850001517,
and the minimum occurs when c=503.
Let α be an optimal set of four-means. Then, α∩J1=∅, α∩J2=∅, and α∩L=∅. Moreover, α does not contain any point from the open intervals (51,52) and (53,54).
Proof.
Let us first consider the set β:={S1(21),T1(21),T2(21),S2(21)}. Then,
[TABLE]
Since V4 is the quantization error for four-means, we have V4≤3942001243. Let α:={a1<a2<a3<a4} be an optimal set of four-means. We first show that α∩J1=∅. For the sake of contradiction, assume that α∩J1=∅. Then 51<a1, which yields
[TABLE]
which is a contradiction. Thus, we can assume that α∩J1=∅. Similarly, we can show that α∩J2=∅.
We now show that α∩L=∅. For the sake of contradiction, assume that α∩L=∅. Suppose that a2>53. Then,
[TABLE]
which leads to a contradiction. So, we can assume that a2<52. Similarly, we have 53<a3. Due to symmetry of P, the following two cases can occur:
Case 1. 31≤a2<52 and 53<a3≤32.
In this case, 31≤a2<52 implies 21(a1+a2)<51 yielding a1<52−a2≤52−31=151<252. Thus, due to symmetry, we have
[TABLE]
which gives a contradiction.
Case 2. a2≤31 and 32≤a3.
In this case we have,
[TABLE]
By Case 1 and Case 2, we deduce that α∩L=∅. We now show that α does not contain any point the open intervals (51,52) and (53,54). Suppose that a2∈(51,52). Then, notice that a3∈L and a4∈J2. Again, two cases can arise:
Case I. 31≤a2<52.
In this case, 21(a1+a2)<51 implying a1<52−a2≤52−31=151<252, and so
[TABLE]
and hence, V4≥29565000101911>V4, which is a contradiction.
Case II. 51<a2<31.
In this case, 21(a2+a3)>52 implying a3>54−a2≥54−31=157. Recall Corollary 3.1.2, and ∫J2(x−S2(21))2dP=751V. The following subcases arise:
(i)
If 157<a3≤4522, then
[TABLE]
(ii)
If 4522≤a3≤21, then T111(53)<21(31+4522)<T112(52) implying that
[TABLE]
(iii)
If 21≤a3≤18091,
then T111(53)<21(31+21)<T1122(52) implying that
[TABLE]
(iv)
If 18091≤a3≤4523,
then T1121(53)<21(31+18091)<T1122(52) implying that
[TABLE]
(v)
If 4523≤a3≤6031,
then T11(53)=21(31+4523) implying that
[TABLE]
(vi)
If 6031≤a3≤4021,
then T11(53)<21(31+6031)<T12(52) implying
[TABLE]
(vii)
If 4021≤a3≤240127,
then T11(53)<21(31+4021)<T12(52) implying
[TABLE]
(viii)
If 240127≤a3≤158,
then T11(53)<21(31+240127)<T12(52) implying
[TABLE]
(ix)
If 158≤a3≤21(158+T212(52))=13573, then T11(53)<21(31+158)<T12(52) implying
[TABLE]
(x)
If 21(158+T212(52))=13573≤a3≤95=T21(53), then T11(53)<21(31+13573)<T12(52) implying
[TABLE]
(xi)
If T21(53)=95≤a3, then
21(31+95)=T12(52) implying that
[TABLE]
each of which is a contradiction. Thus, by Case I and Case II, it follows that a2∈(51,52), i.e., α does not contain any point from the open interval (51,52). Reflecting the situation with respect to the point 21, we also deduce that α does not contain any point from the open interval (53,54). Thus, the proof of the lemma is complete.
∎
Proposition 3.1.4**.**
{S1(21),T1(21),T2(21),S2(21)}* is an optimal set of four-means for P with quantization error V4=3942001243.*
Proof.
If β:={S1(21),T1(21),T2(21),S2(21)}, then
[TABLE]
Since V4 is the quantization error for four-means, V4≤3942001243. Let α:={a1,a2,a3,a4} be an optimal set of four-means. Since optimal quantizers are the centroids of their own Voronoi regions, without any loss of generality, we can assume that 0<a1<a2<a3<a4<1. By Lemma 3.1.3, we see that α contains points from J1, L, J2, and α does not contain any point from the open intervals (51,52), (53,54). We now show that card(α∩L)=2. Suppose that card(α∩L)=1. Then, without any loss of generality, we can assume that
card(α∩J1)=2 and card(α∩J2)=1. Recall Proposition 2.1.14. Then, by Lemma 2.1.8, we have
α∩J1={S1(9019),S1(9071)}, α∩L={21}, and α∩J2={S2(21)}. Then, we see that the quantization error is 88695000312379>V4, which is a contradiction. Hence, card(α∩L)=2, card(α∩J1)=card(α∩J2)=1 implying the fact that α={S1(21),T1(21),T2(21),S2(21)} is an optimal set of four-means with quantization error V4=3942001243.
∎
Lemma 3.1.5**.**
Let α be an optimal set of five-means. Then, α∩J1=∅, α∩J2=∅, and α∩L=∅. Moreover, α does not contain any point from the open intervals (51,52) and (53,54).
Proof.
First, consider the set β:={S1(9019),S1(9071),T1(21),T2(21),S2(21)}. Then,
[TABLE]
Since V5 is the quantization error for five-means, we have V5≤88695000180979. Let α:={a1<a2<a3<a4<a5} be an optimal set of five-means. Proceeding in the similar way as shown in the proof of Proposition 2.1.13, we have 0<a1<51 and 54<a5<1 implying α∩J1=∅ and α∩J2=∅. We now show that α∩L=∅. For the sake of contradiction, assume that α∩L=∅.
If 53<a2. Then,
[TABLE]
If a2<52<53<a3, the following three cases can arise:
(i)
103≤a2<52 and 53<a3≤107. Then, 21(a1+a2)<51 and 54<21(a3+a4) implying a1<52−a2≤101 and a4>58−a3≥109. Hence, by symmetry,
[TABLE]
(ii)
103≤a2<52 and 107≤a3.
Then, T21(52)<21(52+107)<T21(53), and so
[TABLE]
(iii)
a2≤103 and 107≤a3.
Then, due to symmetry,
[TABLE]
In each of the cases we reach a contradiction; hence, we can assume that α∩L=∅.
Next, recall Proposition 2.1.14. If card(α∩L)=3, then
[TABLE]
which gives a contradiction. So, we can assume that 1≤card(α∩L)≤2. If card(α∩L)=1, then, due to symmetry, the following two cases can arise:
Case 1. a3=21, 103≤a2<52 and 53<a4≤107:
As shown above, we have a1<101 and a5>109. Moreover, T1212(52)<21(52+21)<T1212(53). Thus,
[TABLE]
Case II. a3=21, a2≤103 and 107≤a4:
First, notice that 21(103+21)=52 and 21(21+107)=53 implying the fact that the Voronoi regions of a2 and a4 do not contain any point from L, and thus, we have a1,a2∈J1, and a4,a5∈J2. Hence,
[TABLE]
yielding
V5≥88695000213683>V5, which gives a contradiction.
Therefore, we can assume that card(α∩L)=2. We now show that α does not contain any point from the open intervals (51,52) and (53,54). Suppose that α contains a point from (51,52). In that case, α does not contain any point from (53,54) as a1∈J1 and a3,a4∈L, and a5∈J2; consequently, the following two possibilities arise:
103≤a2<52: Then, a1<101, and
[TABLE]
51<a2≤103:
Then, 21(a2+a3)>52 implying a3>54−a2≥54−103=21, and so
[TABLE]
yielding V5≥17739004129>V5.
Again, in both cases we reach a contradiction.
Thus, it follows that α does not contain any point from the open interval (51,52). Reflecting the situation with respect to the point 21, we can also show that α does not contain any point from the open interval (53,54).
∎
Lemma 3.1.6**.**
Let α be an optimal set of n-means for n=6. Then, α∩J1=∅, α∩J2=∅ and α∩L=∅. Moreover, α does not contain any point from the open intervals (51,52) and (53,54).
Proof.
Let α:={a1,a2,a3,a4,a5,a6} be an optimal set of six-means. Since optimal quantizers are the centroids of their own Voronoi regions, without any loss of generality, we can assume that 0<a1<a2<a3<a4<a5<a6<1.
Now, consider the set of points β:={S1(9019),S1(9071),T1(21),T2(21),S2(9019),S2(9071)}. Then,
[TABLE]
Since V6 is the quantization error for six-means, we have V6≤8869500082283. Proceeding in the similar way as in the proof of Proposition 2.1.13, we have 0<a1<51 and 54<a4<1 implying α∩J1=∅ and α∩J2=∅. P being symmetric about 21, we can assume that there are three optimal quantizers to the left of 21 and three optimal quantizers to the right of 21. We now show that α∩L=∅. Suppose that α∩L=∅. Then, a3<52 and 53<a4. Due to symmetry, first suppose that 103≤a3<52 and 53<a4≤107. Then, 21(a2+a3)<51 and 54<21(a4+a5) implying a2<52−a3≤52−103=101 and a5>58−a4≥58−107=109. Hence, by Corollary 2.1.12, we have
[TABLE]
which gives a contradiction. Next, suppose that a3≤103 and 107≤a4. Then,
[TABLE]
which leads to another contradiction. So, we can assume that α∩L=∅. We now show that α does not contain any point from the open intervals (51,52) and (53,54). Suppose that α contains a point from the open interval (51,52). Then, due to symmetry, α will also contain a point from (53,54), and the only possible case is that a2∈(51,52) and a5∈(53,54). The following two case can happen:
Case 1. 103≤a2<52 and 53<a5≤107: Then,
[TABLE]
Case 2. 51<a2≤103 and 107≤a5<54:
Then, 21(a2+a3)>52 implies a3>54−a2≥54−103=21, i.e., a3>21. Similarly, a4<21, which is a contradiction, as a3<a4.
Hence, α does not contain any point from the open intervals (51,52) and (53,54). ∎
Proposition 3.1.7**.**
Let αn be an optimal set of n-means for all n≥3. Then, αn∩J1=∅, αn∩J2=∅, and αn∩L=∅. Moreover, αn does not contain any point from the open intervals (51,52) and (53,54).
Proof.
By Proposition 2.1.13, Lemma 3.1.3, Lemma 3.1.5, and Lemma 3.1.6, it follows that the proposition is true for 3≤n≤6. We now show that the proposition is true for all n≥7. Let αn:={a1,a2,a3,⋯,an} be an optimal set of n-means for all n≥7. Since optimal quantizers are the centroids of their own Voronoi regions, without any loss of generality, we can assume that 0<a1<a2<a3<⋯<an<1.
Consider the set of seven points
[TABLE]
Then, ∫a∈β7min(x−a)2dP=1773900010967.
Since Vn is the quantization error for n-means for all n≥7, we have Vn≤V7≤1773900010967. Proceeding in the similar way as in the proof of Proposition 2.1.13, we have 0<a1<51 and 54<an<1 implying αn∩J1=∅ and αn∩J2=∅. We now show that αn∩L=∅. Suppose that αn∩L=∅. Let j=max{i:ai<52 for all 1≤i≤n}, and then aj<52. First, assume that 103≤aj<52.
Then, 21(aj−1+aj)<51 implying aj−1<52−aj≤52−103=101, and so
[TABLE]
which is a contradiction. Next, assume that aj≤103. Then, notice that T11(53)=4519<21(103+53)=209; hence,
[TABLE]
which leads to a contradiction. Thus, we can conclude that αn∩L=∅.
We now prove that αn does not contain any point from the open intervals (51,52) and (53,54). Suppose that αn contains a point from the open interval (51,52). Let k=max{i:ai<52 for all 1≤i≤n}, and then ak<52.
Case I. 103≤ak<51: Then, 21(ak−1+ak)≤51 implies ak−1≤101 which yields
[TABLE]
Case II. 51<ak≤103: Then, 21(ak+ak+1)>52 implies ak+1>21 which yields
[TABLE]
By Case I and Case II, we can assume that αn does not contain any point from the open interval (51,52). Reflecting the situation with respect to 21, we can also assume that αn does not contain any point from the open interval (53,54).
∎
The following proposition gives a property of the n-th quantization error.
Proposition 3.1.8**.**
Let α be an optimal set of n-means for P, where n≥3. Set α1:=α∩J1, α2:=α∩J2 and αL:=α∩L. Let
n1=card(α∩J1), n2=card(α∩J2) and nL=card(α∩L). Then,
[TABLE]
Proof.
By Proposition 3.1.7, α does not contain any point from the open intervals (51,52) and (53,54), and so n=n1+n2+nL. By Lemma 2.1.8, we see that S1−1(α1) is an optimal set of n1-means for P, and S2−1(α2) is an optimal set of n2-means for P. In the similar way it can be seen that αL is an optimal set of nL-means for P∣L=ν, where P∣L is the conditional probability measure of P on L as defined by (2). Again, P-almost surely, the Voronoi region of any point in α∩Ji for i=1,2, does not contain any point from the Voronoi region of any point in α∩L, and vice versa. Thus,
[TABLE]
which completes the proof.
∎
3.2. Canonical sequences and optimal quantization
In this section, we first define the canonical sequences{a(n)}n≥1 and {F(n)}n≥1 associated with the condensation system, then calculate the optimal sets of F(n)-means, F(n)-th quantization error, quantization dimension and quantization coefficients.
Observation. Let A be a Borel subset of R, αn be an optimal set of n-means for P, and let V(P;αn,A) be the quantization error contributed by αn on the set A with respect to P. Using Proposition 2.1.14, Proposition 3.1.7, and Proposition 3.1.8, it follows that if
[TABLE]
for 1≤i=j≤2, then
card(αn+1∩Ji)=card(αn∩Ji)+1,card(αn+1∩L)=card(αn∩L), and card(αn+1∩Jj)=card(αn∩Jj);and if
[TABLE]
then
card(αn+1∩Ji)=card(αn∩Ji) for i=1,2, and card(αn+1∩L)=card(αn∩L)+1.
In order to avoid routine technicalities, we omit the justification of the Observation. Notice that the Observation enables one to construct optimal sets αn,n≥3, beginning with the optimal set of three-means. For example, by Proposition 2.1.13, the set α3:={S1(21),21,S2(21)} is an optimal set of three-means which contains one element from each of J1, L, and J2. Since V(P;α3,L)=31W>751V=V(P:α3,J1)=V(P;α3,J2), by the Observation above, an optimal set α4 of four-means must contain two elements from L, and one element from each of J1 and J2 yielding α4={S1(21),T1(21),T2(21),S2(21)}, which is justified by Proposition 3.1.4. Once α4 is known, similarly, one calculates an optimal set α5 of five-means, and so forth.
Having optimal sets of n-means for 1≤n≤6, and utilizing the Observation, we define the canonical sequences that are useful in calculating the optimal sets of n-means and the nth quantization errors for all n∈N.
Definition 3.2.1**.**
The sequences {a(n)}n≥1 and {F(n)}n≥1, where
[TABLE]
are the canonical sequences associated with the condensation system (S,p,ν).
Remark 3.2.2**.**
First several terms of the sequences {a(n)} and {F(n)} are
[TABLE]
Also, it is easy to see that a(2k+1)=3k and a(2k)=3k−2 for all k≥1.
Lemma 3.2.3**.**
For any positive integer k≥1, we have
(i)
F(2k+1)=22k+1(1+3⋅2k−1)=2⋅22k+3⋅23k, and
(ii)
F(2k)=22k(1+2k)=22k+23k.
In fact, for any n≥3, we have F(n)=2a(n)+2F(n−1), and if n=2, then F(2)=22+2F(1).
Proof.
Notice that if k=1 and k=2, then the relations given by F(2k+1) and F(2k) are clearly true. Let n=2k+1 for some positive integer k≥2. Then,
[TABLE]
Let n=2k for some positive integer k≥3. Then,
[TABLE]
To prove F(n)=2a(n)+2F(n−1) for n≥3, we proceed as follows: Let n=2k+1 for some k≥1. Then,
F(n)=F(2k+1)=2⋅22k+3⋅23k=23k+2(22k+23k)=2a(2k+1)+2F(2k)=2a(n)+2F(n−1). Let n=2k for some k≥2. Then, F(n)=F(2k)=22k+23k=23k−2+22k+3⋅23k−2=2a(2k)+2F(2k−1)=2a(n)+2F(n−1). If n=2, then F(2)=22+2F(1) directly follows from the definition.
∎
For n∈N, we will denote the sequence of sets
α2a(n)(ν),∪ω∈ISω(α2a(n−1)(ν)),∪ω∈I2Sω(α2a(n−2)(ν)),⋯,∪ω∈In−4Sω(α2a(4)(ν)),∪ω∈In−3Sω(α2a(3)(ν)),∪ω∈In−2Sω(α22(ν)),∪ω∈In−1Sω(α2(ν)),{Sω(21):ω∈In} by S(a(n)), S(a(n−1)), S(a(n−2)), ⋯, S(a(4)), S(a(3)), S(2), S(1), and S(0), respectively.
Also, for 1≤ℓ≤2, write
[TABLE]
and for 3≤ℓ≤n, write
[TABLE]
Further, we write
S(2)(0):={Sω(α2(P)):ω∈In}={Sω(9019),Sω(9071):ω∈In},
and S(2)(2)(0)=∪ω∈InSω(α2(ν))∪{Sω(21):ω∈In+1}. Moreover, for any ℓ∈N∪{0}, if A:=S(i), we identify S(2)(i) and S(2)(2)(i), respectively, by A(2) and A(2)(2); and if A:=S(a(i)), we identify S(2)(a(i)) and S(2)(2)(a(i)), respectively, by A(2) and A(2)(2). Set
[TABLE]
For any real number x, let ⌊x⌋ denote the greatest integer not exceeding x.
For n∈N, n≥1, set
[TABLE]
In addition, write
[TABLE]
For any element a∈A∈SF∗(n), by the Voronoi region of a it is meant the Voronoi region of a with respect to the set ∪B∈SF∗(n)B.
Similarly, for any a∈A∈SF(n), by the Voronoi region of a it is meant the Voronoi region of a with respect to the set ∪B∈SF(n)B. Notice that if a,b∈A, where A∈SF(n) or A∈SF∗(n), the error contributed by a in the Voronoi region of a is equal to the error contributed by b in the Voronoi region of b. Let us now define an order ≻ on the set SF∗(n) as follows: For A,B∈SF∗(n) by A≻B it is meant that the error contributed by any element a∈A in the Voronoi region of a is larger than the error contributed by any element b∈B in the Voronoi region of b. Similarly, we define the order relation ≻ on the set SF(n).
Lemma 3.2.4**.**
For a given positive integer n≥4, let S(a(4))∈SF∗(n). Then, S(a(4))≻B for any B∈SF∗(n)∖{S(a(4))}.
Proof.
We first prove that S(a(4))≻S(a(ℓ)) for 5≤ℓ≤n. In order to that, for 5≤ℓ≤n, we first prove the following inequality:
[TABLE]
First, assume that ℓ=2k+1 for some k≥2. Then,
\frac{18^{a(\ell)-a(4)}}{75^{\ell-4}}=\frac{18^{a(2k+1)-a(4)}}{75^{2k+1-4}}=\frac{18^{3k-4}}{75^{2k-3}}=\Big{(}\frac{18^{3}}{75^{2}}\Big{)}^{(k-1)}\frac{75}{18}>1.
Next, assume that ℓ=2k for some k≥3. Then, \frac{18^{a(\ell)-a(4)}}{75^{\ell-4}}=\frac{18^{a(2k)-a(4)}}{75^{2k-4}}=\frac{18^{3k-2-4}}{75^{2k-4}}=\Big{(}\frac{18^{3}}{75^{2}}\Big{)}^{(k-2)}>1.
Thus, the inequality is proved. The distortion error due to any element from the set S(a(ℓ)) is given by 75n−ℓ13118a(ℓ)1W. On the other hand, the distortion error due to any element from the set S(a(4)) is given by 75n−413118a(4)1W. Thus, 75n−413118a(4)1W>75n−ℓ13118a(ℓ)1W is true if 75ℓ−418a(ℓ)−a(4)>1, which is clearly true by (8). Next, take 2≤ℓ≤⌊2n⌋. Then, the distortion error due to the set S(2)(a(2ℓ)) is given by 75n−2ℓ13118a(2ℓ)+11W=75n−2ℓ131183ℓ−11W. Thus, 75n−413118a(4)1W>75n−2ℓ131183ℓ−11W is true if 752ℓ−4183ℓ−5>1, i.e., if (752183)(ℓ−2)18>1, which is clearly true as ℓ≥2. Similarly, we can show that S(a(4))≻S(2)(0).
Now, take 1≤ℓ≤3. Then, S(a(4))≻S(a(ℓ)) is true since
75n−413118a(4)1W>75n−ℓ13118ℓ1W. Similarly, S(a(4))≻S(0). Thus, the assertion follows.
∎
Lemma 3.2.5**.**
Let 0≤k≤n. Then,
(i)
S(a(2k))≻S(a(2k+2))* for all k≥2.*
(ii)
S(a(82))≻S(a(2k+1))≻S(a(2k+82))≻S(a(2k+3))* for all k≥1.*
(iii)
S(a(83))≻S(2)(a(2k))≻S(a(2k+160))≻S(a(2k+81))≻S(2)(a(2k+2))* for all k≥2.*
(iv)
S(a(7))≻S(0)≻S(a(88))≻S(a(9))*, S(a(81))≻S(2)≻S(a(162))≻S(a(83)), S(a(121))≻S(2)(a(42))≻S(a(202))≻S(2)(0)≻S(a(123))≻S(2)(a(44)), and *
S(2)(a(80))≻S(a(240))≻S(1)≻S(a(161))≻S(2)(a(82)).
Proof.
(i) For any k≥2, let b∈S(a(2k))=∪ω∈In−2kSω(α2a(2k)(ν)). Then, b=Sω(Tτ(21)) for some ω∈In−2k and τ∈Ia(2k). The error contributed by b in its Voronoi region is given by
[TABLE]
Similarly, the error contributed by any element in the set S(a(2k+2)) is 75n−2k−213118a(2k+2)1W. Thus, S(a(2k))≻S(a(2k+2)) will be true if 75n−2k13118a(2k)1W>75n−2k−213118a(2k+2)1W, i.e., if
1<75218a(2k+2)−a(2k)=752183, which is clearly true.
(ii)S(a(82))≻S(a(3)) is true since 75n−8213118a(82)1W>75n−313118a(3)1W. For all k≥1, proceeding similarly as in (i), we have S(a(2k+1))≻S(a(2k+82)) and S(a(2k+82))≻S(a(2k+3)). Thus, (ii) is proved.
(iii)S(a(83))≻S(2)(a(4)) is true since 75n−8313118a(83)1W>75n−413118a(4)+11W. Proceeding similarly as in (i), we can show that S(2)(a(2k))≻S(a(2k+160)), S(a(2k+160))≻S(a(2k+81)), and S(a(2k+81))≻S(2)(a(2k+2)) for all k≥2. Thus (iii) follows.
(iv) Since 75n−713118a(7)1W>75n1V>75n−8813118a(88)1W>75n−913118a(9)1W, the inequality S(a(7))≻S(0)≻S(a(88))≻S(a(9)) is true. Similarly we can show the other inequalities.
∎
Remark 3.2.6**.**
The Lemma 3.2.5 defines the order among the elements of the sets SF∗(n) for all n≥1. Since it is helpful in obtaining the optimal sets of F(n)-means, we exhibit the following cases for later use:
(i)
S(0)≻S(2)(0)≻S(1)* for n=1;*
(ii)
S(0)≻S(2)≻S(2)(0)≻S(1)* for n=2;*
(iii)
S(a(3))≻S(0)≻S(2)≻S(2)(0)≻S(1)* for n=3;*
(iv)
S(a(4))≻S(a(3))≻S(0)≻S(2)≻S(2)(a(4))≻S(2)(0)≻S(1)* for n=4.
*
Lemma 3.2.7**.**
Let αF(n), SF(n), SF(1)(n), and SF(2)(n) be the sets as defined before. Then,
[TABLE]
Proof.
Let A∈SF(1)(n). If A=S(0), then A(2)(2)=S(2)(2)(0)={Sω(21):ω∈In+1}∪(∪ω∈InSω(α2(ν)))={Sω(21):ω∈In+1}∪(∪ω∈In+1−1Sω(α2(ν))). If A=S(a(2ℓ)) for some ℓ∈{1,2,⋯,⌊2n⌋}, then
[TABLE]
Next, let A∈SF(2)(n). Then, A=S(1),S(2), or S(a(2ℓ+1)) for some ℓ∈N. If A=S(1), then A(2)=∪ω∈In−1Sω(α21+1(ν))=∪ω∈In+1−2Sω(α22(ν)), and similarly, we have S(2)(2)=∪ω∈In+1−3Sω(α23(ν)). If A=S(a(2ℓ+1)), then
[TABLE]
yielding, A(2)=∪ω∈In+1−(2ℓ+1)Sω(α2a(2(ℓ+1))(ν)). Thus, we see that
[TABLE]
which proves the assertion.
∎
Lemma 3.2.8**.**
For A,B∈SF(n) with A≻B, the distortion error due to the set (SF(n)∖A)∪A(2)∪B is less than the distortion error due to the set (SF(n)∖B)∪B(2)∪A.
Proof.
Let V(αF(n)) be the distortion error due to the set αF(n) with respect to the condensation measure P. First take A=S(a(k)) and B=S(a(k′)) for some 3≤k=k′≤n. Then, the distortion error due to the set (αF(n)∖A)∪A(2)∪B is less than the distortion error due to the set (αF(n)∖B)∪B(2)∪A is
[TABLE]
yielding 75n−k1319a(k)1W>75n−k′1319a(k′)1W, which is clearly true since by the hypothesis A≻B. Similarly, we can prove the lemma in each of the following cases:
(i)A=S(a(k)) and B=S(k′), where 3≤k≤n and 0≤k′≤2;
(ii)A=S(k) and B=S(a(k′)), where 0≤k≤2 and 3≤k′≤n;
(iii)A=S(k) and B=S(a(k′)), where 0≤k≤2 and 0≤k′≤2.
Thus, the proof of the lemma is complete.
∎
Using the similar technique as Lemma 3.2.8, the following lemma can be proved.
Lemma 3.2.9**.**
For any two sets A,B∈SF∗(n), let A≻B. Then, the distortion error due to the set (SF∗(n)∖A)∪A(2)∪B is less than the distortion error due to the set (SF∗(n)∖B)∪B(2)∪A.
Remark 3.2.10**.**
By Proposition 3.1.4, we know that αF(1) is an optimal set of F(1)-means. Assume that αF(n) is an optimal set of F(n)-means for some n≥1. Let A∈SF(n) be such that A≻B for any other B∈SF(n). By Lemma 3.2.8, we deduce that if A=S(0)={Sω(21):ω∈In}, then the set (αF(n)∖A)∪{Sω(9019),Sω(9071):ω∈In} is an optimal set of F(n)−2n+2n+1-means. If A=∪ω∈In−ℓSω(α2ℓ(ν)) for 1≤ℓ≤3, then the set (αF(n)∖A)∪(∪ω∈In−ℓSω(α2ℓ+1(ν))) is an optimal set of F(n)−2n+2n+1-means. If A=∪ω∈In−ℓSω(α2a(ℓ)(ν)), then the set (αF(n)∖A)∪(∪ω∈In−ℓSω(α2a(ℓ)+1(ν))) is an optimal set of F(n)−2n−ℓ2a(ℓ)+2n−ℓ2a(ℓ)+1-means.
Proposition 3.2.11**.**
Let a(n) and F(n) be the two sequences as defined by Definition 3.2.1. Then, for any n≥1, the set αF(n)(P)
is an optimal set of F(n)-means with quantization error given by
[TABLE]
Proof.
By Proposition 3.1.4, for n=1 the set αF(1) is an optimal set of F(1)-means with quantization error 3191W+752V. We now show that αF(n) is an optimal set of F(n)-means for any n≥2. Consider the following cases:
Case 1. n=2.
Let α be an optimal set of F(2)-means. Recall that α does not contain any point from the open intervals (51,52) and (53,54). The distortion error due to the set αF(2)(P)=α22(ν)∪(∪ω∈ISω(α2(ν)))∪{Sω(21):ω∈I2} is given by
[TABLE]
Since VF(2)(P) is the quantization error for F(2)-means, we have VF(2)(P)≤886950009283. Since α is an optimal set of F(2)-means, F(2) is even, and P is symmetric about the point 21, α must contain equal number of points from each of the sets J1 and J2 implying that α contains even number of points from L. We now show that α contains 22 elements from L. Suppose that α contains less than 22 elements from L. Then, card(α∩L)=0 or 2. But, α∩L=∅, and so card(α∩L)=2. Hence,
[TABLE]
which is a contradiction. Next suppose that α contains more than 22 elements from L. As α∩Ji=∅ for i=1,2, we must have card(α∩L)=6,8, or 10. Suppose that card(α∩L)=6. Then, for 1≤i≤2, α∩Ji is an optimal set of three-means with respect to the image measure P∘Si−1, which by Lemma 2.1.8 yields that Si−1(α∩Ji) is an optimal set of three-means for P, and so by Proposition 2.1.13, we have
Si−1(α∩Ji)={S1(21),21,S2(21)}, i.e., α∩J1={S11(21),S1(21),S12(21)}, and α∩J2={S21(21),S2(21),S22(21)}. Then, the distortion error is
V_{F(2)}(P)\geq 2\Big{(}\int_{J_{11}}(x-S_{11}(\frac{1}{2}))^{2}dP+\int_{S_{1}(L)}(x-S_{1}(\frac{1}{2}))^{2}dP+\int_{J_{12}}(x-S_{12}(\frac{1}{2}))^{2}dP\Big{)}=2\Big{(}\frac{1}{75^{2}}V+\frac{1}{75}\frac{1}{3}W+\frac{1}{75^{2}}V\Big{)}=\frac{203}{1642500}>V_{F(2)}(P),
which is a contradiction. Similarly, we can show that if card(α∩L)=8 or 10, contradiction will arise. Hence, card(α∩L)=22, which implies that α contains F(1) elements from each of the sets J1 and J2. Thus, we see that in this case α=αF(2)(P) with quantization error VF(2)(P)=31921W+7523191W+(752)2V.
Case 3. n=3.
By Case 1, we know that αF(2)=S(0)∪S(1)∪S(2) is an optimal set of F(2)-means, where S(0),S(1),S(2)∈SF(2). By Remark 3.2.6, S(0)≻S(2)≻S(2)(0)≻S(1). Thus, by Remark 3.2.10, the set (αF(2)∖S(0))∪S(2)(0)=S(1)∪S(2)∪S(2)(0) is an optimal set of 22+22+23-means. Similarly, the set S(1)∪S(2)(2)∪S(2)(0) is an optimal set of 22+23+23-means, the set S(1)∪S(2)(2)∪S(2)(2)(0) is an optimal set of 22+23+23+23-means, the set S(2)(1)∪S(2)(2)∪S(2)(2)(0) is an optimal set of 23+23+23+23=F(3)-means. By Lemma 3.2.7, it is known that αF(3)=S(2)(1)∪S(2)(2)∪S(2)(2)(0). Thus, αF(3) is an optimal set of F(3)-means with quantization error same as it is given in the hypothesis for n=3.
Case 4. n≥4.
Let αF(n) be an optimal set of F(n)-means for some n≥3. We need to show that αF(n+1) is an optimal set of F(n+1)-means. We have
αF(n)=∪A∈SF(n)A. In the first step, let A(1)∈SF(n) be such that A(1)≻B for any other B∈SF(n). Then, by Remark 3.2.10, the set (αF(n)∖A(1))∪A(2)(1) gives an optimal set of F(n)−card(A(1))+card(A(2)(1))-means. In the 2nd step, let A(2)∈(SF(n)∖{A(1)})∪{A(2)(1)} be such that A(2)≻B for any other set B∈(SF(n)∖{A(1)})∪{A(2)(1)}. Then, using the similar technique as Lemma 3.2.8, we can show that the distortion error due to the following set:
[TABLE]
with cardinality F(n)−card(A(1))+card(A(2)(1))−card(A(2))+card(A(2)(2)) is smaller than the distortion error due to the set obtained by replacing A(2) in the set (9) by any other set A′(2) having the same cardinality as A(2). In other words, \Big{(}((\alpha_{F(n)}\setminus A(1))\cup A^{(2)}(1))\setminus A(2)\Big{)}\cup A^{(2)}(2) forms an optimal set of
F(n)−card(A(1))+card(A(2)(1))−card(A(2))+card(A(2)(2))-means. Proceeding inductively in this way, up to (n+1+2⌊2n⌋) steps, we can see that αF(n+1)=(∪A∈SF(1)(n)A(2)(2))∪(∪A∈SF(2)(n)A(2)) forms an optimal set of F(n+1)-means.
The F(n)-th quantization error for all n≥3 is given by
[TABLE]
Thus, the proof of the proposition is complete.
∎
Using Proposition 3.2.11 and the recursive properties of canonical sequences, by routine calculations the following lemma is obtained.
Lemma 3.2.12**.**
For all k≥2, we have
[TABLE]
Remark 3.2.13**.**
By Proposition 3.2.11, we see that if αF(n) is an optimal set of F(n)-means for some n≥4, then αF(n) contains F(n−1) elements from each of J1 and J2, and 2a(n) elements from L. Thus, by Proposition 3.1.8, we have
VF(n)(P)=319a(n)1W+752VF(n−1)(P).
3.3. Calculation of Optimal sets of m-means for all m∈N
Now, we give the description of how to calculate the optimal sets of m-means for any m∈N.
For 1≤m≤4, the optimal sets of m-means and the mth quantization error are known by Lemma 2.1.4, Proposition 2.1.10, Proposition 2.1.13, and Proposition 3.1.4. If m=F(n) for some positive integer n, then they are known by Proposition 3.2.11. Let m∈N be such that F(nm)<m<F(nm+1) for some positive integer nm. Notice that SF∗(nm) contains (nm+1+⌊2nm⌋) elements. After rearranging the elements of SF∗(nm) write
[TABLE]
where C(0)≻C(1)≻C(2)≻⋯≻C(nm+1+⌊2nm⌋). Let ℓm∈N be such that
[TABLE]
If m=F(nm)+card(C(0))+⋯+card(C(ℓm)), then the set
[TABLE]
is a unique optimal set of m-means. Let F(nm)+card(C(0))+⋯+card(C(ℓm))<m<F(nm)+card(C(0))+⋯+card(C(ℓm+1)). Let βm⊂C(ℓm+1) with card(βm)=m−(F(nm)+card(C(0))+⋯+card(C(ℓm))). The following three cases can arise:
Case 1. C(ℓm+1)=∪ω∈In−kSω(α2a(k)(ν)).
Write βm,1:={ω∈In−k:SωTτ(21)∈βm for some τ∈Ia(k)}, and
βm,2:={τ∈Ia(k):SωTτ(21)∈βm for some ω∈In−k}. Set
[TABLE]
Case 2. C(ℓm+1)={Sω(21):ω∈Inm}.
Write βm,1:={ω∈Inm:Sω(21)∈β}, and then βm∗:=ω∈βm,1∪{Sω(9019),Sω(9071)}.
Case 3. C(ℓm+1)=ω∈Inm∪{Sω(9019),Sω(9071)}.
Write βm,1:={ω∈Inm:Sω(9019)∈βm or Sω(9071)∈βm}, and write
[TABLE]
Let βm∗ be the set that arises either in Case 1, Case 2, or in Case 3. Then, the set
[TABLE]
is an optimal set of m-means. The number of such sets in any of the above cases is given by card(C(ℓm+1))Ccard(βm),
where uCv=(uv) represent the binomial coefficient.
The following two examples illustrate the computations described above.
Example 3.3.1**.**
Let m=21. Since F(2)<m<F(3), we have nm=2. Since S(0)≻S(2)≻S(2)(0)≻S(1), we have
SF∗(nm)=SF∗(2)={C(0),C(1),C(2),C(3)},
where C(0)=S(0), C(1)=S(2), C(2)=S(2)(0), and C(3)=S(1). Again, F(2)+card(C(0))+card(C(1))<m<F(2)+card(C(0))+card(C(1))+card(C(2)) implying ℓm=1, and so
C(ℓm+1)=S(2)(0). Take βm={S11(9019),S12(9019),S21(9071)}, where βm⊂S(2)(0) with card(βm)=m−(F(2)+card(C(0))+card(C(1)))=23−20=3. Then,
[TABLE]
Hence,
[TABLE]
The number of optimal sets of 23-means is given by 8C3=56.
Example 3.3.2**.**
Let m=31. As in the previous example, we have nm=2, C(0)=S(0), C(1)=S(2), C(2)=S(2)(0), and C(3)=S(1). Since F(2)+card(C(0))+card(C(1))+card(C(2))=12+4+4+8=28<m<32=F(2)+card(C(0))+card(C(1))+card(C(2))+card(C(3)), we have ℓm=2, and so
C(ℓm+1)=S(1). Take βm={S1T1(21),S1T2(21),S2T1(21)}, where βm⊂S(1) with card(βm)=m−28=3. Then,
[TABLE]
Hence,
[TABLE]
is an optimal set of 31-means. The number of optimal sets of 31-means is given by 4C3=4.
3.4. Asymptotics for the nth quantization error Vn(P)
Having the optimal sets and the corresponding quantization errors are explicitly known, we now turn to the investigation of the quantization dimension and the quantization coefficients for the condensation measure P. If D(ν) is the quantization dimension of ν, then (21(31)2)2+D(ν)D(ν)+(21(31)2)2+D(ν)D(ν)=1 (see [13]), which yields D(ν)=log3log2=β, where β is the Hausdorff dimension of the Cantor set generated by the similarity maps T1 and T2 (i.e., β satisfies (31)β+(31)β=1).
Theorem 3.4.1**.**
Let P be the condensation measure associated with the self-similar measure ν. Then, limn→∞logVn(P)2logn=D(ν), i.e., the quantization dimension D(P) of the measure P exists and is equal to D(ν).
Proof.
For n∈N, n≥3, let ℓ(n) be the least positive integer such that F(2ℓ(n)+1)≤n<F(2(ℓ(n)+1)+1). Then,
VF(2(ℓ(n)+1)+1)<Vn≤VF(2ℓ(n)+1). Thus, we have
[TABLE]
By Lemma 3.2.3 and Lemma 3.2.12, we have F(2ℓ(n)+1)=2⋅2ℓ(n)+3⋅23ℓ(n), and
V_{F(2(\ell(n)+1)+1)}=9^{-3(\ell(n)+1)}\frac{79}{7224}\Big{(}1-\Big{(}\frac{324}{625}\Big{)}^{\ell(n)+1}\Big{)}-\frac{3571}{44347500}\Big{(}\frac{2}{75}\Big{)}^{2\ell(n)+1}. Notice that ℓ(n)→∞ whenever n→∞.
Again,
[TABLE]
and so
[TABLE]
Thus, log3log2≤liminfn−logVn2logn≤limsupn−logVn2logn≤log3log2 implying the fact that the quantization dimension of the measure P exists and is equal to D(ν)=β.
∎
Theorem 3.4.2**.**
β-dimensional quantization coefficient for the condensation measure P does not exist; however, the β-dimensional lower and upper quantization coefficients for P are finite and positive.
Proof.
Since β=log3log2 for any k≥2, we have
[TABLE]
Similarly, F(2(k+1))β2=93k(2k4+8)β2. Moreover, 9a(2k+1)=93k and 9a(2(k+1))=93(k+1)−2=93k+1, and 93k(752)2k−1=(625324)k275. Then, by Lemma 3.2.12, we have
[TABLE]
yielding
[TABLE]
and
[TABLE]
yielding \mathop{\lim}\limits_{k\to\infty}F(2(k+1))^{\frac{2}{\beta}}V_{F(2(k+1))}(P)=8^{\frac{2}{\beta}}\Big{(}\frac{1}{27}W+\frac{2}{75}\frac{79}{7224}\Big{)}.
Since (F(2k+1)β2VF(2k+1)(P))k≥2 and (F(2(k+1))β2VF(2(k+1))(P))k≥2 are two subsequences of (nβ2Vn(P))n∈N having two different limits, we can say that the sequence (nβ2Vn(P))n∈N does not converge, in other words, the β-dimensional quantization coefficient for P does not exist. For n∈N, n≥3, let ℓ(n) be the least positive integer such that F(2ℓ(n)+1)≤n<F(2(ℓ(n)+1)+1). Then,
VF(2(ℓ(n)+1)+1)<Vn≤VF(2ℓ(n)+1) implying
yielding the fact that 91(3β2722479)≤n→∞liminfnβ2Vn≤n→∞limsupnβ2Vn≤9(3β2722479), i.e., β-dimensional lower and upper quantization coefficients for P are finite and positive.
∎
Recall that the critical value of the condensation system under consideration is the number κ satisfying (31(51)2)2+κκ=21. Hence, κ=log75−log22log2; on the other hand, D(ν)=log3log2>κ. Therefore, by Theorem 3.4.1, it follows that
Proposition 3.4.3**.**
D(P)=max{κ,D(ν)}.**
4. Condensation measure P with self-similar measure ν satisfying D(ν)<κ
In this section, we study the optimal quantization for the condensation measure P generated by the condensation system ({S1,S2},(31,31,31),ν), where the self-similar measure ν is given by ν=21ν∘T1−1+21ν∘T2−1 with T1(x)=71x+3512, and T2(x)=71x+3518 for all x∈R (i.e., the case s=71.) From the general results obtained in Section 2, we have
•
E(ν)=21,W=V(ν)=4003;E(P)=21,V=V(P)=1168131,
•
α1={21}, with V1=V(P),
•
α2={21043,210167},V2=12877200321827, and
•
α3={101,21,109},V3=87600481.
Below, if the arguments of some statements are exactly the same as their counterparts in the previous section, we will omit their proofs to avoid repetition.
Notice that in this case, we have V2n(ν)=49n1W, and
[TABLE]
Proposition 4.1**.**
The set {S1(21),T1(21),T2(21),S2(21)} is an optimal set of four-means with quantization error V4=429240013057.
Proposition 4.2**.**
Let αn be an optimal set of n-means for all n≥3. Then, αn∩J1=∅, αn∩J2=∅, and αn∩L=∅. Moreover, αn does not contain any point from the open intervals (51,52) and (53,54).
4.3. Canonical sequence and optimal quantization
In this section, the two canonical sequences are {a(n)}n≥1 and {F(n)}n≥1 given by the following definition.
Definition 4.3.1**.**
The canonical sequences for this condensation system (S,p,ν) is defined as
[TABLE]
From these definitions it follows that, for any n≥1,2a(n+1)+2F(n)=2n+(n+3)2n=(n+4)2n=F(n+1); hence, we have
Lemma 4.3.2**.**
For the canonical sequences a(n) and F(n), F(n+1)=2a(n+1)+2F(n).
For 1≤ℓ≤n, write S(ℓ):=∪ω∈In−ℓSω(α2a(ℓ)(ν)) and S(2)(ℓ):=∪ω∈In−ℓSω(α2a(ℓ)+1(ν)). Notice that if ℓ=n, then S(n)=α2a(n)(ν). Moreover, write
[TABLE]
For any ℓ∈N∪{0}, if A:=S(ℓ), we identify S(2)(ℓ) and S(2)(2)(ℓ) respectively by A(2) and A(2)(2). For n∈N, set
[TABLE]
[TABLE]
In addition, write
[TABLE]
The order relation ≻ on the elements of SF∗(n) and SF(n) are defined analogously as it is defined on the elements of SF∗(n) and SF(n) in Section 2.
Remark 4.3.3**.**
By Definition 4.3.1,
αF(n)=S1(αF(n−1))∪α2a(n)(ν)∪S2(αF(n−1)).
Lemma 4.3.4**.**
Let ≻ be the order relation on SF∗(n). Then,
[TABLE]
Proof.
For any n≥k≥1, the distortion error due to any element in the set S(k) is given by 75n−k1312a(k)149a(k)1W. On the other hand, the distortion error due to to the set S(0) and S(2)(0) are, respectively, given by 75n1V and 75n121V2. Hence, S(2)≻S(0)≻S(3) will be true if 3198752W>V>31982753W which is clearly true. Thus, S(2)≻S(0)≻S(3). For n>k≥2, the inequality S(k)≻S(k+1) is true if 1>9875 which is obvious. Moreover, since 3198107511W>21V2>3198117512W, we have S(11)≻S(2)(0)≻S(12). Again, 98177518>9875>98187519 yields S(18)≻S(1)≻S(19). Combining all these inequalities, we see that the lemma follows.
∎
Remark 4.3.5**.**
Lemma 4.3.4 implies that if n=1, then S(0)≻S(2)(0)≻S(1); if n=2, then S(2)≻S(0)≻S(2)(0)≻S(1); if n=3, then S(2)≻S(0)≻S(3)≻S(2)(0)≻S(1); and so on.
From the definitions of S(k) for all 0≤k≤n and S(2)(0) it follows that
Lemma 4.3.6**.**
Let αF(n) and SF(n) be the sets as defined before. Then,
[TABLE]
Lemma 4.3.7**.**
For any two sets A,B∈SF∗(n), let A≻B. Then, the distortion error due to the set (SF∗(n)∖A)∪A(2)∪B is less than the distortion error due to the set (SF∗(n)∖B)∪B(2)∪A.
Proof.
We have SF∗(n)={S(n),S(n−1),⋯,S(1),S(0),S(2)(0)}. Let VSF∗(n) be the distortion error due to the set SF∗(n). First, take A=S(k) and B=S(k′) for some 2≤k<k′≤n. Then, by Lemma 4.3.4, A≻B. The distortion error due to the set (SF∗(n)∖A)∪A(2)∪B is given by
[TABLE]
Similarly, The distortion error due to the set (SF∗(n)∖B)∪B(2)∪A is
[TABLE]
Thus, (4.3) will be less than (14) if (7598)k′−k>1, which is clearly true since k′>k. Similarly, we can prove the lemma for any two elements A,B∈SF∗(n). Thus, the proof of the lemma is complete.
∎
Proposition 4.3.8**.**
For any n≥1 the set αF(n) is an optimal set of F(n)-means for the condensation measure P whose quantization error is given by
[TABLE]
Proof.
By Proposition 4.1, the set αF(1)={S1(21),T1(21),T2(21),S2(21)} is an optimal set of F(1)-means with quantization error V4=429240013057.
Proceeding in the same way as Proposition 3.2.11, we can show that for any n≥2, the set αF(n) forms an optimal set of F(n)-means, and the quantization error VF(n) is given by
[TABLE]
yielding
[TABLE]
Thus, the proof of the proposition is complete.
∎
4.4. Asymptotics for the nth quantization error Vn(P)
In this subsection, we turn to the investigation of the quantization dimension D(P) and the D(P)-dimensional quantization coefficient for the condensation measure P. Notice that in this case D(ν)=β, where β=log7log2 which is the Hausdorff dimension of the limit set generated by the similarity maps T1 and T2 considered in this section.
Theorem 4.4.1**.**
D(P)=limn→∞−logVn(P)2logn=κ;* hence, the quantization dimension of P exists and is equal to the critical value of the condensation system.*
Proof.
Since (31(51)2)2+κκ=21,κ=log75−log22log2.
For n∈N, n≥4, let ℓ(n) be the least positive integer such that F(ℓ(n))≤n<F(ℓ(n)+1). Then,
VF(ℓ(n)+1)<Vn≤VF(ℓ(n)). Thus, we have
[TABLE]
Notice that when n→∞, then ℓ(n)→∞. Recall that F(ℓ(n))=(ℓ(n)+3)2ℓ(n)−1, and so by Proposition 4.3.8, we have
[TABLE]
Similarly, ℓ(n)→∞lim−log(VF(ℓ(n)))2log(F(ℓ(n)+1))=κ. Thus, κ≤liminfn−logVn2logn≤limsupn−logVn2logn≤κ implying the fact that the quantization dimension of the measure P exists and is equal to κ.
∎
Theorem 4.4.2**.**
The D(P)-dimensional quantization coefficient for the condensation measure P is infinity.
Proof.
For n∈N, n≥4, let ℓ(n) be the least positive integer such that F(ℓ(n))≤n<F(ℓ(n)+1). Then,
VF(ℓ(n)+1)<Vn≤VF(ℓ(n)) implying (F(ℓ(n)))2/κVF(ℓ(n)+1)<n2/κVn<(F(ℓ(n)+1))2/κVF(ℓ(n)). As ℓ(n)→∞ whenever n→∞, we have
[TABLE]
Next, since κ=log75−log22log2, we have
[TABLE]
and similarly
[TABLE]
yielding the fact that ∞≤n→∞liminfn2/κVn(P)≤n→∞limsupn2/κVn(P)≤∞, i.e., the D(P)-dimensional quantization coefficient for the condensation measure P is infinity.
∎
Since D(P)=κ=log75−log22log2>D(ν)=log7log2, the following proposition is also true.
Proposition 4.4.3**.**
D(P)=max{κ,D(ν)}.
5. Condensation measures P with self-similar measure ν satisfying
D(ν)>κ and D(ν)=κ
In this section, we consider the quantization when s=51 and s=156. Since the proofs are the same as in the previous two cases, we will summarize the results and make some concluding remarks. The condensation measures P in these cases are generated by the systems ({S1,S2},(31,31,31),ν),
where the measures ν are given by ν=21ν∘T1−1+21ν∘T2−1 with
T1(x)=51x+258, and T2(x)=51x+2512 in the case s=51, and
T1(x)=156x+52−7526, and T2(x)=156x+53−256 in the case s=156.
Table 1 below outlines the information for the quantization of P in each case. The results in table are consequence of the particular facts that:
a)
For n≥3, αn∩J1=∅, αn∩J2=∅, and αn∩L=∅, and αn does not contain any point from the open intervals (51,52) and (53,54).
b)
The sets SF(n) and SF∗(n), and the order relation ≻ among the elements of them are also defined the same way as in Section 3. Furthermore,
(i)
⋯≻S(4)≻S(3)≻S(2)≻S(0)≻S(2)(0)≻S(1).
(ii)
Although the canonical sequences {a(n)}n≥1 and {F(n)}n≥1 are identical, the order in the elements of SF∗(n) are different.
(iii)
For A,B∈SF∗(n) with A≻B, the distortion error due to the set (SF∗(n)∖A)∪A(2)∪B is less than the distortion error due to the set (SF∗(n)∖B)∪B(2)∪A.
Since, from
(31(51)2)2+κκ=21 we have κ=log75−log22log2 as the critical value, it follows that for these condensation systems D(P)=max{κ,D(ν)} as well.
5.1. Concluding Remarks
For the condensation system ({S1,S2},(31,31,31),ν) generating the condensation measure P, where S1,S2 are the similarity mappings
and ν is a self-similar measure defined by ν=21ν∘T1−1+21ν∘T2−1 with T1(x)=sx+(1−s)52 and T2(x)=sx+(1−s)53,0<s<31, by Theorem 3.4.2, Theorem 4.4.2, and Table 2, we see that when s=71,156,51, the D(P) dimensional lower quantization coefficient for the condensation measure P is infinity; on the other hand, if s=31, then the D(P)-dimensional lower and upper quantization coefficients are finite, positive and unequal. Notice that 71<156<51<31. Thus, it is worthwhile to investigate the least upper bound of s for which the D(P) dimensional lower quantization coefficient for the condensation measure P is infinity. Such a problem still remains open.
Observe that, for s=71 and s=156, although the quantization coefficients are infinity, whereas the relations between D(P) and D(ν) are not the same. Again, it is worthwhile to investigate the least upper bound of s for which the D(P)=D(ν) while D(P)-dimensional lower quantization coefficient for the condensation measure P is infinity.
Data Availability Statement. Data sharing not applicable to this article as no datasets were generated or analyzed during the current study. However, detailed calculations for the items summarized in Table 1 are available from the corresponding author upon request.
Bibliography40
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Abaya, E.F. and Wise, G.L.: Some remarks on the existence of optimal quantizers . Statistics & Probability Letters, 2(6), 349-351 (1984)
2[2] Abundo, C., Bodnar, T., Driscoll, J., Hatton, I., Wright, J.: City population dynamics and fractal transport networks . In Proceedings of the Santa Fe Institute’s CSSS 2013; Santa Fe Institute: Santa Fe, NM (2013)
3[3] Barnsley, M.F.: Fractals everywhere . Academic Press, New York, London (1988)
4[4] Benhenni, K., Cambanis, S.: The effect of quantization on the performance of sampling designs . IEEE Trans. Inform. Theory, 44, 1981–1992 (1998)
5[5] Bucklew, J.A. and Wise, G.L.: Multidimensional asymptotic quantization theory with r 𝑟 r th power distortion measures . IEEE Transactions on Information Theory, 28(2), 239-247 (1982)
6[6] Dettmann, C.P. and Roychowdhury, M.K.: Quantization for uniform distributions on equilateral triangles . Real Analysis Exchange, 42(1), 149-166 (2017)
7[7] Du, Q., Faber, V., Gunzburger, M.: Centroidal Voronoi Tessellations: Applications and Algorithms . Siam Rev., 41, 637–676 (1999)
8[8] Gruber, P.M.: Optimum quantization and its applications . Advances in Mathematics, 186, 456-497 (2004)