Introductory university-level calculus, linear algebra, abstract algebra, probability, statistics, and stochastic processes.
Open sets and closed sets in
Get link
Facebook
X
Pinterest
Email
Other Apps
-
Open sets
In , we have the notion of an open interval such as . We want to extend this idea to apply to . We also introduce the notions of bounded sets and closed sets in .
Recall that the -neighbor of a point is defined as where is the distance between and .
Definition (Open set)
A subset of is said to be an open set if the following holds:
That is, for every point in an open set , we can always find an open ball centered at that point, that is included in . See the following figure.
Perhaps, it is instructive to see what is not an open set. Negating (Eq:OpenSet), we have This means that there is some point in such that its neighbor cannot be included in (i.e., some part of the neighbor crosses the "boundary" to go out of .)
Example. The open interval in is an open set. To see this, take any point and let (note: and ). Then, we have the -neighbor . □
Example. The closed interval is not an open set. To see this, let . For any , we have the neighbor because . □
Definition (Path-connected)
For each , let be a continuous function on . Then the -tuple of these functions, is a point in , parameterized by . The set defined by is called a pathin. The points and are called the initial and terminal points, respectively, and both are collectively called the endpoints.
If the path in is included in the subset of , that is, , then is said to be a path in .
For the subset of , for any , if there exists at least one path with and being its endpoints, is said to be path-connected.
Example. Let , in and consider the union of 1-neighbors (i.e., ): (Draw pictures!). No matter how we connect the two points and by a path (continuous line or curve), there are always some points not in . Therefore, is not path-connected. □
Definition (Open region in )
A path-connected open set in is called an open region in .
Example. is an open region. So is . However, is not. □
Theorem (Any open ball is an open region).
The -neighbor of in , , is an open region.
Proof. First, we show that is an open set. Take an arbitrary and let . Noting , let . It suffices to show that . By the triangle inequality, for any , so that , and hence .
Next, we show that is path-connected. Let denote a path (if exists) that starts at (i.e., ) and ends at (i.e., ). For any , define the following path:
then this is a path from to in . We still need to show such path as for each exists in . Let us define, for example,
for . This is a path (line segment) from to . Furthermore, Thus, for all .
This proves that is path-connected. ■
Closed sets
The Intermediate Value Theorem can be extended to multivariate functions on a path-connected set. To extend the Extreme Value Theorem to multivariate functions, we need the notion of bounded closed sets.
Definition (Bounded set)
The subset of is said to be bounded if there exist and such that .
That is, a set is bounded if it can be "covered" by an open ball.
Remark. Let be the distance between and the origin . Then (draw a figure!)
Therefore, in the above definition, we can replace the point with the origin.
Example. In , the rectangular region where is bounded. To see this, let
and
Then, for any real number such that , we have □
Definition (Closed set)
The subset of is said to be a closed set if (i.e., the complement of in ), is an open set. A bounded closed set is a closed set that is bounded.
Remark. Be careful: "The set is not an open set" does not necessarily imply that is a closed set! See the following proposition.
Proposition
The semi-closed ("clopen") interval is neither open nor closed.
Proof. Let . For any and any point , we have . Hence . Accordingly, is not open.
Next, consider the complement . Take . For any and any point , we have . Hence . That is, is not open, and therefore, is not closed. ■
Example. Let us show that the rectangular region in is a closed set. Let and . We need to show that is open. Take an arbitrary point . Since , it is either or .
Consider the case that (the other case is similar). Then, either or . Consider the case that (the other case is similar). Let . Then . For any point , its -coordinate is greater than . Thus, , that is, . This implies that . Hence is open. Accordingly, is closed. □
Defining the birth process Consider a colony of bacteria that never dies. We study the following process known as the birth process , also known as the Yule process . The colony starts with cells at time . Assume that the probability that any individual cell divides in the time interval is proportional to for small . Further assume that each cell division is independent of others. Let be the birth rate. The probability of a cell division for a population of cells during is . We assume that the probability that two or more births take place in the time interval is . That is, it can be ignored. Consequently, the probability that no cell divides during is . Note that this process is an example of the Markov chain with states \({n_0}, {n_0 + 1}, {n_0 + 2}...
Generational growth Consider the following scenario (see the figure below): A single individual (cell, organism, etc.) produces descendants with probability , independently of other individuals. The probability of this reproduction, , is known. That individual produces no further descendants after the first (if any) reproduction. These descendants each produce further descendants at the next subsequent time with the same probabilities. This process carries on, creating successive generations. Figure 1. An example of the branching process. Let be the random variable representing the population size (number of individuals) of generation . In the above figure, we have , , , , We shall assume as the initial condition. Ideally, our goal would be to find how the population size grows through generations, that is, to find the probability for e...
In mathematics, we must prove (almost) everything and the proofs must be done logically and rigorously. Therefore, we need some understanding of basic logic. Here, I will informally explain some rudimentary formal logic. Definitions (Proposition): A proposition is a statement that is either true or false. "True" and "false" are called the truth values, and are often denoted and . Here is an example. "Dr. Akira teaches at UBD." is a statement that is either true or false (we understand the existence of Dr. Akira and UBD), hence a proposition. The following statement is also a proposition, although we don't know if it's true or false (yet): Any even number greater than or equal to 4 is equal to a sum of two primes. See also: Goldbach's conjecture Next, we define several operations on propositions. Note that propositions combined with these operations are again propositions. (Conjunction, logical "and"): Let ...
Comments
Post a Comment