Next Article in Journal
The Local Times for Additive Brownian Sheets and the Intersection Local Times for Independent Brownian Sheets
Previous Article in Journal
Direct Solution of Inverse Steady-State Heat Transfer Problems by Improved Coupled Radial Basis Function Collocation Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quantization for a Condensation System

by
Shivam Dubey
1,
Mrinal Kanti Roychowdhury
2,* and
Saurabh Verma
1
1
Department of Applied Sciences, Indian Institute of Information Technology Allahabad, Prayagraj 211015, UP, India
2
School of Mathematical and Statistical Sciences, University of Texas Rio Grande Valley, 1201 West University Drive, Edinburg, TX 78539-2999, USA
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(9), 1424; https://doi.org/10.3390/math13091424
Submission received: 21 March 2025 / Revised: 21 April 2025 / Accepted: 23 April 2025 / Published: 26 April 2025

Abstract

:
For a given r ( 0 , + ) , the quantization dimension of order r, if it exists, denoted by D r ( μ ) , represents the rate at which the nth quantization error of order r approaches zero as the number of elements n in an optimal set of n-means for μ tends to infinity. If D r ( μ ) does not exist, we define D ̲ r ( μ ) and D ¯ r ( μ ) as the lower and the upper quantization dimensions of μ of order r, respectively. In this paper, we investigate the quantization dimension of the condensation measure μ associated with a condensation system ( { S j } j = 1 N ,   ( p j ) j = 0 N , ν ) . We provide two examples: one where ν is an infinite discrete distribution on R , and one where ν is a uniform distribution on R . For both the discrete and uniform distributions ν , we determine the optimal sets of n-means, calculate the quantization dimensions of condensation measures μ , and show that the D r ( μ ) -dimensional quantization coefficients do not exist. Moreover, we demonstrate that the lower and upper quantization coefficients are finite and positive.

1. Introduction

Various types of dimensions, including Hausdorff and packing dimensions or the lower and the upper box-counting dimensions, are important to characterize the complexity of highly irregular sets. In recent years, paralleling methods have been adopted to study the corresponding dimensions of measures (see [1]). In this paper, we investigate the quantization dimensions of the condensation measures. The quantization problem consists of studying the quantization error induced by the approximation of a given probability measure with discrete probability measures of finite supports. This problem originated in information theory and some engineering technology. For rigorous mathematical foundation of this theory, one can see Graf-Luschgy’s book [2]. Further theoretical results and promising applications are contained in [3,4,5,6,7,8]. Two important objects in the quantization theory are the quantization coefficient and the quantization dimension.
Let μ be a Borel probability measure on a d-dimensional normed space R d equipped with a metric ρ induced by the norm · . Let r ( 0 , + ) and n N , where N is the set of natural numbers, and α R d be a locally finite (i.e., intersection of α with any bounded subset of R d is finite) subset of R d . This implies that α is countable and closed. Then, the nth quantization error of order r for μ is defined by
V n , r ( μ ) : = inf { ρ ( x , α ) r d μ ( x ) : α R d , card ( α ) n } ,
where ρ ( x , α ) denotes the distance from the element x to the set α with respect to a given norm · on R d . If x r d μ ( x ) < , then there is some set α for which the infimum is achieved (see [2,3,5,6]). Such a set α is called an optimal set of n-means, or optimal set of n-quantizers. For some recent work in this direction one can see [2,6,8,9,10,11,12,13,14,15,16,17,18,19,20,21]. An optimal set α of n-means can then be used to give a best approximation of μ by a discrete probability supported on a set with no more than n elements. This can be achieved by giving each element a α a mass corresponding to μ ( M ( a | α ) ) , where M ( a | α ) is the set of elements x R d , which are nearest to a, i.e., ρ ( x , α ) = ρ ( x , a ) . So, the set { M ( a | α ) : a α } is the Voronoi diagram or Voronoi tessellation of R d with respect to α . Of course, the idea of ‘best approximation’ is, in general, dependent on the choice of r. Such a set α for which the infimum occurs and contains no more than n elements is called an optimal set of n-means, or optimal set of n-quantizers (of order r). An optimal set of n-means for a probability distribution μ is also referred to as V n , r ( μ ) -optimal set. The collection of all optimal sets of n-means for a probability distribution μ is denoted by C n , r ( μ ) . It can be shown that for a continuous Borel probability measure μ , an optimal set of n-means always has exactly n elements (see [2]). The numbers
D ̲ r ( μ ) : = lim inf n r log n log V n , r ( μ ) , and D ¯ r ( μ ) : = lim sup n r log n log V n , r ( μ )
are, respectively, called the lower and the upper quantization dimensions of μ of order r. If D ¯ r ( μ ) = D ̲ r ( μ ) , the common value is called the quantization dimension of μ of order r, and is denoted by D r ( μ ) . Quantization dimension measures the speed at which the specified measure of the error approaches zero as n tends to infinity. For any κ r > 0 , the two numbers
Q ̲ r κ r ( μ ) : = lim inf n n r / κ r V n , r ( μ ) and Q ¯ r κ r ( μ ) : = lim sup n n r / κ r V n , r ( μ )
are, respectively, called the κ r -dimensional lower and the upper quantization coefficients for μ (of order r). The quantization coefficients provide us with more accurate information about the asymptotics of the quantization error than the quantization dimension. Compared to the calculation of quantization dimension, it is usually much more difficult to determine whether the lower and the upper quantization coefficients are finite and positive. Let ν be a Borel probability measure on R d with compact support C, and ( p 0 , p 1 , p 2 , , p N ) be a probability vector with p j > 0 for all 1 j N , where N is a positive integer and N 2 . Let S 1 , S 2 , , S N be a family of contractive mappings on R d . Then, there exist a unique Borel probability measure μ on R d and a unique nonempty compact set K satisfying
μ = j = 1 N p j μ S j 1 + p 0 ν and K = j = 1 N S j ( K ) C .
Following [22,23], we call ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) a condensation system. The measure μ is called the attracting measure or the condensation measure for ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , and the set K, which is the support of the measure μ , is called the attractor or invariant set for the system. If each S j is contractive similitude, then such a measure μ is also termed as an inhomogeneous self-similar measure (see [24]). There are several works that have been conducted on the condensation system, for example, L q spectra and Rényi dimensions of inhomogeneous self-similar measures were studied by Olsen-Snigireva, and then by Liszka (see [25,26]). Let μ be a condensation measure on R d associated with a condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , where ν is any Borel probability measure on R d with a compact support. Let K be the attractor of the condensation system, and C be the support of ν . We say that { S 1 ( K ) , S 2 ( K ) , , S N ( K ) , C } satisfies the strong separation condition (SSC) if S 1 ( K ) , S 2 ( K ) , , S N ( K ) , C are pairwise disjointed. On the other hand, { S 1 ( K ) , S 2 ( K ) , , S N ( K ) ,   C } satisfies the inhomogeneous open set condition (IOSC), which is the modified version of the inhomogeneous open set condition proposed in [24], if there exists a bounded nonempty open set U R d such that the following conditions are satisfied: ( i )   j = 1 N S j ( U ) U and S i ( U ) S j ( U ) = for 1 i j N ; ( i i )   K U and C U ; ( i i i )   P ( ( U ) ) = 0 and C S j ( cl ( U ) ) = for all 1 j N . Notice that if { S 1 ( K ) , S 2 ( K ) , , S N ( K ) , C } satisfies the SSC, then it also satisfies the IOSC. Take { S j } j = 1 N as a family of bi-Lipschitz mappings on R d , i.e., there exist 0 < a j b j < 1 , such that a j ρ ( x , y ) ρ ( S j ( x ) , S j ( y ) ) b j ρ ( x , y ) for all 1 j N , and for all x , y R d , we call a j and b j the lower and the upper bi-Lipschitz constants, respectively. For r ( 0 , + ) , let l r , κ r ( 0 , + ) be the unique numbers such that j = 1 N ( p j a j r ) l r r + l r = 1 and j = 1 N ( p j b j r ) κ r r + κ r = 1 , respectively. In [27], Priyadarshi et al. showed that, under the strong separation condition, max { l r , D ̲ r ( ν ) } D ̲ r ( μ ) . Further, let { R d ; g 1 , g 2 , , g M } be an IFS with invariant set C , satisfying the strong open set condition such that ρ ( g i ( x ) , g i ( y ) ) c i ρ ( x , y ) for all x , y R d , where 0 < c i < 1 and 1 i M . For a given probability vector ( q 1 , q 2 , , q M ) , let ν be the invariant measure associated with the IFS { R d ; g 1 , g 2 , , g M } . Then, D ¯ r ( μ ) max { κ r , d r } , where d r is uniquely determined by the relation i = 1 M ( q i c i r ) d r r + d r = 1 . In our recent work [28], by considering the Borel probability measure ν as the image measure of an ergodic measure with bounded distortion on the symbolic space { 1 , 2 , , M } N with support of a conformal set C , , which is a generalization of [27], we have shown that
D ¯ r ( μ ) max { κ r , D r ( ν ) } .
The following problem remains open (also see Remark 1).
Open 1.
Let ν be any Borel probability measure and μ be the condensation measure associated with the condensation system ( { S i } i = 1 N , ( p i ) i = 0 N , ν ) . Then, whether under the strong separation condition,
max { l r , D ̲ r ( ν ) } D ̲ r ( μ ) D ¯ r ( μ ) max { κ r , D ¯ r ( ν ) } ,
is not known yet.
Delineation 1.
In this paper, we estimate the quantization dimension of a condensation system given by ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) . In this regard, in Section 3 and Section 4, we give two examples of condensation measures μ associated with a condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , consisting of contractive similarity mappings S j , with similarity ratios s j for 1 j N such that one takes ν as an infinite discrete distribution on R , and one takes ν as a uniform distribution on R , which is the ‘main result’ of the paper. Notice that in the two examples, we fix r = 2 , and the underlying norm is the Euclidean distance. When r = 2 , and κ r is determined by the relation j = 1 N ( p j s j ) κ r r + κ r , we denote κ r , D r ( μ ) , and D r ( ν ) , respectively, by κ, D ( μ ) , and D ( ν ) . In Section 3, with respect to the squared Euclidean distance, we first determine the optimal sets of n-means, the nth quantization error, and the quantization dimension of an infinite discrete distribution ν with a compact support. For the discrete distribution ν, we see that D ( ν ) = 0 . Then, in Section 3, we also show that D ( μ ) = κ = max { κ , D ( ν ) } , the D ( μ ) -dimensional quantization coefficient does not exist, and the lower and the upper quantization coefficients are finite and positive. In Section 4, we take ν as a uniform distribution with a compact support, determine the optimal sets of n-means, the nth quantization error, and show that D ( μ ) = 1 = D ( ν ) = max { κ , D ( ν ) } , the D ( μ ) -dimensional quantization coefficient does not exist, and the lower and the upper quantization coefficients are finite and positive.

2. Preliminaries

First, we introduce some basic definitions, and then state and prove some lemmas and propositions. By a word ω of length k over the alphabet I : = { 1 , 2 , , N } , we mean ω : = ω 1 ω 2 ω k I k . A word of length zero is called the empty word and is denoted by ∅. The length of a word ω is denoted by | ω | . By I * , it is meant that the set of all words over the alphabet I includes the empty word ∅. For any two words ω : = ω 1 ω 2 ω | ω | and τ : = τ 1 τ 2 τ | τ | in I * , by ω τ , the concatenation of the words ω and τ is meant, i.e., ω τ : = ω 1 ω 2 · ω | ω | τ 1 τ 2 τ | τ | . Let S j be the bi-Lipschitz mappings with the lower and upper bi-Lipschitz constants a j and b j , respectively, for 1 j N , let ( p 0 , p 1 , , p N ) be the probability vector, and let ν be the Borel probability measure on R d with a compact support C in the condensation system. Let K be the attractor of the condensation system as defined before. For ω = ω 1 ω 2 ω k I k , we define
S ω : = S ω 1 S ω k , p ω : = j = 1 k p ω j , and K ω : = S ω ( K ) .
For the empty word ∅ in I * , by S the identity mapping on R is meant. For every n 1 , by iterating, one easily gets,
K = | ω | = n S ω ( K ) k = 0 n 1 | ω | = k S ω ( C ) , and μ = | ω | = n p ω μ S ω 1 + p 0 k = 0 n 1 | ω | = k p ω ν S ω 1 .
We call Γ I * a finite maximal antichain if Γ is a finite set of words in I * , such that every sequence in { 1 , 2 , , N } N is an extension of some word in Γ , but no word of Γ is an extension of another word in Γ .
Proposition 1.
Let r ( 0 , + ) . Further, let l r ( 0 , + ) be defined by j = 1 N ( p j a j r ) l r r + l r = 1 . Then,
max { l r , D ̲ r ( ν ) } D ̲ r ( μ ) and max { l r , D ¯ r ( ν ) } D ¯ r ( μ ) .
Lemma 1
(See, [27] Lemma 3.1). Let r ( 0 , + ) , and let μ be the condensation measure associated with the condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) . Then,
D ̲ r ( ν ) D ̲ r ( μ ) and D ¯ r ( ν ) D ¯ r ( μ ) .
Lemma 2
(See, [27], Proposition 3.2). Assume that the sets S 1 K , , S N K , C satisfy the strong separation condition. Let r ( 0 , + ) . Let l r ( 0 , + ) be defined by j = 1 N ( p j a j r ) l r r + l r = 1 . Let μ be the condensation measure associated with the condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , and e n , r ( μ ) : = V n , r 1 / r ( μ ) . Then, it follows that
lim inf n n e n , r l r ( μ ) > 0 .
Corollary 1.
Lemma 2 implies that l r D ̲ r ( μ ) .
Proof of Proposition 1.
Combining Lemma 1 and Corollary 1, we obtain the proof of the proposition. □
In the condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , if ν is an image measure of an ergodic measure with bounded distortion on the symbolic space { 1 , 2 , , M } N with the support a conformal set C , then under strong separation condition, D ̲ r ( μ ) D ¯ r ( μ ) max { κ r , D r ( ν ) } . For more details see, [28].
Proposition 2
(See, [28], Theorem 1.4). Assume that the sets S 1 K , , S N K , C satisfy the strong separation condition. Let r ( 0 , + ) . Let κ r ( 0 , + ) be defined by j = 1 N ( p j b j r ) κ r r + κ r = 1 . Let C be the conformal set generated by a conformal IFS ( R d ; { g i } i = 1 M ) satisfying the strong separation condition, let ν be the image measure of an ergodic measure with bounded distortion on the code space { 1 , 2 , , M } N with support C , let μ be the condensation measure associated with the condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , and let e n , r ( μ ) : = V n , r 1 / r ( μ ) . Then, it follows that D ̲ r ( μ ) D ¯ r ( μ ) max { κ r , D r ( ν ) } .
Proposition 2 leads us to the following corollory.
Corollary 2.
Let s j : = a j = b j in the above theorem, i.e., if S j are the similarity mappings for 1 j N in the condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) and κ r is uniquely determined by the relation j = 1 N ( p j s j r ) κ r r + κ r = 1 , then D r ( μ ) = max { κ r , D r ( ν ) } .
In the following remark, we examine whether the inequalities
D ̲ r ( μ ) max { κ r , D ̲ r ( ν ) } and D ¯ r ( μ ) max { κ r , D ¯ r ( ν ) }
hold in general for a condensation system ( { S j } j = 1 N , ( p j ) j = 0 N , ν ) , when ν is any Borel probability measure not necessarily obtained by some IFS or an image measure of an ergodic measure. However, we cannot make any conclusive statement regarding their validity. In Section 3 and Section 4, we give two examples in which for r = 2 , both D r ( ν ) and D r ( μ ) exist and satisfy the following relations:
D ̲ r ( μ ) = max { κ r , D ̲ r ( ν ) } and D ¯ r ( μ ) = max { κ r , D ¯ r ( ν ) } .
Remark 1.
Proceeding in a similar way as ([2], Lemma 4.14), we have
V n , r ( μ ) p 0 V n , r ( ν ) + j = 1 N p j s j r V n , r ( μ ) , p 0 V n N + 1 , r ( μ ) + j = 1 N p j s j r V n N + 1 , r ( μ ) ,
where x represents the greatest integer not exceeding x for any real x. Thus, for any s > 0 , we have
( 1 j = 1 N p j s j r ) lim inf n n r / s V n , r ( ν ) lim inf n n r / s V n , r ( μ ) lim sup n n r / s V n , r ( μ ) p 0 2 r / s ( N + 1 ) r / s lim sup n n r / s V n , r ( ν ) + j = 1 N p j s j r 2 r / κ r ( N + 1 ) r / κ r lim sup n n r / s V n , r ( μ ) .
Let s = max { κ r , D ̲ r ( ν ) } , or s = max { κ r , D ¯ r ( ν ) } . Then, from the last inequalities, we see that lim inf n n r / s V n , r ( μ ) and lim sup n n r / s V n , r ( μ ) can either or both be zero, positive, or infinity. Thus, we can not draw any useful conclusion whether the following inequalities are correct:
D ̲ r ( μ ) max { κ r , D ̲ r ( ν ) } , and D ¯ r ( μ ) max { κ r , D ¯ r ( ν ) } .
In the sequel, we will denote the condensation measure as P. Take r = 2 , and consider the condensation system as ( { S 1 , S 2 } , ( 1 3 , 1 3 , 1 3 ) , ν ) on the Euclidean space R , i.e., the condensation measure P is given by P : = 1 3 P S 1 1 + 1 3 P S 2 1 + 1 3 ν , where ν is a Borel probability measure on R with a compact support. We define the two contractive similarity mappings S 1 and S 2 on R as follows: S 1 ( x ) = 1 5 x and S 2 ( x ) = 1 5 x + 4 5 for all x R . Then, for n N , by (1), we have
P = 1 3 n | ω | = n P S ω 1 + k = 0 n 1 1 3 k + 1 | ω | = k ν S ω 1 .
Write J : = [ 0 , 1 ] . For ω = ω 1 ω 2 ω k I k , set J ω : = S ω ( J ) , and C ω : = S ω ( C ) .
The following lemma can easily be proved.
Lemma 3.
Let K be the support of the condensation measure. Then, for any n 1 ,
K ( ω I n J ω ) k = 0 n 1 ( ω I k C ω ) J .
By Equation (2), we can deduce the following lemma.
Lemma 4.
Let g : R R + be Borel measurable and n N . Then,
g ( x ) d P ( x ) = 1 3 n | ω | = n ( g S ω ) ( x ) d P ( x ) + k = 0 n 1 1 3 k + 1 | ω | = k ( g S ω ) ( x ) d ν ( x ) .
The following lemma that appears in [29] is also true.
Lemma 5
(See [29], Lemma 3.7). 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.
In the following two sections, we investigate the quantization for two condensation measures P: in Section 3, P is associated with an infinite discrete distribution ν borrowed from our recent paper [28]; and in Section 4, P is associated with a uniform distribution.

3. Quantization for a Condensation Measure Associated with a Discrete Distribution

