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 Gleason's Theorem
β Scribed by Fred Richman; Douglas Bridges
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 167 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0022-1236
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
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
## 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
Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.
## Abstract A new proof of Menger's theorem is presented.