A Basic Topological Approach to the Continuity of the Size Function ()
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
be a subset of
. A path in
joining a point p to a point q in
is a continuous function
defined on
with values in
such that
and
. The notion of a path in
induces an equivalence relation on any subset
of
. Any two points p and q of
are said to be
-equivalent, and we use the notation
, if and only if either
or there is a path joining p and q in
, in other words
To each
we associate a non empty subset
For any subset
and to each
we define the set
Hence we have
For
, we have
, and we can write
. Also, for
, we have
.
The family of sets
is a partition of
,
a family of non empty and disjoint sets called quotient set of
with respect to
, and noted
. Elements of
are called equivalence classes. Hence two elements of
are members of the same set P of
if and only if they are
-equivalent. Each element p of one
is a representative of the
equivalence class P. So if
and
then
. The application
, defined by
, is called the projection of
on
, it is a surjection.
For any set
we define the cardinality of this set, noted
, by
The first two results follow easily.
Theorem 1. Let
and
be two non empty sets such that
. The application
defined for all
, induces an injection
of
to
. Hence
and
or equivalently
Theorem 2. Let
and
two non empty sets such that
. The application
defined for any p in
, induces a surjection
from
to
. Hence
Moreover, for all
,
is a partition of
.
We combine now the first two results we get the next one.
Theorem 3. Let
and
be non empty sets such that
and
. For the injections
defined in Theorem 1 we have
Proof. For
and
, let us consider the injection
The subset
of
increase when
increase. Indeed, for
, the set
increase with
. Because the elements of
are of the form
for
, we deduce that
increase with
. This fact implies that
From Theorem 1 we have
for
. Otherwise from Theorem 2 we have
for
. Hence
and the result follows. □
We obtain directly the next result which will allow us to get a decomposition the size function.
Theorem 4. Let
a partition of
and
a partition of
. We have
(a) If, for all
, there exists a set
such that
, in other words
, then
.
(b) If, for all p and
, we have
, then
.
(c) Under the preceding assumptions in (a) and (b), we have
.
Finally, let us state a classical result for a path connected set [7].
Theorem 5. The quotient set
is the set of path connected components of
.
3. Size Function
The size function of a set
is defined from a measure function, noted
, which is simply a well defined and continuous application on
. For any subset
of
the following notation will be used
which can be extended to subsets
,
,
and
.
We consider the quotient set
of
obtained from the equivalence relation
induced by continuous paths in
. The size function associated with the set
and the measure function
, noted
, is defined as the number of elements in this quotient set. Using the function
, we have
Hence
1)
if
is empty;
2)
if
has a finite number of elements;
3)
if
has infinitely many elements.
Example 6. The simplest example, with no interest for the sequel of the paper, is for
. Let
. Hence
For any
, we have
hence
□
Since
increases with respect to
, an increasing/decreasing property of the size function follows directly from Theorem 1 and Theorem 2.
Theorem 7. [2] [4]
increases with respect to x and decreases with respect to y.
4. Decomposition of the Size Function
Under some assumptions, the set
can be decomposed into disjoint subsets. The size function is then decomposable into a sum of size functions of its subsets.
Theorem 8. If
is compact and locally path connected, then path connected components of
are in finite number and form
.
Proof. As
is locally path connected, for any point
and any neighborhood
of p in
there is a sub-neighborhood
in
which is path connected. The elements of
are then path connected components of
. These related components are both open and closed in
, and therefore also compact. As we have
, it is a covering of the compact set
by disjoint open sets. Then, there is a finite sub-covering of
, but this sub-covering may only be the covering itself and therefore
has a finite number of elements, hence the result follows. □
Let us set
where
represents the number of non empty and disjoint elements of
in such a way that
Moreover, we have
Theorem 9. If
is compact and locally path connected, we have
and then
Proof. We use Theorem 4 with
and
. Based on (a) of Theorem 4, we have
Based on (b) of Theorem 4, since for any p and
we have
so we obtain
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
, i.e., a compact set
with only one path connected component. Let us note this family by
Condition (iv) implies that the set
contains at least two points, so consequently it contains infinitely many points and
The set
will be said calm if the number of connected components of
is always finite, that is to say
for all s.
5. General Results
Let
be a calm element of
. From the continuity of
on the compact set
, let us define
and
, and the set
by
and
We start by establishing basic general results for
defined on
which are illustrated in Figure 1.
Figure 1. The function
.
Theorem 10. [2] [4] Suppose
. We have
i)
for all
;
ii)
for all
where
;
iii)
for all
where
;
iv)
for all
.
Proof. i) In this case
.
ii) Here we have
iii) There exists a non isolated point
such that
. Hence
from continuity of
,
contains an infinity of singletons,
the result follows.
iv) Direct consequence of the definition of the size function for a calm set
, and the increasing/decreasing property of Theorem 7. □
Now, since
is an integer valued function, we get directly the next result.
Theorem 11. [2] [4] At any point of continuity of
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
is a simple continuous curve of finite length. It is a compact, connected, and locally path connected set.
6.2. First Example
Let
given in Figure 2. The measure function is
which is the euclidean distance from the origin
to
. We have
and
. Figure 3 presents the size function
on
for the set
.
Figure 3. Values of the function
.
is a calm set. On the diagonal of
, namely
for
, we have
6.3. Second Example
The set
of Figure 4 is a curve of finite length. The measure function is the distance of a point
to the
axis, so we have
The size function is given in Figure 5. We have
and
.
is also a clam set. On the diagonal of
, namely
for
, we have
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
Figure 5. The function
.
for
. We have
. For the point B, the coordinates of the lowest vertex of each triangle are
for
. We have
.
Figure 7 contains the graph of the size function
for the set
of Figure 6. We have
and
. On the diagonal of
, namely
for
, we have
So,
is not a calm set, the problem is around the point A.
Figure 7. The function
.
7. Continuity Properties of Size Function
In this section we present continuity results of the size function
for a particular family of sets, namely calm set
in
. 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
with respect to the variable y.
Let us now consider the size function
defined on the set
for
.
Theorem 12. For
,
1) there exists
such that the function
is constant on the segments
and
in
;
2) there exists
such that the function
is constant on the segments
and
in
.
Proof. We know that
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
. The result follows. □
Theorem 13. [4] Let
,
,
and
be real numbers such that
. Then we have the following inequality
which can be written as
Proof. Using notation of Section 2, set
for
, and
for
. So, we consider the injections
for
, and the result follows from Theorem 1 and Theorem 3. □
Corollary 1. Let
,
,
and
be real numbers such that
. If
then
is constant on the rectangle with vertices
,
,
, and
.
Remember that
is increasing with respect to x and decreasing with respect to y, and let
. We will consider the following definitions.
1) We will say that
is left discontinuous at
if
and is right discontinuous at
if
2) We will say that
is left discontinuous at
if
and right discontinuous at
if
Theorem 14. [4] Let
. We have the following two results.
1) If
is a point of left discontinuity of
, then
is also a point of left discontinuity of
for all y in the interval
.
2) If
is a point of right discontinuity of
, then
is also a point of right discontinuity of
for all y in the interval
.
Proof. 1) Let us assume the contrary, i.e., the function
is left continuous at
for a y in the interval
. We have
But we know that
increases with respect to x. So, from Theorem 13, for all
we have
Taking the limit for
, and using the left continuity at
, we get
which contradict the left discontinuity at
.
2) A similar proof holds for this result. Let us assume the contrary, i.e., the function
is right continuous at
for a y in the interval
. We have
But we know that
increases with respect to x. So, from Theorem 13, for all
we have
Taking the limit for
, and using the right continuity at
, we get
which contradict the right discontinuity at
. □
We have a similar proof for the next result.
Theorem 15. [4] Let
. We have the following two results.
1) If
is a point of left discontinuity of
, then
is also a point of left discontinuity of
for all x in the interval
.
2) If
is a point of right discontinuity of
, then
is also a point of right discontinuity of
for all x in the interval
.
Theorem 16. [4] At every point
such that
, the function
is right continuous with respect to x, i.e.,
Proof. Since the function is constant to the right, there is a finite number of equivalence classes. When x decreases to
, 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
such that
, the function
is right continuous with respect to y, i.e.,
Proof. The proof of this result proceeds in several steps.
Step 1. Suppose
is not right continuous with respect to y at
, so
From Theorem 15, the discontinuity is extended to the point
on the diagonal of
and we have
Also, from Theorem 12 there exists
such that
is constant for
.
Step 2. From the calmness assumption,
, so there are L
equivalence classes in
which are disjoint compact subsets of
. Let
be less than the distance between any pair of equivalence classes
of
. This d is well defined because there is a finite number L of compact subsets of
to consider. Each element
can
be covered by the open set
From the definition of d, those
's are disjoint open sets and we have
Step 3. Equivalence classes of
, for any
such that
are union of a finite number of those of
, so
they are also compact subsets of
. Our assumption on the right discontinuity implies that we can join two equivalence classes, say
and
, of
in
but we cannot join them in
.
Step 4. Let us built now an open covering of
. Take
and take a path in
to join the two equivalence classes
and
that we cannot join in
. Let us suppose that this path has (at least) one point
in
with
. Take
and
. Take a path in
which join the two equivalent classes that we cannot join in
. Let us suppose that this path has (at least) one point
in
with
. Take
and
. And so on, we construct a sequence of open sets
, and a sequence of points
, such that the open set
cover
.
Step 5. So
covers
. Any finite subcovering of this covering is included in an open covering of the form
for a certain K. But this open set does not contain
. Since
is compact, it means that we cannot construct the sequence of open sets
.
Step 6. If we cannot build the sequence of open sets
, there is
such that for each path joining the two equivalence classes
and
in
, either 1) there exists p on the path such that
and then
, or else 2) any point p on the path is such that
.
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
and
, which is not possible because the path is a connected set.
2) In the second case
and
are joined in
, 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
of the size function
in
contains at least one point of discontinuity with respect to x or to y in
, and this point is not
.
Proof. Let
be a point of discontinuity of
. Then, any open ball in
around
contains one point
such that
We can connect
and
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
from the right, in x or in y, and from the right continuity, on this segment the value is
. It is therefore necessary that
be discontinuous along at least one of these segments, i.e., that
admits at least one point of discontinuity, either with respect to x or with respect to y. □
Theorem 19. [4] For any
, with
, there is
such that the open set
contains no point of discontinuity of the size function
.
Proof. If
is a point of continuity, the result follows. So let us suppose that
is a point of discontinuity and for any integer
there is a point of discontinuity
in the neighborhood
. From Theorem 18, the points
can be supposed to be points of discontinuity with respect to x or to y. We can extract a subsequence
, of
such that
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
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
, and let us consider the function
We know that the discontinuity of the function
with respect to x is repeated for inferior values towards the diagonal. Consequently
as an infinite number of point of discontinuity. Otherwise,
is increasing with respect to x. Since each discontinuity implies an increasing value of at least 1, it follows that
. But this contradict the fact that
is finite for all
(Theorem 10), hence the result follows. □
Let us look now at the closed subset of
well defined for
by
The diagonal of this set is given by
.
Theorem 20. For all
,
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,
contains a finite number of intersections of vertical and horizontal lines which contain the discontinuities.
Proof. We cover the compact set
with the family
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
to the boundary. So there is a finite number of vertical and horizontal lines, and consequently of intersections, in
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
, let us choose the neighborhood
for an
small enough such that this neighborhood contains no other vertical or horizontal lines of the preceding result except
and
. 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
) and vertical segments (increasing y and decreasing y, for
) from
. Let us consider the values of
for the 4 following points in this neighborhood:
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
and
Figure 8.
neighborhood of a point
.
Figure 9. Possible configurations of an intersection point
.
Decreasing x and increasing y segments contain no discontinuity up to the vertical boundary
or the horizontal boundary
of
. 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
.
Case (D1). If
and
The increasing x and decreasing y segments contain discontinuities up to the diagonal boundary
of
. 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
or the horizontal boundary
of
.
Case (D2). If
and
The increasing y segment contains no discontinuity up to the horizontal boundary
of
. For the other segments we have the same conclusions as in the Case (D1).
Case (D3). If
and
The decreasing x segment contains no discontinuity up to the vertical boundary
of
. For the other segments we have the same conclusions as in the Case (D1).
Case (D4). If
and
The increasing y segment contains no discontinuity up to the horizontal boundary
of
. The decreasing y segments contain no discontinuity up to the next intersection point on these segments or up to the diagonal boundary of
. The decreasing x segment contains discontinuities up to the next intersection point or up to the vertical boundary
of
. The increasing x segment contains discontinuities up to the diagonal of
.
Case (D5). If
and
The decreasing x segment contains no discontinuity up to the vertical boundary
of
. The increasing x segment contains no discontinuity up to the next intersection point or up to the diagonal of
. The increasing y segment contains discontinuities up to the next intersection point or up to the horizontal boundary
of
. The decreasing y segment contains discontinuities up to the diagonal of
.
Case (D6). If
and
The decreasing x segment contains no discontinuity up to the vertical boundary
of
. The increasing x segment contains discontinuities up to the diagonal of
. The increasing y segment contains no discontinuity up to the horizontal boundary
of
. The decreasing y segment contains discontinuities up to the diagonal of
.
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
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.