We define the \(n\)-dimensional Euclidean space as:
\[ \mathbb{R}^n = \{(x_1, \dots, x_n) \mid x_i \in \mathbb{R}\} \]On the real line \(\mathbb{R}\), topological space (t.s.) open sets are generated by open intervals. If \(A \subseteq \mathbb{R}^n\) and \(B \subseteq \mathbb{R}^m\), then:
\[ A \times B = \{(x,y) \mid x \in A, y \in B\} \subset \mathbb{R}^{n+m} \]More generally, if \(A_i \subseteq \mathbb{R}^{n_i}\), then \(A_1 \times A_2 \times \dots \times A_k \subset \mathbb{R}^{n_1 + \dots + n_k}\).
An open rectangle in \(\mathbb{R}^n\) is a cartesian product of open intervals \((a_1,b_1) \times \dots \times (a_n,b_n)\), where \(a_i, b_i \in \mathbb{R} \cup \{\pm \infty\}\).
The collection of all open rectangles in \(\mathbb{R}^n\) forms a basis for a topology on \(\mathbb{R}^n\). Verify that \((\mathbb{R}^n, \tau)\) is second countable and Hausdorff.
A set \(O \subset \mathbb{R}^n\) is open if for every \(x \in O\), there exists an open rectangle \(I \subset \mathbb{R}^n\) such that \(x \in I \subset O\).
For \(a_i < b_i \in \mathbb{R}\), we call \([a_1,b_1] \times \dots \times [a_n,b_n]\) a closed rectangle in \(\mathbb{R}^n\).
Show that a closed rectangle is closed in \((\mathbb{R}^n, \tau)\).
Recall that \([a,b] \subset \mathbb{R}\) (\(-\infty < a < b < \infty\)) is a compact subset of \(\mathbb{R}\). Therefore, \([a_1,b_1] \times \dots \times [a_n,b_n]\) is compact in \(\mathbb{R}^n\).
One equivalent way to think of boundedness in \(\mathbb{R}\) is that a set \(A \subset \mathbb{R}\) is bounded (bdd) if \(A \subset [a,b]\) for some \(-\infty < a < b < \infty\).
A set \(A \subset \mathbb{R}^n\) is said to be bounded if \(A \subset \prod_{i=1}^{n} [a_i, b_i]\) for finite \(a_i, b_i\).
Suppose \(K \subset \mathbb{R}^n\) is closed and bounded. Then \(K\) is compact in \(\mathbb{R}^n\).
Heine-Borel Theorem: A subset \(K \subset \mathbb{R}^n\) is compact if and only if it is closed and bounded. (Recall: A closed subset of a compact space is compact).
English explanation and missing steps
Roadmap. A point of \(\mathbb R^n\) has \(n\) real coordinates. Products of open intervals give open rectangles. Every open set is a union of these rectangles, so they form a basis.
- To get a countable basis, use rectangles whose finite endpoints are rational. Given \(x\in O\), first choose a small rectangle inside \(O\), then choose rational endpoints between its sides and \(x\).
- To separate distinct \(x,y\), choose disjoint balls of radius less than \(|x-y|/3\); each contains a basis rectangle. This proves the Hausdorff property.
- A closed rectangle is closed because its complement is the union of points where at least one coordinate is outside its closed interval. It is compact as a finite product of compact intervals. A closed and bounded set lies in one such rectangle and is closed inside it, hence compact.
Hinglish mein poora explanation
Poora idea: \(\mathbb R^n\) ka point \(n\) real coordinates ka tuple hai. Open intervals ka product open rectangle hota hai; in rectangles ke unions se saare open sets milte hain.
- Second countable: rectangle ke endpoints rational numbers lo. Rationals countable hain, isliye aise rectangles bhi countable hain. Kisi bhi open set ke point ke around chhota rational rectangle fit kar sakte hain.
- Hausdorff: do alag points ke beech positive distance hai. Dono ke around \(|x-y|/3\) se chhote disjoint balls lo; unke andar rectangles bhi milenge.
- Compactness: closed rectangle finite compact intervals ka product hai. Closed bounded \(K\) ek aise rectangle mein aata hai aur uska closed subset hai, isliye compact hai. Yahin Heine–Borel ka logic hai.
\((\mathbb{R}^n, +)\) is a real vector space of dimension \(n\). For \(x, y \in \mathbb{R}^n\), where \(x = (x_1, \dots, x_n)\) and \(y = (y_1, \dots, y_n)\), we define the inner product:
\[ \langle x,y \rangle := \sum_{i=1}^{n} x_i y_i \]This inner product defines the Euclidean norm (length) of \(x \in \mathbb{R}^n\):
\[ |x| = \left(\sum_{i=1}^{n} x_i^2\right)^{1/2} \]- \(|x| \ge 0\), and \(|x| = 0 \iff x = 0\).
- \(|\lambda x| = |\lambda| |x|\).
- Triangle Inequality: \(|x+y| \le |x| + |y|\).
This Euclidean norm gives rise to the Euclidean distance on \(\mathbb{R}^n\) via \(d(x,y) := |x-y|\) for \(x,y \in \mathbb{R}^n\). Thus, \((\mathbb{R}^n, |\cdot|)\) is a metric space.
English explanation and missing steps
The dot product \(\langle x,y\rangle=\sum x_i y_i\) measures alignment; the norm \(|x|=\sqrt{\langle x,x\rangle}\) measures length. Cauchy–Schwarz gives \(|\langle x,y\rangle|\le |x||y|\). Expanding \(|x+y|^2\) and using this bound gives \(|x+y|^2\le(|x|+|y|)^2\), hence the triangle inequality.
The distance \(d(x,y)=|x-y|\) is therefore a metric: it is nonnegative, symmetric, vanishes only when \(x=y\), and obeys the triangle inequality. These estimates justify the balls used in topology and limits.
Hinglish mein poora explanation
Dot product \(\sum x_i y_i\) direction ka relation batata hai; norm \(\sqrt{\langle x,x\rangle}\) length hai. Cauchy–Schwarz se \(|\langle x,y\rangle|\le |x||y|\) milta hai. \(|x+y|^2\) expand karo, cross term ko bound karo, phir square root lene par triangle inequality milti hai.
\(d(x,y)=|x-y|\) distance hai: zero sirf same point par, dono order mein same, aur direct distance detour se zyada nahi. Isi se balls, limits aur continuity ki formal definitions banti hain.
Let \(X\) be any topological space. For a function \(f: X \to \mathbb{R}^n\), one can define continuity. If \(A \subset \mathbb{R}^n\) and \(f: A \to X\) is continuous, and \(A\) is a compact set, then \(f(A)\) is compact.
More generally, if \(f: A \to \mathbb{R}^n\) is continuous, then \(f(A)\) is compact if \(A\) is compact.
Let \(f: \Omega \to \mathbb{R}^m\), where \(\Omega \subseteq \mathbb{R}^n\) is open.
\[ \lim_{x \to a} f(x) = L \quad (a \in \mathbb{R}^n) \]This means: \(\forall \epsilon > 0, \exists \delta > 0\) such that \(|f(x) - L| < \epsilon\) whenever \(0 < |x-a| < \delta\).
Let \(T: \mathbb{R}^n \to \mathbb{R}^m\) be a linear transformation. Then \(T\) is continuous.
Proof: Let \(e_j := (0, \dots, 1, \dots, 0)\) be the standard basis in \(\mathbb{R}^n\). \(T(e_j) = \sum_{i=1}^{m} a_{ij} e_i\), where \(a_{ij} \in \mathbb{R}\). The matrix representation is \([T] = (a_{ij})_{m \times n}\).
Now, \(x = \sum_{j=1}^{n} \lambda_j e_j\).
\[ T(x) = \sum_{j=1}^{n} \lambda_j T(e_j) = \sum_{j=1}^{n} \lambda_j \left( \sum_{i=1}^{m} a_{ij} e_i \right) = \sum_{i=1}^{m} \left( \sum_{j=1}^{n} \lambda_j a_{ij} \right) e_i \] \[ |T(x)|^2 = \sum_{i=1}^{m} \left( \sum_{j=1}^{n} \lambda_j a_{ij} \right)^2 \]By Cauchy-Schwarz inequality:
\[ |T(x)|^2 \le \sum_{i=1}^{m} \left( |x|^2 \cdot \sum_{j=1}^{n} a_{ij}^2 \right) = \left( \sum_{i=1}^{m} \sum_{j=1}^{n} |a_{ij}|^2 \right) |x|^2 \]So, \(|T(x)| \le M|x|\) for all \(x \in \mathbb{R}^n\), where \(M = \left(\sum_{i=1}^{m} \sum_{j=1}^{n} |a_{ij}|^2\right)^{1/2}\). Here, \(M\) is the norm of the linear transformation \(T\).
For \(x, y \in \mathbb{R}^n\), by linearity \(T(x-y)\) is a vector:
\[ |T(x) - T(y)| = |T(x-y)| \le M|x-y| \]Therefore, \(T\) is Lipschitz continuous. Hence, \(T\) is continuous. ∎
English explanation and missing steps
For continuity at \(a\), take \(L=f(a)\) in the limit definition. A linear map \(T\) is continuous because Cauchy–Schwarz gives \(|T(h)|\le M|h|\); therefore \(|T(x)-T(a)|\le M|x-a|\). If \(M=0\), the map is constant and continuity is immediate.
A continuous image of a compact set is compact: pull any open cover of \(f(K)\) back to an open cover of \(K\), select finitely many sets, and map forward. The source statement with a general target space uses this same argument.
Hinglish mein poora explanation
Point \(a\) par continuity ka matlab \(x\to a\) hone par \(f(x)\to f(a)\). Linear map ke matrix entries fixed hain, isliye koi constant \(M\) milta hai jisse \(|T(h)|\le M|h|\). \(h=x-a\) rakhne se output difference bhi zero ko jata hai. \(M=0\) ho to map constant hai.
Compact set ki continuous image compact hoti hai: image ka open cover lo, preimage se original set ka cover banao, compactness se finite subcover lo, phir image par wapas apply karo. Yeh result target ke general topological space hone par bhi kaam karta hai.
If \(f, g\) are continuous, then by composition of functions:
- \((f \pm g)(x) = f(x) \pm g(x)\) is continuous.
- \((\lambda f)(x) = \lambda \cdot f(x)\) is continuous.
- \(S: \mathbb{R}^n \times \mathbb{R}^n \to \mathbb{R}^n, S(x,y) = x+y\) is continuous.
- \(m: \mathbb{R} \times \mathbb{R}^n \to \mathbb{R}^n, m(\lambda, x) = \lambda x\) is continuous.
A vector-valued function \(f: \mathbb{R}^n \to \mathbb{R}^m\), written as \(f = (f_1, \dots, f_m)\) where \(f_i: \mathbb{R}^n \to \mathbb{R}\), is continuous if and only if each \(f_i\) is continuous for \(1 \le i \le m\).
Proof:
\((\implies)\) \(|f_i(x) - f_i(a)| \le \left( \sum_{j=1}^{m} |f_j(x) - f_j(a)|^2 \right)^{1/2} = |f(x) - f(a)|\).
As \(x \to a\), \(|f(x) - f(a)| \to 0\) (small), which implies \(|f_i(x) - f_i(a)| \to 0\).
English explanation and missing steps
Componentwise continuity works in both directions. If \(f\) is continuous, \(|f_i(x)-f_i(a)|\le |f(x)-f(a)|\) proves each component is continuous. Conversely, if all \(m\) components are continuous, choose one \(\delta\) that makes every component difference smaller than \(\varepsilon/\sqrt m\); then \(|f(x)-f(a)|<\varepsilon\).
For sums and scalar products, combine continuity of \((f,g)\) with continuity of addition and multiplication. For example, \(|(f+g)(x)-(f+g)(a)|\le |f(x)-f(a)|+|g(x)-g(a)|\).
Hinglish mein poora explanation
Vector function continuous hai tab aur sirf tab jab uske sab coordinate functions continuous hon. Ek direction mein har coordinate difference vector norm se chhota hota hai. Ulti direction mein \(m\) components ke liye ek common \(\delta\) lo, har difference \(\varepsilon/\sqrt m\) se chhota karo; total norm \(\varepsilon\) se chhota hoga.
Sum ke liye triangle inequality directly lagti hai. Scalar multiplication ke liye scalar aur vector multiplication ki continuity use hoti hai. Is tarah algebra rules kisi informal “obvious” step par depend nahi karte.
Let \(f: \mathbb{R}^n \to \mathbb{R}\) be bounded near \(a\). For \(\delta > 0\), define:
\[ M_\delta := \sup \{f(x) \mid |x-a| < \delta\} \] \[ m_\delta := \inf \{f(x) \mid |x-a| < \delta\} \]The oscillation of \(f\) at \(a\) is:
\[ O(f,a) := \lim_{\delta \to 0^+} (M_\delta - m_\delta) \]Does this limit exist? Let \(0 < \delta_1 < \delta_2\). Then \(M_{\delta_2} \ge M_{\delta_1}\) and \(m_{\delta_2} \le m_{\delta_1}\), which implies \(-m_{\delta_2} \ge -m_{\delta_1}\).
So \(M_{\delta_2} - m_{\delta_2} \ge M_{\delta_1} - m_{\delta_1}\). The function \(M_\delta - m_\delta\) is monotonic as \(\delta \to 0^+\). Thus, the limit exists and \(O(f,a)\) is well-defined.
\(f: \mathbb{R}^n \to \mathbb{R}\) is continuous at \(x=a \iff O(f,a) = 0\).
English explanation and missing steps
Oscillation is the range of values in shrinking balls: \(\omega_\delta=M_\delta-m_\delta\). Smaller balls give smaller or equal \(\omega_\delta\), so the nonnegative limit as \(\delta\downarrow0\) exists.
- If \(f\) is continuous at \(a\), choose a ball where \(|f(x)-f(a)|<\varepsilon/2\). Any two values in that ball differ by less than \(\varepsilon\), so oscillation is zero.
- If oscillation is zero, choose a ball with \(\omega_\delta<\varepsilon\). Since \(a\) is in the ball, \(|f(x)-f(a)|\le\omega_\delta<\varepsilon\), proving continuity.
Hinglish mein poora explanation
Oscillation chhote ball mein function values ka maximum spread hai: \(M_\delta-m_\delta\). Ball shrink karne par spread badh nahi sakta; nonnegative hone se limit exist karti hai.
- Agar \(f\) continuous hai to point \(a\) ke paas sab values \(f(a)\) ke close hoti hain; do values ka difference triangle inequality se aur chhota hota hai. Oscillation zero.
- Agar oscillation zero hai, sufficiently small ball mein spread \(\varepsilon\) se kam hai. \(a\) bhi ball mein hai, isliye \(|f(x)-f(a)|<\varepsilon\). Yeh continuity ki exact condition hai.