Generalization of Scott's formula for retractions from generalized Alexandroff's cube (Q1112360)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generalization of Scott's formula for retractions from generalized Alexandroff's cube
scientific article

    Statements

    Generalization of Scott's formula for retractions from generalized Alexandroff's cube (English)
    0 references
    0 references
    1986
    0 references
    In the paper by \textit{A. W. Jankowski}, Stud. Logica 45, 155-166 (1986; Zbl 0612.54017)] the following theorem (Th. 3.5) is shown: If \(\alpha =0\) or \(\delta =\infty\) or \(\alpha\geq \delta\), then a closure space X is an absolute extensor for the category of \(<\alpha,\delta >\)-closure spaces iff a contraction of X is the closure space of all \(<\alpha,\delta >\)- filters in an \(<\alpha,\delta >\)-semidistributive lattice. In the case when \(\alpha =\omega\) and \(\delta =\infty\), this theorem becomes Scott's theorem [\textit{D. Scott}, Toposes, algebraic Geometry and Logic, Dalhousie Univ. Halifax 1971, Lecture Notes Math. 274, 97-136 (1972; Zbl 0239.54006)]. A topological space X is an absolute extensor for the category of all topological spaces iff a contraction of X is a topological space of ``Scott's open sets'' in a continuous lattice. On the other hand, when \(\alpha =0\) and \(\delta =\omega\), this theorem becomes Jankowski's theorem: A closure space X is an absolute extensor for the category of all closure spaces satisfying the compactness theorem iff a contraction of X is a closure space of all filters in a complete Heyting lattice. But for separate cases of \(\alpha\) and \(\delta\), the theorem of Jankowski (loc.cit.) is proved using essentially different methods. We show that this theorem can be proved using, for retraction, one uniform formula. Namely it is proved that if \(\alpha =0\) or \(\delta =\infty\) or \(\alpha\geq \delta\) and \(F_{\alpha,\delta}(L)\subseteq B^{{\mathfrak n}}_{\alpha,\delta}\) and if L is an \(<\alpha,\delta >\)- semidistributive lattice, then the function \[ r: B^ n_{\alpha,\delta}\to F_{\alpha,\delta}(L) \] such that for \(x\in {\mathcal P}({\mathfrak n}):\) \[ (*)\quad r(x)=\inf_ L\{l\in L| \quad (\forall A\subseteq L)x\in C(A)\Rightarrow l\in C(A)\} \] defines retraction, where C is a proper closure operator for \(B^{{\mathfrak n}}_{\alpha,\delta}\). It is also proved that the formula (*) defines retraction for all \(<\alpha,\delta >\), whenever L is an \(<\alpha,\delta >\)-pseudodistributive lattice. Moreover it is proved that when \(\alpha =\omega\) and \(\delta =\infty\), the formula (*) defines identical retraction to the formula given by D. Scott, and when \(\alpha =0\) and \(\delta =\omega\), the formula (*) defines identical retraction to the formula given by Jankowski.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    closure space
    0 references
    continuous lattice
    0 references
    absolute extensor
    0 references
    complete Heyting lattice
    0 references
    semidistributive lattice
    0 references
    retraction
    0 references
    closure operator
    0 references