A pair of monotone maps between partially ordered sets, one left adjoint and one right adjoint, such that one map composed with the other yields order inequalities in both directions (f(a) ≤ b iff a ≤ g(b)); this correspondence links closure-like operations and kernel-like operations and organizes duality between lattices and their images.

Principle

Given posets (P, ≤) and (Q, ≤), a Galois connection consists of maps f: P → Q and g: Q → P satisfying f(p) ≤ q ⇔ p ≤ g(q). Equivalently, f is the left adjoint of g and preserves existing joins while g preserves meets, encoding a universal correspondence between images and preimages.

Demonstration

The maps sending a subset A of a group to the subgroup generated by A and sending a subgroup H to its underlying set form a Galois connection between the powerset lattice and the lattice of subgroups; closures and cores are recovered as compositions g∘f and f∘g.

Misapplication

Treating any pair of order-reversing maps as a Galois connection or assuming existence of both adjoints without verifying the bidirectional inequality leads to incorrect identification of closures and lost universal properties.

Consequence

A genuine Galois connection yields canonical closure and kernel operators (idempotent, monotone) and provides universal descriptions: left adjoints preserve colimits (joins), right adjoints preserve limits (meets), and one can transfer problems across posets via the adjunction.

Reversal

Reversing the connection swaps left and right adjoints and interchanges the roles of joins and meets; conceptually this produces the dual Galois connection where closure-like behavior becomes kernel-like and vice versa.

Boundary

Applies to posets or lattices with monotone maps; it does not require underlying algebraic structure like groups but does require the adjoint inequality to hold globally; not every pair of monotone maps forms a Galois connection.

Semantic Tension

The term competes with 'adjunction' from category theory: a Galois connection is a special case of an adjoint pair restricted to posets, so one must distinguish poset-specific consequences (order-theoretic closures) from more general categorical adjunction phenomena.

Synthesis

A Galois connection is the order-theoretic adjunction between two posets given by a left and right monotone map satisfying a bidirectional inequality; it produces canonical closure and kernel operators and allows transfer of universal constructions between contexts.