Let ν be an infinite discrete distribution with support C : = { a j : j N } , where a j : = 2 5 + 1 5 2 j 1 1 2 j 1 . Notice that C = 2 5 , 1 2 , 11 20 , 23 40 , 47 80 , 19 32 , 191 320 , 383 640 , [ 2 5 , 3 5 ] R . Let the probability mass function of ν be given by f such that
f ( x ) = 1 2 j if x = a j for j N , 0 otherwise .
Set A k : = { a k , a k + 1 , a k + 2 , } , and b k = E ( X : X A k ) , where k N . Then, by the definition of conditional expectation, we see that
b k = j = k a j 1 2 j j = k 1 2 j .
For any Borel measurable function g on R , by g d ν , it is meant that
g d ν = j = 1 g ( a j ) ν ( a j ) = j = 1 g ( a j ) 1 2 j .
Then, E ( ν ) = 7 15 , and V ( ν ) = 8 1575 , where E ( ν ) and V ( ν ) represent the expected value of a random variable with distribution ν , and its variance, respectively. The quantization dimension D ( ν ) of the measure ν exists and equals zero; for more details one can see [28]. In order to compute the quantization dimension of condensation measure P associated with discrete distribution ν , first we give the following lemmas and proposition.
Lemma 6.
Let E ( P ) represent the expected value and V : = V ( P ) represent the variance of the condensation measure P. Then, E ( P ) = 19 39 ,   V = 86,696 777,231 , and for any x 0 R , ( x x 0 ) 2 d P = ( x 0 19 39 ) 2 + V ( P ) .
Proof. 
By Lemmas 4 and 5, we can see that E ( P ) = x d P = 19 39 . Again, x 2 d ν = j = 1 a j 2 1 2 j = 39 175 . We have
x 2 d P = 1 3 ( S 1 ( x ) ) 2 d P + 1 3 ( S 2 ( x ) ) 2 d P + 1 3 x 2 d ν = 1 3 1 5 x 2 d P + 1 3 1 5 x + 4 5 2 d P + 1 3 39 175 = 1 75 x 2 d P + 1 75 x 2 d P + 8 75 x d P + 16 75 + 13 175 ,
which implies x 2 d P = 6953 19 , 929 , and hence, V ( P ) = x 2 d P ( x d P ) 2 = 6953 19 , 929 19 39 2 = 86 , 696 777 , 231 . For any x 0 R , ( x x 0 ) 2 d P = ( x 0 19 39 ) 2 + V ( P ) follows from the standard theory of probability. Thus, the proof of the lemma is complete. □
We now give the following proposition.
Proposition 3.
Let ω I k , k 0 , and let X be the random variable with probability distribution P. Then, E ( X : X J ω ) = S ω ( 19 39 ) , and E ( X : X C ω ) = S ω ( 7 15 ) . Moreover, for any x 0 R and any ω I k , k 0 , we have
J ω ( x x 0 ) 2 d P ( x ) = 1 3 k 1 25 k V + ( S ω ( 19 39 ) x 0 ) 2 , C ω ( x x 0 ) 2 d P ( x ) = 1 3 k + 1 1 25 k V ( ν ) + ( S ω ( 7 15 ) x 0 ) 2 , S ω ( { a 1 , a 2 } ) ( x x 0 ) 2 d P ( x ) = 1 3 k + 1 ( S ω ( a 1 ) x 0 ) 2 1 2 + ( S ω ( a 2 ) x 0 ) 2 1 2 2 , and S ω ( A 3 ) ( x x 0 ) 2 d P ( x ) = 1 3 k + 1 j = 3 ( S ω ( a j ) x 0 ) 2 1 2 j .
Proof. 
By Equation (2), we have P ( J ω ) = 1 3 k and P ( C ω ) = 1 3 k + 1 . Then, by Lemma 4, the proof follows. □
Note 1.
By Lemma 6, it follows that the optimal set of one-mean for the condensation measure P consists of the expected value 19 39 and the corresponding quantization error is the variance V ( P ) of P, i.e., V 1 ( P ) = V ( P ) .

3.1. Essential Lemmas and Propositions

