A Basic Topological Approach to the Continuity of the Size Function

Abstract

We present old and new results about the size function of a set providing simple and complete proofs using basic tools of general topology. For instance, the decomposition of the size function is given and, under the calmness property of a set, the right continuity of the size function with respect to both arguments is established. Finally, a classification of its points of discontinuity is given.

Share and Cite:

Dubeau, F. (2022) A Basic Topological Approach to the Continuity of the Size Function. Advances in Pure Mathematics, 12, 565-586. doi: 10.4236/apm.2022.1210044.

1. Introduction

Size functions are shape descriptors, in a geometrical/topological sense. They are functions counting certain connected components of a topological space. In this paper, we revisit the very first basic results about the continuity of the size function. The main contribution is to present simple and complete proofs of old and new results using only basic topological tools. For example, the fundamental result on the decomposition of the size function is established in Theorem 9 of Section 0. Moreover, the introduction of the calmness property for a set allows us to, not only simplify some proofs of old results, but also present simple proofs of the continuity to the right for the size function with respect to its two arguments, given in Theorem 16 and Theorem 17 of Section 7. To complete the paper, we present a classification of the discontinuity points of the size function. Several papers have been dedicated to the study of size functions. For the purpose of this survey, and because we use only basic topology, it is enough to consider [1] [2] [3] [4] and references therein. One of the motivations for studying these functions is the possibility to use them in topology, image analysis, and pattern recognition, see for example [5] [6].

2. Path Connectivity and Equivalence Relation

Let C be a subset of n . A path in C joining a point p to a point q in C is a continuous function h ( ) defined on [ 0,1 ] with values in C such that h ( 0 ) = p and h ( 1 ) = q . The notion of a path in C induces an equivalence relation on any subset E of n . Any two points p and q of E are said to be C -equivalent, and we use the notation p C q , if and only if either p = q or there is a path joining p and q in C , in other words

p C q iff { p = q or h : [ 0,1 ] C , continuous , such that h ( 0 ) = p and h ( 1 ) = q .

To each p n we associate a non empty subset

[ p ] C = { q n | p C q } .

For any subset E n and to each p n we define the set

[ p ] C E = [ p ] C E = { q E | p C q } .

Hence we have

[ p ] C E { if p E , = if p E .

For E 1 E 2 , we have [ p ] C E 1 = [ p ] C E 1 [ p ] C E 2 = [ p ] C E 2 , and we can write [ p ] C E 1 = [ p ] C E 2 E 1 . Also, for C 1 C 2 , we have [ p ] C 1 E [ p ] C 2 E .

The family of sets { P n | p E such that P = [ p ] C E } is a partition of E ,

a family of non empty and disjoint sets called quotient set of E with respect to C , and noted E / C . Elements of E / C are called equivalence classes. Hence two elements of E are members of the same set P of E / C if and only if they are C -equivalent. Each element p of one P E / C is a representative of the

equivalence class P. So if p 1 and p 2 P E / C then [ p 1 ] C E = P = [ p 2 ] C E . The application π C E : E E / C , defined by π C E ( p ) = [ p ] C E , is called the projection of

E on E / C , it is a surjection.

For any set A we define the cardinality of this set, noted Card ( A ) , by

Card ( A ) = { thenumberofelementsof A , if this number is finite , + , else .

The first two results follow easily.

Theorem 1. Let E 1 and E 2 be two non empty sets such that E 1 E 2 . The application

[ p ] C E 1 [ p ] C E 2 ,

defined for all p E 1 , induces an injection I C ( ) of E 1 / C to E 2 / C . Hence

Card ( E 1 / C ) Card ( E 2 / C ) ,

and

E 2 / C \ I C ( E 1 / C ) = ( E 2 \ I C ( E 1 / C ) ) / C ,

or equivalently

E 2 / C = I C ( E 1 / C ) ( E 2 \ I C ( E 1 / C ) ) / C .

Theorem 2. Let C 1 and C 2 two non empty sets such that C 1 C 2 . The application

[ p ] C 1 E [ p ] C 2 E ,

defined for any p in E , induces a surjection J E ( ) from E / C 1 to E / C 2 . Hence

Card ( E / C 1 ) Card ( E / C 2 ) .

Moreover, for all P 2 E / C 2 , J E 1 ( P 2 ) = { P 1 E / C 1 | J E ( P 1 ) = P 2 } is a partition of P 2 .

We combine now the first two results we get the next one.

Theorem 3. Let E 1 , E 2 and C 1 , C 2 be non empty sets such that E 1 E 2 and C 1 C 2 . For the injections

I C j : E 1 / C j E 2 / C j ( j = 1 , 2 )

defined in Theorem 1 we have

Card ( ( E 2 \ I C 1 ( E 1 / C 1 ) ) / C 1 ) Card ( ( E 2 \ I C 2 ( E 1 / C 2 ) ) / C 2 )

Proof. For E 1 E 2 and C , let us consider the injection

I C : E 1 / C E 2 / C .

The subset I C ( E 1 / C ) of E 2 increase when C increase. Indeed, for p E 1 , the set [ p ] C E 2 increase with C . Because the elements of I C ( E 1 / C ) are of the form [ p ] C E 2 for p E 1 , we deduce that I C ( E 1 / C ) increase with C . This fact implies that

E 2 \ I C 1 ( E 1 / C 1 ) E 2 \ I C 2 ( E 1 / C 2 ) .

From Theorem 1 we have

Card ( ( E 2 \ I C 1 ( E 1 / C 1 ) ) / C j ) Card ( ( E 2 \ I C 2 ( E 1 / C 2 ) ) / C j )

for j = 1 , 2 . Otherwise from Theorem 2 we have

Card ( ( E 2 \ I C j ( E 1 / C j ) ) / C 1 ) Card ( ( E 2 \ I C j ( E 1 / C j ) ) / C 2 )

for j = 1 , 2 . Hence

Card ( ( E 2 \ I C 1 ( E 1 / C 1 ) ) / C 1 ) Card ( ( E 2 \ I C 2 ( E 1 / C 2 ) ) / C 1 ) Card ( ( E 2 \ I C 2 ( E 1 / C 2 ) ) / C 2 ) ,

and the result follows. □

We obtain directly the next result which will allow us to get a decomposition the size function.

Theorem 4. Let { E i } i I a partition of E and { C i } i I a partition of C . We have

(a) If, for all p E , there exists a set E i such that [ p ] C E E i , in other words [ p ] C E = [ p ] C E i , then E / C = i I E i / C .

(b) If, for all p and q E i , we have p C q p C i q , then E i / C = E i / C i .

(c) Under the preceding assumptions in (a) and (b), we have E / C = i I E i / C i .

Finally, let us state a classical result for a path connected set [7].

Theorem 5. The quotient set E / C is the set of path connected components of E .

3. Size Function

The size function of a set M is defined from a measure function, noted φ , which is simply a well defined and continuous application on n . For any subset D of n the following notation will be used

D ( φ x ) = { p D | φ ( p ) x } ,

which can be extended to subsets D ( φ = x ) , D ( φ x ) , D ( φ < x ) and D ( φ > x ) .

We consider the quotient set M ( φ x ) / M ( φ y ) of M ( φ x ) obtained from the equivalence relation M ( φ y ) induced by continuous paths in M ( φ y ) . The size function associated with the set M and the measure function φ , noted L ( M , φ ) ( , ) , is defined as the number of elements in this quotient set. Using the function Card ( ) , we have

L ( M , φ ) ( x , y ) = Card ( M ( φ x ) / M ( φ y ) ) .

Hence

1) L ( M , φ ) ( x , y ) = 0 if M ( φ x ) / M ( φ y ) is empty;

2) L ( M , φ ) ( x , y ) = { 1,2,3, } if M ( φ x ) / M ( φ y ) has a finite number of elements;

3) L ( M , φ ) ( x , y ) = + if M ( φ x ) / M ( φ y ) has infinitely many elements.

