James Munkres Topology: Theorem 16.3

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.

 

转载于:https://www.cnblogs.com/peabody/p/10117156.html

内容概要:本文详细介绍了利用粒子群优化(PSO)算法解决配电网中分布式光伏系统的选址与定容问题的方法。首先阐述了问题背景,即在复杂的配电网环境中选择合适的光伏安装位置和确定合理的装机容量,以降低网损、减小电压偏差并提高光伏消纳效率。接着展示了具体的PSO算法实现流程,包括粒子初始化、适应度函数构建、粒子位置更新规则以及越界处理机制等关键技术细节。文中还讨论了目标函数的设计思路,将多个相互制约的目标如网损、电压偏差和光伏消纳通过加权方式整合为单一评价标准。此外,作者分享了一些实践经验,例如采用前推回代法进行快速潮流计算,针对特定应用场景调整权重系数,以及引入随机波动模型模拟光伏出力特性。最终实验结果显示,经过优化后的方案能够显著提升系统的整体性能。 适用人群:从事电力系统规划与设计的专业人士,尤其是那些需要处理分布式能源集成问题的研究人员和技术人员。 使用场景及目标:适用于希望深入了解如何运用智能优化算法解决实际工程难题的人士;旨在帮助读者掌握PSO算法的具体应用方法,从而更好地应对配电网中分布式光伏系统的选址定容挑战。 其他说明:文中提供了完整的Matlab源代码片段,便于读者理解和复现研究结果;同时也提到了一些潜在改进方向,鼓励进一步探索和创新。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值