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 R⊂A×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:2A→2B and G:2B→2A:

  • F(S)={b∈B|aRb∀a∈S}
  • G(T)={a∈A|aRb∀b∈T}

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:

S⊂S′⟹F(S′)⊂F(S)

and:

T⊂T′⟹G(T′)⊂G(T)

  • F∘G and G∘F are both monotone, and ascendant. In other words:

S⊂G(F(S))

and:

S⊂S′⟹G(F(S))⊂G(F(S′))

Similarly for F∘G

  • G∘F∘G=G and F∘G∘F=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 F∘G defines a closure operator on B, and the operator G∘F 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