Hostname: page-component-7479d7b7d-8zxtt Total loading time: 0 Render date: 2024-07-12T08:28:40.887Z Has data issue: false hasContentIssue false

Galois Connections and Pair Algebras

Published online by Cambridge University Press:  20 November 2018

J. C. Derderian*
Affiliation:
State University of New York at Buffalo, Buffalo, New York
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Unless further restricted, P, Q, and R denote arbitrary partially ordered sets whose order relations are all written “≦” .

An isotone mapping ϕ: PQ is said to be residuated if there is an isotone mapping ψ: QP such that

(RM 1) xϕψx for all x i n P;

(RM 2) yψϕ ≦ for all y in Q.

Let Q* denote the partially ordered set with order relation dual to that of Q.

(A) The following conditions are equivalent:

(i) ϕ: PQ* is a Galois connection;

(ii) ϕ: PQ is a residuated mapping;

(iii) Max{zP: zyy} exists for all y in Q and is equal to yψ.

Since ψ is uniquely determined by ϕ, it will be denoted by ϕ+.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1969

References

1. Birkhoff, G., Lattice theory, p. 54, Amer. Math. Soc. Colloq. Publ., Vol. 25 (Amer. Math. Soc, Providence, R.I., 1948).Google Scholar
2. Croisot, R., Application résiduées, Ann. Sci. École Norm. Sup. 78 (1956), 453474.Google Scholar
3. Derderian, J. C., Residuated mappings, Pacific J. Math. 20 (1967), 3543.Google Scholar
4. Hartmanis, J. and Stearns, R. E., Pair algebra and its application to automata theory, Information and Control 7 (1964), 485507.Google Scholar
5. Janowitz, M. F., A semigroup approach to lattices, Can. J. Math. 18 (1966), 12121223.Google Scholar
6. Kaplansky, I., Rings of operators, Mimeographed Notes, University of Chicago, 1955.Google Scholar
7. Liu, C. L., Pair algebra and its application, IEEE Conference record, Seventh Annual Symposium on Switching and Automata Theory, 1966; pp. 103112.Google Scholar