Example 6. The simplest example, with no interest for the sequel of the paper, is for M = { a } . Let φ ( a ) = s . Hence

M ( φ x ) = { M if x s , if x < s .

For any y , we have

M ( φ x ) / M ( φ y ) = { M / M ( φ y ) = { M } if x s , if x < s ,

hence

L ( M , φ ) ( x , y ) = { 1 if x s , 0 if x < s .

Since M ( φ ζ ) increases with respect to ζ , an increasing/decreasing property of the size function follows directly from Theorem 1 and Theorem 2.

Theorem 7. [2] [4] L ( M , φ ) ( x , y ) increases with respect to x and decreases with respect to y.

4. Decomposition of the Size Function

Under some assumptions, the set M can be decomposed into disjoint subsets. The size function is then decomposable into a sum of size functions of its subsets.

Theorem 8. If M is compact and locally path connected, then path connected components of M are in finite number and form M / M .

Proof. As M is locally path connected, for any point p M and any neighborhood V p of p in M there is a sub-neighborhood U p in M which is path connected. The elements of M / M are then path connected components of M . These related components are both open and closed in M , and therefore also compact. As we have M = M / M , it is a covering of the compact set M by disjoint open sets. Then, there is a finite sub-covering of M , but this sub-covering may only be the covering itself and therefore M / M has a finite number of elements, hence the result follows. □

Let us set

M / M = { M n | n = 1, , N ( M ) } ,

where N ( M ) represents the number of non empty and disjoint elements of M / M in such a way that

M = n = 1 N ( M ) M n .

Moreover, we have

M ( φ x ) = n = 1 N ( M ) M n ( φ x ) .

Theorem 9. If M is compact and locally path connected, we have

M ( φ x ) / M ( φ y ) = n = 1 N ( M ) M n ( φ x ) / M n ( φ y ) ,

and then

L ( M , φ ) ( x , y ) = n = 1 N ( M ) L ( M n , φ ) ( x , y ) .

Proof. We use Theorem 4 with E = M ( φ x ) and C = M ( φ y ) . Based on (a) of Theorem 4, we have

M ( φ x ) / M ( φ y ) = n = 1 N ( M ) M n ( φ x ) / M ( φ y ) .

Based on (b) of Theorem 4, since for any p and q M n ( φ x ) we have

p M ( φ y ) q if and only if p M n ( φ y ) q ,

so we obtain

M ( φ x ) / M ( φ y ) = M n ( φ x ) / M n ( φ y ) .

The result follows from (c) of Theorem 4. □

Using this result, it is enough now to consider a compact, connected, and locally path connected set M , i.e., a compact set M with only one path connected component. Let us note this family by

K loc c = { M n | ( i ) M is compact , ( ii ) M is connected , ( iii ) M is locallypathconnected , ( iv ) M containsmorethanonepoint . } .

Condition (iv) implies that the set M contains at least two points, so consequently it contains infinitely many points and

Card ( M ) = + .

The set M K loc c will be said calm if the number of connected components of M ( φ s ) is always finite, that is to say

Card ( M ( φ s ) / M ( φ s ) ) < +

for all s.

5. General Results

Let M be a calm element of K loc c . From the continuity of φ ( ) on the compact set M , let us define s _ and s ¯ , and the set Δ ( s _ , s ¯ ) by

s _ = min { φ ( p ) | p M } max { φ ( p ) | p M } = s ¯ ,

and

Δ ( s _ , s ¯ ) = { ( x , y ) n | s _ x y s ¯ } .

We start by establishing basic general results for L ( M , φ ) ( x , y ) defined on 2 which are illustrated in Figure 1.

Figure 1. The function L ( M , φ ) ( x , y ) .

Theorem 10. [2] [4] Suppose s _ s ¯ . We have

i) L ( M , φ ) ( x , y ) = 0 for all ( x , y ) R 0 = { ( x , y ) 2 | x < s _ } ;

ii) L ( M , φ ) ( x , y ) = 1 for all ( x , y ) R 1 where

R 1 = { ( x , y ) 2 | x s _ and y s ¯ } ;

iii) L ( M , φ ) ( x , y ) = + for all ( x , y ) R where

