AI 中文总结
该研究探讨拓扑空间中团大小性质与紧致性的关联，厘清有限团、有界团与多种紧致性的蕴含关系，并提出寻找具有有限但无界团的可数紧致空间这一核心开放问题。
AI 中文摘要
称拓扑空间$X$具有有限团（分别地，有界团），当且仅当$X$上的每个闭的非自反二元关系——等价地，每个闭的无环有向图——的团大小为有限（分别地，有界有限）。每个紧致空间都具有有界团。具有有限团蕴含极限点紧致性，且被$ω$-极限点紧致性（等价地，可数紧致性）蕴含。因此，对于$T_1$空间，具有有限团等价于可数紧致性。具有有界团严格弱于紧致性。事实上，任何满足$X^ω$为可数紧致的空间$X$都具有有界团。然而，我们尚未找到具有有限但无界团的可数紧致空间的例子。这类空间的存在性是本注记提出的主要开放问题。
英文摘要
Say that a topological space $X$ has finite, respectively bounded, cliques iff every closed, irreflexive binary relation --- equivalently, every closed, loop-free directed graph --- on $X$ has cliques of finite, respectively bounded finite, size. Every compact space has bounded cliques. Having finite cliques implies limit-point compactness, and is implied by $ω$-limit point compactness (equivalently, countable compactness). Thus, for $T_1$ spaces, having finite cliques is equivalent to countable compactness. Having bounded cliques is strictly weaker than compactness. Indeed, any space $X$ such that $X^ω$ is countably compact has bounded cliques. However, we have found no example of a countably compact space having finite but unbounded cliques. The existence of such a space is the major open problem raised in this note.
Comments14 pages. Assisted by Anthropic's Claude; formalized in Lean 4 and machine-checked
