Order, lattices, ordered algebraic structures Maps between ordered sets Concept
Galois insertion
Summary
A Galois insertion is a Galois connection in which the lower adjoint undoes the upper adjoint: for every . Then embeds into as the set of closed elements of the closure operator . Galois insertions describe how a structure such as "subgroups" sits inside a larger ordered set such as "all subsets".
Further reading
About this page
| Tag | BPV58EPYCQ |
|---|---|
| URI | m2://BPV58EPYCQ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A15 |
| Specializes | Galois connection |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- 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.