AI 中文总结
本文针对βN的深度过滤，构造显式集合作为每一层间隙的见证，证明其闭包恰落入指定层，核心是利用双重指数序列的刚性建立主引理。
AI 中文摘要
设 $\Sigma_{1} = \mathbb{N}^*$，$\Sigma_{k+1} = \overline{\mathbb{N}^* + \Sigma_{k}}$ 为 $\beta\mathbb{N}$ 的累积深度过滤，这是 Protasov 和 Protasova 为离散群研究的闭理想链在 $(\mathbb{N},+)$ 上的类比，其严格下降由 Lutsenko 和 Protasov 的一个定理保证。对于每个 $k$，我们给出一个显式集合，其闭包与 $\Sigma_{k}$ 相交但不与 $\Sigma_{k+1}$ 相交。固定双重指数序列 $e_{n} = 2^{2^{n}}$，按索引模 $k$ 的余数将其划分为 $k$ 个子序列 $E_{0}, \dots, E_{k-1}$，并设 $A_{k} = E_{0} + \cdots + E_{k-1}$。我们证明，任何满足 $E_{t} \in q_{t}$ 的自由超滤子之和 $q_{0} + \cdots + q_{k-1}$ 位于 $\Sigma_{k} \setminus \Sigma_{k+1}$ 中。核心是一个主引理，通过对 $j$ 归纳证明：如果 $\{e_{n}\}$ 的具有两两不相交指标集的子序列之和 $F_{1} + \cdots + F_{j}$ 属于一个自由超滤子 $s$，则 $s \notin \Sigma_{j+1}$。证明依赖于双重指数序列的一个刚性：一个固定的差迫使任何平移交集（一旦其最大指标足够大）中的最大指标在其自身子序列内抵消，从而使每个平移交集至少下降一层。同样的见证也位于纯过滤的间隙中。
英文摘要
Let $Σ_{1} = \mathbb{N}^*$ and $Σ_{k+1} = \overline{\mathbb{N}^* + Σ_{k}}$ be the cumulative depth filtration of $β\mathbb{N}$, the analogue for $(\mathbb{N},+)$ of a chain of closed ideals that Protasov and Protasova studied for discrete groups, where strict descent follows from a theorem of Lutsenko and Protasov. For every $k$ we give an explicit set whose closure meets $Σ_{k}$ but not $Σ_{k+1}$. Fix the doubly exponential sequence $e_{n} = 2^{2^{n}}$, partition it into $k$ subsequences $E_{0}, \dots, E_{k-1}$ by the residue of the index modulo $k$, and set $A_{k} = E_{0} + \cdots + E_{k-1}$. We prove that any sum $q_{0} + \cdots + q_{k-1}$ of free ultrafilters with $E_{t} \in q_{t}$ lies in $Σ_{k} \setminus Σ_{k+1}$. The engine is a master lemma, proved by induction on $j$: if a sum $F_{1} + \cdots + F_{j}$ of subsequences of $\{e_{n}\}$ with pairwise disjoint index sets belongs to a free ultrafilter $s$, then $s \notin Σ_{j+1}$. The proof rests on a single rigidity of the doubly exponential sequence: a fixed difference forces the largest index in any shift-intersection, once it is large, to cancel within its own subsequence, which makes every shift-intersection descend by at least one level. The same witnesses lie in the gaps of the pure filtration.
Comments11 pages, 1 figure
