Difference between revisions of "Connectedness"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
Line 10: Line 10:
 
<p>If <span class="math-inline"><math>c = a</math></span> then this implies that <span class="math-inline"><math>f = b</math></span> (since if <span class="math-inline"><math>d = b</math></span> then <span class="math-inline"><math>A = (a, b)</math></span> which implies that <span class="math-inline"><math>B = \emptyset</math></span>). So if <span class="math-inline"><math>A \cup B = (c, d) \cup (e, f) = (a, d) \cup (e, b) \text{ we must have that } a < d, e < b</math></span>. If <span class="math-inline"><math>d = e</math></span> then <span class="math-inline"><math>A \cup B = (a, d) \cup (d, b)</math></span> and so <span class="math-inline"><math>d \not \in (a, b)</math></span> so <span class="math-inline"><math>A \cup B \neq (a, b)</math></span>. If <span class="math-inline"><math>d < e</math></span> then <span class="math-inline"><math>A \cup B = (a, d) \cup (e, b)</math></span> and <span class="math-inline"><math>(d, e) \not \in (a, b)</math></span> so <span class="math-inline"><math>A \cup B \neq (a, b)</math></span>. If <span class="math-inline"><math>d > e</math></span> then <span class="math-inline"><math>A \cap B = (e, d) \neq \emptyset</math></span>. Either way we see that <span class="math-inline"><math>(a, b) \neq A \cup B</math></span>.</p>
 
<p>If <span class="math-inline"><math>c = a</math></span> then this implies that <span class="math-inline"><math>f = b</math></span> (since if <span class="math-inline"><math>d = b</math></span> then <span class="math-inline"><math>A = (a, b)</math></span> which implies that <span class="math-inline"><math>B = \emptyset</math></span>). So if <span class="math-inline"><math>A \cup B = (c, d) \cup (e, f) = (a, d) \cup (e, b) \text{ we must have that } a < d, e < b</math></span>. If <span class="math-inline"><math>d = e</math></span> then <span class="math-inline"><math>A \cup B = (a, d) \cup (d, b)</math></span> and so <span class="math-inline"><math>d \not \in (a, b)</math></span> so <span class="math-inline"><math>A \cup B \neq (a, b)</math></span>. If <span class="math-inline"><math>d < e</math></span> then <span class="math-inline"><math>A \cup B = (a, d) \cup (e, b)</math></span> and <span class="math-inline"><math>(d, e) \not \in (a, b)</math></span> so <span class="math-inline"><math>A \cup B \neq (a, b)</math></span>. If <span class="math-inline"><math>d > e</math></span> then <span class="math-inline"><math>A \cap B = (e, d) \neq \emptyset</math></span>. Either way we see that <span class="math-inline"><math>(a, b) \neq A \cup B</math></span>.</p>
 
<p>We can use the same logic for the other cases which will completely show that <span class="math-inline"><math>(a, b)</math></span> is connected.</p>
 
<p>We can use the same logic for the other cases which will completely show that <span class="math-inline"><math>(a, b)</math></span> is connected.</p>
 +
 +
=== Basic Theorems Regarding Connected and Disconnected Metric Spaces ===
 +
<p>A metric space <span class="math-inline"><math>(M, d)</math></span> is said to be disconnected if there exists <span class="math-inline"><math>A, B \subseteq M</math></span>, <span class="math-inline"><math>A, B \neq \emptyset</math></span> where <span class="math-inline"><math>A \cap B = \emptyset</math></span> and:</p>
 +
<span class="equation-number">(1)</span>
 +
<div style="text-align: center;"><math>\begin{align} \quad M = A \cup B \end{align}</math></div>
 +
<p>We say that <span class="math-inline"><math>(M, d)</math></span> is connected if it is not disconnected.</p>
 +
<p>Furthermore, we say that <span class="math-inline"><math>S \subseteq M</math></span> is connected/disconnected if the metric subspace <span class="math-inline"><math>(S, d)</math></span> is connected/disconnected.</p>
 +
