Math 2.0

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

Galois insertion

Summary

A Galois insertion is a Galois connection (f,g)(f, g) in which the lower adjoint undoes the upper adjoint: f(g(y))=yf(g(y)) = y for every yy. Then gg embeds QQ into PP as the set of closed elements of the closure operator g∘fg \circ f. Galois insertions describe how a structure such as "subgroups" sits inside a larger ordered set such as "all subsets".

Further reading

  1. Web https://en.wikipedia.org/wiki/Galois_connection
About this page
TagBPV58EPYCQ
URIm2://BPV58EPYCQ
Kindconcept
WritingW0 stub
MSC06A15
SpecializesGalois connection
Changed2 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.

What links here

Definitions