Sharp Balian-Low Theorems and Fourier Multipliers Alex Powell - - PowerPoint PPT Presentation

sharp balian low theorems and fourier multipliers
SMART_READER_LITE
LIVE PREVIEW

Sharp Balian-Low Theorems and Fourier Multipliers Alex Powell - - PowerPoint PPT Presentation

Sharp Balian-Low Theorems and Fourier Multipliers Alex Powell Vanderbilt University Department of Mathematics October 8, 2017 Joint work with: Shahaf Nitzan & Michael Northington Notation Q: What is time-frequency analysis? Notation Q:


slide-1
SLIDE 1

Sharp Balian-Low Theorems and Fourier Multipliers

Alex Powell

Vanderbilt University Department of Mathematics

October 8, 2017 Joint work with: Shahaf Nitzan & Michael Northington

slide-2
SLIDE 2

Notation

Q: What is time-frequency analysis?

slide-3
SLIDE 3

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators.

slide-4
SLIDE 4

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

slide-5
SLIDE 5

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-6
SLIDE 6

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-7
SLIDE 7

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-8
SLIDE 8

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-9
SLIDE 9

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-10
SLIDE 10

Notation

Q: What is time-frequency analysis? It’s a branch of harmonic analysis that uses the structure of translation and modulation for the analysis of functions and operators. Translation: Tsf (x) = f (x − s) Modulation: Mrf (x) = e2πirxf (x) For fixed a, b > 0 and f ∈ L2(R) define: fm,n(x) = MmbTanf (x) = e2πibmxf (x − na) Gabor system: G(f , a, b) = {fm,n}m,n∈Z

  • 5
  • 4
  • 3
  • 2
  • 1

1 2 3 4 5

  • 1.5
  • 1
  • 0.5

0.5 1 1.5

slide-11
SLIDE 11

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ)

slide-12
SLIDE 12

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ) fm,n(x) = MbmTanf (x) is a “time-frequency shift” of f Think of G(f , a, b) as set of time-frequency shifts of f ∈ L2(R) along the lattice aZ × bZ in the time-freq plane:

slide-13
SLIDE 13

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ) fm,n(x) = MbmTanf (x) is a “time-frequency shift” of f Think of G(f , a, b) as set of time-frequency shifts of f ∈ L2(R) along the lattice aZ × bZ in the time-freq plane: Time-freq plane

slide-14
SLIDE 14

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ) fm,n(x) = MbmTanf (x) is a “time-frequency shift” of f Think of G(f , a, b) as set of time-frequency shifts of f ∈ L2(R) along the lattice aZ × bZ in the time-freq plane: f0,0

slide-15
SLIDE 15

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ) fm,n(x) = MbmTanf (x) is a “time-frequency shift” of f Think of G(f , a, b) as set of time-frequency shifts of f ∈ L2(R) along the lattice aZ × bZ in the time-freq plane: f0,2

slide-16
SLIDE 16

Time-frequency plane

Sometimes useful to visualize Gabor systems in the time-frequency plane: Recall Fourier transform: f (ξ) =

  • f (x)e−2πiξxdx

Modulation property:

  • (Msf )(ξ) =

f (ξ − s) = Ts( f )(ξ) fm,n(x) = MbmTanf (x) is a “time-frequency shift” of f Think of G(f , a, b) as set of time-frequency shifts of f ∈ L2(R) along the lattice aZ × bZ in the time-freq plane: f1,2

slide-17
SLIDE 17

Signal representations

Goal: represent functions/signals h in terms of G(f , a, b) h(x) =

  • m,n∈Z

cm,nfm,n(x) =

  • m,n∈Z

cm,ne2πibmxf (x − an)

slide-18
SLIDE 18

Signal representations

Goal: represent functions/signals h in terms of G(f , a, b) h(x) =

  • m,n∈Z

cm,nfm,n(x) =

  • m,n∈Z

cm,ne2πibmxf (x − an)

  • Represent h as sum of: different frequency components (controlled by m)

at different times (controlled by n)

slide-19
SLIDE 19

Signal representations

Goal: represent functions/signals h in terms of G(f , a, b) h(x) =

  • m,n∈Z

cm,nfm,n(x) =

  • m,n∈Z

cm,ne2πibmxf (x − an)

  • Represent h as sum of: different frequency components (controlled by m)

at different times (controlled by n)

  • To be useful, want f to be well-localized in time and frequency
