𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Definitive Constructive Open Mapping Theorem?

✍ Scribed by Douglas Bridges; Hajime Ishihara


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
436 KB
Volume
44
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


It is proved, within Bishop's constructive mathematics (BISH), that, in the context of a Hilbert space, the Open Mapping Theorem is equivalent to a principle that holds in intuitionistic mathematics and recursive constructive mathematics but is unlikely to be provable within BISH.


πŸ“œ SIMILAR VOLUMES


A General Constructive Intermediate Valu
✍ Douglas S. Bridges πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 180 KB

Proof. We first prove the paraconvexity of u ( X ) . Consider a, 6 , and y such that u(a) 5 y 5 u(b), and let E > 0. We use an approximate "approximate interval-28 Ztschr. f. math. Logik

A Constructive Proof of Gleason's Theore
✍ Fred Richman; Douglas Bridges πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 167 KB

Gleason's theorem states that any totally additive measure on the closed subspaces, or projections, of a Hilbert space of dimension greater than two is given by a positive operator of trace class. In this paper we give a constructive proof of that theorem.

A constructive version of Birkhoff's the
✍ Jesper CarlstrΓΆm πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

## Abstract A version of Birkhoff's theorem is proved by constructive, predicative, methods. The version we prove has two conditions more than the classical one. First, the class considered is assumed to contain a generic family, which is defined to be a set‐indexed family of algebras such that if

A constructive proof of the Peter-Weyl t
✍ Thierry Coquand; Bas Spitters πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

We present a new and constructive proof of the Peter-Weyl theorem on the representations of compact groups. We use the Gelfand representation theorem for commutative C\*-algebras to give a proof which may be seen as a direct generalization of Burnside's algorithm [3]. This algorithm computes the cha

A Constructive Proof of a Theorem in Rel
✍ Aleksandar Kron πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 461 KB πŸ‘ 1 views

In this paper we investigate a propositional systeni L related t o T,-W of relevance logic. It has been conjectured that for any formulas A and B