Math 2.0

Order, lattices, ordered algebraic structures Maps between ordered sets Concept

Galois connection

Summary

A Galois connection is a pair of maps f ⁣:P→Qf \colon P \to Q and g ⁣:Q→Pg \colon Q \to P between partially ordered sets with f(x)≤yf(x) \le y exactly when x≤g(y)x \le g(y). It is a weak form of an order isomorphism, and it is the order-theoretic case of an adjunction between functors. The correspondence between subgroups and subfields in Galois theory is the classical example, which gives the notion its name. Every Galois connection produces a closure operator g∘fg \circ f on PP.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Galois_connection
About this page
TagQ5JHEPRYQ6
URIm2://Q5JHEPRYQ6
Kindconcept
WritingW0 stub
MSC06A15
Same as

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

Special cases

Definitions