Library Header Image
LSE Research Online LSE Library Services

Parthasarathy, shift-compactness and infinite combinatorics

Bingham, N. H. and Ostaszewski, Adam (2024) Parthasarathy, shift-compactness and infinite combinatorics. Indian Journal of Pure and Applied Mathematics. ISSN 0019-5588 (In Press)

[img] Text (Parthasarathy, shift-compactness and infinite combinatorics) - Accepted Version
Pending embargo until 1 January 2100.

Download (267kB) | Request a 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.

Item Type: Article
Additional Information: © 2024 Springer
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 25 Mar 2024 14:27
Last Modified: 28 May 2024 08:33

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics