Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Galois connection
Summary
In mathematics, especially in order theory, a Galois connection is a particular correspondence (typically) between two partially ordered sets (posets). Galois connections find applications in various mathematical theories. They generalize the fundamental theorem of Galois theory about the correspondence between subgroups and subfields, discovered by the French mathematician Évariste Galois.
A Galois connection can also be defined on preordered sets or classes; this article presents the common case of posets.
The literature contains two closely related notions of "Galois connection". In this article, we will refer to them as (monotone) Galois connections and antitone Galois connections.
A Galois connection is rather weak compared to an order isomorphism between the involved posets, but every Galois connection gives rise to an isomorphism of certain sub-posets, as will be explained below.
The term Galois correspondence is sometimes used to mean a bijective Galois connection; this is simply an order isomorphism (or dual order isomorphism, depending on whether we take monotone or antitone Galois connections).
Let (A, ≤) and (B, ≤) be two partially ordered sets. A monotone Galois connection between these posets consists of two monotone functions: F : A → B and G : B → A, such that for all a in A and b in B, we have
F(a) ≤ b if and only if a ≤ G(b).
In this situation, F is called the lower adjoint of G and G is called the upper adjoint of F. Mnemonically, the upper/lower terminology refers to where the function application appears relative to ≤. The term "adjoint" refers to the fact that monotone Galois connections are special cases of pairs of adjoint functors in as discussed further below. Other terminology encountered here is left adjoint (resp. right adjoint) for the lower (resp. upper) adjoint.
An essential property of a Galois connection is that an upper/lower adjoint of a Galois connection uniquely determines the other:
F(a) is the least element with a ≤ G(), and
G(b) is the largest element with F() ≤ b.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.