Subjects: Vector Analysis
Links: Perfect and Connected Sets in R, Topological Connectedness
Def: Let . We say that is disconnected if there exist , nonempty such that:
A set is connected if it not disconnected
Def: Let . We define the straight line segment that joins with , denoted with and defined by
Th: Let such that and . If and are separated, then .
Def: Let . We say that is convex if for every pair , then
Th: Let . If is convex, then is connected
Def: Let , and we will that the set is a polygonal curve that connects and .
Def: Let . is polygonally connected if for every pair of points exists a polygonal curve that connects and and is contained in .
Th: Let be a nonempty open set. is connected, iff is polygonally connected.
Prop: Let . is disconnected iff there’s open sets such that:
- and
Cor: Let . is connected iff there’s no open sets such that:
- and
Path-Connected Sets
Def:************ A set is path-connected if for every pair of points there exists a continuous fucntion with and . We call a ****path joining and .
Prop:************ A path-connected set is connected.
Th: Let an nonempty open set. is connected iff is path-connected.
Th: Let be an open connected set, and , then there’s a differentiable path with and
Path-Covering Lemma
Suppose is a continuous path from the interval into an open subset of . Then there are a number and a partition of the interval such that:
- for
- for
- for
- for