In this subsection, we give some lemmas and propositions that we need to determine the optimal sets of n-means and the nth quantization errors for all n 2 . To determine the quantization error, we will frequently use the formulas given in Expression (3).
Proposition 4
(See [4,6]). Let α be an optimal set of n-means, a α , and M ( a | α ) be the Voronoi region generated by a α . Then, for every a α , ( i )   μ ( M ( a | α ) ) > 0 , ( i i )   μ ( M ( a | α ) ) = 0 , ( i i i )   a = E ( X : X M ( a | α ) ) , and ( i v )   μ-almost means surely the set { M ( a | α ) : a α } forms a Voronoi partition of R d .
Proposition 5.
Let α : = { c 1 , c 2 } be an optimal set of two-means with c 1 < c 2 , and let V 2,1 and V 2,2 , respectively, be the distortion errors contributed by the points c 1 and c 2 . Then, c 1 = 659 2730 , c 2 = 1621 1950 , and the corresponding quantization error is V 2 = V 2 , 1 + V 2 , 2 = 0.0269686 , where V 2 , 1 = 8 , 469 , 163 466 , 338 , 600 and V 2 , 2 = 20 , 536 , 627 2 , 331 , 693 , 000 , respectively, denote the distortion errors due to c 1 and c 2 .
Proof. 
Consider the set of two points β : = { d 1 , d 2 } , where d 1 = E ( X : X J 1 { a 1 , a 2 } ) and d 2 = E ( X : X A 3 J 2 ) , i.e.,
d 1 = 1 P ( J 1 { a 1 , a 2 } ) J 1 x d P + 1 3 ( a 1 1 2 + a 2 1 2 2 ) = 659 2730 ,
and
d 2 = 1 P ( A 3 J 2 ) 1 3 j = 3 a j 1 2 j + J 2 x d P = 1621 1950 .
The distortion error due to the set β is given by
min d β ( x d ) 2 d P = J 1 ( x 659 2730 ) 2 d P + 1 3 ( ( a 1 659 2730 ) 2 1 2 + ( a 2 659 2730 ) 2 1 2 2 + j = 3 ( a j 1621 1950 ) 2 1 2 j + J 2 ( x 1621 1950 ) 2 d P = 499,067 18,505,500 = 0.0269686 .
Since V 2 is the quantization error for two-means, we have V 2 0.0269686 . Let α : = { c 1 , c 2 } be an optimal set of two-means for P. Suppose that 2 5 c 1 . Then,
V 2 J 1 ( x 2 5 ) 2 d P = 47,833 1,494,675 = 0.0320023 > V 2 ,
which leads to a contradiction. So, we can assume that c 1 < 2 5 . Similarly, we can show that 3 5 < c 2 . Since 3 10 1 2 ( c 1 + c 2 ) 7 10 , the Voronoi region of c 1 cannot contain any point from J 2 , and the Voronoi region of c 2 cannot contain any point from J 1 . Suppose that the Voronoi region of c 1 does not contain any point from A 1 . Then, c 1 = E ( X : X J 1 ) = 19 195 , and c 2 = E ( X : X A 2 J 2 ) = 133 195 , and then the distortion error is
J 1 ( x c 1 ) 2 d P + 1 3 j = 1 ( a j c 2 ) 2 1 2 j + J 2 ( x c 2 ) 2 d P = 76,848 2,158,975 = 0.0355947 > V 2 ,
which leads to a contradiction. Similarly, we can show that if the Voronoi region of c 2 does not contain any point from A 1 a contradiction will arise. Thus, we conclude that both the Voronoi regions of c 1 and c 2 contain at least one point from A 1 . Let the Voronoi region of c 1 contain points a 1 , a 2 , , a k from A 1 , and the Voronoi region of c 2 contain { a j : j > k } for some positive integer k 1 . Let F ( k ) be the corresponding distortion error. Then,
F ( k ) = J 1 ( x c 1 ) 2 d P + 1 3 j = 1 k ( a j c 1 ) 2 1 2 j + j = k + 1 ( a j c 2 ) 2 1 2 j + J 2 ( x c 2 ) 2 d P .
Using Calculus, we see that min { F ( k ) : k N } = 499,067 18,505,500 = 0.0269686 , which occurs when k = 2 . This yields the fact that c 1 = E ( X : X J 1 { a 1 , a 2 } ) = 659 2730 , and c 2 = E ( X : X A 3 J 2 ) = 1621 1950 , and the corresponding quantization error is V 2 = V 2,1 + V 2,2 = 499,067 18,505,500 = 0.0269686 , where V 2,1 = J 1 ( x c 1 ) 2 d P + 1 3 j = 1 2 ( a j c 1 ) 2 1 2 j = 8,469,163 466,338,600 , and V 2,2 = 1 3 j = 3 ( a j c 2 ) 2 1 2 j + J 2 ( x c 2 ) 2 d P = 20,536,627 233,1693,000 . Thus, the proof of the proposition is complete. □
Lemma 7.
Let ω I k for k 0 . Then,
J ω 1 S ω ( { a 1 , a 2 } ) ( x S ω ( 659 2730 ) ) 2 d P = 1 75 k V 2,1 , and S ω ( A 3 ) J ω 2 ( x S ω ( 1621 1950 ) ) 2 d P = 1 75 k V 2,2 .
Proof. 
For any ω I k , k 0 , we have
J ω 1 S ω ( { a 1 , a 2 } ) ( x S ω ( 659 2730 ) ) 2 d P = 1 3 k J ω 1 S ω ( { a 1 , a 2 } ) ( x S ω ( 659 2730 ) ) 2 d ( P S ω 1 ) = 1 3 k J 1 { a 1 , a 2 } ( S ω ( x ) S ω ( 659 2730 ) ) 2 d P = 1 3 k 1 25 k J 1 { a 1 , a 2 } ( x 659 2730 ) 2 d P = 1 75 k V 2,1 .
Similarly, S ω ( A 3 ) J ω 2 ( x S ω ( 1621 1950 ) ) 2 d P = 1 75 k V 2,2 . Thus, the proof of the lemma is complete. □
From the above lemma, the following corollary follows.
Corollary 3.
Let ω I k for k 0 . Then, for any a R ,
J ω 1 S ω ( { a 1 , a 2 } ) ( x a ) 2 d P = 1 3 k 1 25 k V 2 , 1 + 7 12 ( S ω ( 659 2730 ) a ) 2 , and S ω ( A 3 ) J ω 2 ( x a ) 2 d P = 1 3 k 1 25 k V 2 , 2 + 5 12 ( S ω ( 1621 1950 ) a ) 2 .
Proposition 6.
Let α : = { a 1 , a 2 , a 3 } be an optimal set of three-means with a 1 < a 2 < a 3 . Then, a 1 = S 1 ( 19 39 ) , a 2 = E ( ν ) = 7 15 , and a 3 = S 2 ( 19 39 ) . The corresponding quantization error is V 3 = 30,232 6,476,925 = 0.00466765 .
Proof. 
Let β : = { S 1 ( 19 39 ) , 7 15 , S 2 ( 19 39 ) } . Then, using (3), we have
min a β ( x a ) 2 d P = J 1 ( x 1 10 ) 2 d P + C ( x 7 15 ) 2 d P + J 2 ( x 9 10 ) 2 d P = 1 3 1 25 V + 1 3 V ( ν ) + 1 3 1 25 V = 30,232 6,476,925 = 0.00466765 .
Since V 3 is the quantization error for three-means, we have 0.00466765 V 3 . Let α : = { c 1 , c 2 , c 3 } be an optimal set of three-means with c 1 < c 2 < c 3 . Since c 1 , c 2 , and c 3 are the expected values of their own Voronoi regions, we have 0 < c 1 < c 2 < c 3 < 1 . Suppose that 1 5 c 1 . Then,
V 3 J 1 ( x 1 5 ) 2 d P = 2488 498,225 = 0.00499373 > V 3 ,
which is a contradiction. So, we can assume that c 1 < 1 5 . We now show that the Voronoi region of c 1 does not contain any point from C. For the sake of contradiction, assume that the Voronoi region of c 1 contains at least one point, say a 1 , from C. Then,
V 3 min { J 1 ( x c 1 ) 2 d P + 1 3 ( a 1 c 1 ) 2 1 2 : 0 < c 1 < 1 5 } = 2,038,879 174,876,975 = 0.0116589 > V 3 ,
which leads to a contradiction. Hence, the Voronoi region of c 1 does not contain any point from C. If c 3 ( 4 5 1 1000 ) , then
V 3 J 2 ( x ( 4 5 1 1000 ) ) 2 d P = 94,007,843 19,929,000,000 = 0.00471714 > V 3 ,
which leads to a contradiction. Hence, ( 4 5 1 1000 ) < c 3 . Suppose that c 2 2 5 . Then, a 9 < 1 2 2 5 + ( 4 5 1 1000 ) < a 10 , and so, we have
V 3 J 1 min c S 1 ( α 2 ) ( x c ) 2 d P + 1 3 j = 1 9 ( a j 2 5 ) 2 1 2 j + J 2 ( x S 2 ( 19 39 ) 2 d P = 1 75 ( V 2 , 1 + V 2 , 2 ) + 1 3 j = 1 9 ( a j 2 5 ) 2 1 2 j + 1 75 V = 1,221,371,823,004,331 244,495,731,916,800,000 = 0.00499547 > V 3 ,
which leads to a contradiction. Hence, we can assume that 2 5 < c 2 . Then, as 1 5 < 1 2 ( c 1 + c 2 ) , the Voronoi region of c 2 does not contain any point from J 1 . Recall that we already proved that the Voronoi region of c 1 does not contain any point from C. Assume that ( 4 5 1 1000 ) < c 3 4 5 . Then, 1 2 ( c 2 + c 3 ) 3 5 implying c 2 6 5 c 3 6 5 ( 4 5 1 1000 ) = 401 1000 < a 2 , and so
V 3 1 3 j = 2 ( a j 0.401 ) 2 1 2 j + J 2 ( x 4 5 ) 2 d P = 310,181,843 39,858,000,000 = 0.00778217 > V 3 ,
which is a contradiction. So, we can assume that 4 5 < c 3 . If the Voronoi region of c 3 contains points form C, we have 1 2 ( c 2 + c 3 ) < 3 5 , implying c 2 6 5 c 3 6 5 4 5 = 2 5 , which leads to a contradiction, as we have seen 2 5 < c 2 . Hence, the Voronoi region of c 3 does not contain any point from C. If 3 5 c 2 , then
V 3 J 1 ( x S 1 ( 19 39 ) ) 2 d P + 1 3 j = 1 ( a j 3 5 ) 2 1 2 j + J 2 min c α 2 ( x c ) 2 d P = 1 75 V + 1 3 j = 1 ( a j 3 5 ) 2 1 2 j + 1 75 ( V 2 , 1 + V 2 , 2 ) = 275,894,407 29,146,162,500 = 0.00946589 > V 3 ,
which gives a contradiction. So, we can assume that c 2 < 3 5 . Then, notice that the Voronoi region of c 2 does not contain any point from J 3 as 4 5 < c 3 < 1 . Hence, we have c 1 = S 1 ( 19 39 ) , c 2 = E ( ν ) = 7 15 , and c 3 = S 2 ( 19 39 ) , and the corresponding quantization error is V 3 = 30,232 6,476,925 = 0.00466765 . Thus, the proof of the proposition is complete. □
Lemma 8.
Let α be an optimal set of four-means. Then, α J 1 , α J 2 , and card ( α C ) = 2 .
Proof. 
The distortion error due to the set β : = { S 1 ( 19 39 ) , S 2 ( 19 39 ) } α 2 ( ν ) is given by
min a β ( x a ) 2 d P = 1 75 V + 1 3 j = 2 ( a j b 2 ) 2 1 2 j + 1 75 V = 185,729 58,292,325 = 0.00318617 .
Since V 4 is the quantization error for four-means, we have V 4 0.00318617 . Let an optimal set of four-means be given by α : = { c 1 , c 2 , c 3 , c 4 } such that c 1 < c 2 < c 3 < c 4 . Since c 1 , c 2 , c 3 , and c 4 are the expected values of their own Voronoi regions, we have 0 < c 1 < c 2 < c 3 < c 4 < 1 . If c 1 1 5 , then
V 4 J 1 ( x 1 5 ) 2 d P = 2488 498,225 = 0.00499373 > V 4 ,
which leads to a contradiction. So, we can assume that c 1 < 1 5 . If c 4 4 5 , then
V 4 J 2 ( x 4 5 ) 2 d P = 6953 1,494,675 = 0.00465185 > V 4 ,
which is a contradiction. So, we can assume that 4 5 < c 4 . Thus, we see that α J 1 , and α J 2 . Assume that α C = . Then, the following cases can arise:
Case 1. c 3 < 2 5 .
Then,
V 4 1 3 j = 1 ( a j 2 5 ) 2 1 2 j + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 271,751 58,292,325 = 0.00466187 > V 4 ,
which is a contradiction.
Case 2. c 2 < 2 5 < 3 5 < c 3 .
First, assume that 7 20 c 2 < 2 5 , and 3 5 < c 3 13 20 . Then, 1 2 ( c 1 + c 2 ) < 1 5 implying c 1 < 2 5 7 20 = 1 20 . Similarly, 1 2 ( c 3 + c 4 ) > 4 5 implying 19 20 < c 4 . Then,
V 4 S 1 ( A 3 ) J 12 ( x 1 20 ) 2 d P + 1 3 j = 1 2 ( a j 2 5 ) 2 1 2 j + 1 3 j = 3 ( a j 3 5 ) 2 1 2 j + J 21 S 1 ( { a 1 , a 2 } ) ( x 19 20 ) 2 d P = 143,519 27,594,000 = 0.00520109 > V 4 ,
which gives a contradiction. Next, assume that 7 20 c 2 < 2 5 , and 13 20 c 3 . Then, c 1 < 1 20 , and a 2 < 1 2 ( 2 5 + 13 20 ) < a 3 , and so
V 4 S 1 ( A 3 ) J 12 ( x 1 20 ) 2 d P + 1 3 j = 1 2 ( a j 2 5 ) 2 1 2 j + 1 3 j = 3 ( a j 13 20 ) 2 1 2 j = 473,663 137,970,000 = 0.00343309 > V 4 ,
which leads to a contradiction. Last, assume that c 2 < 7 20 , and 13 20 < c 3 . Then, as 1 2 ( 7 20 + 13 20 ) = 1 2 , and J 1 min c S 1 ( α 2 ) ( x c ) 2 d P = 1 75 ( V 2 , 1 + V 2 , 2 ) , we have
V 4 1 75 ( V 2 , 1 + V 2 , 2 ) + 1 3 j = 1 2 ( a j 7 20 ) 2 1 2 j + 1 3 j = 3 ( a j 13 20 ) 2 1 2 j = 126,549,001 38,861,550,000 = 0.00325641 > V 4 ,
which is a contradiction.
Case 3. 3 5 < c 2 .
Since c 1 < 1 5 , this is the reflection of Case 1 about the point 1 2 , thus a contradiction arises in this case as well.
Hence, we can conclude that α C . We now show that card ( α C ) = 2 . For the sake of contradiction, assume that card ( α C ) = 1 . Recall that α J 1 , and α J 2 . Thus, either c 2 C , or c 3 C . Without any loss of generality assume that c 3 C . Then, c 2 < 2 5 . The following cases can arise:
Case I. 7 20 c 2 < 2 5 .
Then, 1 2 ( c 1 + c 2 ) < 1 5 implying c 1 < 1 20 , and so
V 4 S 1 ( A 3 ) J 12 ( x 1 20 ) 2 d P + 1 3 V 2 ( ν ) + 1 75 V = 344,484,113 93,267,720,000 = 0.0036935 > V 4 ,
which leads to a contradiction.
Case II. 3 10 c 2 7 20 .
Then, 1 2 ( c 1 + c 2 ) < 1 5 implying c 1 < 1 10 . Moreover, a 1 < 1 2 ( 7 20 + b 2 ) < a 2 . First assume that 2 25 c 1 < 1 10 . Then,
V 4 J 11 ( x 2 25 ) 2 d P + S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + 1 3 ( a 1 7 20 ) 2 1 2 + 1 3 j = 2 ( a j b 2 ) 2 1 2 j + 1 75 V = 152,465,267 46,633,860,000 = 0.00326941 > V 4 ,
which is a contradiction. Next, assume that c 1 2 25 . Then, S 12 ( 3 5 ) < 1 2 ( 2 25 + 3 10 ) < S 122 ( 0 ) , and so
V 4 J 11 ( x S 11 ( 19 39 ) ) 2 d P + S 1 ( C ) ( x 2 25 ) 2 d P + J 121 ( x 2 25 ) 2 d P + S 12 ( C ) ( x 2 25 ) 2 d P + J 122 ( x 3 10 ) 2 d P + 1 3 ( a 1 7 20 ) 2 1 2 + 1 3 j = 2 ( a j b 2 ) 2 1 2 j + 1 75 V = 89,570,473 27,980,316,000 = 0.0032012 > V 4 ,
which leads to a contradiction.
Case III. c 2 3 10 .
Then, a 1 < 1 2 ( 3 10 + b 2 ) < a 2 , and so
V 4 1 3 ( a 1 3 10 ) 2 1 2 + 1 3 j = 2 ( a j b 2 ) 2 1 2 j + 1 75 V = 104,633 31,089,240 = 0.00336557 > V 4 ,
which is a contradiction.
Thus, card ( α C ) = 1 leads to a contradiction. Hence, we can assume that card ( α C ) = 2 . Thus, the proof of the lemma is complete. □
From Lemma 8, the following proposition follows.
Proposition 7.
The set { S 1 ( 19 39 ) , S 2 ( 19 39 ) } α 2 ( ν ) is an optimal set of four-means with quantization error V 4 = 185 , 729 58 , 292 , 325 = 0.00318617 .
We now prove the following proposition.
Proposition 8.
Let n N and n 3 , and let α be an optimal set of n-means. Then, α J 1 , α J 2 , and α C .
Proof. 
By Proposition 6 and Lemma 8, the proposition is true for n = 3 , 4 . We now prove that the proposition is true for n 5 . Consider the set of five points β : = S 1 ( α 2 ) α 2 ( ν ) { S 2 ( 19 39 ) } . The distortion error due to the set β is given by
min c β ( x c ) 2 d P = 1 75 ( V 2 , 1 + V 2 , 2 ) + 1 3 V 2 ( ν ) + 1 75 V = 6,666,323 3,238,462,500 = 0.00205848 .
Since V n is the quantization error for n-means with n 5 , we have V n V 5 0.00205848 . Let α : = { c 1 < c 2 < < c n } be an optimal set of n-means for P. In a similar way as shown in Lemma 8, we can show that α J 1 and α J 2 . For the sake of contradiction, assume that α C = . Let j : = max { i : c i < 2 5 } . Then, c j < 2 5 and c j + 1 > 3 5 . The following cases can arise:
Case 1. 3 10 < c j < 2 5 and 3 5 < c j + 1 < 7 10 .
Then, 1 2 ( c j 1 + c j ) < 1 5 and 1 2 ( c j + 1 + c j + 2 ) > 4 5 , yielding c j 1 < 1 10 and c j + 1 > 9 10 . Thus,
V n S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + 1 3 j = 1 2 ( a j 2 5 ) 2 1 2 j + 1 3 j = 3 ( a j 3 5 ) 2 1 2 j + J 21 S 1 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 1123 459,900 = 0.00244184 > V n ,
which gives a contradiction.
Case 2. 3 10 < c j < 2 5 and 7 10 c j + 1 . Then, c j 1 < 1 10 , and a 2 < 1 2 ( 2 5 + 7 10 ) = a 3 , and so
V n S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + 1 3 j = 1 2 ( a j 2 5 ) 2 1 2 j + 1 3 j = 3 ( a j 7 10 ) 2 1 2 j = 1,834,513 597,870,000 = 0.00306841 > V n ,
which leads to a contradiction.
Case 3. c j 3 10 and 7 10 c j + 1 .
Then, as 1 2 ( 3 10 + 7 10 ) = 1 2 , we have
V n 1 3 ( a 1 3 10 ) 2 1 2 + 1 3 j = 2 ( a j 7 10 ) 2 1 2 j = 41 6300 = 0.00650794 > V n ,
which is a contradiction.
Thus, we see that α C = leads to a contradiction. Hence, we can assume that α C . Thus, the proof of the proposition is complete. □
Lemma 9.
Let α be an optimal set of five-means. Then, α does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) .
Proof. 
Let α : = { c 1 < c 2 < c 3 < c 4 < c 5 } be an optimal set of five means. As shown in the proof of Proposition 8, we have V 5 0.00205848 . First, prove the following claim.
card ( α C ) = 2 .
Since α J 1 and α J 2 , we have card ( α C ) 3 . If card ( α C ) = 3 , then
V 5 J 1 ( x S 1 ( 19 39 ) ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 2 75 V = 173,392 58,292,325 = 0.00297453 > V 5 ,
which is a contradiction. So, we can assume that card ( α C ) 2 . Suppose that card ( α C ) = 1 . Then, the following cases can arise:
Case 1. c 4 C .
Then, c 3 < 2 5 . Assume that 3 10 < c 3 < 2 5 . Then, 1 2 ( c 2 + c 3 ) < 1 5 implying c 2 < 1 10 , and so
V 5 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 25,816,591 11,658,465,000 = 0.00221441 > V 5 ,
which gives a contradiction. Next, assume that c 3 3 10 . Then, a 1 < 1 2 ( 3 10 + b 2 ) < a 2 , and so
V 5 1 3 ( a 1 3 10 ) 2 1 2 + 1 3 j = 2 ( a j b 2 ) 2 1 2 j + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 104,633 31,089,240 = 0.00336557 > V 5 ,
which is a contradiction. Thus, c 4 C leads to a contradiction.
Case 2. c 3 C .
Then, c 2 < 2 5 and 3 5 < c 4 . First, assume that 1 3 < c 2 < 2 5 and 3 5 < c 4 < 2 3 . Then, 1 2 ( c 1 + c 2 ) < 1 5 and 1 2 ( c 4 + c 5 ) > 4 5 implying c 1 < 1 15 and 14 15 < c 5 . Thus,
V 5 S 1 ( A 3 ) J 12 ( x 1 15 ) 2 d P + J 21 S 1 ( { a 1 , a 2 } ) ( x 14 15 ) 2 d P = 32531 10,347,750 = 0.00314378 > V 5 ,
which is a contradiction. Next, assume that 3 10 c 2 1 3 and 3 5 < c 4 < 2 3 . Then, 1 2 ( c 1 + c 2 ) < 1 5 and 1 2 ( c 4 + c 5 ) > 4 5 implying c 1 < 1 10 and 14 15 < c 5 . Moreover, 1 2 ( c 2 + c 3 ) 2 5 yielding c 3 4 5 c 2 4 5 1 3 = 7 15 , and so,
V 5 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + 1 3 ( a 1 7 15 ) 2 1 2 + J 21 S 1 ( { a 1 , a 2 } ) ( x 14 15 ) 2 d P = 3,354,097 1,076,166,000 = 0.00311671 > V 5 ,
which leads to a contradiction. Now, assume that 3 10 c 2 1 3 and 2 3 c 4 7 10 . Then, c 1 < 1 10 and c 5 > 9 10 . Moreover, 1 2 ( c 2 + c 3 ) 2 5 and 1 2 ( c 3 + c 4 ) 3 5 implying a 1 < 7 15 c 3 8 15 < a 3 . Thus, we have
V 5 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + 1 3 ( a 1 7 15 ) 2 1 2 + j = 3 ( a j 8 15 ) 2 1 2 j + J 21 S 1 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 2593 1,103,760 = 0.00234924 > V 5 ,
which is a contradiction. Last, assume that c 2 3 10 and 7 10 c 4 . Then, as 1 2 ( 3 10 + 7 10 ) = 1 2 , we have
V 5 1 3 ( a 1 3 10 ) 2 1 2 + j = 3 ( a j 7 10 ) 2 1 2 j = 1 315 = 0.0031746 > V 5 ,
which gives a contradiction.
Case 3. c 2 C .
This case is similar to Case 1, and similarly shows that a contradiction arises.
Thus, considering all the above possible cases, we can say that card ( α C ) = 1 leads to a contradiction. Hence, we can assume that card ( α C ) = 2 , i.e., the claim is true.
We now show that α does not contain any point from ( 1 5 , 2 5 ) ( 2 5 , 3 5 ) . Recall that α J 1 , α J 2 , and card ( α C ) = 2 . Suppose that α contains a point from ( 1 5 , 2 5 ) . Then, α contains c 2 from ( 1 5 , 2 5 ) . First, assume that 3 10 < c 2 < 2 5 . Then, 1 2 ( c 1 + c 2 ) < 1 5 implying c 1 < 1 10 , and so
V 5 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 25,816,591 11,658,465,000 = 0.00221441 > V 5 ,
which is a contradiction. Next, assume that c 2 3 10 . Then, 1 2 ( c 2 + c 3 ) 2 5 implying c 3 4 5 c 2 4 5 3 10 = 1 2 = a 2 , and so
V 5 1 3 ( a 1 1 2 ) 2 1 2 + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 1,470,799 466,338,600 = 0.00315393 > V 5 ,
which is a contradiction. Hence, α cannot contain any point from ( 1 5 , 2 5 ) . Suppose that α contains a point from ( 3 5 , 4 5 ) . Then, α contains c 4 from ( 3 5 , 4 5 ) . First, assume that 3 5 < c 4 < 7 10 . Then, 1 2 ( c 4 + c 5 ) > 4 5 implying c 5 > 9 10 , and so
V 5 J 1 ( x S 1 ( 19 39 ) ) 2 d P + J 21 S 1 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 26,226,559 11,658,465,000 = 0.00224957 > V 5 ,
which gives a contradiction. Next, assume that 7 10 c 4 . Then, 1 2 ( c 3 + c 4 ) 3 5 implying c 3 6 5 c 4 6 5 7 10 = 1 2 , and so
V 5 J 1 ( x S 1 ( 19 39 ) ) 2 d P + 1 3 j = 3 ( a j 1 2 ) 2 1 2 j + J 2 min c S 2 ( α 2 ) ( x c ) 2 d P = 1 75 V + 1 3 j = 3 ( a j 1 2 ) 2 1 2 j + 1 75 ( V 2 , 1 + V 2 , 2 ) = 130,788,689 58,292,325,000 = 0.00224367 > V 5 ,
which is a contradiction. Hence, α cannot contain any point from ( 3 5 , 4 5 ) . Thus, the proof of the lemma is complete. □
Lemma 10.
Let α be an optimal set of six-means. Then, α does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) .
Proof. 
Consider the set of six points β : = S 1 ( α 2 ) α 2 ( ν ) S 2 ( α 2 ) . The distortion error due to set β is given by
min c β ( x c ) 2 d P = 2 75 ( V 2 , 1 + V 2 , 2 ) + 1 3 V 2 ( ν ) = 13,564,657 14,573,081,250 = 0.000930802 .
Since V 6 is the quantization error for six-means, we have V 6 0.000930802 . Let α : = { c 1 < c 2 < < c 6 } be an optimal set of six-means.
First, prove the following claim.
card ( α C ) = 2 .
Since α J 1 and α J 2 , we have card ( α C ) 4 . If card ( α C ) = 4 , then
V 6 J 1 ( x S 1 ( 19 39 ) ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 2 75 V = 173,392 58,292,325 = 0.00297453 > V 6 ,
which is a contradiction. Assume that card ( α C ) = 3 . Recall that α J 1 , and α J 2 . First, assume that α does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) . Then, either α contains two points from J 1 and one point from J 2 , or α contains one point from J 1 and two points from J 2 . In any case, we have the distortion error as
1 75 ( V 2 , 1 + V 2 , 2 ) + 1 3 V 3 ( ν ) + 1 75 V = 109,198,939 58,292,325,000 = 0.0018733 > V 6 ,
which is a contradiction. Next, assume that α contains a point from the set ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) . First assume that α contains the point from the open interval ( 1 5 , 2 5 ) . Then, c 2 ( 1 5 , 2 5 ) . The following two cases can arise:
Case 1. 3 10 c 2 < 2 5 .
Then, 1 2 ( c 1 + c 2 ) < 1 5 , implying c 1 < 1 10 , and so
V 6 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 25,816,591 11,658,465,000 = 0.00221441 > V 6 ,
which is a contradiction.
Case 2. 1 5 < c 2 3 10 .
Then, 1 2 ( c 2 + c 3 ) > 2 5 implying c 4 > 4 5 c 2 4 5 3 10 = 1 2 , and so
V 6 1 3 ( a 1 1 2 ) 2 1 2 + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 1,470,799 466,338,600 = 0.00315393 > V 6 ,
which gives a contradiction.
Similarly, we can show that if α contains the point from the open interval ( 3 5 , 4 5 ) , a contradiction arises. Hence, we can assume that card ( α C ) 2 . Suppose that card ( α C ) = 1 . Then, the following cases can arise:
Case A. α does not contain any point from the set ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
Then, V 6 1 3 V 1 ( ν ) = 1 3 V ( ν ) = 8 4725 = 0.00169312 > V 6 , which leads to a contradiction.
Case B. α contains only one point from the set ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
In this case, the following subcases can arise:
Subcase (i). c 1 , c 2 , c 3 J 1 .
Then, c 4 ( 1 5 , 2 5 ) , c 5 C , and c 6 J 2 ; or c 4 C , c 5 ( 3 5 , 4 5 ) , and c 6 J 2 . First, assume that c 4 ( 1 5 , 2 5 ) , c 5 C , and c 6 J 2 . Suppose that 3 10 < c 4 < 2 5 . Then, 1 2 ( c 3 + c 4 ) < 1 5 , implying c 3 < 2 5 c 4 1 10 , and hence,
V 6 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 25,816,591 11,658,465,000 = 0.00221441 > V 6 ,
which is a contradiction. Suppose that 1 5 < c 4 3 10 . Then, 1 2 ( c 4 + c 5 ) 2 5 , implying c 5 1 2 , and so
V 6 1 3 ( a 1 1 2 ) 2 1 2 + J 2 ( x S 2 ( 19 39 ) ) 2 d P = 1,470,799 466,338,600 = 0.00315393 > V 6 ,
which yields a contradiction. Similarly, we can show that if c 4 C , c 5 ( 3 5 , 4 5 ) , and c 6 J 2 , a contradiction arises.
Subcase (ii). c 1 , c 2 , J 1 .
Then, c 3 ( 1 5 , 2 5 ) , c 4 C , c 5 , c 6 J 2 ; or c 3 C , c 4 ( 3 5 , 4 5 ) , and c 5 , c 6 J 2 . First, assume that c 3 ( 1 5 , 2 5 ) , c 4 C , c 5 , c 6 J 2 . Suppose that 3 10 < c 3 < 2 5 . Then, 1 2 ( c 2 + c 3 ) < 1 5 , implying c 2 < 2 5 c 3 1 10 , and hence,
V 6 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 min c S 2 ( α 2 ) ( x c ) 2 d P = 7,038,641 6,476,925,000 = 0.00108673 > V 6 ,
which is a contradiction. Suppose that 1 5 < c 3 3 10 . Then, 1 2 ( c 3 + c 4 ) 2 5 implying c 4 1 2 , and so
V 6 1 3 ( a 1 1 2 ) 2 1 2 + J 2 min c S 2 ( α 2 ) ( x c ) 2 d P = 5,624,509 2,775,825,000 = 0.00202625 > V 6 ,
which yields a contradiction. Similarly, we can show that if c 3 C , c 4 ( 3 5 , 4 5 ) , and c 5 , c 6 J 2 , a contradiction arises.
Subcase (iii). c 1 J 1 .
This case is the reflection of Subcase (i) about the point 1 2 , and thus a contradiction also arises in this case.
Case C. α contains two points from the set ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
By Proposition 4, α contains one point from ( 1 5 , 2 5 ) and one point from ( 3 5 , 4 5 ) . Without any loss of generality, we can assume that c 1 , c 2 J 1 , c 3 ( 1 5 , 2 5 ) , c 4 C , c 5 ( 3 5 , 4 5 ) , and c 6 J 6 . Then, we can also show that it leads to a contradiction.
Thus, we can assume that card ( α C ) = 2 , which is the claim.
We now show that α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) . For the sake of contradiction, first assume that α contains a point from ( 1 5 , 2 5 ) , and does not contain any point from ( 3 5 , 4 5 ) . Suppose that c 1 , c 2 J 1 , c 3 ( 1 5 , 2 5 ) , c 4 , c 5 C , and c 6 J 2 , and then
V 6 J 2 ( x S 2 ( 19 39 ) ) 2 d P = 86,696 58,292,325 = 0.00148726 > V 6 ,
which is a contradiction. Suppose that c 1 J 1 , c 2 ( 1 5 , 2 5 ) , c 3 , c 4 C , and c 5 , c 6 J 2 . Then, either 3 10 c 2 < 2 5 , or 1 5 < c 2 3 10 . First, assume that 3 10 c 2 < 2 5 . Then, 1 2 ( c 1 + c 2 ) < 1 5 implies c 1 1 10 , and so
V 6 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 2 min c S 2 ( α 2 ) ( x c ) 2 d P = 7,038,641 6,476,925,000 = 0.00108673 > V 6 ,
which leads to a contradiction. Next, assume that 1 5 < c 2 3 10 . Then, 1 2 ( c 2 + c 3 ) > 2 5 , implying c 3 > 4 5 c 2 4 5 3 10 = 1 2 > a 1 , and so
V 6 1 3 ( a 1 1 3 ) 2 1 2 + J 2 min c S 2 ( α 2 ) ( x c ) 2 d P = 5,624,509 2,775,825,000 = 0.00202625 > V 6 ,
which is a contradiction. Likewise, we can show that if α contains a point from ( 3 5 , 4 5 ) , and does not contain any point from ( 1 5 , 2 5 ) , a contradiction arises.
Next, assume that α contains a point from ( 1 5 , 2 5 ) and a point from ( 3 5 , 4 5 ) . Then, we have c 1 J 1 , c 2 ( 1 5 , 2 5 ) , c 3 , c 4 C , c 5 ( 3 5 , 4 5 ) , and c 6 J 2 . Then, the following cases can arise:
Case I. 3 10 c 2 < 2 5 and 3 5 < c 5 7 10 .
Then, 1 2 ( c 1 + c 2 ) < 1 5 and 1 2 ( c 5 + c 6 ) > 4 5 , implying c 1 < 1 10 and c 6 > 9 10 . Thus,
V 6 S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P + J 21 S 2 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 137 91,980 = 0.00148945 > V 6 ,
which leads to a contradiction.
Case II. 1 5 < c 2 3 10 and 3 5 < c 5 7 10 .
Then, 1 2 ( c 2 + c 3 ) > 2 5 , implying c 3 > 4 5 c 2 4 5 3 10 = 1 2 > a 1 , and c 6 > 9 10 . Thus,
V 6 1 3 ( a 1 1 3 ) 2 1 2 + J 21 S 2 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 363,053 149,467,500 = 0.00242898 > V 6 ,
which is a contradiction.
Case III. 1 5 < c 2 3 10 and 7 10 c 5 < 4 5 .
Then, 1 2 ( c 2 + c 3 ) 2 5 and 1 2 ( c 4 + c 5 ) 3 5 , implying c 3 1 2 and c 4 1 2 , which leads to a contradiction because c 3 < c 4 .
Thus, we can conclude that α does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) , which is the lemma. □
Proposition 9.
Let α n be an optimal set of n-means for all n 3 . Then, α n does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) .
Proof. 
By Proposition 6 and Lemmas 8–10, the proposition is true for n = 3 , 4 , 5 , 6 . Proceeding in the similar way as Lemma 10, we can show that the proposition is true for n = 7 . We now show that the proposition is true for all n 8 . Consider the set of eight points β : = S 1 ( α 3 ) α 2 ( ν ) S 2 ( α 3 ) . The distortion error due to set β is given by
min c β ( x c ) 2 d P = 1 75 2 V + 1 3 1 75 V ( ν ) + 1 75 2 V + 1 3 V 2 ( ν ) + 1 75 2 V + 1 3 1 75 V ( ν ) + 1 75 2 V = 489,817 1,457,308,125 = 0.000336111 .
Since V n is the quantization error for n-means with n 8 , we have V n V 8 0.000633457 . Let α : = { c 1 < c 2 < < c n } be an optimal set of n-means for P. Suppose that α contains a point from the open interval ( 1 5 , 2 5 ) . Let j : = max { i : c i < 2 5 } . Then, 1 5 < c j < 2 5 . The following cases can arise:
Case 1. 3 10 < c j < 2 5 .
Then, 1 2 ( c j 1 + c j ) < 1 5 , implying c j 1 < 2 5 3 10 = 1 10 , and so
V n S 1 ( A 3 ) J 12 ( x 1 10 ) 2 d P = 217,369 298,935,000 = 0.000727145 > V n ,
which leads to a contradiction.
Case 2. 1 5 c j 3 10 .
Then, 1 2 ( c j + c j + 1 ) > 2 5 , implying c j + 1 > 4 5 c j 4 5 3 10 = 1 2 , and so
V n 1 3 ( a 1 1 2 ) 2 1 2 = 1 600 = 0.00166667 > V n ,
which gives a contradiction.
Hence, we can say that α does not contain any point from ( 2 5 , 3 5 ) . Suppose that α contains a point from ( 3 5 , 4 5 ) . Let j : = min { i : 3 5 < c i } . Then, 3 5 < c j < 4 5 . The following cases can arise:
Case I. 3 5 < c j < 7 10 .
Then, 1 2 ( c j + c j + 1 ) > 4 5 , implying c j + 1 > 8 5 7 10 = 9 10 , and so
V n J 21 S 2 ( { a 1 , a 2 } ) ( x 9 10 ) 2 d P = 227,881 298,935,000 = 0.00076231 > V n ,
which leads to a contradiction.
Case II. 7 10 c j < 4 5 .
Then, 1 2 ( c j 1 + c j ) < 3 5 , implying c j 1 < 6 5 c j 6 5 7 10 = 1 2 < a 2 , and so
V n 1 3 j = 2 ( a j 1 2 ) 2 1 2 j = 1 2520 = 0.000396825 > V n ,
which is a contradiction.
Hence, α does not contain any point from the open interval ( 3 5 , 4 5 ) . This completes the proof of the proposition. □

