We consider profunctors between posets and introduce their {\em graph} and {\em ascent}. The profunctors form themselves a poset, and we consider a partition of this into a down-set and up-set , called a {\it cut}. To elements of we associate their graphs, and to elements of 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 . 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 . Such profunctors identify as order preserving maps $f : \NN \pil \NN \cup {\infty }PQ$ are infinite, we also introduce a topology on , in particular on profunctors .

生成讲解博客的中文版本

生成AI智能校验的中文版本