R = { ( x , y ) 2 | x s _ and y < min { x , s ¯ } } ;

iv) 1 L ( M , φ ) ( x , y ) < + for all s Δ ( s _ , s ¯ ) .

Proof. i) In this case M ( φ x ) = .

ii) Here we have

M ( φ x ) / M ( φ y ) = M ( φ x ) / M = { M ( φ x ) } .

iii) There exists a non isolated point p M such that y < φ ( p ) x . Hence

from continuity of φ ( ) , M ( φ x ) / M ( φ y ) contains an infinity of singletons,

the result follows.

iv) Direct consequence of the definition of the size function for a calm set M , and the increasing/decreasing property of Theorem 7. □

Now, since L ( M , φ ) ( x , y ) is an integer valued function, we get directly the next result.

Theorem 11. [2] [4] At any point of continuity of L ( M , φ ) ( x , y ) there is a neighborhood of this point where the function is constant.

6. Examples

6.1. Generalities

We present three simple examples of the size function based on two different measure functions φ ( ) . In each example, the set M is a simple continuous curve of finite length. It is a compact, connected, and locally path connected set.

6.2. First Example

Let M 2 given in Figure 2. The measure function is

φ ( p ) = ( u 2 + v 2 ) 1 / 2

which is the euclidean distance from the origin O = ( 0,0 ) to p = ( u , v ) 2 . We have s _ = 1 and s ¯ = 6 . Figure 3 presents the size function L ( M , φ ) ( x , y ) on Δ ( s _ , s ¯ ) for the set M .

Figure 2. The set M .

Figure 3. Values of the function L ( M , φ ) ( x , y ) .

M is a calm set. On the diagonal of Δ ( s _ , s ¯ ) , namely ( x , y ) = ( s , s ) for s [ 1,6 ] , we have