slide-20
SLIDE 20

Signal representations

Goal: represent functions/signals h in terms of G(f , a, b) h(x) =

  • m,n∈Z

cm,nfm,n(x) =

  • m,n∈Z

cm,ne2πibmxf (x − an)

  • Represent h as sum of: different frequency components (controlled by m)

at different times (controlled by n)

  • To be useful, want f to be well-localized in time and frequency
  • Analogy:
slide-21
SLIDE 21

Signal representations

Goal: represent functions/signals h in terms of G(f , a, b) h(x) =

  • m,n∈Z

cm,nfm,n(x) =

  • m,n∈Z

cm,ne2πibmxf (x − an)

  • Represent h as sum of: different frequency components (controlled by m)

at different times (controlled by n)

  • To be useful, want f to be well-localized in time and frequency
  • Analogy:
  • Gabor system applications: communications engineering (OFDM),

audio signal processing, optics, physics, analysis of pseudodifferential operators, subfamily of Fefferman-Cordoba wavepackets

slide-22
SLIDE 22

Example 1

General problem: How to chose f ∈ L2(R) and a, b > 0 so that G(f , a, b) nicely spans L2(R)?

slide-23
SLIDE 23

Example 1

General problem: How to chose f ∈ L2(R) and a, b > 0 so that G(f , a, b) nicely spans L2(R)?

Example

Recall: Fourier series {e2πinx}n∈Z provide an ONB for L2[0, 1] Let f (x) = χ[0,1](x) = indicator function of [0, 1] Have fm,n(x) = e2πimxχ[0,1](x − n) G(f , 1, 1) is an ONB for L2(R)

slide-24
SLIDE 24

Example 1

General problem: How to chose f ∈ L2(R) and a, b > 0 so that G(f , a, b) nicely spans L2(R)?

Example

Recall: Fourier series {e2πinx}n∈Z provide an ONB for L2[0, 1] Let f (x) = χ[0,1](x) = indicator function of [0, 1] Have fm,n(x) = e2πimxχ[0,1](x − n) G(f , 1, 1) is an ONB for L2(R) Unfortunately, this G(f , 1, 1) is not a very “good” ONB for L2(R) f is poorly localized in frequency since | f (ξ)| =

  • sin(πξ)

πξ

1 |ξ|

ONB expansions using G(f , 1, 1) are poorly localized in frequency

slide-25
SLIDE 25

Example 1

General problem: How to chose f ∈ L2(R) and a, b > 0 so that G(f , a, b) nicely spans L2(R)?

Example

Recall: Fourier series {e2πinx}n∈Z provide an ONB for L2[0, 1] Let f (x) = χ[0,1](x) = indicator function of [0, 1] Have fm,n(x) = e2πimxχ[0,1](x − n) G(f , 1, 1) is an ONB for L2(R) Unfortunately, this G(f , 1, 1) is not a very “good” ONB for L2(R) f is poorly localized in frequency since | f (ξ)| =

  • sin(πξ)

πξ

1 |ξ|

ONB expansions using G(f , 1, 1) are poorly localized in frequency Remark: Gabor ONB only occur on time-freq lattices of density one G(h, a, b) is an ONB for L2(R) = ⇒ ab = 1

slide-26
SLIDE 26

Example 2

Example

Let g(t) = e−πx2 Suppose 0 < ab < 1 and consider G(g, a, b) = {gm,n}m,n∈Z Then every f ∈ L2(R) has an unconditionally convergent Gabor expansion: f (x) =

  • m,n∈Z

f , gm,ngm,n(x)

  • g(ξ) = e−πξ2 =

⇒ expansions well-localized in time and frequency

slide-27
SLIDE 27

Example 2

Example

Let g(t) = e−πx2 Suppose 0 < ab < 1 and consider G(g, a, b) = {gm,n}m,n∈Z Then every f ∈ L2(R) has an unconditionally convergent Gabor expansion: f (x) =

  • m,n∈Z

f , gm,ngm,n(x)

  • g(ξ) = e−πξ2 =

⇒ expansions well-localized in time and frequency However: The above G(g, a, b) is not an ONB for L2(R) (but it’s a “frame”) G(g, a, b) provides redundant (non-unique) representations G(g, a, b) poorly conditioned when ab ≈ 1

slide-28
SLIDE 28

Well-localized Gabor ONB?

So far: G(χ[0,1], 1, 1) is ONB for L2(R); poor frequency localization G(e−πx2, a, b) has good time and freq localization; not an ONB