<p>We will now look at some important theorems regarding connected and disconnected metric spaces.</p>
 +
<blockquote style="background: white; border: 1px solid black; padding: 1em;">
 +
<td><strong>Theorem 1:</strong> A metric space <span class="math-inline"><math>(M, d)</math></span> is disconnected if and only if there exists a proper nonempty subset <span class="math-inline"><math>A \subset M</math></span> such that <span class="math-inline"><math>A</math></span> is both open and closed.</td>
 +
</blockquote>
 +
<ul>
 +
<li><span class="math-inline"><math>\Rightarrow</math></span> Suppose that <span class="math-inline"><math>(M, d)</math></span> is disconnected. Then there exists open <span class="math-inline"><math>A, B \subset M</math></span>, <span class="math-inline"><math>A, B \neq \emptyset</math></span>, where <span class="math-inline"><math>A \cap B = \emptyset</math></span> and <span class="math-inline"><math>M = A \cup B</math></span>.</li>
 +
</ul>
 +
<ul>
 +
<li>Since <span class="math-inline"><math>A</math></span> is open in <span class="math-inline"><math>M</math></span> we have that <span class="math-inline"><math>A^c = B</math></span> is closed in <span class="math-inline"><math>M</math></span>. But <span class="math-inline"><math>B</math></span> is also open. Similarly, since <span class="math-inline"><math>B</math></span> is open in <span class="math-inline"><math>M</math></span>, <span class="math-inline"><math>B^c = A</math></span> is closed in <span class="math-inline"><math>M</math></span>. So in fact <span class="math-inline"><math>A</math></span> and <span class="math-inline"><math>B</math></span> are both nonempty proper subsets of <span class="math-inline"><math>M</math></span> that are both open and closed.</li>
 +
</ul>
 +
<ul>
 +
<li><span class="math-inline"><math>\Leftarrow</math></span> Suppose that there exists a proper nonempty subset <span class="math-inline"><math>A \subset M</math></span> such that <span class="math-inline"><math>A</math></span> is both open and closed. Let <span class="math-inline"><math>B = A^c</math></span>. Then <span class="math-inline"><math>B</math></span> is also both open and closed. Furthermore, since <span class="math-inline"><math>B \neq \emptyset</math></span> and <span class="math-inline"><math>A \cap B = \emptyset</math></span>. Additionally, <span class="math-inline"><math>M = A \cup B</math></span>, so <span class="math-inline"><math>M</math></span> is disconnected. <span class="math-inline"><math>\blacksquare</math></span></li>
 +
</ul>
 +
<blockquote style="background: white; border: 1px solid black; padding: 1em;">
 +
<td><strong>Theorem 2:</strong> If <span class="math-inline"><math>(M, d)</math></span> is a connected unbounded metric space, then for every <span class="math-inline"><math>a \in M</math></span> and for all <span class="math-inline"><math>r > 0</math></span>, <span class="math-inline"><math>\{ x \in M : d(x, a) = r \}</math></span> is nonempty.</td>
 +
</blockquote>
 +
<ul>
 +
<li><strong>Proof:</strong> Let <span class="math-inline"><math>(M, d)</math></span> be a connected unbounded metric space and suppose that there exists an <span class="math-inline"><math>a \in M</math></span> and there exists an <span class="math-inline"><math>r_0 > 0</math></span> such that:</li>
 +
</ul>
 +
<span class="equation-number">(2)</span>
 +
<div style="text-align: center;"><math>\\begin{align} \quad \{ x \in M : d(x, a) = r_0 \} = \emptyset \end{align}</math></div>
 +
<ul>
 +