3.2. Optimal Sets and the Quantization Error for a Given Sequence F ( n )

In this subsection, we first define the two sequences { a ( n ) } n 1 and { F ( n ) } n 1 . These two sequences play important roles in this section.
Definition 1.
Define the sequence { a ( n ) } n 1 such that a ( n ) = 2 n for all n 1 . Define the sequence { F ( n ) } n 1 such that F ( n ) = 5 · 2 n 2 n 4 , i.e.,
{ F ( n ) } n 1 = { 4 , 12 , 30 , 68 , 146 , 304 , 622 , 1260 , 2538 , 5096 , 10 , 214 , 20 , 452 , 40 , 930 , } .
Note 2.
Let { a ( n ) } n 1 and { F ( n ) } n 1 be the sequences defined by Definition 1. Then, notice that F ( n + 1 ) = a ( n + 1 ) + 2 F ( n ) . For n = 1 , we set α F ( 1 ) : = α a ( 1 ) ( ν ) { S 1 ( 19 39 ) , S 2 ( 19 39 ) } , and for n 2 , we set α F ( n ) : = α a ( n ) ( ν ) S 1 ( α F ( n 1 ) ) S 2 ( α F ( n 1 ) ) . Then, inductively, we have
α F ( n ) = α a ( n ) ω I S ω ( α a ( n 1 ) ( ν ) ) ω I 2 S ω ( α a ( n 2 ) ( ν ) ) ω I n 1 S ω ( α a ( 1 ) ( ν ) ) { S ω ( 19 39 ) : ω I n } .
Notice that the set α F ( n ) satisfies α F ( n + 1 ) = S 1 ( α F ( n ) ) α a ( n + 1 ) ( ν ) α F ( n ) . We will show that α F ( n ) is an optimal set of F ( n ) -means for P. For n N , we identify the sequence of sets α a ( n ) ( ν ) , ω I S ω ( α a ( n 1 ) ( ν ) ) , ω I 2 S ω ( α a ( n 2 ) ( ν ) ) , , ω I n 2 S ω ( α a ( 2 ) ( ν ) ) , ω I n 1 S ω ( α a ( 1 ) ( ν ) ) , and { S ω ( 19 39 ) : ω I n } , respectively, by S ( n ) , S ( n 1 ) , S ( n 2 ) , ⋯, S ( 2 ) , S ( 1 ) , and S ( n + 1 ) . For 1 n , and we write
S ( 2 ) ( ) : = ω I n S ω ( α a ( ) + 1 ( ν ) ) and S ( 2 ) ( 2 ) ( ) : = ω I n S ω ( α a ( ) + 2 ( ν ) ) = ω I n S ω ( α a ( + 1 ) ( ν ) ) .
Further, we write
S ( 2 ) ( n + 1 ) : = ω I n S ω ( α 2 ( P ) ) = ω I n { S ω ( 659 2730 ) , S ω ( 1621 1950 ) } , S ( 2 ) ( 2 ) ( n + 1 ) : = ω I n S ω ( α 1 ( ν ) ) { S ω ( 19 39 ) : ω I n + 1 } , and S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) : = ω I n S ω ( α a ( 1 ) ( ν ) ) { S ω ( 19 39 ) : ω I n + 1 } .
Moreover, for any N , if A : = S ( ) , we identify S ( 2 ) ( ) , S ( 2 ) ( 2 ) ( ) , and S ( 2 ) ( 2 ) ( 2 ) ( ) , respectively, by A ( 2 ) , A ( 2 ) ( 2 ) , and A ( 2 ) ( 2 ) ( 2 ) . For n N , set
S F ( n ) : = { S ( n ) , S ( n 1 ) , S ( n 2 ) , , S ( 1 ) , S ( n + 1 ) } .
In addition, write
S F * ( n ) : = { S ( n ) , S ( n 1 ) , S ( n 2 ) , , S ( 1 ) , S ( n + 1 ) , S ( 2 ) ( n ) , S ( 2 ) ( n 1 ) , S 2 ) ( n 2 ) , , S ( 2 ) ( 1 ) , S ( 2 ) ( n + 1 ) , S ( 2 ) ( 2 ) ( n ) , S ( 2 ) ( 2 ) ( n 1 ) , , S ( 2 ) ( 2 ) ( 1 ) , S ( 2 ) ( 2 ) ( n + 1 ) , S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) } .
For any element a A S F * ( n ) , by the Voronoi region of a it is meant the Voronoi region of a with respect to the set B S F * ( n ) B . Similarly, for any a A S F ( n ) , by the Voronoi region of a it is meant the Voronoi region of a with respect to the set B S F ( n ) B . Notice that if a , b A , where A S F ( n ) or A S F * ( n ) except the sets S ( 2 ) ( n + 1 ) , S ( 2 ) ( 2 ) ( n + 1 ) , and S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) , the error contributed by a in the Voronoi region of a equals to the error contributed by b in the Voronoi region of b. On the other hand, each of S ( 2 ) ( n + 1 ) , S ( 2 ) ( 2 ) ( n + 1 ) , and S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) contains two different sets: the error in the Voronoi region of an element in one set is larger than the error in the Voronoi region of an element in the other set. Let us now define an order ≻ on the set S F * ( n ) as follows: for A , B S F * ( n ) by A B , it is meant that the error contributed by any element a A in the Voronoi region of a is greater or equal to the error contributed by any element b B in the Voronoi region of b. Similarly, we define the order relation ≻ on the set S F ( n ) .
Remark 2.
Let α F ( n ) be the set defined by (4). Then,
α F ( n + 1 ) = S ( 2 ) ( 2 ) ( 1 ) S ( 2 ) ( 2 ) ( 2 ) S ( 2 ) ( 2 ) ( 3 ) S ( 2 ) ( 2 ) ( n ) S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) .
Remark 3.
Take any 1 < n . The distortion errors due to any element in the sets S ( 2 ) ( 2 ) ( + 1 ) and S ( 2 ) ( 2 ) ( ) are, respectively, 1 3 1 75 n ( + 1 ) V a ( + 2 ) ( ν ) = 1 3 1 75 n ( + 1 ) 2 6 6 1575 and 1 3 1 75 n V a ( + 1 ) ( ν ) = 1 3 1 75 n 2 6 1575 . Notice that
1 3 1 75 n ( + 1 ) 2 6 6 1575 > 1 3 1 75 n 2 6 1575 ,
and so, S ( 2 ) ( 2 ) ( n ) S ( 2 ) ( 2 ) ( n 1 ) S ( 2 ) ( 2 ) ( n 2 ) S ( 2 ) ( 2 ) ( 2 ) S ( 2 ) ( 2 ) ( 1 ) . Similarly, S ( 2 ) ( n ) S ( 2 ) ( n 1 ) S ( 2 ) ( n 2 ) S ( 2 ) ( 2 ) S ( 2 ) ( 1 ) , and S ( n ) S ( n 1 ) S ( n 2 ) S ( 2 ) S ( 1 ) .
Lemma 11.
Let n be a large positive integer, in fact, n 40 . Then, the following inequalities are true:
( i ) If 2 < n k < n k + 26 n , then S ( n k ) S ( 2 ) ( n k + 13 ) S ( 2 ) ( 2 ) ( n k + 26 ) S ( n k 1 ) ,
( i i )   S ( 14 ) S ( 2 ) ( 27 ) S ( 2 ) ( 2 ) ( 40 ) S ( n + 1 ) S ( 13 ) .
( i i i )   S ( 5 ) S ( 2 ) ( 18 ) S ( 2 ) ( 2 ) ( 31 ) S ( 2 ) ( n + 1 ) S ( 4 ) .
( i v )   S ( 2 ) ( 2 ) ( 13 ) S ( 2 ) ( 2 ) ( n + 1 ) S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) S ( 2 ) ( 2 ) ( 12 ) .
Proof. 
Let 2 < n k < n k + 26 n . Then, S ( n k ) S ( 2 ) ( n k + 13 ) S ( 2 ) ( 2 ) ( n k + 26 ) S ( n k 1 ) will be true if
1 3 1 75 k V a ( n k ) ( ν ) > 1 3 1 75 k 13 V a ( n k + 13 ) + 1 ( ν ) > 1 3 1 75 k 26 V a ( n k + 26 ) + 2 ( ν ) > 1 3 1 75 k + 1 V a ( n k 1 ) ( ν ) ,
i.e., if
V a ( n k ) ( ν ) > 75 13 V a ( n k + 13 ) + 1 ( ν ) > 75 26 V a ( n k + 26 ) + 2 ( ν ) > 1 75 V a ( n k 1 ) ( ν ) .
By putting the values of V a ( n k ) ( ν ) , V a ( n k + 13 ) + 1 ( ν ) , V a ( n k + 26 ) + 2 ( ν ) , and V a ( n k 1 ) ( ν ) , we see that the inequalities in (5) are clearly true. Thus, the proof of ( i ) is complete.
By ( i ) , we know that S ( 14 ) S ( 2 ) ( 27 ) S ( 2 ) ( 2 ) ( 40 ) . Thus, to prove ( i i ) it is enough to prove that S ( 2 ) ( 2 ) ( 40 ) S ( n + 1 ) S ( 13 ) , which is true if
1 3 1 75 n 40 V a ( 40 ) + 2 ( ν ) > 1 75 n V > 1 3 1 75 n 13 V a ( 13 ) ( ν ) .
By putting the values of V a ( 40 ) + 2 ( ν ) , V, and V a ( 13 ) ( ν ) , we see that the inequalities in (6) are clearly true. Thus, the proof of ( i i ) is complete. Similarly, we can prove the inequalities in ( i i i ) and ( i v ) . Thus, the lemma is yielded. □
Remark 4.
By Remark 3 and Lemma 11, for any large positive integer n, in fact, if n 40 , it follows that
S ( n ) S ( n 1 ) S ( n 13 ) S ( 2 ) ( n ) S ( n 14 ) S ( 2 ) ( n 1 ) S ( n 15 ) S ( 2 ) ( n 2 ) S ( n 16 ) S ( n 26 ) S ( 2 ) ( n 13 ) S ( 2 ) ( 2 ) ( n ) S ( n 27 ) S ( 14 ) S ( 2 ) ( 27 ) S ( 2 ) ( 2 ) ( 40 ) S ( n + 1 ) S ( 13 ) S ( 2 ) ( 26 ) S ( 2 ) ( 2 ) ( 39 ) S ( 12 ) S ( 5 ) S ( 2 ) ( 18 ) S ( 2 ) ( 2 ) ( 31 ) S ( 2 ) ( n + 1 ) S ( 4 ) S ( 2 ) ( 17 ) S ( 2 ) ( 2 ) ( 30 ) S ( 3 ) S ( 1 ) S ( 2 ) ( 14 ) S ( 2 ) ( 2 ) ( 27 ) S ( 2 ) ( 13 ) S ( 2 ) ( 2 ) ( 26 ) S ( 2 ) ( 12 ) S ( 2 ) ( 2 ) ( 25 ) S ( 2 ) ( 1 ) S ( 2 ) ( 2 ) ( 14 ) S ( 2 ) ( 2 ) ( 13 ) S ( 2 ) ( 2 ) ( n + 1 ) S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) S ( 2 ) ( 2 ) ( 12 ) S ( 2 ) ( 2 ) ( 11 ) S ( 2 ) ( 2 ) ( 10 ) S ( 2 ) ( 2 ) ( 1 ) .
Lemma 12.
For any two sets A , B S F ( n ) , let A B . Then, the distortion error due to the set ( S F ( n ) A ) A ( 2 ) B is less than the distortion error due to the set ( S F ( 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 ( k ) and B = S ( k ) for some 1 k , k n . Then, A B implies k > k . The distortion error due to the set ( α F ( n ) A ) A ( 2 ) B is given by
V ( α F ( n ) ) 1 3 ( 2 75 ) n k V a ( k ) ( ν ) + 1 3 ( 2 75 ) n k V a ( k ) + 1 ( ν ) + 1 3 ( 2 75 ) n k V a ( k ) ( ν ) = V ( α F ( n ) ) 56 3 ( 2 75 ) n k 2 6 k 1575 + 64 3 ( 2 75 ) n k 2 6 k 1575 .
Similarly, the distortion error due to the set ( α F ( n ) B ) B ( 2 ) A is
V ( α F ( n ) ) 56 3 ( 2 75 ) n k 2 6 k 1575 + 64 3 ( 2 75 ) n k 2 6 k 1575 .
Thus, (7) will be less than (8) if 75 128 k < 75 128 k , which is clearly true since k > k . As mentioned in Remark 4, assume that S ( 14 ) S ( n + 1 ) S ( 13 ) . Take A = S ( 14 ) , and B = S ( 13 ) . Here, A B . Proceeding as before, it can also be seen that 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 . Similarly, we can show it for any two sets A , B S F ( n ) with A B . Thus, the lemma is yielded. □
Let us now state the following lemma. The proof is similar to the proof of Lemma 12.
Lemma 13.
For any two sets A , B S F * ( n ) , let A B . Then, the distortion error due to the set ( S F * ( n ) A ) A ( 2 ) B is less than the distortion error due to the set ( S F * ( n ) B ) B ( 2 ) A .
Proposition 10.
For n 1 , let α F ( n ) be the set defined by Note 2. Then, α F ( n ) forms an optimal set of F ( n ) -means for P and the corresponding quantization error is given by
V F ( n ) = 769,208 5,884,749 ( 2 75 ) n 64 3339 ( 1 64 ) n
Proof. 
We see that α F ( 1 ) = α a ( 1 ) ( ν ) { S ω ( 19 39 ) : ω I } , which by Proposition 7 is an optimal set of four-means for P. Thus, the proposition is true for n = 1 . Let α F ( n ) be an optimal set of F ( n ) -means for some n 1 . We now show that α F ( n + 1 ) is an optimal set of F ( n + 1 ) -means. We have α F ( n ) = A S F ( n ) A . Recall that, by Proposition 9, an optimal set of n-means for any n 3 does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) . In the first step, let A ( 1 ) S F ( n ) be such that A ( 1 ) B for any other B S F ( n ) . Then, by Lemma 12, 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 second step, let A ( 2 ) ( S F ( n ) { A ( 1 ) } ) { A ( 2 ) ( 1 ) } be such that A ( 2 ) B for any other set B ( S F ( n ) { A ( 1 ) } ) { A ( 2 ) ( 1 ) } . Then, using the similar technique as Lemma 12, we can show that the distortion error is due to the following set:
( ( α F ( n ) A ( 1 ) ) A ( 2 ) ( 1 ) ) A ( 2 ) A ( 2 ) ( 2 )
where 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 the set B. In other words, ( ( α F ( n ) A ( 1 ) ) A ( 2 ) ( 1 ) ) A ( 2 ) 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, we can see that the set α F ( n + 1 ) = S ( 2 ) ( 2 ) ( 1 ) S ( 2 ) ( 2 ) ( 2 ) S ( 2 ) ( 2 ) ( 3 ) S ( 2 ) ( 2 ) ( n ) S ( 2 ) ( 2 ) ( 2 ) ( n + 1 ) forms an optimal set of F ( n + 1 ) -means. Thus, by the induction principle, we can say that for any n 1 , the set α F ( n ) forms an optimal set of F ( n ) -means for the condensation measure P. The corresponding quantization error is given by
V F ( n ) = 1 3 V a ( n ) ( ν ) + ( 2 75 ) V a ( n 1 ) ( ν ) + ( 2 75 ) 2 V a ( n 2 ) ( ν ) + + ( 2 75 ) n 1 V a ( 1 ) ( ν ) + ( 2 75 ) n V = 1 3 1 1575 1 64 n 1 + ( 2 75 ) 1 64 n 2 + ( 2 75 ) 2 1 64 n 3 + + ( 2 75 ) n 2 1 64 + ( 2 75 ) n 1 + ( 2 75 ) n V ,
which after simplification implies that
V F ( n ) = 64 3339 ( 2 75 ) n ( 1 64 ) n + ( 2 75 ) n V = 769,208 5,884,749 ( 2 75 ) n 64 3339 ( 1 64 ) n .
Thus, the proof of the proposition is complete. □
We now prove the following proposition.
Proposition 11.
Let n N be large. Then, the set
α F ( n ) k = 18 n S ( k ) S ( n + 1 ) k = 31 n S ( 2 ) ( 2 ) ( k ) k = 18 30 S ( 2 ) ( k ) S ( 2 ) ( n + 1 )
forms an optimal set of 2 n 6 + 2 30 ( 2 13 + 1 ) 2 n 6 -means for P and the corresponding quantization error is given by
V 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 = V F ( n ) 128 3975 ( 2 75 ) n ( 75 128 ) 31 ( 75 128 ) n + 1 1024 35,775 ( 2 75 ) n ( 75 128 ) 18 ( 75 128 ) 31 450,241 5,323,500 ( 2 75 ) n .
Proof. 
Due to Remark 4, Lemma 13, using the similar technique as Proposition 10, we can show that the set given by (10) is an optimal set. Recall the definitions of S ( k ) , S ( 2 ) ( k ) , S ( 2 ) ( 2 ) ( k ) , S ( n + 1 ) , and S ( 2 ) ( n + 1 ) . Thus, for 31 k n , in a set when S ( k ) is replaced by S ( 2 ) ( 2 ) ( k ) , we are removing 2 n k · a ( k ) elements, and adding 2 n k · ( a ( k ) + 2 ) elements to the set leading to the number of elements increased by 2 n k · 2 , and the quantization error is decreased by 1 3 ( 2 75 ) n k ( V a ( k ) ( ν ) V a ( k ) + 2 ( ν ) ) . For 18 k 30 , when S ( k ) is replaced by S ( 2 ) ( k ) in a set, we are removing 2 n k a ( k ) elements, and adding 2 n k · ( a ( k ) + 1 ) elements to the set, leading to the number of elements in the set being increased by 2 n k , and the quantization error being decreased by 1 3 ( 2 75 ) n k ( V a ( k ) ( ν ) V a ( k ) + 1 ( ν ) ) . When S ( n + 1 ) is replaced by S ( 2 ) ( n + 1 ) , the number of elements in the set is increased by 2 n , and the quantization error is decreased by ( V ( V 2 , 1 + V 2 , 2 ) ) . Thus, the cardinality of the set (10) is given by
F ( n ) + 2 k = 31 n 2 n k + k = 18 30 2 n k + 2 n = F ( n ) + 2 ( 2 n 30 1 ) + 2 n 30 ( 2 13 1 ) + 2 n = ( 5 · 2 n 2 n 4 ) + 2 n 30 ( 2 13 + 1 ) + 2 n 2 = 2 n 6 + 2 30 ( 2 13 + 1 ) 2 n 6 .
The corresponding quantization error is
V F ( n ) 1 3 k = 31 n ( 2 75 ) n k ( V a ( k ) ( ν ) V a ( k ) + 2 ( ν ) ) 1 3 k = 18 30 ( 2 75 ) n k ( V a ( k ) ( ν ) V a ( k ) + 1 ( ν ) ) ( 2 75 ) n ( V ( V 2 , 1 + V 2 , 2 ) ) = V F ( n ) 1 75 ( 2 75 ) n k = 31 n ( 75 128 ) k 8 675 ( 2 75 ) n k = 18 30 ( 75 128 ) k 450,241 5,323,500 ( 2 75 ) n = V F ( n ) 128 3975 ( 2 75 ) n ( 75 128 ) 31 ( 75 128 ) n + 1 1024 35,775 ( 2 75 ) n ( 75 128 ) 18 ( 75 128 ) 31 450,241 5,323,500 ( 2 75 ) n .

3.3. Asymptotics for the nth Quantization Error V n ( P )

In this subsection, we show that the quantization dimension D ( P ) of the condensation measure P exists, the quantization coefficient does not exist, and the D ( P ) -dimensional lower and upper quantization coefficients are finite and positive.
Theorem 1.
Let P be the condensation measure associated with the self-similar measure ν and κ be the unique number given by ( 1 3 ( 1 5 ) 2 ) κ 2 + κ + ( 1 3 ( 1 5 ) 2 ) κ 2 + κ = 1 . Then, lim n 2 log n log V n ( P ) = κ , i.e., the quantization dimension D ( P ) of the measure P exists and equals κ.
Proof.
( 1 3 ( 1 5 ) 2 ) κ 2 + κ + ( 1 3 ( 1 5 ) 2 ) κ 2 + κ = 1 implies κ = 2 log 2 log 75 log 2 . For n N , let ( n ) be the least positive integer such that F ( ( n ) ) n < F ( ( n ) + 1 ) . Then, V F ( ( n ) + 1 ) < V n V F ( ( n ) ) . Thus, we have
2 log F ( ( n ) ) log V F ( ( n ) + 1 ) < 2 log n log V n < 2 log F ( ( n ) + 1 ) log V F ( ( n ) ) .
Notice that when n , then ( n ) . Recall that F ( ( n ) ) = 5 · 2 ( n ) 2 ( n ) 4 , and so we have
lim ( n ) 2 log F ( ( n ) ) log V F ( ( n ) + 1 ) = 2 lim ( n ) log 5 · 2 ( n ) 2 ( n ) 4 log 769 , 208 5 , 884 , 749 ( 2 75 ) n 64 3339 ( 1 64 ) n = 2 log 2 log 2 75 = 2 log 2 log 75 log 2 = κ .
Similarly, lim ( n ) 2 log F ( ( n ) + 1 ) log V F ( ( n ) ) = κ . Thus, κ lim inf n 2 log n log V n lim sup n 2 log n log V n κ , implying the fact that the quantization dimension of the measure P exists and equals κ . □
Theorem 2.
The D ( P ) -dimensional quantization coefficient for the condensation measure P does not exist, and the D ( P ) -dimensional lower and upper quantization coefficients for P are finite and positive.
Proof. 
We have D ( P ) = κ = 2 log 2 log 75 log 2 , and so for any n N , 2 2 n / κ = ( 75 2 ) n . Hence, by Proposition 10, we have
lim n ( F ( n ) ) 2 / κ V F ( n ) ( P ) = lim n ( 5 · 2 n 2 n 4 ) 2 / κ 769 , 208 5 , 884 , 749 ( 2 75 ) n 64 3339 ( 1 64 ) n = lim n ( 75 2 ) n ( 5 2 n 2 n 4 2 n ) 2 / κ 769 , 208 5 , 884 , 749 ( 2 75 ) n 64 3339 ( 1 64 ) n = 5 2 / κ 769,208 5,884,749 .
Again, by Proposition 11, we have
lim n ( 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 ) 2 / κ V 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 = lim n ( 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 ) 2 / κ ( V F ( n ) 128 3975 ( 2 75 ) n ( 75 128 ) 31 ( 75 128 ) n + 1 1024 35,775 ( 2 75 ) n ( 75 128 ) 18 ( 75 128 ) 31 450,241 5,323,500 ( 2 75 ) n ) = lim n ( 75 2 ) n ( 6 + 2 30 ( 2 13 + 1 ) 2 n 2 n 6 2 n ) 2 / κ ( 769,208 5,884,749 ( 2 75 ) n 64 3339 ( 1 64 ) n 128 3975 ( 2 75 ) n ( 75 128 ) 31 ( 75 128 ) n + 1 1024 35,775 ( 2 75 ) n ( 75 128 ) 18 ( 75 128 ) 31 450,241 5,323,500 ( 2 75 ) n ) = 6 2 / κ 769 , 208 5 , 884 , 749 128 3975 ( 75 128 ) 31 1024 35 , 775 ( 75 128 ) 18 ( 75 128 ) 31 450 , 241 5 , 323 , 500 .
Since ( F ( n ) ) 2 / κ V F ( n ) ( P ) , and ( 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 ) 2 / κ V 2 n ( 6 + 2 30 ( 2 13 + 1 ) ) 2 n 6 ( P ) are two subsequences of ( n 2 / κ V n ( P ) ) n N having two different limits, we can say that the sequence ( n 2 / κ V n ( P ) ) n N does not converge, in other words, the D ( P ) -dimensional quantization coefficient for P does not exist.
To show that the D ( P ) -dimensional lower and upper quantization coefficients for P are finite and positive, for n N , let ( n ) be the least positive integer such that F ( ( n ) ) n < F ( ( n ) + 1 ) . Then, V F ( ( n ) + 1 ) < V n V F ( ( n ) ) implying ( F ( ( n ) ) ) 2 / κ V F ( ( n ) + 1 ) < n 2 / κ V n < ( F ( ( n ) + 1 ) ) 2 / κ V F ( ( n ) ) . As ( n ) whenever n , we have
lim n F ( ( n ) ) F ( ( n ) + 1 ) = lim n 5 · 2 ( n ) 2 ( n ) 4 5 · 2 ( n ) + 1 2 ( ( n ) + 1 ) 4 = 1 2 ,
and so,
lim n ( F ( ( n ) ) ) 2 / κ V F ( ( n ) + 1 ) = 1 4 1 / κ lim n ( F ( ( n ) + 1 ) ) 2 / κ V F ( ( n ) + 1 ) = 1 4 1 / κ lim n ( 5 · 2 ( n ) + 1 2 ( ( n ) + 1 ) 4 ) 2 / κ 769 , 208 5 , 884 , 749 ( 2 75 ) ( n ) + 1 64 3339 ( 1 64 ) ( n ) + 1 = 1 4 1 / κ 5 2 / κ 769,208 5,884,749 = 25 4 1 / κ 769,208 5,884,749 ,
and similarly,
lim n ( F ( ( n ) + 1 ) ) 2 / κ V F ( ( n ) ) = 4 1 / κ lim n ( F ( ( n ) ) ) 2 / κ V F ( ( n ) ) = ( 100 ) 1 / κ 769,208 5,884,749
yielding the fact that ( 25 4 ) 1 / κ 769,208 5,884,749 lim inf n n 2 / κ V n ( P ) lim sup n n 2 / κ V n ( P ) ( 100 ) 1 / κ 769,208 5,884,749 , i.e., the D ( P ) -dimensional lower and upper quantization coefficients for the condensation measure P are finite and positive. Thus, the proof of the theorem is complete. □
Remark 5.
Notice that ( 1 3 ( 1 5 ) 2 ) κ 2 + κ + ( 1 3 ( 1 5 ) 2 ) κ 2 + κ = 1 implies κ = 2 log 2 log 75 log 2 0.382496 > 0 = D ( ν ) . In Theorem 1, we have proved that D ( P ) = κ = max { κ , D ( ν ) } .

4. Quantization for a Condensation Measure Associated with a Uniform Distribution

In this section, we investigate the optimal quantization for the condensation measure P when ν is the uniform distribution on the closed interval [ 2 5 , 3 5 ] .
Lemma 14.
Let X and Y be the random variables with the probability distributions P and ν, respectively. Let E ( X ) , E ( Y ) represent the expected values, and V : = V ( X ) , W : = V ( Y ) represent the variances of X and Y, respectively. Then,
E ( X ) = E ( Y ) = 1 2 , V = 97 876 , and W = 1 300 .
Proof. 
Using Lemma 4, we have E ( X ) = x d P ( x ) = 1 3 1 5 x d P ( x ) + 1 3 ( 1 5 x + 4 5 ) d P ( x ) + 1 3 x d ν ( x ) = 1 15 E ( X ) + 1 15 E ( X ) + 4 15 + 1 6 , which implies E ( X ) = 1 2 . Again, E ( X 2 ) = x 2 d P ( x ) = 1 3 x 2 d ( P S 1 1 ) ( x ) + 1 3 x 2 d ( P S 2 1 ) ( x ) + 1 3 x 2 d ν = 1 3 ( 1 5 x ) 2 d P ( x ) + 1 3 ( 1 5 x + 4 5 ) 2 d P ( x ) + 1 3 2 5 3 5 5 x 2 d x = 1 75 E ( X 2 ) + 1 75 E ( X 2 ) + 8 75 E ( X ) + 16 75 + 19 225 , which implies E ( X 2 ) = 79 219 , and hence, V ( X ) = E ( X E ( X ) ) 2 = E ( X 2 ) E ( X ) 2 = 79 219 1 4 = 97 876 . On the other hand, E ( Y ) = y d ν = 2 5 3 5 5 y d y = 1 2 , and V ( Y ) = E ( Y 1 2 ) 2 = 2 5 3 5 5 ( y 1 2 ) 2 d y = 1 300 . Thus, the proof of the lemma is complete. □
Lemma 15.
Let P be the condensation measure and ν be the uniform distribution that occurs in P. Then, for any x 0 R , we have
( x x 0 ) 2 d P ( x ) = 97 876 + ( x 0 1 2 ) 2 , and ( x x 0 ) 2 d ν ( x ) = 1 300 + ( x 0 1 2 ) 2 .
Proof. 
Let X and Y be the random variables as defined in Lemma 14. Then, following the standard rule of probability, we have ( x x 0 ) 2 d P ( x ) = V ( X ) + ( x 0 1 2 ) 2 , and ( x x 0 ) 2 d ν ( x ) = V ( Y ) + ( x 0 1 2 ) 2 , which is the lemma. □
Note 3.
Let ω I k , k 0 . Then, by Equation (2), it follows that P ( J ω ) = 1 3 k , P ( C ω ) = 1 3 k + 1 ,
E ( X : X J ω ) = 1 P ( J ω ) J ω x d P = x d ( P S ω 1 ) = S ω ( x ) d P = S ω ( 1 2 ) , and E ( X : X C ω ) = 1 P ( C ω ) C ω x d P = x d ( ν S ω 1 ) = S ω ( x ) d ν = S ω ( 1 2 ) .
For any x 0 R ,
J ω ( x x 0 ) 2 d P ( x ) = 1 3 k 1 25 k V + ( S ω ( 1 2 ) x 0 ) 2 , C ω ( x x 0 ) 2 d ν ( x ) = 1 3 k + 1 1 25 k W + ( S ω ( 1 2 ) x 0 ) 2 .
Remark 6.
By Lemma 15, it follows that the optimal set of one-mean for the condensation measure P consists of the expected value 1 2 and the corresponding quantization error is the variance V ( X ) of the random variable X.
The following proposition is useful.
Proposition 12.
Let ν be the uniform distribution on the interval [ 2 5 , 3 5 ] . Then, for n 1 , the set { 2 5 + 2 i 1 10 n : 1 i n } is a unique optimal set of n-means for ν with quantization error V n ( ν ) = W n 2 . Moreover, the quantization dimension D ( ν ) of ν is one.
Proof. 
Since ν is uniformly distributed on [ 2 5 , 3 5 ] , the boundaries of the Voronoi regions of an optimal set of n-means will divide the interval [ 2 5 , 3 5 ] into n equal subintervals, i.e., the boundaries of the Voronoi regions are given by
{ 2 5 , 2 5 + 1 5 n , 2 5 + 2 5 n , , 2 5 + n 1 5 n , 3 5 } .
This implies that an optimal set of n-means for ν is unique, and it consists of the midpoints of the boundaries of the Voronoi regions, i.e., the optimal set of n-means for ν is given by { 2 5 + 2 i 1 10 n : 1 i n } for any n 1 . Then, the nth quantization error for ν is
V n ( ν ) = n × ( the quantization error in each Voronoi region ) = n 2 5 2 5 + 1 5 n 5 x ( 2 5 + 1 10 n ) 2 d x ,
which after simplification implies V n ( ν ) = 1 300 n 2 = W n 2 . Hence, D ( ν ) = lim n 2 log ( n ) log ( 1 300 n 2 ) = 1 . Thus, the proof of the proposition is complete. □
Remark 7.
By Proposition 12, it follows that lim n n 2 V n ( ν ) = 1 300 , i.e., the one-dimensional quantization coefficient for ν is finite and strictly positive. In fact, for any probability measure μ on R d with non-vanishing absolutely continuous part lim n n 2 / d V n ( μ ) is finite and strictly positive; in other words, the quantization dimension of a probability measure with non-vanishing absolutely continuous part is equal to the dimension d of the underlying space (see [30]).
Lemma 16.
Let α n ( ν ) be an optimal set of n-means for ν. Then, for any ω I k , k 0 , S ω ( α n ( ν ) ) is an optimal set of n-means for the image measure ν S ω 1 . Moreover,
C ω min a S ω ( α n ( ν ) ) ( x a ) 2 d P = 1 3 · 1 75 k · W n 2 .
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 equivalently from Lemma 5. Now, using (2) and Proposition 12, we have
C ω min a S ω ( α n ( ν ) ) ( x a ) 2 d P = 1 3 k + 1 C ω min a S ω ( α n ( ν ) ) ( x a ) 2 d ( ν S ω 1 ) = 1 3 k + 1 C min a S ω ( α n ( ν ) ) ( S ω ( x ) a ) 2 d ν = 1 3 k + 1 · 1 25 k C min a α n ( ν ) ( x a ) 2 d ν = 1 3 · 1 75 k · W n 2 .
Thus, the proof of the lemma is complete. □

4.1. Essential Lemmas and Propositions

In this subsection, we give some lemmas and propositions that we need to determine the optimal sets of n-means and the nth quantization errors for all n 2 . To determine the quantization error, we will frequently use the formulas given in the expression (11).
Let us now state the following proposition. The proof of this proposition follows similarly as the proof of Proposition 5.
Proposition 13.
Let α : = { a 1 , a 2 } be an optimal set of two-means with a 1 < a 2 . Then, a 1 = 13 60 , a 2 = 47 60 , and the corresponding quantization error is V 2 = 8003 262 , 800 = 0.0304528 .
Lemma 17.
Let ω I k for any k 0 . Then,
J ω 1 S ω [ 2 5 , 1 2 ] ( x S ω ( 13 60 ) ) 2 d P = 1 75 k · 1 2 V 2 = J ω 2 S ω [ 1 2 , 3 5 ] ( x S ω ( 47 60 ) ) 2 d P .
Corollary 4.
Let ω I k for k 0 . Then, for any a R ,
J ω 1 S ω ( [ 2 5 , 1 2 ] ) ( x a ) 2 d P = 1 3 k 1 25 k 1 2 V 2 + 1 2 ( S ω ( 13 60 ) a ) 2 , and S ω ( [ 1 2 , 3 5 ] ) J ω 2 ( x a ) 2 d P = 1 3 k 1 25 k 1 2 V 2 + 1 2 ( 47 60 ) a ) 2 .
Proposition 14.
Let α : = { a 1 , a 2 , a 3 } be an optimal set of three-means with a 1 < a 2 < a 3 . Then, a 1 = S 1 ( 1 2 ) = 1 10 , a 2 = 1 2 , and a 3 = S 2 ( 1 2 ) = 9 10 . The corresponding quantization error is V 3 = 89 21 , 900 = 0.00406393 .
Proof. 
Let β : = { 1 10 , 1 2 , 9 10 } . Then, using (11), we have
min a β ( x a ) 2 d P = J 1 ( x 1 10 ) 2 d P + C ( x 1 2 ) 2 d P + J 2 ( x 9 10 ) 2 d P = 1 3 1 25 V + 1 3 W + 1 25 V = 89 21,900 = 0.00406393 .
Since V 3 is the quantization error for three-means, we have 0.00406393 V 3 . Let α : = { a 1 , a 2 , a 3 } be an optimal set of three-means with a 1 < a 2 < a 3 . Since a 1 , a 2   , and a 3 are the centroids of their own Voronoi regions, we have 0 < a 1 < a 2 < a 3 < 1 . Suppose that 1 5 a 1 . Then,
V 3 J 1 ( x 1 5 ) 2 d P = 79 16,425 = 0.00480974 > V 3 ,
which is a contradiction. So, we can assume that a 1 < 1 5 . Similarly, we have 4 5 < a 3 . Suppose that a 2 2 5 . Then,
V 3 C ( x 2 5 ) 2 d P = 1 3 ( W + ( 1 2 2 5 ) 2 ) = 1 225 = 0.00444444 > V 3 ,
which is a contradiction. So, we can assume that 2 5 < a 2 . Similarly, a 2 < 3 5 . Thus, we have 2 5 < a 2 < 3 5 . We now show that the Voronoi region of a 1 does not contain any point from C. Suppose that 1 2 ( a 1 + a 2 ) 2 5 . Then, a 2 4 5 a 1 > 4 5 1 5 = 3 5 , which is a contradiction, and so the Voronoi region of a 1 does not contain any point from C. Similarly, the Voronoi region of a 3 does not contain any point from C. In a similar fashion, we can show that the Voronoi region of a 2 does not contain any point from J 1 and J 2 . Hence,
a 1 = S 1 ( 1 2 ) = 1 10 , a 2 = E ( X : X C ) = 1 2 , and a 3 = S 2 ( 1 2 ) = 9 10 ,
and the corresponding quantization error is V 3 = 89 21,900 = 0.00406393 . Thus, the proof of the lemma is complete. □
Lemma 18.
Let α be an optimal set of four-means. Then, α J 1 , α J 2 , and α C . Moreover, α does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) .
Proof. 
Let us first consider a set of four points β : = { S 1 ( 13 60 ) , S 1 ( 47 60 ) , 1 2 , S 2 ( 1 2 ) } . Then, using Lemma 17,
min a β ( x a ) 2 d P = 2 J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + C ( x 1 2 ) 2 d P + J 2 ( x S 2 ( 1 2 ) ) 2 d P = 1 75 V 2 + 1 3 W + 1 75 V = 59,003 19,710,000 = 0.00299356 .
Since V 4 is the quantization error for four-means, we have V 4 0.00299356 . Let α : = { a 1 < a 2 < a 3 < a 4 } be an optimal set of four-means. Proceeding in the similar way as shown in the proof of Proposition 14, we have 0 < a 1 < 1 5 and 4 5 < a 4 < 1 , implying α J 1 and α J 2 . We now show that α C . For the sake of contradiction, assume that α C = . Then, if a 3 < 2 5 , we have
V 4 C ( x 2 5 ) 2 d P + J 2 ( x S 2 ( 1 2 ) ) 2 d P = 1 225 + 1 75 V = 389 65,700 = 0.00592085 > V 4 ,
which leads to a contradiction. Hence, 3 5 < a 3 . Suppose that a 2 7 20 . Then, due to symmetry, we can assume that 13 20 a 3 , and so
V 4 [ 2 5 , 1 2 ] ( x 7 20 ) 2 d P + [ 1 2 , 3 5 ] ( x 13 20 ) 2 d P = 2 3 [ 2 5 , 1 2 ] ( x 7 20 ) 2 d ν = 13 3600 = 0.00361111 > V 4 ,
which gives a contradiction. So, we can assume that 7 20 < a 2 < 2 5 < 3 5 < a 3 < 13 20 . Then, 1 2 ( a 1 + a 2 ) < 1 5 and 1 2 ( a 3 + a 4 ) > 4 5 , yielding a 1 < 1 20 and a 4 > 19 20 ; otherwise, the quantization error can strictly be reduced by moving a 2 to 2 5 and a 3 to 3 5 contradicting the fact that α is an optimal set of four-means. Then,
V 4 2 J 12 ( x 1 20 ) 2 d P + [ 2 5 , 1 2 ] ( x 2 5 ) 2 d P = 48,349 9,855,000 = 0.00490604 > V 4 ,
which is a contraction. Hence, α C . Thus, we see that α J 1 , α J 2 , and α C . To complete the rest of the proof, for the sake of contradiction, assume that α contains a point from the open interval ( 1 5 , 2 5 ) . Then, α can not contain any point from ( 3 5 , 4 5 ) because card ( α ) = 4 , and α J 1 , α J 2 , and α C . Assume that α contains a 2 from ( 1 5 , 2 5 ) . Then, 0 < a 1 < 1 5 < a 2 < 2 5 < a 3 < 3 5 < 4 5 < a 4 < 1 , and so, the Voronoi region of a 4 does not contain any point from C, and the Voronoi region of a 3 does not contain any point from J 2 . Under the assumption a 2 ( 1 5 , 2 5 ) the following three cases can arise:
Case 1: 1 3 a 2 < 2 5 .
Then,
min a { a 2 , a 3 } C ( x a ) 2 d P : 1 3 a 2 < 2 5 and 2 5 a 3 3 5 = min a { a 2 , a 3 } 1 3 2 5 a 2 + a 3 2 5 ( x a 2 ) 2 d x + a 2 + a 3 2 3 5 5 ( x a 3 ) 2 d x : 1 3 a 2 < 2 5 , 2 5 a 3 3 5 = 1 2025 ( when a 2 = 2 5 and a 3 = 8 15 ) .
Again, 1 2 ( a 1 + a 2 ) < 1 5 implies a 1 < 2 5 a 2 2 5 1 3 = 1 15 < 1 10 = S 1 ( 1 2 ) , and so
V 4 S 1 [ 1 2 , 3 5 ] J 12 ( x 1 15 ) d P + 1 2025 + J 2 ( x S 2 ( 1 2 ) ) 2 d P = 20,833 5,913,000 = 0.00352325 > V 4 ,
which leads to a contradiction.
Case 2: 4 15 a 2 1 3 .
Then, proceeding as (12), we have
min a { a 2 , a 3 } C ( x a ) 2 d P : 4 15 a 2 1 3 , 2 5 a 3 3 5 , and 2 5 a 2 + a 3 2 = 11 10,935 ,
which occurs when a 2 = 1 3 and a 3 = 23 45 . Moreover, 1 2 ( a 1 + a 2 ) < 1 5 implying a 1 < 2 5 a 2 2 5 4 15 = 2 15 . First, assume that 1 15 a 1 < 2 15 . Then,
V 4 J 11 ( x 1 15 ) 2 d P + C 1 ( x S 1 ( 1 2 ) ) 2 d P + J 12 ( x 2 15 ) 2 d P + 11 10,935 + 1 75 V = 608,693 199,563,750 ,
implying V 4 608,693 199,563,750 = 0.00305012 > V 4 , which yields a contradiction. Next, assume that 0 < a 1 < 1 15 . Then, for any x J 12 , we have
min a { a 1 , a 2 } ( x a ) 2 ( x 1 30 ) 2 ,
because a 2 x 4 15 x 1 15 x 1 30 2 75 > 0 , and x a 1 x 1 15 7 75 > x 1 30 2 75 > 0 . Thus, we have
V 4 J 12 ( x 1 30 ) 2 d P + 11 10,935 + 1 75 V = 488,149 99,781,875 = 0.00489216 > V 4 ,
which leads to another contradiction. Thus, Case 2 gives a contradiction.
Case 3: 1 5 < a 2 4 15 .
Then, proceeding as (12), we have
min a { a 2 , a 3 } C ( x a ) 2 d P : 1 5 < a 2 4 15 , 2 5 a 3 3 5 , and 2 5 a 2 + a 3 2 = 1 675 ,
which occurs when a 2 = 4 15 and a 3 = 8 15 . Moreover,
min a { a 1 , a 2 } J 1 ( x a ) 2 d P : 0 < a 1 < 1 5 < a 2 < 2 5 J 1 min a S 1 ( α 2 ) ( x a ) 2 d P = 1 75 V 2 .
Thus, we see that
V 4 1 75 V 2 + 1 675 + 1 75 V = 7367 2,190,000 = 0.00336393 > V 4 ,
which is a contradiction.
Therefore, we can assume that α does not contain any point from ( 1 5 , 2 5 ) . Reflecting the situation with respect to the point 1 2 , we can also say that α does not contain any point from the open interval ( 3 5 , 4 5 ) . Thus, the proof of the lemma is complete. □
Remark 8.
By Lemma 18, it is easy to see that the sets { S 1 ( 13 60 ) , S 1 ( 47 60 ) , 1 2 , S 2 ( 1 2 ) } and { S 1 ( 1 2 ) , 1 2 , S 2 ( 13 60 ) , S 2 ( 47 60 ) } form two different optimal sets of four-means.
Proposition 15.
Let α be an optimal set of n-means with n 3 . Then, α J 1 , α J 2 , and α C .
Proof. 
Due to Proposition 14 and Lemma 18, the proposition is true for n = 3 and n = 4 . Let α : = { a 1 , a 2 , , a n } be an optimal set of n-means for n 5 , where 0 < a 1 < a 2 < < a n < 1 . Proceeding in the similar way as shown in the proof of Proposition 14, we see that 0 < a 1 < 1 5 , and 4 5 < a n < 1 , yielding α J 1 and α J 2 . Consider a set of five points β : = S 1 ( α 2 ) { 1 2 } S 2 ( α 2 ) , where α 2 is an optimal set of two-means for P. Then, using Lemma 17, and the symmetry of P, we obtain the distortion error for the set β as
min a β ( x a ) 2 d P = 2 J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + C ( x 1 2 ) 2 d P = 1 75 V 2 + 1 3 W = 29,903 19,710,000 = 0.00151715 .
Since V n is the quantization error for n-means with n 5 , we have V n 0.00151715 . Notice that for any a α , since P ( M ( a | α ) > 0 , there can not be more than one point from α in any of the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) . We now show that α C . On the contrary, assume that α C = . Let j = max { i : a i < 2 5 and 1 i n } . Then, a j < 2 5 and 3 5 < a j + 1 . If a j 1 2 ( 1 5 + 2 5 ) = 3 10 , then
min a α ( x a ) 2 d P C min a α ( x a ) 2 d P = 1 3 C min a { a j , a j + 1 } ( x a ) 2 d ν 1 3 [ 2 5 , 9 20 ] ( x 3 10 ) 2 d ν + 1 3 [ 9 20 , 3 5 ] ( x 3 5 ) 2 d ν = 23 7200 = 0.00319444 > V n ,
which yields a contradiction. Similarly, if a j + 1 7 10 a contradiction will arise. So, we can assume that 3 10 < a j < 2 5 < 3 5 < a j + 1 < 7 10 . Then, 1 2 ( a j 1 + a j ) < 1 5 , implying a j 1 < 2 5 a j 2 5 3 10 = 1 10 , and similarly, 1 2 ( a j + 1 + a j + 2 ) > 4 5 implies a j + 2 9 10 . Thus, we see that
V n J 12 ( x 1 10 ) 2 d P + [ 2 5 , 1 2 ] ( x 2 5 ) 2 d P + [ 1 2 , 3 5 ] ( x 3 5 ) 2 d P + J 21 ( x 9 10 ) 2 d P ,
which after simplification yields V n 12,677 4,927,500 = 0.0025727 > V n , which is a contradiction. All these contradictions arise due to our assumption α C = . Hence, we can conclude that α C . This completes the proof of the proposition. □
Lemma 19.
Let α be an optimal set of five-means. Then, α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
Proof. 
Let α : = { a 1 < a 2 < a 3 < a 4 < a 5 } be an optimal set of five-means. By Expression (13), we have V 5 0.00151715 . Proposition 15 says that α contains points from J 1 , C and J 2 . Suppose that α contains a point from ( 1 5 , 2 5 ) . Then, two cases can arise:
Case 1. 3 10 a 2 < 2 5 .
Due to symmetry of P about 1 2 , we can assume that a 3 = 1 2 and 3 5 < a 4 7 10 . Then, 1 2 ( a 1 + a 2 ) < 1 5 and 4 5 < 1 2 ( a 4 + a 5 ) , yielding a 1 < 1 10 and 9 10 < a 5 , and so, we have
V 5 2 ( J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P + [ 2 5 , 9 20 ] ( x 2 5 ) 2 d P + [ 9 20 , 1 2 ] ( x 1 2 ) 2 d P ) = 21,289 9,855,000 = 0.00216022 > V 5 ,
which is a contradiction.
Case 2. 1 5 < a 2 3 10 .
Then, 1 2 ( a 2 + a 3 ) > 2 5 , implying a 3 > 4 5 a 2 4 5 3 10 = 1 2 , which leads to a contradiction, because by our assumption, a 3 = 1 2 . Therefore, α does not contain any point from ( 1 5 , 2 5 ) . Similarly, α does not contain any point from ( 3 5 , 4 5 ) , which completes the proof of the lemma. □
Remark 9.
By Lemma 19 and due to the symmetry of P, it can be seen that the set S 1 ( α 2 ) { 1 2 } S 2 ( α 2 ) , where α 2 is an optimal set of two-means for P, forms an optimal set of five-means.
Lemma 20.
Let α be an optimal set of six-means. Then, α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
Proof. 
Let α : = { a 1 < a 2 < a 3 < a 4 < a 6 } be an optimal set of six-means. Suppose that α contains a point from ( 1 5 , 2 5 ) . Proposition 15 says that α contains points from J 1 , C and J 2 . Consider the set of six points β : = S 1 ( α 2 ) S 2 ( α 2 ) α 2 ( ν ) , where α 2 C 2 ( P ) , and α 2 ( ν ) C 2 ( ν ) . Then,
min a β ( x a ) 2 d P = 4 J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + 1 3 V 2 ( ν ) = 21,481 19,710,000 = 0.00108985 .
Since V 6 is an optimal set of six-means, V 6 0.00108985 . Since α C , card ( α ) is even, and P is symmetric about 1 2 , we can assume that α contains an equal number of points from both sides of the point 1 2 , implying card ( α C ) = 2 , and a 3 , a 4 C . Since α contains a point from ( 1 5 , 2 5 ) , the following two cases can arise:
Case 1. 3 10 a 2 < 2 5 .
Proceeding as Case 1 of Lemma 19 in this case, we have
V 6 2 J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P = 0.00188245 > V 6 ,
which is a contradiction.
Case 2. 1 5 < a 2 3 10 .
Due to symmetry, we can assume that 7 10 a 5 < 4 5 . Then, 1 2 ( a 2 + a 3 ) > 2 5 , implying a 3 > 4 5 a 2 4 5 3 10 = 1 2 . Similarly, 1 2 ( a 4 + a 5 ) < 3 5 , implying a 4 < 1 2 , which leads to a contradiction as a 3 < a 4 .
Therefore, α does not contain any point from ( 1 5 , 2 5 ) . Likewise, α does not contain any point from ( 3 5 , 4 5 ) , which completes the proof of the lemma. □
Remark 10.
By Lemma 20, it is easy to see that if α 6 is an optimal set of six-means for P, then α 6 = S 1 ( α 2 ) α 2 ( ν ) S 2 ( α 2 ) , where α 2 is an optimal set of two-means for P, and the corresponding quantization error is given by V 6 = 21 , 481 19 , 710 , 000 = 0.00108985 .
Lemma 21.
Let α be an optimal set of seven-means. Then, α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
Proof. 
Consider the set β : = S 1 ( α 2 ) S 2 ( α 3 ) α 2 ( ν ) , where α 2 C 2 ( P ) , α 3 C 3 ( P ) , and α 2 ( ν ) C 2 ( ν ) . Then,
min a β ( x a ) 2 d P = J 1 min a S 1 ( α 2 ) ( x a ) 2 d P + J 2 min a S 2 ( α 3 ) ( x a ) 2 d P + 1 3 V 2 ( ν ) = 1 75 V 2 + 1 75 1 75 V + 1 3 W + 1 75 V + 1 3 1 1200 = 7273 9,855,000 = 0.000738001 .
Since V 7 is the quantization error for seven-means, we have V 7 0.000738001 . Let α : = { a 1 < a 2 < a 3 < a 4 < a 6 < a 7 } be an optimal set of seven-means. Proposition 15 says that α contains points from J 1 , C and J 2 . Suppose that α contains a point from ( 1 5 , 2 5 ) . We now prove the following claim:
Claim 1. card ( α J 1 ) 2 and card ( α J 2 ) 2 .
Suppose that card ( α J 1 ) = 1 . Then, two cases can arise:
Case 1. 3 10 a 2 < 1 5 .
Then, 1 2 ( a 1 + a 2 ) < 1 5 implying a 1 < 1 10 , and so
V 7 J 11 S 1 [ 2 5 , 1 2 ] ( x S 1 ( 13 60 ) ) 2 d P + S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P = 37,103 39,420,000 = 0.000941223 > V 7 ,
which is a contradiction.
Case 2. a 2 3 10 .
Then, 1 2 ( a 2 + a 3 ) > 2 5 yielding a 3 > 1 2 , and so
V 7 J 1 min a { S 1 ( 13 60 ) , S 1 ( 47 60 ) } ( x a ) 2 d P + [ 2 5 , 1 2 ] ( x 1 2 ) 2 d P = 1 75 V 2 + 1 3 [ 2 5 , 1 2 ] ( x 1 2 ) 2 d ν ,
which implies V 7 18,953 19,710,000 = 0.000961593 > V 7 , and so a contradiction arises.
Thus, we can assume that card ( α J 1 ) 2 . Similarly, we can show that card ( α J 2 ) 2 . Thus, the claim is true.
Next, we prove the following claim:
Claim 2. card ( α C ) = 2 .
By the hypothesis, α contains a point from ( 1 5 , 2 5 ) ; by Claim 1, card ( α J 1 ) 2 and card ( α J 2 ) 2 . So, we can assume that c a r d ( α C ) 2 . Suppose that c a r d ( α C ) = 1 . Let a j = max { a i : a i < 2 5 and 1 i 7 } . Then, a j < 2 5 . Consider the following two cases:
Case A. 3 10 a j < 2 5 .
Then, 1 2 ( a j 1 + a j ) < 1 5 implying a j 1 < 1 10 . First, suppose that α does not contain any point from ( 3 5 , 4 5 ) . Proceeding as (12), we have
min a { a j , a j + 1 } C ( x a ) 2 d P : 3 10 < a j 2 5 , 2 5 a j + 1 3 5 , and 2 5 a j + a j + 1 2 = 1 2025 ,
which occurs when a j = 2 5 and a j + 1 = 8 15 . Then,
V 7 S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P + 1 2025 = 1457 1,182,600 = 0.00123203 > V 7 ,
which gives a contradiction. Next, suppose that α contains a point from ( 3 5 , 4 5 ) , i.e., a j + 2 ( 3 5 , 4 5 ) . Then,
min a { a j , a j + 1 , a j + 2 } { C ( x a ) 2 d P : a j [ 3 10 , 2 5 ) , a j + 1 [ 2 5 , 3 5 ] , a j + 2 ( 3 5 , 4 5 ) , and 2 5 a j + a j + 1 2 < a j + 1 + a j + 2 2 3 5 } = 1 3600 ,
which occurs when a j = 2 5 , a j + 1 = 1 2 and a j + 2 = 3 5 , and so
V 7 S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P + 1 3600 = 89 87,600 = 0.00101598 > V 7 ,
which leads to a contradiction. Thus, a contradiction arises in Case 3.
Case B. 1 5 < a j 3 10 .
Suppose that α does not contain any point from ( 3 5 , 4 5 ) . Then,
min a { a j , a j + 1 } C ( x a ) 2 d P : 1 5 < a j 3 10 , 2 5 a j + 1 3 5 , and 2 5 a j + a j + 1 2 = 1 900 ,
which occurs when a j = 3 10 and a j + 1 = 1 2 yielding V 7 1 900 > 0.00111111 > V 7 , which is a contradiction. Next, suppose that α contains a point from ( 3 5 , 7 10 ] . This case can be considered as a reflection of the last part of Case A. Thus, if α contains a point from ( 3 5 , 7 10 ] , a contradiction arises. Now, suppose that α contains a point from [ 7 10 , 4 5 ) , i.e., a j + 2 [ 7 10 , 4 5 ) . Then,
min a { a j , a j + 1 , a j + 2 } { C ( x a ) 2 d P : a j ( 1 5 , 3 10 ] , a j + 1 [ 2 5 , 3 5 ] , a j + 2 [ 7 10 , 4 5 ) , and 2 5 a j + a j + 1 2 < a j + 1 + a j + 2 2 3 5 } = 1 900 ,
which occurs when a j = 3 10 , a j + 1 = 1 2 and a j + 2 = 7 10 . Then,
V 7 1 900 = 0.00111111 > V 7
which yields a contradiction.
Hence, card ( α C ) = 2 , i.e., Claim 2 is true.
By the hypothesis α contains a point from ( 1 5 , 3 5 ) ; by Claim 1 and Claim 2, we have card ( α J 1 ) 2 , card ( α J 2 ) 2 , and card ( α C ) = 2 . So, we can assume that card ( α J 1 ) = card ( α J 2 ) = 2 , card ( α C ) = 2 , and α does not contain any point from ( 3 5 , 4 5 ) . Then, the following two cases arise:
Case 5. 3 10 a 3 < 2 5 .
Then,
V 7 S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P + J 2 min a S 2 ( α 2 ) ( x a ) 2 d P = 0.00114424 > V 7 ,
which is a contradiction.
Case 6. 1 5 < a 3 3 10 .
Then,
min a { a 3 , a 4 , a 5 } C ( x a ) 2 d P : 1 5 < a 3 3 10 , 2 5 a 4 < a 5 3 5 , and 2 5 a 3 + a 4 2 = 1 1620 ,
which occurs when a 3 = 3 10 , a 4 = 1 2 , and a 5 = 17 30 . Thus, in this case,
V 7 C min a { a 3 , a 4 , a 5 } ( x a ) 2 d P + J 2 min a S 2 ( α 2 ) ( x a ) 2 d P = 1 1620 + 1 75 V 2 = 60,509 59,130,000 ,
i.e., V 7 60,509 59,130,000 = 0.00102332 > V 7 , which gives a contradiction.
Therefore, we can assume that α does not contain any point from the interval ( 1 5 , 2 5 ) . Reflecting the situation with respect to the point 1 2 , we can also assume that α does not contain any point from the interval ( 3 5 , 4 5 ) . Hence, the proof of the lemma is complete. □
Remark 11.
In Lemma 21, we have proved that if α is an optimal set of seven-means, then card ( α J 1 ) 2 , card ( α J 2 ) 2 , and card ( α C ) = 2 . Moreover, α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) . Therefore, we can assume that if α is an optimal set of seven-means, then α = S 1 ( α 3 ) S 2 ( α 2 ) α 2 ( ν ) , or α = S 1 ( α 2 ) S 2 ( α 3 ) α 2 ( ν ) , where α 2 C 2 ( P ) , α 3 C 3 ( P ) , and α 2 ( ν ) C 2 ( ν ) , and the corresponding quantization error is V 7 = 7273 9 , 855 , 000 = 0.000738001 .
Proposition 16.
Let α be an optimal set of n-means with n 3 . Then, α does not contain any point from ( 1 5 , 2 5 ) ( 3 5 , 4 5 ) .
Proof. 
By Proposition 14 and Lemmas 18–21, the proposition is true for 3 n 7 . We now prove that the proposition is true for all n 8 . Let α : = { a 1 < a 2 < < a n } be on optimal set of n means for n 8 . Consider the set β = S 1 ( α 3 ) S 2 ( α 3 ) α 2 ( ν ) , where α 3 C 3 ( P ) and α 2 ( ν ) C 2 ( ν ) . Then,
min a β ( x a ) 2 d P = 2 J 11 ( x S 11 ( 1 2 ) ) 2 + C 1 ( x S 1 ( 1 2 ) ) 2 d P + J 12 ( x S 12 ( 1 2 ) ) 2 + C min a α 2 ( ν ) ( x a ) 2 d P = 2 1 75 2 V + 1 75 1 3 W + 1 75 2 V + 1 3 1 1200 = 2537 6,570,000 = 0.000386149 ,
Since V n is the quantization error for n-means with n 8 , we have V n V 8 0.000386149 . For the sake of contradiction, assume that α contains a point from the open interval ( 1 5 , 2 5 ) . Recall that there can not be more than one point from α in any of the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) . Suppose that a j ( 1 5 , 2 5 ) , where j = max { i : a i < 2 5 and 1 i n } . Then, following cases can arise:
Case 1. 3 10 a j < 2 5 .
Then, a j 1 < 1 10 yielding
V n S 1 [ 1 2 , 3 5 ] J 12 ( x 1 10 ) 2 d P = 97 131,400 = 0.000738204 > V n ,
which is a contradiction.
Case 2. 1 5 < a j 3 10 .
Then, 1 2 ( a j + a j + 1 ) > 2 5 implies a j + 1 > 4 5 a j 4 5 3 10 = 1 2 . Thus,
V n [ 2 5 , 1 2 ] min a { a j , a j + 1 } ( x a ) 2 d P [ 2 5 , 1 2 ] ( x 1 2 ) 2 d P = 1 1800 = 0.000555556 > V n ,
which leads to a contradiction.
Similarly, we can show that for any a α if a ( 3 5 , 4 5 ) , then a contradiction arises. Thus, the proof of the proposition is complete. □