slide-29
SLIDE 29

Well-localized Gabor ONB?

So far: G(χ[0,1], 1, 1) is ONB for L2(R); poor frequency localization G(e−πx2, a, b) has good time and freq localization; not an ONB Questions: Can one have “nice” examples of Gabor ONB that provide well-localized representations in both time and frequency? If G(f , 1, 1) is an ONB for L2(R), can f , f both be well-localized?

slide-30
SLIDE 30

Well-localized Gabor ONB?

So far: G(χ[0,1], 1, 1) is ONB for L2(R); poor frequency localization G(e−πx2, a, b) has good time and freq localization; not an ONB Questions: Can one have “nice” examples of Gabor ONB that provide well-localized representations in both time and frequency? If G(f , 1, 1) is an ONB for L2(R), can f , f both be well-localized? Balian-Low theorem is a fundamental obstruction that prevents this...

slide-31
SLIDE 31

The BLT

Balian-Low Theorem

Suppose f ∈ L2(R) satisfies

  • |x|2|f (x)|2dx < ∞

and

  • |ξ|2|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an ONB for L2(R).

slide-32
SLIDE 32

The BLT

Balian-Low Theorem

Suppose f ∈ L2(R) satisfies

  • |x|2|f (x)|2dx < ∞

and

  • |ξ|2|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an ONB for L2(R). BLT says: Gabor ONB must be poorly localized in time or frequency

slide-33
SLIDE 33

The BLT

Balian-Low Theorem

Suppose f ∈ L2(R) satisfies

  • |x|2|f (x)|2dx < ∞

and

  • |ξ|2|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an ONB for L2(R). BLT says: Gabor ONB must be poorly localized in time or frequency Origin: Balian (1981) & Low (1985); both with same technical gap Later proofs: Battle (1989), Daubechies, Coifman, Semmes (1990)

slide-34
SLIDE 34

The BLT

Balian-Low Theorem

Suppose f ∈ L2(R) satisfies

  • |x|2|f (x)|2dx < ∞

and

  • |ξ|2|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an ONB for L2(R). BLT says: Gabor ONB must be poorly localized in time or frequency Origin: Balian (1981) & Low (1985); both with same technical gap Later proofs: Battle (1989), Daubechies, Coifman, Semmes (1990) BLT holds more generally for Riesz bases

slide-35
SLIDE 35

The BLT

Balian-Low Theorem

Suppose f ∈ L2(R) satisfies

  • |x|2|f (x)|2dx < ∞

and

  • |ξ|2|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an ONB for L2(R). BLT says: Gabor ONB must be poorly localized in time or frequency Origin: Balian (1981) & Low (1985); both with same technical gap Later proofs: Battle (1989), Daubechies, Coifman, Semmes (1990) BLT holds more generally for Riesz bases BLT is sharp (2003): fails with weights

|x|2 log2+ǫ(|x|+2), |ξ|2 log2+ǫ(|ξ|+2)

∃ versions with nonsymmetric weights |x|p, |ξ|p′, Gautam (2008)

slide-36
SLIDE 36

Perspective

Heisenberg Uncertainty Principle

If f ∈ L2(R) and f L2(R) = 1 then:

  • |x|2|f (x)|2dx

1/2 |ξ|2| f (ξ)|2dξ 1/2 ≥ 4π Heisenberg UP: f and f cannot both be too well localized Balian-Low Theorem is a strong form of UP for Gabor ONB: G(f , 1, 1) ONB for L2(R) = ⇒ lower bound in UP is infinite

slide-37
SLIDE 37

Exact systems

Q: Is the BLT the end of the story?

slide-38
SLIDE 38

Exact systems

Q: Is the BLT the end of the story? A: No! We’ll see that the BLT is part of a larger scale of trade-offs between time-frequency localization and spanning structure

slide-39
SLIDE 39

Exact systems

Q: Is the BLT the end of the story? A: No! We’ll see that the BLT is part of a larger scale of trade-offs between time-frequency localization and spanning structure A weaker spanning structure than ONB: {fn} ⊂ L2(R) is minimal if: ∀N, fN / ∈ span{fn : n = N} {fn} ⊂ L2(R) is exact if it is complete and minimal {ONB} {Exact Systems}

slide-40
SLIDE 40

Exact systems

