Skip to content
March 17, 2016 / porton

Galois connections are related with pointfree funcoids!

I call pointfree funcoids (see my free e-book) between boolean lattices as boolean funcoids.

I have proved that:

Theorem Let \mathfrak{A} and \mathfrak{B} be complete boolean lattices. Then \alpha is the first component of a boolean funcoid iff it is a lower adjoint (in the sense of Galois connections between posets).

Does this theorem generalize for non-complete boolean lattices? or even further?

Is \beta the upper adjoint of \alpha if (\alpha;\beta) is a boolean funcoid? (Equivalently: Is (\alpha;\beta) a boolean funcoid if (\alpha;\beta) is a Galois connection between complete boolean lattices A and B?)

Further idea: We can define pointfree reloids between posets \mathfrak{A} and \mathfrak{B} as filters on the set of Galois connections between \mathfrak{A} and \mathfrak{B}.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: