Order, lattices, ordered algebraic structures Maps between ordered sets Concept
Galois connection
Summary
A Galois connection is a pair of maps and between partially ordered sets with exactly when . 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 on .
Where this leads
3 pages build on this one.
Further reading
About this page
| Tag | Q5JHEPRYQ6 |
|---|---|
| URI | m2://Q5JHEPRYQ6 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A15 |
| 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.