A pair of monotone maps between posets (f : P → Q, g : Q → P) such that for all p in P and q in Q, f(p) ≤_Q q iff p ≤_P g(q). Equivalently, f is left adjoint to g when posets are viewed as categories. It yields a residual correspondence tying approximation and closure operators.

Principle

Galois connections capture order‑theoretic adjunction: one map gives best lower/upper approximations relative to the other, producing closure and kernel-like operators and preserving suprema or infima on one side.

Demonstration

Image and inverse‑image along a function φ : X→Y induce a Galois connection between power sets: for A⊆X and B⊆Y, φ(A)⊆B iff A⊆φ^{-1}(B). Here f=direct image, g=inverse image; f preserves unions (suprema) and g preserves intersections (infima).

Misapplication

Calling any pair of monotone maps a Galois connection without verifying the adjoint equivalence condition; confusing Galois connections with Galois correspondences in field theory (related historically but technically distinct contexts).

Consequence

A Galois connection provides systematic constructions of closure and interior operators (g∘f and f∘g), identifies reflective/coreflective subposets, and translates order properties (like completeness) into existence of adjoints.

Reversal

Swapping f and g converts left/right adjoint roles; dropping monotonicity or the biconditional relation destroys the connection and the induced closure operators.

Boundary

Restricted to preorders/posets and monotone maps; does not by itself supply group‑theoretic Galois theory results or field automorphism correspondences unless additional algebraic structure is present.

Semantic Tension

Close concepts: 'adjunction' in categories (same formal pattern) and 'Galois correspondence' in algebra (a specific instance with more structure). Tension arises from similar names across different levels of abstraction.

Synthesis

A Galois connection is the order‑theoretic form of an adjunction: a monotone left and right map between posets tied by a biconditional that yields canonical closure/interior operations and encodes best approximate relationships in ordered settings.