<li>We will show that a contradiction arises. Let <span class="math-inline"><math>A = \{ x \in M : d(x, a) < r_0 \}</math></span> and let <span class="math-inline"><math>B = \{ x \in M : d(x, a) > r_0 \}</math></span>. Then <span class="math-inline"><math>A</math></span> is open since it is simply an open ball centered at <span class="math-inline"><math>a</math></span>. Furthermore, <span class="math-inline"><math>B</math></span> is open since <span class="math-inline"><math>B^c</math></span> is a closed ball centered <span class="math-inline"><math>a</math></span>. <span class="math-inline"><math>A</math></span> is nonempty since <span class="math-inline"><math>a \in A</math></span> and <span class="math-inline"><math>B</math></span> is nonempty since <span class="math-inline"><math>(M, d)</math></span> is unbounded (if it were empty then this would imply <span class="math-inline"><math>(M, d)</math></span> is bounded). Clearly <span class="math-inline"><math>A \cap B = \emptyset</math></span> and <span class="math-inline"><math>M = A \cup B</math></span>. So <span class="math-inline"><math>(M, d)</math></span> is a disconnected metric space. But this is a contradiction.</li>
 +
</ul>
 +
<ul>
 +
<li>Therefore the assumption that there exists an <span class="math-inline"><math>a \in M</math></span> and an <span class="math-inline"><math>r_0 > 0</math></span> such that <span class="math-inline"><math>\{ x \in M : d(x, a) = r_0 \} \emptyset</math></span> was false.</li>
 +
</ul>
 +
<ul>
 +
<li>So for all <span class="math-inline"><math>a \in M</math></span> and for all <span class="math-inline"><math>r > 0</math></span> the set <span class="math-inline"><math>\{ x \in M : d(x, a) = r \}</math></span> is nonempty. <span class="math-inline"><math>\blacksquare</math></span></li>
 +
</ul>
  
 
== Licensing ==  
 
== Licensing ==  

Revision as of 11:18, 8 November 2021

Connected and Disconnected Metric Spaces

Definition: A metric space is said to be Disconnected if there exists nonempty open sets and such that and . If is not disconnected then we say that Connected. Furthermore, if then is said to be disconnected/connected if the metric subspace is disconnected/connected.

Intuitively, a set is disconnected if it can be separated into two pieces while a set is connected if it’s an entire piece.

For example, consider the metric space where is the Euclidean metric on . Let , i.e., is an open interval in . We claim that is connected.

Suppose not. Then there exists nonempty open subsets and such that and . Furthermore, and must be open intervals themselves, say and . We must have that . So or and furthermore, or .

If then this implies that (since if then which implies that ). So if . If then and so so . If then and so . If then . Either way we see that .

We can use the same logic for the other cases which will completely show that is connected.

Basic Theorems Regarding Connected and Disconnected Metric Spaces

A metric space is said to be disconnected if there exists , where and:

(1)

We say that is connected if it is not disconnected.

Furthermore, we say that is connected/disconnected if the metric subspace is connected/disconnected.

We will now look at some important theorems regarding connected and disconnected metric spaces.

Theorem 1: A metric space is disconnected if and only if there exists a proper nonempty subset such that is both open and closed.

  • Suppose that is disconnected. Then there exists open , , where and .
  • Since is open in we have that is closed in . But is also open. Similarly, since is open in , is closed in . So in fact and are both nonempty proper subsets of that are both open and closed.
  • Suppose that there exists a proper nonempty subset such that is both open and closed. Let . Then is also both open and closed. Furthermore, since and . Additionally, , so is disconnected.

Theorem 2: If is a connected unbounded metric space, then for every and for all , is nonempty.

  • Proof: Let be a connected unbounded metric space and suppose that there exists an and there exists an such that:

(2)

Failed to parse (syntax error): {\displaystyle \\begin{align} \quad \{ x \in M : d(x, a) = r_0 \} = \emptyset \end{align}}
  • We will show that a contradiction arises. Let and let . Then is open since it is simply an open ball centered at . Furthermore, is open since is a closed ball centered . is nonempty since and is nonempty since is unbounded (if it were empty then this would imply is bounded). Clearly and . So is a disconnected metric space. But this is a contradiction.
  • Therefore the assumption that there exists an and an such that was false.
  • So for all and for all the set is nonempty.

Licensing

Content obtained and/or adapted from: