Theorems · Definition · order theory
GaloisConnection
{α : Type u} → {β : Type v} → [Preorder α] → [Preorder β] → (α → β) → (β → α) → PropA Galois connection is a pair of functions l and u satisfying
l a ≤ b ↔ a ≤ u b. They are special cases of adjoint functors in category theory,
but do not depend on the category theory library in mathlib.
- Defined in
- Mathlib.Order.GaloisConnection.Defs
- Cited by
- 253 results in Mathlib
- Foundations
- Depth 2 from the axioms, rests on 6 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Preorderstatement and proof · cited by 7,952
Cited by297
Results whose statement or proof uses this declaration.
- GaloisInsertion.gcstatement · cited by 137
- GaloisConnection.l_supstatement and proof · cited by 81
- GaloisConnection.l_iSupstatement and proof · cited by 78
- GaloisConnection.monotone_lstatement and proof · cited by 76
- GaloisConnection.l_botstatement and proof · cited by 63
- GaloisConnection.monotone_ustatement and proof · cited by 53
- GaloisConnection.le_u_lstatement and proof · cited by 52
- GaloisConnection.u_iInfstatement and proof · cited by 40
- GaloisConnection.u_infstatement and proof · cited by 37
- GaloisConnection.l_u_lestatement and proof · cited by 36
- OrderIso.to_galoisConnectionstatement · cited by 32
- GaloisConnection.u_topstatement and proof · cited by 31
Showing the 200 most cited of 297.