4.2. Optimal Sets and the Quantization Error for a Given Sequence F ( n )

In this subsection we first define the two sequences { a ( n ) } n 0 and { F ( n ) } n 0 . These two sequences play important role in the rest of the paper.
Definition 2.
Define the sequence { a ( n ) } n 0 such that a ( 0 ) = 0 , and a ( n ) = 2 n 1 for all n 1 . Define the sequence { F ( n ) } n 0 such that F ( n ) = 4 n + 2 n + 1 , i.e.,
{ F ( n ) } n 0 = { 3 , 8 , 24 , 80 , 288 , 1088 , 4224 , 16640 , 66048 , 263168 , 1050624 , } .
Lemma 22.
Let { a ( n ) } n 0 and { F ( n ) } n 0 be the sequences defined by Definition 2. Then, F ( n + 1 ) = 2 a ( n + 1 ) + 2 F ( n ) .
Proof. 
We have, 2 a ( n + 1 ) + 2 F ( n ) = 2 2 n + 1 + 2 ( 4 n + 2 n + 1 ) = 4 n + 1 + 2 n + 2 = F ( n + 1 ) , and thus the lemma follows. □
For n N , we identify the sequence of sets α 2 a ( n ) ( ν ) , ω I S ω ( α 2 a ( n 1 ) ( ν ) ) , ω I 2 S ω ( α 2 a ( n 2 ) ( ν ) ) , , ω I n 2 S ω ( α 2 a ( 2 ) ( ν ) ) , ω I n 1 S ω ( α 2 a ( 1 ) ( ν ) ) , ω I n S ω ( α 2 a ( 0 ) ( ν ) ) , and { S ω ( 1 2 ) : ω I n + 1 } , respectively, by S ( n ) , S ( n 1 ) , S ( n 2 ) , ⋯, S ( 2 ) , S ( 1 ) , S ( 0 ) , and S ( n + 1 ) . For 0 n , we write
S ( 2 ) ( ) : = ω I n S ω ( α 2 a ( ) + 1 ( ν ) ) and S ( 2 ) ( 2 ) ( ) : = ω I n S ω ( α 2 a ( ) + 2 ( ν ) ) .
Further, we write S ( 2 ) ( n + 1 ) : = { S ω ( α 2 ( P ) ) : ω I n + 1 } = { S ω ( 13 60 ) , S ω ( 47 60 ) : ω I n + 1 } , and S ( 2 ) ( 2 ) ( n + 1 ) : = ω I n + 1 S ω ( α 2 a ( 0 ) ( ν ) ) { S ω ( 1 2 ) : ω I n + 2 } . 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 ) . For n N { 0 } , set
α F ( n ) : = S ( n ) S ( n 1 ) S ( n 2 ) S ( 1 ) S ( 0 ) S ( n + 1 ) ,
and
S F ( n ) : = { S ( n ) , S ( n 1 ) , S ( n 2 ) , , S ( 1 ) , S ( 0 ) , S ( n + 1 ) } .
In addition, write
S F * ( n ) : = { S ( n ) , S ( n 1 ) , , S ( 0 ) , S ( n + 1 ) , S ( 2 ) ( n ) , S ( 2 ) ( n 1 ) , , S ( 2 ) ( 1 ) , S ( 2 ) ( n + 1 ) } .
For any element a A S F * ( n ) , by the Voronoi region of a it is meant the Voronoi region of a with respect to the set B S F * ( n ) B . Similarly, for any a A S F ( n ) , by the Voronoi region of a, the Voronoi region of a is meant with respect to the set B S F ( n ) B . Notice that if a , b A , where A S F ( n ) or A S F * ( 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 S F * ( n ) as follows: for A , B S F * ( 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 S F ( n ) .
Remark 12.
By Definition 2, we have
α F ( n ) = S 1 ( α F ( n 1 ) ) α 2 a ( n ) ( ν ) S 2 ( α F ( n 1 ) ) .
Lemma 23.
Let ≻ be the order relation on S F * ( n ) . Then,
( i )   S ( n ) S ( n 1 ) S ( 2 ) S ( 1 ) for all n 2 , and S ( 2 ) ( n ) S ( 2 ) ( n 1 ) S ( 2 ) ( 2 ) S ( 2 ) ( 1 ) for all n 3 .
( i i )   S ( 1 ) S ( 2 ) ( n ) for all 0 n 14 .
( i i i )   S ( n 13 ) S ( 2 ) ( n ) S ( n 14 ) for all n 14 .
( i v )   S ( 2 ) ( 2 ) S ( n + 1 ) for all n 2 , and S ( 1 ) S ( n + 1 ) S ( 2 ) ( 1 ) S ( 0 ) S ( 2 ) ( n + 1 ) S ( 2 ) ( 0 ) for all n 1 . On the other hand, S ( 1 ) S ( 0 ) S ( 2 ) ( 1 ) S ( 2 ) ( 0 ) for n = 0 .
Proof.
( i ) Let 1 p < q n . The distortion error due to any element in the set S ( q ) : = ω I n q ( α 2 a ( q ) ( ν ) ) is given by 1 75 n q 1 3 W 2 3 ( a ( q ) ) = 1 75 n q 1 3 W 2 6 q 1 . Similarly, the distortion error due to any element in the set S ( p ) is given by 1 75 n p 1 3 W 2 6 p 1 . Thus, S ( q ) S ( p ) is true if 1 75 n q 1 3 W 2 6 q 1 > 1 75 n p 1 3 W 2 6 p 1 , i.e., if 75 64 q p > 1 , which is clearly true since q > p . Hence, S ( n ) S ( n 1 ) S ( 2 ) S ( 1 ) for all n 2 , and similarly, we can prove that S ( 2 ) ( n ) S ( 2 ) ( n 1 ) S ( 2 ) ( 2 ) S ( 2 ) ( 1 ) for all n 3 .
( i i )   S ( 1 ) S ( 2 ) ( n ) is true if 1 75 n 1 1 3 W 2 3 a ( 1 ) > 1 3 W 2 3 ( a ( n ) + 1 ) , i.e., if 75 8 64 75 n > 1 , which is true for 0 n 14 .
( i i i ) For 0 n 14 , we see that S ( n 13 ) S ( 2 ) ( n ) S ( n 14 ) is true if 1 75 13 1 3 W 2 3 a ( n 13 ) > 1 3 W 2 3 ( a ( n ) + 1 ) > 1 75 14 1 3 W 2 3 a ( n 14 ) , i.e., if 1 75 13 1 2 6 n 81 > 1 2 6 n > 1 75 14 1 2 6 n 87 , i.e., if 2 81 75 13 > 1 > 2 87 75 14 , which is obviously true.
( i v ) For n 2 , the relation S ( 2 ) ( 2 ) S ( n + 1 ) is true if 1 75 n 2 1 3 W 2 3 ( a ( 2 ) + 1 ) > 1 75 n + 1 V , i.e., if 75 3 3 W 2 12 > V , which is obvious. Similarly, we can prove the rest of the inequalities. □
We now give the following proposition.
Proposition 17.
Let ≻ be the order relation on S F * ( n ) . Then,
( i )   S ( n ) S ( n 1 ) S ( n 2 ) S ( 2 ) S ( 1 ) S ( 2 ) ( n ) S ( 2 ) ( n 1 ) S ( 2 ) ( n 2 ) S ( 2 ) ( 2 ) S ( n + 1 ) S ( 2 ) ( 1 ) S ( 0 ) S ( 2 ) ( n + 1 ) S ( 2 ) ( 0 ) for all 2 n 14 .
( i i )   S ( n ) S ( n 1 ) S ( n 2 ) S ( n 13 ) S ( 2 ) ( n ) S ( n 14 ) S ( 2 ) ( n 1 ) S ( n 15 ) S ( 2 ) ( n 2 ) S ( n 16 ) S ( 2 ) ( 17 ) S ( 3 ) S ( 2 ) ( 16 ) S ( 2 ) S ( 2 ) ( 15 ) S ( 1 ) S ( 2 ) ( 14 ) S ( 2 ) ( 13 ) S ( 2 ) ( 2 ) S ( n + 1 ) S ( 2 ) ( 1 ) S ( 0 ) S ( 2 ) ( n + 1 ) S ( 2 ) ( 0 ) for all n 15 .
Proof. 
The proof of the proposition follows by combining the inequalities in Lemma 23. □
Lemma 24.
Let α F ( n ) and S F ( n ) be the sets as defined before. Then,
α F ( n + 1 ) = A ( S F ( n ) S ( 0 ) ) A ( 2 ) ( 2 ) S ( 2 ) ( 0 ) .
Proof. 
For S ( n ) , S ( n 1 ) , , S ( 2 ) , S ( 0 ) , S ( n + 1 ) S F ( n ) , we have
S ( 2 ) ( 2 ) ( n ) = α 2 a ( n ) + 2 ( ν ) = α 2 a ( n + 1 ) ( ν ) , S ( 2 ) ( 2 ) ( n 1 ) = ω I S ω ( α 2 a ( n 1 ) + 2 ( ν ) ) = ω I S ω ( α 2 a ( n ) ( ν ) ) , S ( 2 ) ( 2 ) ( 1 ) = ω I n 1 S ω ( α 2 a ( 1 ) + 2 ( ν ) ) = ω I n 1 S ω ( α 2 a ( 2 ) ( ν ) ) , S ( 2 ) ( 0 ) = ω I n S ω ( α 2 a ( 0 ) + 1 ( ν ) ) = ω I n S ω ( α 2 a ( 1 ) ( ν ) ) , S ( 2 ) ( 2 ) ( 0 ) = ω I n + 1 S ω ( α 2 a ( 0 ) ( ν ) ) { S ω ( 1 2 ) : ω I n + 2 } = ω I n + 1 S ω ( α 2 a ( 0 ) ( ν ) ) { S ω ( 1 2 ) : ω I n + 2 } .
Thus, by the expression (14), the proof of the lemma follows. □
We now prove the following lemma.
Lemma 25.
For any two sets A , B S F ( n ) , let A B . Then, the distortion error due to the set ( S F ( n ) A ) A ( 2 ) B is less than the distortion error due to the set ( S F ( n ) B ) B ( 2 ) A .
Proof. 
By Lemma 23 and Proposition 17, for all n 0 , we have
S ( n ) S ( n 1 ) S ( n 2 ) S ( 1 ) S ( n + 1 ) S ( 0 ) .
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 1 k < k n . Then, the distortion error due to the set ( α F ( n ) A ) A ( 2 ) B is given by
V ( α F ( n ) ) ( 2 75 ) n k 1 3 W 2 2 a ( k ) + ( 2 75 ) n k 1 3 W 2 2 ( a ( k ) + 1 ) + ( 2 75 ) n k 1 3 W 2 2 a ( k ) = V ( α F ( n ) ) ( 2 75 ) n k 1 3 3 W 2 4 k + ( 2 75 ) n k 1 3 W 2 4 k
Similarly, the distortion error due to the set ( α F ( n ) B ) B ( 2 ) A is
V ( α F ( n ) ) ( 2 75 ) n k 1 3 3 W 2 4 k + ( 2 75 ) n k 1 3 W 2 4 k .
Thus, (15) will be less than (16) if ( 2 75 ) n k 1 3 7 W 2 4 k > ( 2 75 ) n k 1 3 7 W 2 4 k , i.e., if ( 75 32 ) k k > 1 , which is clearly true since k < k . Now, take A = S ( k ) for 1 k n , and B = S ( n + 1 ) . 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 if
V F ( n ) ( 2 75 ) n k 1 3 3 W 2 4 k + ( 2 75 ) n + 1 V < V F ( n ) ( 2 75 ) n + 1 V + ( 2 75 ) n + 1 1 2 V 2 + ( 2 75 ) n k 1 3 4 W 2 4 k ,
i.e., if ( 2 75 ) n k 1 3 7 W 2 4 k > ( 2 75 ) n + 1 ( 2 V 1 2 V 2 ) , i.e., if ( 75 32 ) k 7 W 3 > 2 75 ( 2 V 1 2 V 2 ) , which is obviously true for k 1 . Similarly, if A = S ( n + 1 ) and B = S ( 0 ) , we can show that 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 . Thus, the proof of the lemma is complete. □
Using the similar technique as Lemma 25, the following lemma can be proved.
Lemma 26.
For any two sets A , B S F * ( n ) , let A B . Then, the distortion error due to the set ( S F * ( n ) A ) A ( 2 ) B is less than the distortion error due to the set ( S F * ( n ) B ) B ( 2 ) A .
The following lemma is useful.
Lemma 27.
Let α be an optimal set of n-means with α ( 1 5 , 2 5 ) = = α ( 3 5 , 4 5 ) , and let i = 1 , 2 . Set β i : = α J i , n i : = card ( β i ) , β c : = α C , and n c : = card ( β c ) . Then, S i 1 ( α i ) is an optimal set of n i -means, and β c is an optimal set of n c -means for ν. Moreover, V n ( P ) = 1 75 ( V n 1 ( P ) + V n 2 ( P ) ) + 1 3 V n c ( ν ) .
Proof. 
Proceeding in the similar way as ([29], Lemma 3.6), we can show that S i 1 ( β i ) is an optimal set of n i -mean for i = 1 , 2 . Proof of β c is an optimal set of n c -means for ν is also similar with a minor modification. α ( 1 5 , 2 5 ) = = α ( 3 5 , 4 5 ) implies n = n 1 + n 2 + n c and α = β 1 β 2 β c . For i = 1 , 2 , we have
J i min a β i ( x a ) 2 d P = 1 3 J i min a β i ( x a ) 2 d ( P S i 1 ) = 1 75 min a S i 1 ( β i ) ( x a ) 2 d P = 1 75 V n i ( P ) .
Moreover,
V n c ( ν ) = β c min a β c ( x a ) 2 d ν .
Thus, we have
V n ( P ) = i = i 2 J i min a β i ( x a ) 2 d P + β c min a β c ( x a ) 2 d P = 1 75 ( V n 1 ( P ) + V n 2 ( P ) ) + 1 3 V n c ( ν ) .
This completes the proof of the lemma. □
Remark 13.
By Remark 12 and Lemma 27, we see that if α F ( n ) is an optimal set of F ( n ) -means for any n 1 , then α F ( n ) contains F ( n 1 ) elements from each of J 1 and J 2 , and 2 a ( n ) elements from C, yielding the fact that V F ( n ) ( P ) = 2 75 V F ( n 1 ) ( P ) + 1 3 V 2 a ( n ) ( ν ) .
Proposition 18.
For any n 0 , the set α F ( n ) is an optimal set of F ( n ) -means for the condensation measure P with quantization error given by
V F ( n ) : = V F ( n ) ( P ) = 89 21 , 900 if n = 0 , 2537 6 , 570 , 000 if n = 1 , 1 129 1 16 n 3473 941 , 700 ( 2 75 ) n if n 2 .
Proof. 
By Proposition 14, we know that α F ( 0 ) is an optimal set of F ( 0 ) -means with quantization error 89 21 , 900 . Using Lemma 17 and the expression (11), the distortion error due to the set α F ( 1 ) is obtained as
min a α F ( 1 ) ( x a ) 2 d P = 1 3 V 2 2 a ( 1 ) ( ν ) + ω I C ω min a S ω ( α 2 a ( 0 ) ( ν ) ) ( x a ) 2 d P + ω I 2 J ω ( x a ) 2 d P = 1 3 W 2 2 + 1 3 2 75 W 2 2 a ( 0 ) + ( 2 75 ) 2 V = 2537 6,570,000 = 0.000386149 .
First, we show that α F ( 1 ) is an optimal set of F ( 1 ) -means. Let β be an optimal set of F ( 1 ) -means and V F ( 1 ) is the corresponding quantization error. Then, from the above calculation, we have V F ( 1 ) 0.000386149 . Recall that β contains points from J 1 , J 2 and C, and β does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 2 5 , 3 5 ) . Due to symmetry of P, we can assume that β contains an equal number of elements from each of J 1 and J 2 , and the rest of the elements of β are equally spaced over the set C with respect to the uniform distribution ν . Thus, card ( β J 1 ) = card ( β J 2 ) 3 . Suppose that card ( β J 1 ) = card ( β J 2 ) = 1 , then
V F ( 1 ) 2 J 1 min a β J 1 ( x a ) 2 d P = 2 75 V = 0.00295282 > V F ( 1 ) ,
which is a contradiction. Next, suppose that card ( β J 1 ) = card ( β J 2 ) = 2 , then,
V F ( 1 ) 2 J 1 min a β J 1 ( x a ) 2 d P = 2 75 V 2 = 0.000812075 > V F ( 1 ) ,
which leads to another contradiction. So, we can assume that card ( β J 1 ) = card ( β J 2 ) = 3 . Then, by Lemma 27, we have S 1 1 ( β J 1 ) = S 2 1 ( β J 2 ) = α F ( 0 ) . Hence, by Remark 12, β = S 1 ( α F ( 0 ) ) S 2 ( α F ( 0 ) ) α 2 ( ν ) = α F ( 1 ) , i.e., α F ( 1 ) is an optimal set of F ( 1 ) -means, and the corresponding quantization error is given by V F ( 1 ) = 2537 6,570,000 . The distortion error due to the set α F ( n ) for any n 2 is given by
min a α F ( n ) ( x a ) 2 d P = 1 3 V 2 2 a ( n ) ( ν ) + k = 0 n 1 ω I n k C ω min a S ω ( α 2 a ( k ) ( ν ) ) ( x a ) 2 d P + ω I n + 1 J ω ( x a ) 2 d P = 1 3 W 2 2 a ( n ) + k = 1 n 1 ω I n k 1 3 1 75 n k W 2 2 a ( k ) + ω I n 1 3 1 75 n W 2 2 a ( 0 ) + ( 2 75 ) n + 1 V = 1 3 4 W 16 n + k = 1 n 1 1 3 ( 2 75 ) n k 4 W 16 k + 1 3 ( 2 75 ) n W + ( 2 75 ) n + 1 V = 1 3 4 W 16 n + ( 2 75 ) n 4 W 3 k = 1 n 1 ( 75 32 ) k + 1 3 ( 2 75 ) n W + ( 2 75 ) n + 1 V = 1 3 4 W 16 n + ( 2 75 ) n W 3 4 W 3 75 43 1 ( 75 32 ) n 1 + 2 75 V ,
yielding
min a α F ( n ) ( x a ) 2 d P = 1 129 1 16 n 3473 941,700 ( 2 75 ) n .
Now, we show that α F ( 2 ) is an optimal set of F ( 2 ) -means. Let γ be an optimal set of F ( 2 ) -means, and V F ( 2 ) is the corresponding quantization error. By (17), we have V F ( 2 ) 0.0000276584 . We show that card ( γ J 1 ) = card ( γ J 2 ) = 8 . Due to symmetry of P we can assume that γ contains equal number of elements from each of J 1 and J 2 , and the rest of the elements of β are equally spaced over the set C with respect to the uniform distribution ν . Suppose that card ( γ J 1 ) = card ( γ J 2 ) 6 . Then, if α 6 is an optimal set of six-means, by Remark 10, we have
V F ( 2 ) 2 J 1 min a γ J 1 ( x a ) 2 d P 2 J 1 min a S 1 ( α 6 ) ( x a ) 2 d P = 2 75 21,481 19,710,000 ,
i.e., V F ( 2 ) 0.0000290627 > V F ( 2 ) , which is a contradiction. Suppose that card ( γ J 1 ) = card ( γ J 2 ) = 7 . Then, by Remark 11, we have
V F ( 2 ) 2 J 1 min a γ J 1 ( x a ) 2 d P + 1 3 V 10 ( ν ) = 2 75 7273 9,855,000 + 1 3 W 10 2 = 0.0000307911 > V F ( 2 ) ,
which leads a contradiction. Similarly, we can show that if card ( γ J 1 ) = card ( γ J 2 ) 9 , a contradiction arises, i.e., card ( γ J 1 ) = card ( γ J 2 ) = 8 , and so by Remark 12, γ = S 1 ( α F ( 1 ) ) S 2 ( α F ( 1 ) ) α 2 a ( 2 ) ( ν ) = α F ( 2 ) , i.e., α F ( 2 ) is an optimal set of F ( 2 ) -means, and the corresponding quantization error is given by V F ( 2 ) = 0.0000276584 .
Let α F ( n ) be an optimal set of F ( n ) -means for some n 2 . We show that α F ( n + 1 ) is an optimal set of F ( n + 1 ) -means. We have α F ( n ) = A S F ( n ) A . Recall that, by Proposition 16, an optimal set of n-means for any n 3 does not contain any point from the open intervals ( 1 5 , 2 5 ) and ( 3 5 , 4 5 ) . In the first step, let A ( 1 ) S F ( n ) be such that A ( 1 ) B for any other B S F ( n ) . Then, by Lemma 25, 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 second step, let A ( 2 ) ( S F ( n ) { A ( 1 ) } ) { A ( 2 ) ( 1 ) } be such that A ( 2 ) B for any other set B ( S F ( n ) { A ( 1 ) } ) { A ( 2 ) ( 1 ) } . Then, using the similar technique as Lemma 25, we can show the distortion error due to the following set:
( ( α F ( n ) A ( 1 ) ) A ( 2 ) ( 1 ) ) A ( 2 ) A ( 2 ) ( 2 )
where 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 (18) by the set B. In other words, ( ( α F ( n ) A ( 1 ) ) A ( 2 ) ( 1 ) ) A ( 2 ) 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 ( 2 n + 3 ) steps, we can see that α F ( n + 1 ) = A ( S F ( n ) S ( 0 ) ) A ( 2 ) ( 2 ) S ( 2 ) ( 0 ) forms an optimal set of F ( n + 1 ) -means. Thus, by the induction principle, we can say that for any n 0 , the set α F ( n ) forms an optimal set of F ( n ) -means with quantization error V F ( n ) as given in the hypothesis. Thus, the proof of the proposition is complete. □

4.3. Asymptotics for the nth Quantization Error V n ( P )

In this subsection, we show that the quantization dimension of the condensation measure P exists and equals to the quantization dimension of the uniform distribution ν . In addition, we show that the D ( P ) -dimensional quantization coefficient for the condensation measure P does not exist, and the lower and upper quantization coefficients for P are finite and positive.
Theorem 3.
Let P be the condensation measure associated with the uniform distribution ν. Then, lim n 2 log n log V n ( P ) = 1 , i.e., the quantization dimension D ( P ) of the measure P exists and equals to the quantization dimension D ( ν ) of ν.
Proof. 
For n N , n 4 , let ( n ) be the least positive integer such that F ( ( n ) ) n < F ( ( n ) + 1 ) . Then, V F ( ( n ) + 1 ) < V n V F ( ( n ) ) . Thus, we have
2 log F ( ( n ) ) log V F ( ( n ) + 1 ) < 2 log n log V n < 2 log F ( ( n ) + 1 ) log V F ( ( n ) ) .
Notice that when n , then ( n ) . By Proposition 18, we have
lim ( n ) 2 log F ( ( n ) ) log V F ( ( n ) + 1 ) = 2 lim ( n ) log ( 4 ( n ) + 2 ( n ) + 1 ) log 1 129 1 16 ( n ) + 1 3473 941 , 700 ( 2 75 ) ( n ) + 1 ( form ) = 2 lim ( n ) 1 129 1 16 ( n ) + 1 3473 941 , 700 ( 2 75 ) ( n ) + 1 4 ( n ) + 2 ( n ) + 1 4 ( n ) log 4 + 2 ( n ) + 1 log 2 1 129 1 16 ( n ) + 1 log 16 + 3473 941 , 700 ( 2 75 ) ( n ) + 1 log 2 75 = 2 log 4 log 16 = 1 .
Similarly, lim ( n ) 2 log F ( ( n ) + 1 ) log V F ( ( n ) ) = 1 . Thus, 1 lim inf n 2 log n log V n lim sup n 2 log n log V n 1 , implying the fact that the quantization dimension of the measure P exists and equals to the quantization dimension D ( ν ) of ν , which is the theorem. □
Theorem 4.
The D ( P ) -dimensional quantization coefficient for the condensation measure P does not exist.
Proof. 
For any n N , by Proposition 17 and Lemma 25, we see that ( α F ( n ) S ( n ) ) S ( 2 ) ( n ) is an optimal set of F ( n ) + 2 a ( n ) -means with quantization error
V F ( n ) + 2 a ( n ) = V F ( n ) 1 3 W 2 2 a ( n ) + 1 3 W 2 2 ( a ( n ) + 1 ) = V F ( n ) W 16 n = ( 1 129 W ) 1 16 n 3473 941,700 ( 2 75 ) n = 19 4300 1 16 n 3473 941,700 ( 2 75 ) n .
Since F ( n ) + 2 a ( n ) = 4 n + 2 n + 1 + 2 2 n 1 = 3 2 4 n + 2 n + 1 , we have
lim n ( F ( n ) + 2 a ( n ) ) 2 V F ( n ) + 2 a ( n ) = lim n ( 3 2 4 n + 2 n + 1 ) 2 ( 19 4300 1 16 n 3473 941 , 700 ( 2 75 ) n ) = 171 17,200 .
Again, ( F ( n ) ) 2 = ( 4 n + 2 n + 1 ) 2 = 16 n + 2 3 n + 2 + 4 n + 1 = 16 n ( 1 + 4 2 n + 4 4 n ) , and
V F ( n ) ( P ) = 1 129 1 16 n 3473 941,700 ( 2 75 ) n = 1 16 n 1 129 3473 941 , 700 ( 32 75 ) n .
Thus,
lim n ( F ( n ) ) 2 V F ( n ) = 1 129 .
By Equations (19) and (20), we see that lim inf n n 2 V n ( P ) 1 129 < 171 17,200 lim sup n n 2 V n ( P ) ; in other words, lim n n 2 V n ( P ) does not exist, i.e., the D ( P ) -dimensional quantization coefficient for the condensation measure P does not exist. □
Theorem 5.
The D ( P ) -dimensional lower and upper quantization coefficients for the condensation measure P are finite and positive.
Proof. 
For n N , n 4 , let ( n ) be the least positive integer such that F ( ( n ) ) n < F ( ( n ) + 1 ) . Then, V F ( ( n ) + 1 ) < V n V F ( ( n ) ) , implying ( F ( ( n ) ) ) 2 V F ( ( n ) + 1 ) < n 2 V n < ( F ( ( n ) + 1 ) ) 2 V F ( ( n ) ) . As ( n ) whenever n , we have
lim n ( F ( ( n ) ) ) 2 ( F ( ( n ) + 1 ) ) 2 = lim n 4 ( n ) + 2 ( n ) + 1 4 ( n ) + 1 + 2 ( n ) + 2 2 = 1 16 .
Again, ( F ( ( n ) ) ) 2 = ( 4 ( n ) + 2 ( n ) + 1 ) 2 = 16 ( n ) + 2 3 ( n ) + 2 + 4 ( n ) + 1 = 16 ( n ) ( 1 + 4 2 ( n ) + 4 4 ( n ) ) , and
V F ( ( n ) ) ( P ) = 1 129 1 16 ( n ) 3473 941,700 ( 2 75 ) ( n ) = 1 16 ( n ) 1 129 3473 941 , 700 ( 32 75 ) ( n ) .
Thus,
lim n ( F ( ( n ) ) ) 2 V F ( ( n ) + 1 ) = 1 16 lim n ( F ( ( n ) + 1 ) ) 2 V F ( ( n ) + 1 ) = 1 16 1 129 , and similarly ,
lim n ( F ( ( n ) + 1 ) ) 2 V F ( ( n ) ) = 16 129 ,
yielding the fact that 1 16 1 129 lim inf n n 2 V n ( P ) lim sup n n 2 V n ( P ) 16 129 , i.e., the D ( P ) -dimensional lower and quantization coefficients for the condensation measure P are finite and positive, which is the theorem. □
Remark 14.
Notice that ( 1 3 ( 1 5 ) 2 ) κ 2 + κ + ( 1 3 ( 1 5 ) 2 ) κ 2 + κ = 1 implies κ = 2 log 2 log 75 log 2 0.382496 < 1 = D ( ν ) = max { κ , D ( ν ) } . In Theorem 3, we have proved that D ( P ) = D ( ν ) .
We conclude this paper with the following remark.
Remark 15.
Using the similar techniques or by giving a major overhaul to our techniques given in the last two sections, Section 3 and Section 4, one can investigate optimal quantization for more general condensation measures.

Author Contributions

Writing—review & editing, S.D., M.K.R. and S.V. All authors have read and agreed to the published version of the manuscript.

Funding

The first author thanks IIIT Allahabad (Ministry of Education, India) for financial support through a Senior Research Fellowship.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Facloner, K.J. Techniques in Fractal Geometry; John Wiley & Sons Ltd.: Chichester, UK, 1997. [Google Scholar]
  2. Graf, S.; Luschgy, H. Foundations of Quantization for Probability Distributions; Lecture Notes in Mathematics 1730; Springer: Berlin/Heidelberg, Germany, 2000. [Google Scholar]
  3. Abaya, E.F.; Wise, G.L. Some remarks on the existence of optimal quantizers. Stat. Probab. Lett. 1984, 2, 349–351. [Google Scholar] [CrossRef]
  4. Gersho, A.; Gray, R.M. Vector Quantization and Signal Compression; Kluwer Academy publishers: Boston, MA, USA, 1992. [Google Scholar]
  5. Gray, R.M.; Kieffer, J.C.; Linde, Y. Locally optimal block quantizer design. Inf. Control 1980, 45, 178–198. [Google Scholar] [CrossRef]
  6. György, A.; Linder, T. On the structure of optimal entropy-constrained scalar quantizers. IEEE Trans. Inf. Theory 2002, 48, 416–427. [Google Scholar] [CrossRef]
  7. Gray, R.; Neuhoff, D. Quantization. IEEE Trans. Inform. Theory 1998, 44, 2325–2383. [Google Scholar] [CrossRef]
  8. Zam, R. Lattice Coding for Signals and Networks: A Structured Coding Approach to Quantization, Modulation, and Multiuser Information Theory; Cambridge University Press: Cambridge, MA, USA, 2014. [Google Scholar]
  9. Dettmann, C.P.; Roychowdhury, M.K. Quantization for uniform distributions on equilateral triangles. Real Anal. Exch. 2017, 42, 149–166. [Google Scholar] [CrossRef]
  10. Dai, M.; Liu, Z. The quantization dimension and other dimensions of probability measures. Int. J. Nonlinear Sci. 2008, 5, 267–274. [Google Scholar]
  11. Facloner, K.J. The multifractal spectrum of statistically self-similar measures. J. Theoret. Probab. 1994, 7, 681–701. [Google Scholar]
  12. Graf, S.; Luschgy, H. The Quantization Dimension of Self-Similar Probabilities. Math. Nachr. 2002, 241, 103–109. [Google Scholar] [CrossRef]
  13. Lindsay, L.J.; Mauldin, R.D. Quantization dimension for conformal iterated function systems. Nonlinearity 2002, 15, 189–199. [Google Scholar] [CrossRef]
  14. Pötzelberger, K. The quantization dimension of distributions. Math. Proc. Camb. Phil. Soc. 2001, 131, 507–519. [Google Scholar] [CrossRef]
  15. Rosenblatt, J.; Roychowdhury, M.K. Optimal quantization for piecewise uniform distributions. Unif. Distrib. Theory 2018, 13, 23–55. [Google Scholar] [CrossRef]
  16. Roychowdhury, M.K. Optimal quantizers for some absolutely continuous probability measures. Real Anal. Exch. 2017, 43, 105–136. [Google Scholar] [CrossRef]
  17. Roychowdhury, M.K. Least upper bound of the exact formula for optimal quantization of some uniform Cantor distributions. Discret. Contin. Dyn. Syst. Ser. 2018, 38, 4555–4570. [Google Scholar] [CrossRef]
  18. Roychowdhury, M.K. Quantization dimension estimate for condensation systems of conformal mappings. Real Anal. Exch. 2013, 38, 317–335. [Google Scholar] [CrossRef]
  19. Roychowdhury, M.K. Quantization dimension function and ergodic measure with bounded distortion. Bull. Pol. Acad. Sci. Math. 2009, 57, 251–262. [Google Scholar] [CrossRef]
  20. Zhu, S. Quantization dimension for condensation systems. Math. Z. 2008, 259, 33–43. [Google Scholar] [CrossRef]
  21. Zhu, S. Asymptotic quantization errors for in-homogeneous self-similar measures supported on self-similar sets. Sci. China Math. 2016, 59, 337–350. [Google Scholar] [CrossRef]
  22. Barnsley, M.F. Fractals Everywhere; Academic Press: New York, NY, USA; London, UK, 1988. [Google Scholar]
  23. Lasota, A. A variational principle for fractal dimensions. Nonlinear Anal. 2006, 64, 618–628. [Google Scholar] [CrossRef]
  24. Olsen, L.; Snigireva, N. Multifractal spectra of in-homogenous self-similar measures. Indiana Univ. Math. J. 2008, 57, 1789–1844. [Google Scholar] [CrossRef]
  25. Liszka, P. The Lq spectra and Rényi dimension of generalized inhomogeneous self-similar measures. Cent. Eur. J. Math. 2014, 12, 1305–1319. [Google Scholar]
  26. Olsen, L.; Snigireva, N. Lq spectra and Rényi dimensions of in-homogeneous self-similar measures. Nonlinearity 2007, 20, 151–175. [Google Scholar] [CrossRef]
  27. Priyadarshi, A.; Roychowdhury, M.K.; Verma, M. Quantization dimensions for inhomogeneous bi-Lipschitz iterated function systems. Monatshefte Math. 2025, 207, 125–140. [Google Scholar] [CrossRef]
  28. Dubey, S.; Roychowdhury, M.K.; Verma, S. Quantization dimension for a generalized inhomogeneous bi-Lipschitz iterated function system. arXiv 2025, arXiv:2503.11105. [Google Scholar]
  29. Cömez, D. Roychowdhury, M.K. Quantization for uniform distributions on stretched Sierpinski triangles. Monatshefte Math. 2019, 190, 79–100. [Google Scholar] [CrossRef]
  30. Bucklew, J.A.; Wise, G.L. Multidimensional asymptotic quantization theory with rth power distortion measures. IEEE Trans. Inf. Theory 1982, 28, 239–247. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Dubey, S.; Roychowdhury, M.K.; Verma, S. Quantization for a Condensation System. Mathematics 2025, 13, 1424. https://doi.org/10.3390/math13091424

AMA Style

Dubey S, Roychowdhury MK, Verma S. Quantization for a Condensation System. Mathematics. 2025; 13(9):1424. https://doi.org/10.3390/math13091424

Chicago/Turabian Style

Dubey, Shivam, Mrinal Kanti Roychowdhury, and Saurabh Verma. 2025. "Quantization for a Condensation System" Mathematics 13, no. 9: 1424. https://doi.org/10.3390/math13091424

APA Style

Dubey, S., Roychowdhury, M. K., & Verma, S. (2025). Quantization for a Condensation System. Mathematics, 13(9), 1424. https://doi.org/10.3390/math13091424

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

Article Metrics

Back to TopTop