Q: Is the BLT the end of the story? A: No! We’ll see that the BLT is part of a larger scale of trade-offs between time-frequency localization and spanning structure A weaker spanning structure than ONB: {fn} ⊂ L2(R) is minimal if: ∀N, fN / ∈ span{fn : n = N} {fn} ⊂ L2(R) is exact if it is complete and minimal {ONB} {Exact Systems}

Exact BLT (Daubechies & Janssen, 1993)

Suppose f ∈ L2(R) satisfies

  • |x|4|f (x)|2dx < ∞

and

  • |ξ|4|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an exact system in L2(R).

slide-41
SLIDE 41

Exact systems

Q: Is the BLT the end of the story? A: No! We’ll see that the BLT is part of a larger scale of trade-offs between time-frequency localization and spanning structure A weaker spanning structure than ONB: {fn} ⊂ L2(R) is minimal if: ∀N, fN / ∈ span{fn : n = N} {fn} ⊂ L2(R) is exact if it is complete and minimal {ONB} {Exact Systems}

Exact BLT (Daubechies & Janssen, 1993)

Suppose f ∈ L2(R) satisfies

  • |x|4|f (x)|2dx < ∞

and

  • |ξ|4|

f (ξ)|2dξ < ∞. Then G(f , 1, 1) cannot be an exact system in L2(R). |x|4, |ξ|4 weights are sharp ∃ versions with nonsymmetric weights |x|p, |ξ|q, (Heil & AP, 2007)

slide-42
SLIDE 42

(Cq)-systems

Q: What happens “between” ONB and exact systems?

slide-43
SLIDE 43

(Cq)-systems

Q: What happens “between” ONB and exact systems? A: (Cq)-systems provide an intermediate scale of spanning structures

slide-44
SLIDE 44

(Cq)-systems

Q: What happens “between” ONB and exact systems? A: (Cq)-systems provide an intermediate scale of spanning structures Fix 2 ≤ q ≤ ∞. {fn}∞

n=1 ⊂ L2(R) is a (Cq)-system if every f ∈ L2(R) can be approximated

arbitrarily well by finite sums anfn with

  • |an|q1/q

≤ Cf L2(R) (Cq)-system provides completeness with ℓq control on coefficients Every ONB for L2(R) is a (C2)-system If a Gabor system G(f , 1, 1) is exact, then it is a (C∞)-system

slide-45
SLIDE 45

BLT for (Cq)-systems

Theorem (Nitzan, Northington, AP, 2017)

Fix 2 ≤ q ≤ ∞. Suppose f ∈ L2(R) satisfies

  • |x|4(1− 1

q )|f (x)|2dx < ∞

and

  • |ξ|4(1− 1

q )|

f (ξ)|2dξ < ∞. Then G(f , 1, 1, ) cannot be an exact (Cq)-system for L2(R).

slide-46
SLIDE 46

BLT for (Cq)-systems

Theorem (Nitzan, Northington, AP, 2017)

Fix 2 ≤ q ≤ ∞. Suppose f ∈ L2(R) satisfies

  • |x|4(1− 1

q )|f (x)|2dx < ∞

and

  • |ξ|4(1− 1

q )|

f (ξ)|2dξ < ∞. Then G(f , 1, 1, ) cannot be an exact (Cq)-system for L2(R). The weights |x|4(1− 1

q ), |ξ|4(1− 1 q ) are sharp

Almost sharp predecessor: Nitzan, Olsen, 2011 ∃ sharp nonsymmetric versions of the theorem Note: q = 2 recovers BLT for ONB with weights |x|2, |ξ|2 q = ∞ recovers BLT for exact systems with weights |x|4, |ξ|4

slide-47
SLIDE 47

Ingredient 1 in the proof: the Zak transform

Zak transform

∀(x, ξ) ∈ R2, Zf (x, ξ) =

  • k∈Z

f (x − k)e−2πikξ The Zak transform is quasiperiodic: Zf (x, ξ + 1) = Zf (x, ξ) Zf (x + 1, ξ) = e−2πiξZf (x, ξ) So Zf (x, ξ) fully determined by values on square (x, ξ) ∈ [0, 1]2 Z : L2(R) → L2([0, 1]2) is unitary Zak transform converts Gabor system to windowed exponentials: Z(fm,n) = Z(MmTnf )(x, ξ) = e2πi(mx+nξ)Zf (x, ξ)

slide-48
SLIDE 48

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

slide-49
SLIDE 49

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

