Math 2.0

Order, lattices, ordered algebraic structures Definition

Galois connection

Builds on Partial orderMonotone function

Definition

Let (P,≤)(P, \le) and (Q,≤)(Q, \le) be partially ordered sets. A (monotone) Galois connection between PP and QQ is a pair of maps f ⁣:P→Qf \colon P \to Q and g ⁣:Q→Pg \colon Q \to P such that, for all x∈Px \in P and y∈Qy \in Q, f(x)≤y  ⟺  x≤g(y).f(x) \le y \iff x \le g(y). The map ff is the lower adjoint and gg is the upper adjoint of the connection.

Remarks

Let i ⁣:ℤ→ℝi \colon \Z \to \R be the inclusion and ⌊⋅⌋ ⁣:ℝ→ℤ\lfloor \cdot \rfloor \colon \R \to \Z the floor function. Then i(n)≤xi(n) \le x if and only if n≤⌊x⌋n \le \lfloor x \rfloor, so (i,⌊⋅⌋)(i, \lfloor \cdot \rfloor) is a Galois connection. On ℝ\R, the pair f(x)=x+1f(x) = x + 1, g(y)=yg(y) = y is not a Galois connection: for x=0x = 0 and y=1/2y = 1/2, x≤g(y)x \le g(y) holds but f(x)≤yf(x) \le y fails. In a Galois connection both maps are monotone, x≤g(f(x))x \le g(f(x)) and f(g(y))≤yf(g(y)) \le y, and f∘g∘f=ff \circ g \circ f = f and g∘f∘g=gg \circ f \circ g = g. Each adjoint determines the other: g(y)g(y) is the greatest xx with f(x)≤yf(x) \le y. The lower adjoint preserves all existing suprema, and the upper adjoint preserves all existing infima. An antitone Galois connection uses order-reversing maps with y≤f(x)y \le f(x) if and only if x≤g(y)x \le g(y); it is a monotone connection between PP and the dual of QQ.

Reading path

To understand this page from the ground up, read these 20 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set definition
  4. Implication definition
  5. Predicate definition
  6. Ordered pair definition
  7. Existential quantifier definition
  8. Universal quantifier definition
  9. Cartesian product definition
  10. Subset definition
  11. Uniqueness quantifier definition
  12. Binary relation definition
  13. Antisymmetric relation definition
  14. Reflexive relation definition
  15. Transitive relation definition
  16. Function definition
  17. Preorder definition
  18. Partial order definition
  19. Monotone function definition
  20. Galois connection definition

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Galois_connection
About this page
TagMBVJ4JQXC5
URIm2://MBVJ4JQXC5
Kinddefinition
WritingW0 stub
MSC06A15
DefinesGalois connection
UsesPartial order, Monotone function
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by