Real and Complex Analysis Assignment
Real and Complex Analysis Assignment
The union of infinitely many compact sets is not necessarily compact. A counterexample is provided by the union of intervals [n, n+1] for n \in \mathbb{N}, which is not bounded and thus not compact in \mathbb{R} because a compact set in \mathbb{R} needs to be closed and bounded .
Consider E = {p \in \mathbb{Q} | 2 < p^2 < 3} in the rational number space with the standard metric. This set is bounded because all elements are within the interval \((\sqrt{2}, \sqrt{3})\), thus it cannot extend beyond rational approximations bounding this range. It is closed in \( \mathbb{Q} \) since any rational limit of sequences from E still lies within \( p^2 \) range constraints, reinforcing closure due to the missing limits outside \((\sqrt{2}, \sqrt{3})\) not being rational .
It is not generally true that Int(A \cup B) = IntA \cup IntB. An example demonstrating this is A = [0, 2) and B = (1, 3]. The interiors are IntA = (0, 2) and IntB = (1, 3), making IntA \cup IntB = (0, 2) \cup (1, 3) = (0, 3), whereas the union, A \cup B = [0, 3], has an interior Int(A \cup B) = (0, 3). The two results differ, showing the statement is not true in all cases .
The function d(x, y) = |m^{-1} - n^{-1}| satisfies the conditions of a metric: non-negativity, symmetry, identity of indiscernibles, and triangle inequality for the natural numbers. However, while this function can be defined over \( \mathbb{R}^+ \), it might not satisfy metric properties in the entire positive real space due to its dependency on the form of its arguments when extended beyond natural numbers .
To prove that Int(A \ B) = IntA \ IntB, we need to show two inclusions. First, take any x in Int(A \ B). By definition, there exists an open set U such that x \in U and U \subseteq A \ B. Since U \subseteq A and U \subseteq B, x must be in IntA and IntB, implying x \in IntA \ IntB. For the reverse inclusion, take any x \in IntA \ IntB. Then x is in some open set U such that U \subseteq A and in some open set V such that V \subseteq B. The intersection U \cap V is open and contains x, and U \cap V \subseteq A \ B, hence x \in Int(A \ B).
The metric \( D(x, y) = φ(d(x, y)) \) is valid in a metric space X if φ satisfies certain conditions: φ(0) = 0 ensures reflexivity, φ(r) > 0 for r > 0 ensures positivity, φ(a + b) \leq φ(a) + φ(b) ensures the triangle inequality, and a \leq b \implies φ(a) \leq φ(b) maintains consistency with the original metric's ordering properties. These conditions ensure D maintains metric properties of non-negativity, identity of indiscernibles, symmetry, and triangle inequality .
For \( \bar{d} \) defined by \( \bar{d}(x, y) = d(x, y) \) if \( d(x, y) \leq 1 \) and \( \bar{d}(x, y) = 1 \) if \( d(x, y) > 1 \), the verification involves checking all properties of a metric. Specifically, \( \bar{d} \) must satisfy non-negativity, identity of indiscernibles, symmetry, and triangle inequality. Each property can be deduced from the properties of the original metric \( d \), observed over the constraints defined .
A non-empty subset S of real numbers that has both a largest and a smallest element is compact. This is because such a set is bounded and closed in \( \mathbb{R} \). According to the Heine-Borel theorem, a subset of \( \mathbb{R} \) is compact if and only if it is closed and bounded .
The boundary \( \delta A = \overline{A} \setminus A^{\circ} \) is closed because it is the complement of an open set, since the interior \( A^{\circ} \) is always open. As \( \overline{A} \) is closed, \( \delta A \) is closed as it is an intersection of closed sets, which meets closure properties in metric spaces .
To prove A + B is closed when A is closed and B is compact, consider a sequence \((x_n + y_n)\) with \(x_n \in A, y_n \in B\) converging to z. Since B is compact, \((y_n)\) has a convergent subsequence with the limit in B. Correspondingly, \((x_n)\) has a subsequence converging to an element in A due to the closed nature of A. Thus, their sum converges to an element in A + B, confirming A + B is closed .