Question

Give an example of a connected set in \(\mathbb{R}^{n}\) that is not polygonally connected.

Short answer

Question: Provide an example of a connected set in \(\mathbb{R}^{n}\) that is not polygonally connected. Answer: One example of such a set is given by \(S \subset \mathbb{R}^2\) defined as: $$ S = \{(x, y) \in \mathbb{R}^2 : y = e^x \text{ or } x = 0, y \ge 1\} $$ This set consists of the graph of the exponential function \(y = e^x\) along with the vertical line segment (half line) at \(x = 0\) and \(y \ge 1\). The set S is connected as it consists of continuous functions \(f(x) = e^x\) and \(g(x) = x\), but it is not polygonally connected, as there is no polygonal path between points like \(A=(0,1)\) and \(B=(1, e)\) within the set S.

Step-by-step solution

Define the set

Let's consider the set \(S \subset \mathbb{R}^2\) defined as: $$ S = \{(x, y) \in \mathbb{R}^2 : y = e^x \text{ or } x = 0, y \ge 1\} $$ This set consists of the graph of the exponential function \(y = e^x\) along with the vertical line segment (half line) at \(x = 0\) and \(y \ge 1\).

Show that the set is connected

To show that S is connected, we consider the continuous functions \(f(x) = e^x\) and \(g(x) = x\). For any point \((x, e^x) \in S\) on the exponential curve, there exists another point \((0, x)\) in S such that \(|f(x) - g(x)| = |e^x - x|\). Since both f(x) and g(x) are continuous functions over \(\mathbb{R}\), their difference is also continuous. Therefore, S is a connected set.

Show that the set is not polygonally connected

To show that S is not polygonally connected, we consider two points, \(A=(0,1)\) and \(B=(1, e)\). A polygonal path between A and B consists of a finite number of line segments, but because the exponential function \(y = e^x\) is strictly increasing and never intersects the vertical line \(x = 0\) for \(y \ge 1\), there cannot be any such polygonal path between A and B within the set S. Therefore, the set S is not polygonally connected.

Key concepts

Exponential Function

The exponential function, represented as \(y = e^x\), is a unique and important function in mathematics. It is characterized by the constant base \(e\), which is approximately equal to 2.718. This function has several key properties that make it stand out:

• It is strictly increasing, which means that as \(x\) gets larger, the value of \(e^x\) also increases.
• Its graph is a smooth, continuous curve that never touches the horizontal axis but approaches it as \(x\) decreases towards negative infinity.
• It is defined for all real numbers, and the range is always positive, stretching from \(0\) to \(\infty\).

These properties are crucial when considering connectivity, particularly in the set \(S\) mentioned in the exercise. The exponential curve in \(S\) contributes to the overall connectedness of the set, even though it does not permit polygonal connections due to its strictly increasing nature.

Real Analysis

Real analysis is a branch of mathematics dealing with real numbers and the real-valued functions that arise from them. It provides a rigorous framework for discussing concepts such as limits, continuity, and connectedness, all of which are relevant to the problem at hand.

• **Limits and Continuity**: Real analysis thoroughly examines functions where limits and continuity play a crucial role. By ensuring functions like \(f(x) = e^x\) and \(g(x) = x\) are continuous, we establish that their combination into set \(S\) doesn't break connection.
• **Connectedness**: In real analysis, a set is connected if there is no way to partition it into two non-empty open subsets. This property of \(S\) ensures there are no gaps or jumps in the set.

By using these real analysis principles, we can conclude why certain sets maintain connectedness, like \(S\), despite their complicated structures or paths they may not allow.

Path Connectedness

Path connectedness is a more stringent concept of connectivity in mathematics, specifically within the realm of topology. A set is path-connected if any two points within the set can be joined by a continuous path lying entirely within the set.
The distinction between connectedness and path connectedness is subtle yet significant.

• **Simple Connectivity**: A path-connected set is always connected because if two points can be joined by a path, it implies no breaks exist in the set.
• **Polygonal Paths**: These are paths made up of straight-line segments. A set that is not polygonally connected, like \(S\), cannot have every path made of these segments without leaving the set.

In the exercise, \(S\) is not polygonally connected due to the strict increase of the exponential part of the set, preventing a finite number of line segments from connecting two points like \((0,1)\) and \((1,e)\) entirely within \(S\). This illustrates how sets can be connected globally while not allowing certain types of paths.