L ( M , φ ) ( s , s ) = { 2 for s [ 1,2 ) , 4 for s [ 2,3 ) , 6 for s [ 3,4 ) , 4 for s [ 4,5 ) , 2 for s [ 5,6 ) , 1 for s = 6.

6.3. Second Example

The set M of Figure 4 is a curve of finite length. The measure function is the distance of a point p = ( u , v ) to the O u axis, so we have

φ ( p ) = | v | .

The size function is given in Figure 5. We have s _ = 1 and s ¯ = 6 .

M is also a clam set. On the diagonal of Δ ( s _ , s ¯ ) , namely ( x , y ) = ( s , s ) for s [ 1,6 ] , we have

Figure 4. The set M .

L ( M , φ ) ( s , s ) = { 1 for s [ 1,2 ) , 2 for s [ 2,2.5 ) , 3 for s [ 2.5,3 ) , 1 for s [ 3,4 ) , 4 for s [ 4,4.5 ) , 3 for s [ 4.5,5 ) , 2 for s [ 5,6 ) , 1 for s = 6.

6.4. Third Example

For the third example, we slightly modify the preceding example as indicated in Figure 6. In this set, two sequences of triangles with decreasing height go to the points A and B. For the point A, the coordinates of the highest vertex of each triangle are

( u n , v n ) = ( 1 + 4 ( 1 2 ) n ,4 + 2 ( 1 2 ) n ) ,

Figure 5. The function L ( M , φ ) ( x , y ) .

Figure 6. The set M .

for n = 0 , 1 , 2 , . We have lim n ( u n , v n ) = ( 1 , 4 ) = A . For the point B, the coordinates of the lowest vertex of each triangle are

( u n , v n ) = ( 1 + 4 ( 1 2 ) n , 3 2 ( 1 2 ) n ) .

for n = 0 , 1 , 2 , . We have lim n ( u n , v n ) = ( 1 , 3 ) = B .

Figure 7 contains the graph of the size function L ( M , φ ) ( x , y ) for the set M of Figure 6. We have s _ = 1 and s ¯ = 6 . On the diagonal of Δ ( s _ , s ¯ ) , namely ( x , y ) = ( s , s ) for s [ 1,6 ] , we have

L ( M , φ ) ( s , s )

L ( M , φ ) ( s , s ) = { n + 1 for s [ 3 2 ( 1 2 ) n ,3 2 ( 1 2 ) ( n + 1 ) ) , n = 0,1,2, , 1 for s [ 3,4 ) , + for s = 4, n + 1 for s [ 4 + 2 ( 1 2 ) ( n + 1 ) ,4 + 2 ( 1 2 ) n ) , n = 0,1,2, , 1 for s = 6.

So, M is not a calm set, the problem is around the point A.

Figure 7. The function L ( M , φ ) ( x , y ) .

7. Continuity Properties of Size Function

In this section we present continuity results of the size function L ( M , φ ) ( x , y ) for a particular family of sets, namely calm set M in K loc c . New results will complete old ones that can be found in [2] [4]. We present simple proofs of all results. In particular, the assumption of calmness of a set, which might simplify proofs of old results, is mainly introduced to prove, using elementary topological tools, the right continuity of the size function L ( M , φ ) ( x , y ) with respect to the variable y.

Let us now consider the size function L ( M , φ ) ( x , y ) defined on the set Δ ( s _ , s ¯ ) for s _ < s ¯ .

Theorem 12. For ( x , y ) Δ ( s _ , s ¯ ) ,

1) there exists ε ( x , y ) > 0 such that the function L ( M , φ ) ( , y ) is constant on the segments ( x ε ( x , y ) , x ) × { y } and ( x , x + ε ( x , y ) ) × { y } in Δ ( s _ , s ¯ ) ;

2) there exists ε ( x , y ) > 0 such that the function L ( M , φ ) ( x , ) is constant on the segments { x } × ( y ε ( x , y ) , y ) and { x } × ( y , y + ε ( x , y ) ) in Δ ( s _ , s ¯ ) .

Proof. We know that L ( M , φ ) ( x , y ) < + and take only integer values. From the increasing property with respect to x, and the decreasing property with respect to y, there exists only a finite number of discontinuities on the parallel segments to the axes in Δ ( s _ , s ¯ ) . The result follows. □

Theorem 13. [4] Let x 1 , x 2 , y 1 and y 2 be real numbers such that s _ x 1 x 2 y 1 y 2 < s ¯ . Then we have the following inequality

L ( M , φ ) ( x 2 , y 1 ) L ( M , φ ) ( x 1 , y 1 ) L ( M , φ ) ( x 2 , y 2 ) L ( M , φ ) ( x 1 , y 2 ) 0,

which can be written as

L ( M , φ ) ( x 2 , y 1 ) L ( M , φ ) ( x 2 , y 2 ) L ( M , φ ) ( x 1 , y 1 ) L ( M , φ ) ( x 1 , y 2 ) 0.

Proof. Using notation of Section 2, set E i = M ( φ x i ) for i = 1 , 2 , and C j = M ( φ y j ) for j = 1 , 2 . So, we consider the injections

I C j : E 1 / C j E 2 / C j .

for j = 1 , 2 , and the result follows from Theorem 1 and Theorem 3. □

Corollary 1. Let x 1 , x 2 , y 1 and y 2 be real numbers such that s _ x 1 x 2 y 1 y 2 < s ¯ . If

L ( M , φ ) ( x 2 , y 1 ) = L ( M , φ ) ( x 1 , y 2 ) ,

then L ( M , φ ) ( x , y ) is constant on the rectangle with vertices ( x 1 , y 1 ) , ( x 2 , y 1 ) , ( x 2 , y 2 ) , and ( x 1 , y 2 ) .

Remember that L ( M , φ ) ( x , y ) is increasing with respect to x and decreasing with respect to y, and let ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) . We will consider the following definitions.

1) We will say that L ( M , φ ) ( , y ¯ ) is left discontinuous at x ¯ if

lim x x ¯ L ( M , φ ) ( x , y ¯ ) < L ( M , φ ) ( x ¯ , y ¯ ) ,

and is right discontinuous at x ¯ if

lim x x ¯ L ( M , φ ) ( x , y ¯ ) > L ( M , φ ) ( x ¯ , y ¯ ) .

2) We will say that L ( M , φ ) ( x ¯ , ) is left discontinuous at y ¯ if

lim y y ¯ L ( M , φ ) ( x ¯ , y ) > L ( M , φ ) ( x ¯ , y ¯ ) ,

and right discontinuous at y ¯ if

lim y y ¯ L ( M , φ ) ( x ¯ , y ) < L ( M , φ ) ( x ¯ , y ¯ ) .

Theorem 14. [4] Let ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) . We have the following two results.

1) If x ¯ is a point of left discontinuity of L ( M , φ ) ( , y ¯ ) , then x ¯ is also a point of left discontinuity of L ( M , φ ) ( , y ) for all y in the interval [ x ¯ , y ¯ ] .

