Parthasarathy, shift-compactness and infinite combinatorics

Bingham, N. H.; and Ostaszewski, AdamORCID logo Parthasarathy, shift-compactness and infinite combinatorics. Indian Journal of Pure and Applied Mathematics, 55 (3). 931 – 948. ISSN 0019-5588
Copy

Parthasarathy’s heritage has a hidden component arising from a variant of his concept of shift-compactness which yields quick proofs of fundamental theorems reviewed here. We demonstrate the closeness of the variant notion to his original one as arising in the tacit treatment of all possible convergent centrings. We also include a very short proof of the Effros Mapping Theorem –a non-linear version of the Open Mapping Theorem. This is deduced from a shift-compactness theorem. Both these can be given a constructive form by implementing a constructive improvement to a theorem on the separation of points and closed nowhere dense sets.

picture_as_pdf

picture_as_pdf
subject
Accepted Version

Download

Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL Data Cite XML EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads