𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constructive version of Birkhoff's theorem

✍ Scribed by Jesper Carlström

Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
137 KB
Volume
54
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

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 an identity is valid in every algebra of this family, it is valid in every algebra of the class. Secondly, the class is assumed to be closed under inductive limits. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

A Constructive Proof of Gleason's Theore
A Constructive Proof of Gleason's Theorem
✍ 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 General Constructive Intermediate Valu
A General Constructive Intermediate Value Theorem
✍ 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 Definitive Constructive Open Mapping T
A Definitive Constructive Open Mapping Theorem?
✍ Douglas Bridges; Hajime Ishihara 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

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.

An Effective Version of Belyi's Theorem
An Effective Version of Belyi's Theorem
✍ Lily S. Khadjavi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We compute bounds on covering maps that arise in Belyi's Theorem. In particular, we construct a library of height properties and then apply it to algorithms that produce Belyi maps. Such maps are used to give coverings from algebraic curves to the projective line ramified over at most three points.