slide-50
SLIDE 50

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

G(f , 1, 1) ONB for L2(R) ⇐ ⇒ |Zf | = 1 a.e.

slide-51
SLIDE 51

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

G(f , 1, 1) ONB for L2(R) ⇐ ⇒ |Zf | = 1 a.e. G(f , 1, 1) Riesz basis for L2(R) ⇐ ⇒ 0 < A ≤ |Zf | ≤ B a.e.

slide-52
SLIDE 52

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

G(f , 1, 1) ONB for L2(R) ⇐ ⇒ |Zf | = 1 a.e. G(f , 1, 1) Riesz basis for L2(R) ⇐ ⇒ 0 < A ≤ |Zf | ≤ B a.e. G(f , 1, 1) exact in L2(R) ⇐ ⇒ 1/|Zf |2 ∈ L1(T2)

slide-53
SLIDE 53

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

G(f , 1, 1) ONB for L2(R) ⇐ ⇒ |Zf | = 1 a.e. G(f , 1, 1) Riesz basis for L2(R) ⇐ ⇒ 0 < A ≤ |Zf | ≤ B a.e. G(f , 1, 1) exact in L2(R) ⇐ ⇒ 1/|Zf |2 ∈ L1(T2) G(f , 1, 1) Schauder basis† for L2(R) ⇐ ⇒ |Zf |2 ∈ A2,prod(T × T)

slide-54
SLIDE 54

Zak transform

Zak properties lead to isometric isomorphism between L2(R) and weighted space L2

W (T2) with weight W (x, ξ) = |Zf (x, ξ)|2

Weighted L2 space: FL2

W (T2) =

1 1 |F(x, ξ)|2W (x, ξ) dx dξ 1/2 Consequence: spanning props of G(f , 1, 1) in L2(R) correspond to spanning props of E = {e2πik,z}k∈Z2 in L2

W (T2)

Zak transform characterization of spanning properties:

G(f , 1, 1) ONB for L2(R) ⇐ ⇒ |Zf | = 1 a.e. G(f , 1, 1) Riesz basis for L2(R) ⇐ ⇒ 0 < A ≤ |Zf | ≤ B a.e. G(f , 1, 1) exact in L2(R) ⇐ ⇒ 1/|Zf |2 ∈ L1(T2) G(f , 1, 1) Schauder basis† for L2(R) ⇐ ⇒ |Zf |2 ∈ A2,prod(T × T) G(f , 1, 1) is an exact (Cq)-system in L2(R) ⇐ ⇒ ???

slide-55
SLIDE 55

Ingredient 2 in the proof: Fourier multipliers

Fix a function g. Fourier multiplier Tg is an operator that does: input F Multiply by g F−1

  • utput
slide-56
SLIDE 56

Ingredient 2 in the proof: Fourier multipliers

Fix a function g. Fourier multiplier Tg is an operator that does: input F Multiply by g F−1

  • utput

We’ll be interested in the setting: Input is a sequence c = {ck}k∈Z2 ∈ ℓ2(Z2) and ∀ξ ∈ T2, F[c](ξ) =

  • k∈Z2

cke2πik,ξ

slide-57
SLIDE 57

Ingredient 2 in the proof: Fourier multipliers

Fix a function g. Fourier multiplier Tg is an operator that does: input F Multiply by g F−1

  • utput

We’ll be interested in the setting: Input is a sequence c = {ck}k∈Z2 ∈ ℓ2(Z2) and ∀ξ ∈ T2, F[c](ξ) =

  • k∈Z2

cke2πik,ξ The multiplier g is an integrable function on T2

slide-58
SLIDE 58

Ingredient 2 in the proof: Fourier multipliers

Fix a function g. Fourier multiplier Tg is an operator that does: input F Multiply by g F−1

  • utput

We’ll be interested in the setting: Input is a sequence c = {ck}k∈Z2 ∈ ℓ2(Z2) and ∀ξ ∈ T2, F[c](ξ) =

  • k∈Z2

cke2πik,ξ The multiplier g is an integrable function on T2 F−1[f ](k) =

  • T2 f (x)e−2πik,xdx for all k ∈ Z2
slide-59
SLIDE 59

Ingredient 2 in the proof: Fourier multipliers

Fix a function g. Fourier multiplier Tg is an operator that does: input F Multiply by g F−1

  • utput