2) If x ¯ is a point of right discontinuity of L ( M , φ ) ( , y ¯ ) , then x ¯ is also a point of right discontinuity of L ( M , φ ) ( , y ) for all y in the interval [ x ¯ , y ¯ ] .

Proof. 1) Let us assume the contrary, i.e., the function L ( M , φ ) ( , y ) is left continuous at x ¯ for a y in the interval [ x ¯ , y ¯ ) . We have

lim x x ¯ L ( M , φ ) ( x , y ) = L ( M , φ ) ( x ¯ , y ) .

But we know that L ( M , φ ) ( x , y ) increases with respect to x. So, from Theorem 13, for all x < x ¯ y < y ¯ we have

L ( M , φ ) ( x ¯ , y ) L ( M , φ ) ( x , y ) L ( M , φ ) ( x ¯ , y ¯ ) L ( M , φ ) ( x , y ¯ ) 0.

Taking the limit for x x ¯ , and using the left continuity at ( x ¯ , y ) , we get

lim x x ¯ L ( M , φ ) ( x , y ¯ ) = L ( M , φ ) ( x ¯ , y ¯ ) ,

which contradict the left discontinuity at ( x ¯ , y ¯ ) .

2) A similar proof holds for this result. Let us assume the contrary, i.e., the function L ( M , φ ) ( , y ) is right continuous at x ¯ for a y in the interval ( x ¯ , y ¯ ) . We have

lim x x ¯ L ( M , φ ) ( x , y ) = L ( M , φ ) ( x ¯ , y ) .

But we know that L ( M , φ ) ( x , y ) increases with respect to x. So, from Theorem 13, for all x ¯ < x y < y ¯ we have

L ( M , φ ) ( x , y ) L ( M , φ ) ( x ¯ , y ) L ( M , φ ) ( x , y ¯ ) L ( M , φ ) ( x ¯ , y ¯ ) 0.

Taking the limit for x x ¯ , and using the right continuity at ( x ¯ , y ) , we get

lim x x ¯ L ( M , φ ) ( x , y ¯ ) = L ( M , φ ) ( x ¯ , y ¯ ) ,

which contradict the right discontinuity at ( x ¯ , y ¯ ) . □

We have a similar proof for the next result.

Theorem 15. [4] Let ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) . We have the following two results.

1) If y ¯ is a point of left discontinuity of L ( M , φ ) ( x ¯ , ) , then y ¯ is also a point of left discontinuity of L ( M , φ ) ( x , ) for all x in the interval [ x ¯ , y ¯ ] .

2) If y ¯ is a point of right discontinuity of L ( M , φ ) ( x ¯ , ) , then y ¯ is also a point of right discontinuity of L ( M , φ ) ( x , ) for all x in the interval [ x ¯ , y ¯ ] .

Theorem 16. [4] At every point ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) such that x ¯ < y ¯ , the function L ( M , φ ) ( , y ¯ ) is right continuous with respect to x, i.e.,

lim x x ¯ L ( M , φ ) ( x , y ¯ ) = L ( M , φ ) ( x ¯ , y ¯ ) .

Proof. Since the function is constant to the right, there is a finite number of equivalence classes. When x decreases to x ¯ , by continuity of φ ( ) and compactness of the sets, all the equivalence classes decrease and remain non empty. The limit equivalence classes are non empty and no new equivalence class is created, so the size function remains constant, and hence is right continuous with respect to x. □

Theorem 17. At any point ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) such that x ¯ y ¯ < s ¯ , the function L ( M , φ ) ( x ¯ , ) is right continuous with respect to y, i.e.,

lim y y ¯ L ( M , φ ) ( x ¯ , y ) = L ( M , φ ) ( x ¯ , y ¯ ) .

Proof. The proof of this result proceeds in several steps.

Step 1. Suppose L ( M , φ ) ( x ¯ , ) is not right continuous with respect to y at y ¯ , so

L ( M , φ ) ( x ¯ , y ¯ ) > lim y y ¯ L ( M , φ ) ( x ¯ , y ) .

From Theorem 15, the discontinuity is extended to the point ( y ¯ , y ¯ ) on the diagonal of Δ ( s _ , s ¯ ) and we have

L ( M , φ ) ( y ¯ , y ¯ ) > lim y y ¯ L ( M , φ ) ( y , y ¯ )

Also, from Theorem 12 there exists ε ( y ¯ , y ¯ ) > 0 such that L ( M , φ ) ( y ¯ , y ) is constant for y ( y ¯ , y ¯ + ε ( x ¯ , y ¯ ) ) .

Step 2. From the calmness assumption, L ( M , φ ) ( y ¯ , y ¯ ) = L < + , so there are L

equivalence classes in M ( φ y ¯ ) / M ( φ y ¯ ) which are disjoint compact subsets of

n . Let d > 0 be less than the distance between any pair of equivalence classes

of M ( φ y ¯ ) / M ( φ y ¯ ) . This d is well defined because there is a finite number L of compact subsets of n to consider. Each element P l M ( φ y ¯ ) / M ( φ y ¯ ) can

be covered by the open set

P l U l = p P l B ( p ; d / 4 ) .

From the definition of d, those U l 's are disjoint open sets and we have

M ( φ y ¯ ) U = l L U l .

