arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.02767math.COmath.ACmath.CT
收藏

偏序集与Alexander对偶之间的原函子

Profunctors between posets and Alexander duality

Gunnar Fløystad

摘要:

我们考虑偏序集之间的原函子$f : P \promap Q$,并引入它们的{ \em图}和{ \em上升图}.原函子$\Pro(P,Q)$形成了一个偏序集,我们考虑将其划分为下集$\cI \sqcup \cF$和上集$\cF$,称为{ \it cut}。对于$\cF$的元素,我们将它们的图形关联起来,对于$\cI$的元素,我们将它们的上升关联起来。我们的基本结果是,这一点,适当的改进,保留是一个削减:我们得到一个削减的布尔格的子集的基础集$Q \times P$。有限布尔格中的割精确地对应于有限单纯复形。我们应用这在交换代数,这些给类亚历山大双平方自由单项式理想给予充分和自然的广义设置的isotonian理想和letterplace理想的偏序集。我们研究$\Pro(\NN, \NN)$。这样的原函子标识为保序映射$f : \NN \pil \NN \cup \{\infty \}$。对于我们的应用程序时,$P$和$Q$是无限的,我们还介绍了一个拓扑$\Pro(P,Q)$,特别是在profunctors $\Pro(\NN,\NN)$。

英文摘要:

We consider profunctors $f : P \promap Q$ between posets and introduce their {\em graph} and {\em ascent}. The profunctors $\Pro(P,Q)$ form themselves a poset, and we consider a partition $\cI \sqcup \cF$ of this into a down-set $\cI$ and up-set $\cF$, called a {\it cut}. To elements of $\cF$ we associate their graphs, and to elements of $\cI$ we associate their ascents. Our basic result is that this, suitable refined, preserves being a cut: We get a cut in the Boolean lattice of subsets of the underlying set of $Q \times P$. Cuts in finite Booleans lattices correspond precisely to finite simplicial complexes. We apply this in commutative algebra where these give classes of Alexander dual square-free monomial ideals giving the full and natural generalized setting of isotonian ideals and letterplace ideals for posets. We study $\Pro(\NN, \NN)$. Such profunctors identify as order preserving maps $f : \NN \pil \NN \cup \{\infty \}$. For our applications when $P$ and $Q$ are infinite, we also introduce a topology on $\Pro(P,Q)$, in particular on profunctors $\Pro(\NN,\NN)$.

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

↑