Theorems · Definition · order theory
LowerAdjoint.closureOperator
{α : Type u_1} →
{β : Type u_4} → [inst : PartialOrder α] → [inst_1 : Preorder β] → {u : β → α} → LowerAdjoint u → ClosureOperator αEvery lower adjoint induces a closure operator given by the composition. This is the partial order version of the statement that every adjunction induces a monad.
- Defined in
- Mathlib.Order.Closure
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses propext, Quot.sound
- Assumes
- PartialOrderPreorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- PartialOrderstatement and proof · cited by 6,410
- ClosureOperatorstatement · cited by 371
- LowerAdjoint.toFunproof · cited by 105
- LowerAdjointstatement and proof · cited by 38
Cited by13
Results whose statement or proof uses this declaration.
- GaloisConnection.closureOperatorproof · cited by 6
- LowerAdjoint.closure_iSup_closureproof · cited by 1
- LowerAdjoint.closure_iSup₂_closureproof · cited by 1
- LowerAdjoint.closure_le_closed_iff_leproof · cited by 1
- LowerAdjoint.closure_sup_closure_leproof · cited by 1
- LowerAdjoint.closure_sup_closure_leftproof · cited by 1
- LowerAdjoint.closure_sup_closure_rightproof · cited by 1
- LowerAdjoint.idempotentproof · cited by 1
- LowerAdjoint.closureOperator_applystatement and proof · cited by 0
- LowerAdjoint.closureOperator_isClosedstatement and proof · cited by 0
- LowerAdjoint.closure_inf_leproof · cited by 0
- LowerAdjoint.closure_sup_closureproof · cited by 0