We’ll be interested in the setting: Input is a sequence c = {ck}k∈Z2 ∈ ℓ2(Z2) and ∀ξ ∈ T2, F[c](ξ) =

  • k∈Z2

cke2πik,ξ The multiplier g is an integrable function on T2 F−1[f ](k) =

  • T2 f (x)e−2πik,xdx for all k ∈ Z2

Output is the sequence: Tg(c) = F−1(gF(c))

slide-60
SLIDE 60

Bounded Fourier multipliers Mq

p(T2)

Say that g ∈ Mq

p(T2) if Tg : ℓp(Z2) → ℓq(Z2) is bounded operator

Tg(c)ℓq(Z2) ≤ Kcℓp(Z2) No nice characterization of Mq

p(T2), except for special cases

Lemma

Suppose f ∈ L2(R) and 2 ≤ q ≤ ∞. Then: G(f , 1, 1) is an exact (Cq)-system for L2(R) ⇐ ⇒

1 |Zf | ∈ Mq 2(T2)

slide-61
SLIDE 61

Ingredient 3 in the proof: an embedding for Zf

Lemma (Gautam, 2007)

Fix 2 ≤ q ≤ ∞. Suppose f ∈ L2(R) satisfies

  • |x|4(1− 1

q )|f (x)|2dx < ∞

and

  • |ξ|4(1− 1

q )|

f (ξ)|2dξ < ∞. If s = 2(1 − 1/q) then for any ϕ ∈ C ∞

c (R2),

  • R2(|x|2 + |ξ|2)s/2 |

ϕZf (x, ξ)|2dxdξ < ∞. Lemma says that Zf embeds into Sobolev space Hs

loc(R2)

Sobolev embeddings = ⇒ Zf has some regularity

when q = 2, Zf ∈ VMO when q > 2, Zf has some H¨

  • lder continuity
slide-62
SLIDE 62

Ingredient 4 in the proof: a topological fact

Recall that the Zak transform F = Zf is quasiperiodic: F(x, ξ + 1) = F(x, ξ) F(x + 1, ξ) = e−2πiξF(x, ξ) Recall Sobolev embedding implies that F = Zf is continuous

slide-63
SLIDE 63

Ingredient 4 in the proof: a topological fact

Recall that the Zak transform F = Zf is quasiperiodic: F(x, ξ + 1) = F(x, ξ) F(x + 1, ξ) = e−2πiξF(x, ξ) Recall Sobolev embedding implies that F = Zf is continuous

Topological fact

A continuous quasiperiodic function must have a zero

slide-64
SLIDE 64

Ingredient 4 in the proof: a topological fact

Recall that the Zak transform F = Zf is quasiperiodic: F(x, ξ + 1) = F(x, ξ) F(x + 1, ξ) = e−2πiξF(x, ξ) Recall Sobolev embedding implies that F = Zf is continuous

Topological fact

A continuous quasiperiodic function must have a zero Intuition: If x∗ is fixed, then F(x∗, ξ), 0 ≤ ξ ≤ 1, is a closed curve Γx∗ ⊂ C F(1, ξ) = e−2πiξF(0, ξ) Γ0, Γ1 have different winding numbers about 0

slide-65
SLIDE 65

An obstruction to Mq

2(Td)

Theorem (Nitzan, Northington, AP)

Suppose 2 ≤ q ≤ ∞. The following three properties are incompatible:

1 |F|−1 ∈ Mq

2(T2)

2 F ∈ Hs

loc(R2), with s = 2(1 − 1 q)

3 F has a zero

This implies the BLT for (Cq)-systems by taking F = Zf Extensions:

Nonsymmetric Sobolev spaces Hs1,s2

loc (R2) ( =

⇒ nonsymmetric BLT) Higher dimensions Mq

p(Td)

Matrix-valued Fourier multipliers Hausdorff dimension of zero set Applications to multiply generated shift-invariant spaces

slide-66
SLIDE 66

Summary

Gabor systems G(f , a, b) give time-freq representations of functions Balian-Low theorem: trade-off between G(f , 1, 1) spanning structure and how well-localized that f , f can be If

  • |x|4(1− 1

q )|f (x)|2dx < ∞

and

  • |ξ|4(1− 1

q )|

f (ξ)|2dξ < ∞, then G(f , 1, 1, ) cannot be an exact (Cq)-system for L2(R) Unfortunately: only way for G(f , a, b) to provide nicely concentrated time-frequency representations is to use overcomplete representations