arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1408.6710math.HOmath.CT
收藏

作为图追踪计算的点集拓扑:作为否定的提升性质

Point-set topology as diagram chasing computations: Lifting property as negation

Misha Gavrilovich

摘要:

我们观察到一些自然的数学定义是相对于最简单的反例的提升性质,即映射的满射性和内射性的定义,以及连通性的定义,拓扑学中的分离公理$T_0$和$T_1$,具有稠密像,诱导(拉回)拓扑,以及每个实值函数有界(在连通域上)。我们还对这一观察的认知和人工智能方面进行了一些简短的推测,特别是在点集拓扑中,一些参数被解读为具有有限前序的图追踪计算。

英文摘要:

We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and $T_1$ in topology, having dense image, induced (pullback) topology, and every real-valued function being bounded (on a connected domain). We also offer a couple of brief speculations on cognitive and AI aspects of this observation, particularly that in point-set topology some arguments read as diagram chasing computations with finite preorders.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