Blog Archive

Wednesday, February 7, 2024

Posetalization Functor



Let (P,⪯) be a pre-order set, π(a)=π(b)⟺a⪯b∧b⪯a.

Then π(a)≤b⟺a⪯π−1(b), hence it is an adjoint functor.

Moreover, let F be the posetalization functor and i be the inclusion functor. Then we have the following adjoint.

(1)HomPos(F(P),Q)≅HomPre(P,i(Q))

The proof follows from the commutative diagram directly. Since Q is a partial order set, so any pre-order homomorphism must factor through π.

i.e. a≤b∧b≤a⇒f(a)≤f(b)∧f(b)≤f(a)⇒f(a)=f(b)

 

No comments:

Post a Comment

Popular Posts