BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 26 definitions for Kuiper.

Kuiper's theorem

Print-Friendly
About 1 pages (175 words)

Bookmark and Share Know this topic well? Help others and get FREE products!

In mathematics, Kuiper's theorem is a result on the topology of the operators on an infinite-dimensional complex Hilbert space H. It states that the topological space X of all linear operators L from H to itself, which are bounded operators and invertible, is such that for any finite complex Y, there is just one homotopy class of mappings from Y to X. Here the topology on X is the norm topology of operators, and the single class must be that of constant mappings. It is a corollary, itself often called Kuiper's theorem, that X is contractible. This result has important uses in topological K-theory. In finite dimensions X would be a complex general linear group, not at all contractible (it has the topology of its maximal compact subgroup, the unitary group). There is therefore a sense in which, by passing to infinitely many dimensions, much of the topology of operators 'goes away'. The result was proved by the Dutch mathematician Nicolaas Kuiper (1920-1994).

View More Summaries on Kuiper's theorem
 
Ask any question on Kuiper's theorem and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Kuiper's theorem from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy