An Introduction to the Uncertainty Principle - Hardy's Theorem on Lie Groups (Paperback, Softcover reprint of the original 1st ed. 2004)

In 1932 Norbert Wiener gave a series of lectures on Fourier analysis at the Univer sity of Cambridge. One result of Wiener's visit to Cambridge was his well-known text The Fourier Integral and Certain of its Applications; another was a paper by G. H. Hardy in the 1933 Journalofthe London Mathematical Society. As Hardy says in the introduction to this paper, This note originates from a remark of Prof. N. Wiener, to the effect that "a f and g [= j] cannot both be very small". ... The theo pair of transforms rems which follow give the most precise interpretation possible ofWiener's remark. Hardy's own statement of his results, lightly paraphrased, is as follows, in which f is an integrable function on the real line and f is its Fourier transform: x 2 m If f and j are both 0 (Ix1e- /2) for large x and some m, then each is a finite linear combination ofHermite functions. In particular, if f and j are x2 x 2 2 2 both O(e- / ), then f = j = Ae- / , where A is a constant; and if one x 2 2 is0(e- / ), then both are null.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Progress in Mathematics, 217
Release date:	March 2013
First published:	2004
Authors:	Sundaram Thangavelu
Dimensions:	235 x 155 x 10mm (L x W x T)
Format:	Paperback
Pages:	174
Edition:	Softcover reprint of the original 1st ed. 2004
ISBN-13:	978-1-4612-6468-2
Categories:	Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Complex analysis Books > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Functional analysis Promotions
LSN:	1-4612-6468-5
Barcode:	9781461264682

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!