Bourbaki

习题 15, § 6

标签 0B55,永久不变。引用为 [Bourbaki, Tag 0B55]。

一般拓扑, I

Bourbaki marks this one as harder than the rest.

Google 翻译生成的粗略草稿,质量较低。术语依照术语表,但句子可能有误;之后会由仔细的译文取代。

令n→f(n)n \to f(n)为N\mathbf{N}到N\mathbf{N}的映射,使得f−1(m)f^{-1}(m)对于每个m∈Nm \in \mathbf{N}都是有限的。如果(xn)(x_n)是集合XX中的任意序列,则放入yn=xf(n)y_n = x_{f(n)}。证明与序列 (xn)(x_n) 和 (yn)(y_n) 关联的基本滤波器是相同的。

Deduce that if (an)(a_n) and (bn)(b_n) are two sequences of elements of a set XX such that the filter associated with (bn)(b_n) is finer than the filter associated with (an)(a_n), then the filter associated with (bn)(b_n) is the same as the filter associated with some subsequence of (an)(a_n).

解答

尚未写出解答。

被以下引用

引用了

无。

Google 翻译生成的粗略草稿,质量较低。术语依照术语表,但句子可能有误;之后会由仔细的译文取代。