Step 3. Equivalence classes of M ( φ y ¯ ) / M ( φ y ¯ + ε ) , for any ε such that y ¯ < y ¯ + ε s ¯ are union of a finite number of those of M ( φ y ¯ ) / M ( φ y ¯ ) , so

they are also compact subsets of n . Our assumption on the right discontinuity implies that we can join two equivalence classes, say P 1 and P 2 , of M ( φ y ¯ ) / M ( φ y ¯ ) in M ( φ y ¯ + ε ) but we cannot join them in M ( φ y ¯ ) .

Step 4. Let us built now an open covering of M ( φ > y ¯ ) . Take ε 0 = ε ( x ¯ , y ¯ ) / 2 and take a path in M ( φ y ¯ + ε 0 ) to join the two equivalence classes P 1 and P 2 that we cannot join in M ( φ y ¯ ) . Let us suppose that this path has (at least) one point q 1 in M \ U with y ¯ < φ ( q 1 ) y ¯ + ε 0 . Take ε 1 = ( φ ( q 1 ) y ¯ ) / 2 ε 0 / 2 and V 1 = M ( φ > y ¯ + ε 1 ) . Take a path in M ( φ y ¯ + ε 1 ) which join the two equivalent classes that we cannot join in M ( φ y ¯ ) . Let us suppose that this path has (at least) one point q 2 in M \ U with y ¯ < φ ( q 2 ) y ¯ + ε 1 . Take ε 2 = ( φ ( q 2 ) y ¯ ) / 2 ε 1 / 2 and V 2 = M ( φ > y ¯ + ε 2 ) . And so on, we construct a sequence of open sets { V k } k = 1 , and a sequence of points { q k } k = 1 , such that the open set k = 1 V k cover M ( φ > y ¯ ) .

Step 5. So U k = 1 V k covers M . Any finite subcovering of this covering is included in an open covering of the form U k = 1 K V k for a certain K. But this open set does not contain q K + 1 M . Since M is compact, it means that we cannot construct the sequence of open sets { V k } k = 1 .

Step 6. If we cannot build the sequence of open sets { V k } k = 1 , there is 0 < ε < ε 0 = ε ( x ¯ , y ¯ ) / 2 such that for each path joining the two equivalence classes P 1 and P 2 in M ( φ y ¯ + ε ) , either 1) there exists p on the path such that φ ( p ) > y ¯ and then p U , or else 2) any point p on the path is such that φ ( p ) y ¯ .

1) In the first case it means that all points of the path are in U, and the path is covered by a finite union of non empty disjoint open sets, at least the two sets U 1 and U 2 , which is not possible because the path is a connected set.

2) In the second case P 1 and P 2 are joined in M ( φ y ¯ ) , which is contrary to the assumption.

In both cases we get a contradiction and the result follows. □

Now we can establish the next result.

Theorem 18. [4] Any open ball around a point of discontinuity ( x ¯ , y ¯ ) of the size function L ( M , φ ) ( , ) in Δ ( s _ , s ¯ ) contains at least one point of discontinuity with respect to x or to y in Δ ( s _ , s ¯ ) , and this point is not ( x ¯ , y ¯ ) .

Proof. Let ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) be a point of discontinuity of L ( M , φ ) ( , ) . Then, any open ball in Δ ( s _ , s ¯ ) around ( x ¯ , y ¯ ) contains one point ( x ^ , y ^ ) Δ ( s _ , s ¯ ) such that

L ( M , φ ) ( x ¯ , y ¯ ) L ( M , φ ) ( x ^ , y ^ ) .

We can connect ( x ¯ , y ¯ ) and ( x ^ , y ^ ) with a path which belongs to the open ball composed of at least two parallel segments to the axes Ox and Oy. We can arrive to the point ( x ¯ , y ¯ ) from the right, in x or in y, and from the right continuity, on this segment the value is L ( M , φ ) ( x ¯ , y ¯ ) . It is therefore necessary that L ( M , φ ) ( , ) be discontinuous along at least one of these segments, i.e., that L ( M , φ ) ( , ) admits at least one point of discontinuity, either with respect to x or with respect to y. □

Theorem 19. [4] For any p ¯ = ( x ¯ , y ¯ ) Δ ( s _ , s ¯ ) , with x ¯ < y ¯ , there is ε ( p ¯ ) > 0 such that the open set

W ε ( p ¯ ) ( p ¯ ) = { ( x , y ) Δ ( s _ , s ¯ ) : | x x ¯ | < ε ( p ¯ ) , | y y ¯ | < ε ( p ¯ ) , x x ¯ , y y ¯ }

contains no point of discontinuity of the size function L ( M , φ ) ( , ) .

Proof. If p ¯ is a point of continuity, the result follows. So let us suppose that p ¯ is a point of discontinuity and for any integer n > 0 there is a point of discontinuity p n = ( x n , y n ) in the neighborhood W 1 / n ( p ¯ ) . From Theorem 18, the points p n can be supposed to be points of discontinuity with respect to x or to y. We can extract a subsequence { p n k } k = 1 , of { p n } n = 1 such that p n k are all points of discontinuity with respect to x or all points of discontinuity with respect to y. Let us select the case where the p n k are points of discontinuity with respect to x (we could repeat the same step in case of discontinuity with respect to y). Fixing the integer N such that x ¯ + 1 / N < y ¯ 1 / N , and let us consider the function

