Papers
Topics
Authors
Recent
Search
2000 character limit reached

The assembly of a pointfree bispace and its two variations

Published 2 Nov 2020 in math.FA and math.CT | (2011.01547v1)

Abstract: The duality of finitary biframes as pointfree bitopological spaces is explored. In particular, for a finitary biframe L\mathcal{L} the ordered collection of all its pointfree bisubspaces (i.e. its biquotients) is studied. It is shown that this collection is bitopological in three meaningful ways. In particular it is shown that, apart from the assembly A(L)\mathsf{A}(\mathcal{L}) of a finitary biframe L\mathcal{L}, there are two other structures A<em>cf(L)\mathsf{A}<em>{cf}(\mathcal{L}) and A</em>±(L)\mathsf{A}</em>{\pm}(\mathcal{L}), which both have the same main component as A(L)\mathsf{A}(\mathcal{L}). The main component of both A<em>cf(L)\mathsf{A}<em>{cf}(\mathcal{L}) and A</em>±(L)\mathsf{A}</em>{\pm}(\mathcal{L}) is the ordered collection of all biquotients of L\mathcal{L}. The structure A<em>cf(L)\mathsf{A}<em>{cf}(\mathcal{L}) being a biframe shows that the collection of all biquotients is generated by the frame of the patch-closed biquotients together with that of the patch-fitted ones. The structure A</em>±(L)\mathsf{A}</em>{\pm}(\mathcal{L}) being a biframe shows the collection of all biquotients is generated by the frame of the positive biquotients together with that of the negative ones. Notions of fitness and subfitness for finitary biframes are introduced, and it is shown that the analogues of both characterization theorems for these axioms appearing in Picado and Pultr (2011) hold. A spatial, bitopological version of these theorems is proven, in which finitary biframes whose spectrum is pairwise T1T_1 are characterized, among other things in terms of the spectrum of Acf(L)\mathsf{A}_{cf}(\mathcal{L}).

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.