Profunctors between posets and Alexander duality

From MaRDI portal



Abstract: We consider profunctors f:PpromapQ between posets and introduce their {em graph} and {em ascent}. The profunctors Pro(P,Q) form themselves a poset, and we consider a partition cIsqcupcF 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 QimesP. 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:NNpilNNcupinfty. 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).











This page was built for publication: Profunctors between posets and Alexander duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102160)