L ( M , φ ) ( , y ¯ 1 / N ) : ( x ¯ 1 / N , x ¯ + 1 / N ) .

We know that the discontinuity of the function L ( M , φ ) ( , y ¯ 1 / N ) with respect to x is repeated for inferior values towards the diagonal. Consequently L ( M , φ ) ( , y ¯ 1 / N ) as an infinite number of point of discontinuity. Otherwise, L ( M , φ ) ( , y ¯ 1 / N ) is increasing with respect to x. Since each discontinuity implies an increasing value of at least 1, it follows that L ( M , φ ) ( x ¯ + 1 / N , y ¯ 1 / N ) = + . But this contradict the fact that L ( M , φ ) ( x , y ) is finite for all x < y (Theorem 10), hence the result follows. □

Let us look now at the closed subset of Δ ( s _ , s ¯ ) well defined for ε > 0 by

Δ ε ( s _ , s ¯ ) = { ( x , y ) Δ ( s _ , s ¯ ) | x + ε y }

The diagonal of this set is given by { ( x , y ) Δ ( s _ , s ¯ ) | x + ε = y } .

Theorem 20. For all ε > 0 , Δ ε ( s _ , s ¯ ) contains a finite number of vertical lines having discontinuities with respect to x and a finite number of horizontal lines having discontinuities with respect to y. Consequently, Δ ε ( s _ , s ¯ ) contains a finite number of intersections of vertical and horizontal lines which contain the discontinuities.

Proof. We cover the compact set Δ ε ( s _ , s ¯ ) with the family { W ε ( p ¯ ) ( p ¯ ) } p ¯ Δ ε ( s _ , s ¯ )

for which we can extract a finite subcovering. Each element of this subcovering has a vertical segment and a horizontal segment which can both be extended in Δ ( s _ , s ¯ ) to the boundary. So there is a finite number of vertical and horizontal lines, and consequently of intersections, in Δ ε ( s _ , s ¯ ) which contains all the discontinuities. □

Thanks to Theorems 13, 14, 15, and 19, we can now classify the intersections. To any intersection points of these lines p ^ = ( x ^ , y ^ ) , let us choose the neighborhood

W ε ( p ^ ) ( p ^ ) = { ( x , y ) Δ ( s _ , s ¯ ) : | x x ^ | < ε ( p ^ ) , | y y ^ | < ε ( p ^ ) , x x ^ , y y ^ }

for an ε ( p ^ ) > 0 small enough such that this neighborhood contains no other vertical or horizontal lines of the preceding result except x = x ^ and y = y ^ . Consequently, around this point, the discontinuities will be on the horizontal and vertical segments passing through that intersection point.

We will discuss discontinuity on horizontal segments (increasing x and decreasing x, for y = y ^ ) and vertical segments (increasing y and decreasing y, for x = x ^ ) from p ^ . Let us consider the values of L ( M , φ ) ( x ^ , y ^ ) for the 4 following points in this neighborhood:

p ^ N E = ( x ^ E , y ^ N ) = ( x ^ + 1 2 ε ( p ^ ) , y ^ + 1 2 ε ( p ^ ) )

p ^ N O = ( x ^ O , y ^ N ) = ( x ^ 1 2 ε ( p ^ ) , y ^ + 1 2 ε ( p ^ ) )

p ^ S O = ( x ^ O , y ^ S ) = ( x ^ 1 2 ε ( p ^ ) , y ^ 1 2 ε ( p ^ ) )

p ^ S E = ( x ^ E , y ^ S ) = ( x ^ + 1 2 ε ( p ^ ) , y ^ 1 2 ε ( p ^ ) ) .

Figure 8 presents those points.

There are 7 cases to analyze. The first case corresponds to a point of continuity, and the six remaining cases correspond to points of discontinuity. Figure 9 presents each case.

Case (C). We have

L ( M , φ ) ( p ^ S E ) = L ( M , φ ) ( p ^ N E ) = L ( M , φ ) ( p ^ N O )

and

Figure 8. W ε ( p ^ ) ( p ^ ) neighborhood of a point p ^ .

Figure 9. Possible configurations of an intersection point p ^ .

L ( M , φ ) ( p ^ S E ) = L ( M , φ ) ( p ^ S O ) = L ( M , φ ) ( p ^ N O ) .

Decreasing x and increasing y segments contain no discontinuity up to the vertical boundary x = s _ or the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) . The increasing x and decreasing y segments contain no discontinuity up to the next intersection point on these segments or up to the diagonal boundary of Δ ε ( s _ , s ¯ ) .

Case (D1). If

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ N E ) > L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ S O ) > L ( M , φ ) ( p ^ N O ) .

The increasing x and decreasing y segments contain discontinuities up to the diagonal boundary x = y of Δ ( s _ , s ¯ ) . Decreasing x and increasing y segments contain discontinuities at least until the next intersection point on each of these segments or up to the vertical boundary x = s _ or the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) .

Case (D2). If

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ N E ) = L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ S O ) > L ( M , φ ) ( p ^ N O ) .

The increasing y segment contains no discontinuity up to the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) . For the other segments we have the same conclusions as in the Case (D1).

