Galois connection
The notion of a Galois connection has its root in Galois theory. By the fundamental theorem of Galois theory (http://planetmath.org/FundamentalTheoremOfGaloisTheory), there is a one-to-one correspondence between the intermediate fields between a field and its subfield
(with appropriate conditions imposed on the extension
), and the subgroups of the Galois group such that the bijection is inclusion-reversing:
If the language of Galois theory is distilled from the above paragraph, what remains reduces to a more basic and general concept in the theory of ordered-sets:
Definition. Let and be two posets. A Galois connection between and is a pair of functions with and , such that, for all and , we have
We denote a Galoisconnection between and by , or simply .
If we define on by iff , and define on by iff , then and are posets, (the duals of and ). The existence of a Galois connection between and is the same as the existence of a Galois connection between and . In short, we say that there is a Galois connection between and if there is a Galois connection between two posets and where and are the underlying sets (of and respectively). With this, we may say without confusion that “a Galois connection exists between and iff a Galois connection exists between and ”.
Remarks.
- 1.
Since for all , then by definition, . Alternatively, we can write
(1) where stands for the identity map on . Similarly, if is the identity map on , then
(2) - 2.
Suppose . Since by the remark above, and so by definition, . This shows that is monotone. Likewise, is also monotone.
- 3.
Now back to Inequality (1), in the first remark. Applying the second remark, we obtain
(3) Next, according to Inequality (2), for any , it is true, in particular, when . Therefore, we also have
(4) Putting Inequalities (3) and (4) together we have
(5) Similarly,
(6) - 4.
If and are Galois connections between and , then . To see this, observe that iff iff , for any and . In particular, setting , we get since . Similarly, , and therefore . By a similarly argument
, if and are Galois connections between and , then . Because of this uniqueness property, in a Galois connection , is called the upper adjoint of and the lower adjoint of .
Examples.
- •
The most famous example is already mentioned in the first paragraph above: let is a finite-dimensional Galois extension
of a field , and is the Galois group of over . If we define
- a.
with ,
- b.
with ,
- c.
by , and
- d.
by , the fixed field of in .
Then, by the fundamental theorem of Galois theory, and are bijections, and is a Galois connection between and .
- a.
- •
Let be a topological space
. Define be the set of all open subsets of and the set of all closed subsets of . Turn and into posets with the usual set-theoretic inclusion. Next, define by , the closure
of , and by , the interior of . Then is a Galois connection between and . Incidentally, those elements fixed by are precisely the regular open sets of , and those fixed by are the regular closed sets.
Remark. The pair of functions in a Galois connection are order preserving as shown above. One may also define a Galois connection as a pair of maps and such that iff , so that the pair are order reversing. In any case, the two definitions are equivalent in that one may go from one definition to another, (simply exchange with , the dual (http://planetmath.org/DualPoset) of ).
References
- 1 T.S. Blyth, Lattices and Ordered Algebraic Structures
, Springer, New York (2005).
- 2 B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, 2nd Edition, Cambridge (2003)