Galois correspondence induced by a binary relation

From Commalg

This article is about a general term. A list of important particular cases (instances) is available at Category:Galois correspondences induced by binary relations

Definition

Let A and B be sets. Suppose RA×B i.e. R is a binary relation between A and B. R induces a Galois correspondence between subsets of A and subsets of B, as follows. We get two maps, F:2A2B and G:2B2A:

  • F(S)={bB|aRbaS}
  • G(T)={aA|aRbbT}

Key facts

  • F and G are both reverse-monotone. In category-theoretic jargon, F and G are contravariant functors between the categories of subsets of A and B, with morphisms being inclusions.

In symbols:

SSF(S)F(S)

and:

TTG(T)G(T)

  • FG and GF are both monotone, and ascendant. In other words:

SG(F(S))

and:

SSG(F(S))G(F(S))

Similarly for FG

  • GFG=G and FGF=F. In other words, going back and forth thrice has the same effect as going once. This follows easily from the last two facts.
  • The operator FG defines a closure operator on B, and the operator GF defines a closure operator on A. By closure operator is meant a monotone ascendant operator. In particular, the subsets which are fixed under this operator, which are called the closed sets, include the whole set, and are closed under taking arbitrary intersections

Related notions