Parthasarathy, shift-compactness and infinite combinatorics

Bingham, N. H. & Ostaszewski, A.ORCID logo (2024). Parthasarathy, shift-compactness and infinite combinatorics. Indian Journal of Pure and Applied Mathematics, 55(3), 931 – 948. https://doi.org/10.1007/s13226-024-00638-9
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

subject
Accepted Version

Download

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export