Definition:Galois Connection/Upper Adjoint
< Definition:Galois Connection(Redirected from Definition:Upper Adjoint)
Jump to navigation
Jump to search
Definition
Let $\struct {S, \preceq}$ and $\struct {T, \precsim}$ be ordered sets.
Let $g: S \to T$, $d: T \to S$ be mappings.
Let $\tuple {g, d}$ be a Galois connection.
Then:
- $g$ is called the upper adjoint of the Galois connection.
Notation
A Galois connection is often denoted as $f = \struct{\upperadjoint f, \loweradjoint f}$ where $\upperadjoint f : S \to T$ denotes the upper adjoint and $\loweradjoint f : T \to S$ denotes the lower adjoint.
When $g : S \to T$ is known to be an upper adjoint of a Galois connection, the lower adjoint can be denoted as $\loweradjoint g : T \to S$.
Similarly, when $d : T \to S$ is known to be a lower adjoint of a Galois connection, the upper adjoint can be denoted as $\upperadjoint d : S \to T$.
Also see
Technical Note
The $\LaTeX$ code for \(\upperadjoint f\) is \upperadjoint f
.
Sources
This page may be the result of a refactoring operation. As such, the following source works, along with any process flow, will need to be reviewed. When this has been completed, the citation of that source work (if it is appropriate that it stay on this page) is to be placed above this message, into the usual chronological ordering. If you have access to any of these works, then you are invited to review this list, and make any necessary corrections. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{SourceReview}} from the code. |
- 1980: G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M.W. Mislove and D.S. Scott: A Compendium of Continuous Lattices
- Mizar article WAYBEL_1:def 10