✦ LIBER ✦

Continuous convergence and the closed-graph theorem

✍ Scribed by Ronald Beattie

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 466 KB
Volume: 99
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.19800990111

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Closed Graph Theorem for Nonlinear M

The Closed Graph Theorem for Nonlinear Maps

✍ Antonio Tineo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Web-compact spaces, Fréchet-Urysohn grou

Web-compact spaces, Fréchet-Urysohn groups and a Suslin closed graph theorem

✍ J. C. Ferrando; Jerzy Ka̧kol; M. López Pellicer; W. Śliwa 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

A topological space X is strongly web-compact if X admits a family Aα : α ∈ N N of relatively countably compact sets covering X and such that Aα ⊂ A β for α ≤ β. The main result of this paper states the following: Theorem A Let X and Y be topological groups and f a homomorphism between X and Y with

Closed graph and open mapping theorems f

Closed graph and open mapping theorems for topological -modules and applications

✍ Claudia Garetto 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

## Abstract We present closed graph and open mapping theorems for $ \tilde \lc $‐linear maps acting between suitable classes of topological and locally convex topological $ \tilde \lc $‐modules. This is done by adaptation of De Wilde's theory of webbed spaces and Adasch–Ernst–Keim's theory of barre

Notes on integration I: The underlying c

Notes on integration I: The underlying convergence theorem

✍ W. F. Eberlein 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 1 views

Convergence of the fixed point theorem w

Convergence of the fixed point theorem with random parameters

✍ F. Poirion 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

A graph-theoretic version of the union-c

A graph-theoretic version of the union-closed sets conjecture

✍ El-Zahar, Mohamed H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture