A quantitative refinement of the closed graph theorem

DOI10.21136/CMJ.1974.101265zbMATH Open0315.46007OpenAlexW2226887528MaRDI QIDQ4076324FDOQ4076324

Authors: Vlastimil Pták 

Publication date: 1974

Full work available at URL: https://eudml.org/doc/12814

Mathematics Subject Classification ID

Complete metric spaces (54E50) Open mapping and closed graph theorems; completeness (including (B)-, (B_r)-completeness) (46A30)

Cites Work

• On the closed graph theorem
• Title not available (Why is that?)
• A theorem of the closed graph type

Cited In (18)

• On superadditive rates of convergence
• A local version of the closed graph Lemma of Kelley
• An open mapping theorem for families of multifunctions
• Subtraction theorems and approximate openness for multifunctions: Topological and infinitesimal viewpoints
• Infinite products of relations, set-valued series and uniform openness of multifunctions
• Extending the applicability of Newton's method using nondiscrete induction
• A remark on small divisors problems
• On general open mapping theorems
• An improved nonlinear closed graph theorem
• Title not available (Why is that?)
• Nonlinear regularity models
• On primal regularity estimates for single-valued mappings
• Nondiscrete mathematical induction and iterative existence proofs
• The rate of convergence of Newton's process
• Title not available (Why is that?)
• Iterative processes and open mapping theorems
• An induction theorem and general open mapping theorems
• Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps

This page was built for publication: A quantitative refinement of the closed graph theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076324)