Case (D3). If

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ N E ) > L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ S O ) = L ( M , φ ) ( p ^ N O ) .

The decreasing x segment contains no discontinuity up to the vertical boundary x = s _ of Δ ( s _ , s ¯ ) . For the other segments we have the same conclusions as in the Case (D1).

Case (D4). If

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ N E ) = L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) = L ( M , φ ) ( p ^ S O ) > L ( M , φ ) ( p ^ N O ) .

The increasing y segment contains no discontinuity up to the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) . The decreasing y segments contain no discontinuity up to the next intersection point on these segments or up to the diagonal boundary of Δ ε ( s _ , s ¯ ) . The decreasing x segment contains discontinuities up to the next intersection point or up to the vertical boundary x = s _ of Δ ( s _ , s ¯ ) . The increasing x segment contains discontinuities up to the diagonal of Δ ( s _ , s ¯ ) .

Case (D5). If

L ( M , φ ) ( p ^ S E ) = L ( M , φ ) ( p ^ N E ) > L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ S O ) = L ( M , φ ) ( p ^ N O ) .

The decreasing x segment contains no discontinuity up to the vertical boundary x = s _ of Δ ( s _ , s ¯ ) . The increasing x segment contains no discontinuity up to the next intersection point or up to the diagonal of Δ ε ( s _ , s ¯ ) . The increasing y segment contains discontinuities up to the next intersection point or up to the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) . The decreasing y segment contains discontinuities up to the diagonal of Δ ( s _ , s ¯ ) .

Case (D6). If

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ N E ) = L ( M , φ ) ( p ^ N O ) ,

and

L ( M , φ ) ( p ^ S E ) > L ( M , φ ) ( p ^ S O ) = L ( M , φ ) ( p ^ N O ) .

The decreasing x segment contains no discontinuity up to the vertical boundary x = s _ of Δ ( s _ , s ¯ ) . The increasing x segment contains discontinuities up to the diagonal of Δ ( s _ , s ¯ ) . The increasing y segment contains no discontinuity up to the horizontal boundary y = s ¯ of Δ ( s _ , s ¯ ) . The decreasing y segment contains discontinuities up to the diagonal of Δ ( s _ , s ¯ ) .

8. Conclusion

We did an overview of the main properties of the size functions by giving basic demonstrations of each of the results using elementary topology. In particular, we presented the decomposition of the size function (Theorem 9) and established results of continuity to the right of the size function (Theorem 16 and Theorem 17) under an assumption that the set M is calm. This assumption could be removed but a proof of the right continuity with respect to the y variable would be much more difficult to establish [8]. An interesting problem would be to find a way to approximate a set by a calm set and study the difference between the two size functions. The reader interested by a survey using more advanced tools of topology, like Morse theory, could consider [9]. A modern approach used in topological data analysis is to use persistent homology and Betti numbers [10].

Acknowledgements

This work has been financially supported by an individual discovery grant from the Natural Sciences and Engineering Research Council of Canada.

Conflicts of Interest

Author declares no competing interests.

References

[1] Frosini, P. (1991) Measuring Shapes by Size Functions. Proceedings of SPIE, Intelligent Robots and Computer Vision X: Algorithms and Techniques, 1607, 122-133.
[2] Frosini, P. and Landi, C. (1997) Size Functions and Morphological Transformations. Acta Applicandae Mathematicae, 49, 85-104.
https://doi.org/10.1023/A:1005857402634
[3] Frosini, P. and Landi, C. (1999) Size Theory as a Topological Tool for Computer Vision. Pattern Recognition and Image Analysis, 9, 596-603.
[4] Frosini, P. and Landi, C. (2001) Size Functions and Formal Series. Applicable Algebra in Engineering, Communication and Computing, 12, 327-349.
https://doi.org/10.1007/s002000100078
[5] Donatini, D., Ferri, M. and Frosini, P. (1998) Applications of Size Theory to Computer Vision and Pattern Recognition. Proceedings of the Joint Workshop of the AI*IA - IAPR - IC IAPRVA’98, Ferrara, 65-68.
[6] Verri, A., Uras, C., Frosini, P. and Ferri, M. (1993) On the Use of the Size Functions for Shape Analysis. Biological Cybernetics, 70, 99-107.
https://doi.org/10.1007/BF00200823
[7] Dugundji, J. (1966) Topology. Allyn and Bacon, Inc., Boston.
[8] Cerri, A., Fabio, B.D., Ferri, M., Frosini, P. and Landi, C. (2013) Betti Numbers in Multidimensional Persistent Homology Are Stable Functions. Mathematical Methods in the Applied Sciences, 36, 1543-1557.
https://doi.org/10.1002/mma.2704
[9] Biasotti, S., De Floriani, L., Falcidieno, L.B., Frosini, P., Giorgi, D., Landi, C., Papaleo, L. and Spagnuolo, M. (2008) Describing Shapes by Geometrical-Topological Properties of Real Functions. ACM Computing Surveys, 40, 12:1-12:87.
https://doi.org/10.1145/1391729.1391731
[10] Cerri, A. and Frosini, P. (2021) A Brief Introduction to Multidimensional Persistent Betti Numbers. Springer Proceedings in Mathematics and Statistics, 350, 215-228.
https://doi.org/10.1007/978-981-16-0174-3_18

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.