Logical equivalence of the fundamental theorems on operators between Banach spaces (Q2191636): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Elementary Functional Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Really Simple Elementary Proof of the Uniform Boundedness Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4853967 / rank
 
Normal rank

Revision as of 00:25, 23 July 2024

scientific article
Language Label Description Also known as
English
Logical equivalence of the fundamental theorems on operators between Banach spaces
scientific article

    Statements

    Logical equivalence of the fundamental theorems on operators between Banach spaces (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2020
    0 references
    It is conventional wisdom that some of the ``grand'' theorems of functional analysis are equivalent to each other in the sense that one can be deduced from the others without much effort. This paper provides six such proofs for all the implications between the closed graph theorem (CGT), the open mapping theorem (OMT), and the bounded inverse theorem (BIT). The authors also show how to derive the uniform boundedness principle (UBP) from CGT. Most interestingly, they present a proof (due to N.~Eldredge) that UBP directly implies half of OMT, namely, that a surjective operator \(T\) between Banach spaces \(X\) and \(Y\) (actually, from a normed space to a Banach space) is almost open, meaning that the closure of \(T(B_X)\) is a \(0\)-neighbourhood in~\(Y\). Reviewer's remarks: (1) The authors' proof that CGT implies BIT is not convincing to me. (2) One upshot of these equivalences is that, in principle, all these theorems can be proved without the Baire category theorem; \textit{A. D. Sokal} recently provided such a short and elegant proof of UBP in [Am. Math. Mon. 118, No. 5, 450--452 (2011; Zbl 1223.46022)]. For the record, it should be noted that the first ever proofs of UBP, due to Hans Hahn and Stefan Banach, also used a gliding hump argument.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    closed graph theorem
    0 references
    open mapping theorem
    0 references
    bounded inverse theorem
    0 references
    uniform boundedness principle
    0 references