Theorem 16.3 If \(A\) is a subspace of \(X\) and \(B\) is a subspace of \(Y\), then the product topology on \(A \times B\) is the same as the topology \(A \times B\) inherits as a subspace of \(X \times Y\).

Comment: To prove the identity of two topologies, we can either show they mutually contain each other or prove the equivalence of their bases. Because a topological basis has smaller number of elements or cardinality than the corresponding topology, proof via basis is more efficient.

Proof: Let \(\mathcal{C}\) be the topological basis of \(X\) and \(\mathcal{D}\) be the basis of \(Y\). Because \(A \subset X\) and \(B \subset Y\), the subspace topological bases of them are \(\mathcal{B}_A = \{C \cap A \vert \forall C \in \mathcal{C} \}\) and \(\mathcal{B}_B = \{D \cap B \vert \forall D \in \mathcal{D} \}\) respectively according to Lemma 16.1.

Due to Lemma 15.1, the basis of the product topology on \(A \times B\) is

\[
\mathcal{B}_{A \times B} = \{ (C \cap A) \times (D \cap B) \vert \forall C \in \mathcal{C}, \forall D \in \mathcal{D} \}.
\]

Meanwhile, the basis of the product topology on \(X \times Y\) is

\[
\mathcal{B}_{X \times Y} = \{ C \times D \vert \forall C \in \mathcal{C}, \forall D \in \mathcal{D} \}.
\]

Restricting \(\mathcal{B}_{X \times Y}\) to the subset \(A \times B\), the basis of the subspace topology on \(A \times B\) is

\[
\begin{aligned}
\tilde{\mathcal{B}}_{A \times B} &= \{ (C \times D) \cap (A \times B) \vert \forall C \in \mathcal{C}, \forall D \in \mathcal{D} \} \\
&= \{ (C \cap A) \times (D \cap B) \vert \forall C \in \mathcal{C}, \forall D \in \mathcal{D} \},
\end{aligned}
\]

which is the same as that of the product topology on \(A \times B\). Hence, this theorem is proved.

The above process of proof can be illustrated as below.

Remark: The above two routes for generating topology on \(A \times B\) must lead to the same result, otherwise, the theory itself is inappropriately proposed. A theory must be at least self-consistent before its debut in reality.

James Munkres Topology: Theorem 16.3的更多相关文章

  1. James Munkres Topology: Theorem 20.3 and metric equivalence

    Proof of Theorem 20.3 Theorem 20.3 The topologies on \(\mathbb{R}^n\) induced by the euclidean metri ...

  2. James Munkres Topology: Theorem 20.4

    Theorem 20.4 The uniform topology on \(\mathbb{R}^J\) is finer than the product topology and coarser ...

  3. James Munkres Topology: Theorem 19.6

    Theorem 19.6 Let \(f: A \rightarrow \prod_{\alpha \in J} X_{\alpha}\) be given by the equation \[ f( ...

  4. James Munkres Topology: Sec 18 Exer 12

    Theorem 18.4 in James Munkres “Topology” states that if a function \(f : A \rightarrow X \times Y\) ...

  5. James Munkres Topology: Sec 22 Exer 6

    Exercise 22.6 Recall that \(\mathbb{R}_{K}\) denotes the real line in the \(K\)-topology. Let \(Y\) ...

  6. James Munkres Topology: Sec 22 Exer 3

    Exercise 22.3 Let \(\pi_1: \mathbb{R} \times \mathbb{R} \rightarrow \mathbb{R}\) be projection on th ...

  7. James Munkres Topology: Lemma 21.2 The sequence lemma

    Lemma 21.2 (The sequence lemma) Let \(X\) be a topological space; let \(A \subset X\). If there is a ...

  8. James Munkres Topology: Sec 37 Exer 1

    Exercise 1. Let \(X\) be a space. Let \(\mathcal{D}\) be a collection of subsets of \(X\) that is ma ...

  9. James Munkres Topology: Sec 22 Example 1

    Example 1 Let \(X\) be the subspace \([0,1]\cup[2,3]\) of \(\mathbb{R}\), and let \(Y\) be the subsp ...

随机推荐

  1. luogu5316

    P5316 恋恋的数学题 题目背景 恋恋是个可爱的女孩子,最近她沉迷了做数学题. 题目描述 现在恋恋正在处理的题目十分简单:现在有k \space (2\leq k\leq 4)k (2≤k≤4)个数 ...

  2. 总线复习之SPI

    SPI总线协议以ds1302为例讲解 1.1概述. 1.2根据时序图来分析. 1.3再熟读一下DS1302的数据手册和SPI总线协议的使用. 1.4结合ds1302功能实现一定的功能. 1.1概述SP ...

  3. [NOIp2016] 换教室

    题目类型:期望\(DP\) 传送门:>Here< 题意:现有\(N\)个时间段,每个时间段上一节课.如果不申请换教室,那么时间段\(i\)必须去教室\(c[i]\)上课,如果申请换课成功, ...

  4. codeforces 786E ALT

    题目链接:CF786E 输出方案暗示网络流 我们考虑最朴素的建图 由源点\(s\)连向所有人,容量为1:树上所有的边视作节点连向\(t\),流量为1:人向其路径上所有的树边连边,流量为\(inf\), ...

  5. [NOI2009]诗人小G(dp + 决策单调性优化)

    题意 有一个长度为 \(n\) 的序列 \(A\) 和常数 \(L, P\) ,你需要将它分成若干段,每 \(P\) 一段的代价为 \(| \sum ( A_i ) − L|^P\) ,求最小代价的划 ...

  6. Codeforces Beta Round #51 D. Beautiful numbers(数位dp)

    题目链接:https://codeforces.com/contest/55/problem/D 题目大意:给你一段区间[l,r],要求这段区间中可以整除自己每一位(除0意外)上的数字的整数个数,例如 ...

  7. Redmine简易安装与系统优化

    安装版本为bitnami-redmine-2.6.5-0 ,用的Bitnami的一键安装包 . 下载地址https://bitnami.com/stack/redmine/installer 简要安装 ...

  8. 任意模数NTT学习笔记

    这两天有点颓,所以东西学的也很慢...这个一眼就能推出来的活生生卡了我两天.. 说几个细节: 柿子: \[f*g = (\frac{f}{M} +f\%m)*(\frac{g}{M} +g\%m) \ ...

  9. 应用调试(二)GDB

    title: 应用调试(二)GDBdate: 2019/1/17 21:00:10 toc: true 应用调试(二)GDB gdb下载工具安装交叉工具链设置GDB介绍编译GDBtarget/host ...

  10. Numpy系列(十)- 掩码数组

    简介 有时候数据集中存在缺失.异常或者无效的数值,我们可以标记该元素为被屏蔽(无效)状态. import numpy as np import numpy.ma as ma x = np.array( ...