On sharp Strichartz inequalities in low dimensions Dirk Hundertmark - - PowerPoint PPT Presentation

on sharp strichartz inequalities in low dimensions
SMART_READER_LITE
LIVE PREVIEW

On sharp Strichartz inequalities in low dimensions Dirk Hundertmark - - PowerPoint PPT Presentation

On sharp Strichartz inequalities in low dimensions Dirk Hundertmark University of Birmingham Gregynog May 2007 p. 1/24 Plan The Strichartz inequality Some History Proof of sharp Strichartz The Representation Theorem Classification of


slide-1
SLIDE 1

On sharp Strichartz inequalities in low dimensions

Dirk Hundertmark University of Birmingham

Gregynog May 2007 – p. 1/24

slide-2
SLIDE 2

Plan

The Strichartz inequality Some History Proof of sharp Strichartz The Representation Theorem Classification of maximizers: how to use rotation invariance

Gregynog May 2007 – p. 2/24

slide-3
SLIDE 3

The free Schrödinger evolution

Gregynog May 2007 – p. 3/24

slide-4
SLIDE 4

The free Schrödinger evolution

i∂tu = −∆u

  • n L2(Rd)

With initial condition

u(0, x) = f(x) ∈ L2(Rd).

Gregynog May 2007 – p. 3/24

slide-5
SLIDE 5

The free Schrödinger evolution

i∂tu = −∆u

  • n L2(Rd)

With initial condition

u(0, x) = f(x) ∈ L2(Rd).

Solved by the unitary time evolution

u(t, x) = (eit∆f)(x)

Gregynog May 2007 – p. 3/24

slide-6
SLIDE 6

The free Schrödinger evolution

i∂tu = −∆u

  • n L2(Rd)

With initial condition

u(0, x) = f(x) ∈ L2(Rd).

Solved by the unitary time evolution

u(t, x) = (eit∆f)(x) u(t, .)L2(Rd) = fL2(Rd).

Gregynog May 2007 – p. 3/24

slide-7
SLIDE 7

The free Schrödinger evolution

i∂tu = −∆u

  • n L2(Rd)

With initial condition

u(0, x) = f(x) ∈ L2(Rd).

Solved by the unitary time evolution

u(t, x) = (eit∆f)(x) u(t, .)L2(Rd) = fL2(Rd).

Thus

u ∈ L∞

t L2 x

as a space-time function

Gregynog May 2007 – p. 3/24

slide-8
SLIDE 8

Strichartz inequality

Theorem (Strichartz 1977). For p = p(d) = 2 + 4

d,

uLp

t,x =

R

dt

  • Rd dx |u(t, x)|p1/p ≤ SdfL2

x

Gregynog May 2007 – p. 4/24

slide-9
SLIDE 9

Strichartz inequality

Theorem (Strichartz 1977). For p = p(d) = 2 + 4

d,

uLp

t,x =

R

dt

  • Rd dx |u(t, x)|p1/p ≤ SdfL2

x

Note p(1) = 6 and p(2) = 4 are the only even integer exponents.

Gregynog May 2007 – p. 4/24

slide-10
SLIDE 10

Strichartz inequality

Theorem (Strichartz 1977). For p = p(d) = 2 + 4

d,

uLp

t,x =

R

dt

  • Rd dx |u(t, x)|p1/p ≤ SdfL2

x

Note p(1) = 6 and p(2) = 4 are the only even integer exponents. From a harmonic analyst point of view, Strichartz follows from

Gregynog May 2007 – p. 4/24

slide-11
SLIDE 11

Strichartz inequality

Theorem (Strichartz 1977). For p = p(d) = 2 + 4

d,

uLp

t,x =

R

dt

  • Rd dx |u(t, x)|p1/p ≤ SdfL2

x

Note p(1) = 6 and p(2) = 4 are the only even integer exponents. From a harmonic analyst point of view, Strichartz follows from

u(t, x) = (2π)(d+1)/2

  • R
  • Rd ei(xk−τt)δ(τ − k2) ˆ

f(k) dkdτ,

Gregynog May 2007 – p. 4/24

slide-12
SLIDE 12

Strichartz inequality

Theorem (Strichartz 1977). For p = p(d) = 2 + 4

d,

uLp

t,x =

R

dt

  • Rd dx |u(t, x)|p1/p ≤ SdfL2

x

Note p(1) = 6 and p(2) = 4 are the only even integer exponents. From a harmonic analyst point of view, Strichartz follows from

u(t, x) = (2π)(d+1)/2

  • R
  • Rd ei(xk−τt)δ(τ − k2) ˆ

f(k) dkdτ,

the paraboloid τ = k2 has positive Gaussian curvature in

Rd+1. Now apply the Stein-Tomas theorem.

Gregynog May 2007 – p. 4/24

slide-13
SLIDE 13

Some history

Tomas 1975: Fourier restriction theorem for densities

  • n the sphere

Extended by Strichartz to some non-compact manifolds with non-vanishing Gaussian curvature. Much simplified proof by Ginibre and Velo 1985. Strichartz inequalities are at the heart of most studies of non-linear Schrödinger equations (from mid 1980 to now).

Gregynog May 2007 – p. 5/24

slide-14
SLIDE 14

Some questions

What is

Sd = sup

f=0

eit∆fLp

t,x

fL2

x

=?

Existence of maximizers: Are there f∗ ∈ L2(Rd) with

Sd = eit∆f∗Lp

t,x

f∗L2

x

.

What are all maximizers?

Gregynog May 2007 – p. 6/24

slide-15
SLIDE 15

Some questions

What is

Sd = sup

f=0

eit∆fLp

t,x

fL2

x

=?

Existence of maximizers: Are there f∗ ∈ L2(Rd) with

Sd = eit∆f∗Lp

t,x

f∗L2

x

.

What are all maximizers? all questions above turn out to be very hard to answer:

Gregynog May 2007 – p. 6/24

slide-16
SLIDE 16

Some questions

What is

Sd = sup

f=0

eit∆fLp

t,x

fL2

x

=?

Existence of maximizers: Are there f∗ ∈ L2(Rd) with

Sd = eit∆f∗Lp

t,x

f∗L2

x

.

What are all maximizers? all questions above turn out to be very hard to answer: The Strichartz inequality is invariant under all Galilei transformations (translations and boosts) and scaling, which is a huge non-compact group.

Gregynog May 2007 – p. 6/24

slide-17
SLIDE 17

Recent history

Gregynog May 2007 – p. 7/24

slide-18
SLIDE 18

Recent history

Markus Kunze 2003: d = 1 maximizer for Strichartz inequality exist and are in L2 ∩ L∞.

Gregynog May 2007 – p. 7/24

slide-19
SLIDE 19

Recent history

Markus Kunze 2003: d = 1 maximizer for Strichartz inequality exist and are in L2 ∩ L∞. Milena Stanislavova 2004: for a related functional (the dispersion management functional) all maximizers are smooth.

Gregynog May 2007 – p. 7/24

slide-20
SLIDE 20

Recent history

Markus Kunze 2003: d = 1 maximizer for Strichartz inequality exist and are in L2 ∩ L∞. Milena Stanislavova 2004: for a related functional (the dispersion management functional) all maximizers are smooth. Damiano Foschi preprint 2004: S1 = 12−1/12 and

S2 = 2−1/2 and Gaussians are (among the) maximizers.

Gregynog May 2007 – p. 7/24

slide-21
SLIDE 21

The Representation Theorem

Gregynog May 2007 – p. 8/24

slide-22
SLIDE 22

The Representation Theorem

Theorem (100DM and Vadim Zharnitsky 2006). Let f ∈ L2(Rd). a) If d = 1 then

  • R
  • R

|eit∆f(x)|6 dxdt = 1 2 √ 3f ⊗ f ⊗ f, P1(f ⊗ f ⊗ f)L2(R3)

b) If d = 2 then

  • R
  • R2 |eit∆f(x)|4 dxdt = 1

4f ⊗ f, P2(f ⊗ f)L2(R4).

Gregynog May 2007 – p. 8/24

slide-23
SLIDE 23

The Representation Theorem

Theorem (100DM and Vadim Zharnitsky 2006). Let f ∈ L2(Rd). a) If d = 1 then

  • R
  • R

|eit∆f(x)|6 dxdt = 1 2 √ 3f ⊗ f ⊗ f, P1(f ⊗ f ⊗ f)L2(R3)

b) If d = 2 then

  • R
  • R2 |eit∆f(x)|4 dxdt = 1

4f ⊗ f, P2(f ⊗ f)L2(R4). P1: orthogonal projection onto functions in L2(R3) invariant

under rotations fixing the (1, 1, 1) direction.

Gregynog May 2007 – p. 8/24

slide-24
SLIDE 24

The Representation Theorem

Theorem (100DM and Vadim Zharnitsky 2006). Let f ∈ L2(Rd). a) If d = 1 then

  • R
  • R

|eit∆f(x)|6 dxdt = 1 2 √ 3f ⊗ f ⊗ f, P1(f ⊗ f ⊗ f)L2(R3)

b) If d = 2 then

  • R
  • R2 |eit∆f(x)|4 dxdt = 1

4f ⊗ f, P2(f ⊗ f)L2(R4). P1: orthogonal projection onto functions in L2(R3) invariant

under rotations fixing the (1, 1, 1) direction.

P2: orthogonal projection onto functions in L2(R4) invariant

under rotations fixing the (1, 0, 1, 0) and (0, 1, 0, 1) directions.

Gregynog May 2007 – p. 8/24

slide-25
SLIDE 25

Consequences I

Note that f ⊗ f ⊗ f, f ⊗ f ⊗ fL2(R3) = f6

L2(R).

Gregynog May 2007 – p. 9/24

slide-26
SLIDE 26

Consequences I

Note that f ⊗ f ⊗ f, f ⊗ f ⊗ fL2(R3) = f6

L2(R).

Since P1 ≤ 1L2(R3),

uL6

t,x ≤ (2

√ 3)−1/6fL2(R)

Gregynog May 2007 – p. 9/24

slide-27
SLIDE 27

Consequences I

Note that f ⊗ f ⊗ f, f ⊗ f ⊗ fL2(R3) = f6

L2(R).

Since P1 ≤ 1L2(R3),

uL6

t,x ≤ (2

√ 3)−1/6fL2(R)

i.e.,

S1 ≤ (2 √ 3)−1/6 = 12−1/12.

and similarly,

S2 ≤ 2−1/2.

Gregynog May 2007 – p. 9/24

slide-28
SLIDE 28

Consequences II

Gregynog May 2007 – p. 10/24

slide-29
SLIDE 29

Consequences II

d = 1: Equality in Strichartz inequality iff f ⊗ f ⊗ f ∈ Ran(P1)

Gregynog May 2007 – p. 10/24

slide-30
SLIDE 30

Consequences II

d = 1: Equality in Strichartz inequality iff f ⊗ f ⊗ f ∈ Ran(P1)

i.e., iff f ⊗ f ⊗ f is invariant under rotations of R3 which keep the (1, 1, 1) direction fixed.

Gregynog May 2007 – p. 10/24

slide-31
SLIDE 31

Consequences II

d = 1: Equality in Strichartz inequality iff f ⊗ f ⊗ f ∈ Ran(P1)

i.e., iff f ⊗ f ⊗ f is invariant under rotations of R3 which keep the (1, 1, 1) direction fixed. If f(x) = e−ax2, then

Gregynog May 2007 – p. 10/24

slide-32
SLIDE 32

Consequences II

d = 1: Equality in Strichartz inequality iff f ⊗ f ⊗ f ∈ Ran(P1)

i.e., iff f ⊗ f ⊗ f is invariant under rotations of R3 which keep the (1, 1, 1) direction fixed. If f(x) = e−ax2, then

f ⊗ f ⊗ f(η) = f(η1)f(η2)f(η3) = e−a(η2

1+η2 2+η2 3) = e−aη2

is invariant under all rotations of R3.

Gregynog May 2007 – p. 10/24

slide-33
SLIDE 33

Consequences II

If f(x) = e−ax2+bx, then

f ⊗ f ⊗ f(η) = e−aη2+b(1,1,1)·η

Gregynog May 2007 – p. 11/24

slide-34
SLIDE 34

Consequences II

If f(x) = e−ax2+bx, then

f ⊗ f ⊗ f(η) = e−aη2+b(1,1,1)·η

is invariant under rotations of R3 keeping the (1, 1, 1) direction fixed.

Gregynog May 2007 – p. 11/24

slide-35
SLIDE 35

Consequences II

If f(x) = e−ax2+bx, then

f ⊗ f ⊗ f(η) = e−aη2+b(1,1,1)·η

is invariant under rotations of R3 keeping the (1, 1, 1) direction fixed. In particular, S1 = 12−1/12 and analogously S2 = 2−1/2.

Gregynog May 2007 – p. 11/24

slide-36
SLIDE 36

Classification of maximizers

Theorem (100DM and Vadim Zharnitsky). a) If f ∈ L2(R) is not identically zero and f ⊗ f ⊗ f is invariant under rotations of R3 which keep the (1, 1, 1) direction fixed, then there exist A ∈ C, µ ∈ R, λ > 0, and b ∈ C such that

f(x) = Ae(−λ+iµ)x2+bx.

b) If f ∈ L2(R2) and f ⊗ f is invariant under rotations of R4 fixing

(1, 0, 1, 0) and (0, 1, 0, 1) directions, then f(x) = Ae(−λ+iµ)|x|2+b·x

for some A ∈ C, µ ∈ R, λ > 0, and b ∈ C2

Gregynog May 2007 – p. 12/24

slide-37
SLIDE 37

Remark: This is similar to the Maxwell problem:

Gregynog May 2007 – p. 13/24

slide-38
SLIDE 38

Remark: This is similar to the Maxwell problem: Let F be a probability distribution on R3 which is invariant under all rotations of R3

Gregynog May 2007 – p. 13/24

slide-39
SLIDE 39

Remark: This is similar to the Maxwell problem: Let F be a probability distribution on R3 which is invariant under all rotations of R3 and

F(v) = f1(v1)f2(v2)f3(v3)

Gregynog May 2007 – p. 13/24

slide-40
SLIDE 40

Remark: This is similar to the Maxwell problem: Let F be a probability distribution on R3 which is invariant under all rotations of R3 and

F(v) = f1(v1)f2(v2)f3(v3)

That is,

F = f ⊗ f ⊗ f

Gregynog May 2007 – p. 13/24

slide-41
SLIDE 41

Remark: This is similar to the Maxwell problem: Let F be a probability distribution on R3 which is invariant under all rotations of R3 and

F(v) = f1(v1)f2(v2)f3(v3)

That is,

F = f ⊗ f ⊗ f

then

F(v) = e−av2.

That is, F is a centered Gaussian.

Gregynog May 2007 – p. 13/24

slide-42
SLIDE 42

Proof of the Representation Formula d = 1

Have

u(t, x) = Ttf(x) = 1 √ 4πit

  • R

ei(x−y)2/(4t)f(y) dy

Gregynog May 2007 – p. 14/24

slide-43
SLIDE 43

Proof of the Representation Formula d = 1

Have

u(t, x) = Ttf(x) = 1 √ 4πit

  • R

ei(x−y)2/(4t)f(y) dy

Thus

u(t, x)3 = 1 √ 4πit

3 R

ei(x−y)2/(4t)f(y) dy 3

and

|u(t, x)|6 = 1 (4π|t|)3

  • R3
  • R3e−ix(η1+η2+η3−ζ1−ζ2−ζ3)/(2t)e−i(|η|2−|ζ|2)/(4t)

f(η1)f(η2)f(η3)f(ζ1)f(ζ2)f(ζ3) dηdζ

Gregynog May 2007 – p. 14/24

slide-44
SLIDE 44

Now do the x-integration with the change of variables

x = 2tz, so dx = 2|t|dz, using δ(β) =

1 2π

  • eixβ dx,
  • R

|u(t, x)|6dx = 1 (4π|t|)2

  • R3
  • R3δ(η1 + η2 + η3 − ζ1 − ζ2 − ζ3)e−i(|η|2−|ζ|2)/(4t)

f(η1)f(η2)f(η3)f(ζ1)f(ζ2)f(ζ3) dηdζ

Gregynog May 2007 – p. 15/24

slide-45
SLIDE 45

Now do the x-integration with the change of variables

x = 2tz, so dx = 2|t|dz, using δ(β) =

1 2π

  • eixβ dx,
  • R

|u(t, x)|6dx = 1 (4π|t|)2

  • R3
  • R3δ(η1 + η2 + η3 − ζ1 − ζ2 − ζ3)e−i(|η|2−|ζ|2)/(4t)

f(η1)f(η2)f(η3)f(ζ1)f(ζ2)f(ζ3) dηdζ

Then do the t-integration with t = 1/(4τ), so dt = 4t2dτ,

  • R
  • R

|u(t, x)|6dxdt = 1 2π

  • R3
  • R3δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)

f ⊗ f ⊗ f(η)f ⊗ f ⊗ f(ζ) dηdζ

Gregynog May 2007 – p. 15/24

slide-46
SLIDE 46

The quadratic form

The right had side can be interpreted as a symmetric quadratic form on C∞

0 (R3) × C∞ 0 (R3).

Gregynog May 2007 – p. 16/24

slide-47
SLIDE 47

The quadratic form

The right had side can be interpreted as a symmetric quadratic form on C∞

0 (R3) × C∞ 0 (R3).

With

q(F, G) := 1 2π

  • R3
  • R3δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ
  • ne has

|u(t, x)|6 dxdt = q(f ⊗ f ⊗ f, f ⊗ f ⊗ f)

Gregynog May 2007 – p. 16/24

slide-48
SLIDE 48

The quadratic form

The right had side can be interpreted as a symmetric quadratic form on C∞

0 (R3) × C∞ 0 (R3).

With

q(F, G) := 1 2π

  • R3
  • R3δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ
  • ne has

|u(t, x)|6 dxdt = q(f ⊗ f ⊗ f, f ⊗ f ⊗ f)

Thus any bound on q yields a bound on S6

1.

Gregynog May 2007 – p. 16/24

slide-49
SLIDE 49

The quadratic form

At least morally, any symmetric quadratic from is generated by a symmetric operator A:

q(F, G) = F, AGL2(Rd)

Gregynog May 2007 – p. 17/24

slide-50
SLIDE 50

The quadratic form

At least morally, any symmetric quadratic from is generated by a symmetric operator A:

q(F, G) = F, AGL2(Rd) q(F, G) = 1 2π

  • R3
  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ

Gregynog May 2007 – p. 17/24

slide-51
SLIDE 51

The quadratic form

At least morally, any symmetric quadratic from is generated by a symmetric operator A:

q(F, G) = F, AGL2(Rd) q(F, G) = 1 2π

  • R3
  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ

=

  • R3 F(η)

1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

Gregynog May 2007 – p. 17/24

slide-52
SLIDE 52

The quadratic form

At least morally, any symmetric quadratic from is generated by a symmetric operator A:

q(F, G) = F, AGL2(Rd) q(F, G) = 1 2π

  • R3
  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ

=

  • R3 F(η)

1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ
  • =AG(η)

Gregynog May 2007 – p. 17/24

slide-53
SLIDE 53

The quadratic form

At least morally, any symmetric quadratic from is generated by a symmetric operator A:

q(F, G) = F, AGL2(Rd) q(F, G) = 1 2π

  • R3
  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)F(η)G(ζ) dηdζ

=

  • R3 F(η)

1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ
  • =AG(η)

= F, AGL2(R3)

Gregynog May 2007 – p. 17/24

slide-54
SLIDE 54

The operator A

What is A, or can we at least compute A?

Gregynog May 2007 – p. 18/24

slide-55
SLIDE 55

The operator A

What is A, or can we at least compute A? Need this since q(F, F) = F, AF ≤ AF2

L2(R3) = Af6 L2(R) for

F = f ⊗ f ⊗ f.

Gregynog May 2007 – p. 18/24

slide-56
SLIDE 56

The operator A

What is A, or can we at least compute A? Need this since q(F, F) = F, AF ≤ AF2

L2(R3) = Af6 L2(R) for

F = f ⊗ f ⊗ f.

So S6

1 ≤ A.

Gregynog May 2007 – p. 18/24

slide-57
SLIDE 57

The operator A

What is A, or can we at least compute A? Need this since q(F, F) = F, AF ≤ AF2

L2(R3) = Af6 L2(R) for

F = f ⊗ f ⊗ f.

So S6

1 ≤ A.

Have

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

Gregynog May 2007 – p. 18/24

slide-58
SLIDE 58

The operator A

What is A, or can we at least compute A? Need this since q(F, F) = F, AF ≤ AF2

L2(R3) = Af6 L2(R) for

F = f ⊗ f ⊗ f.

So S6

1 ≤ A.

Have

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

Claim:

A = 1 2 √ 3P1

where P1 : L2(Rd) → L2(R2) is the orthogonal projection

  • perator mapping into functions F which are invariant under

rotations of R3 around the (1, 1, 1) direction.

Gregynog May 2007 – p. 18/24

slide-59
SLIDE 59

Fact 1:

A : L2(R3) → Range(P1)

Gregynog May 2007 – p. 19/24

slide-60
SLIDE 60

Fact 1:

A : L2(R3) → Range(P1)

Indeed,

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

Gregynog May 2007 – p. 19/24

slide-61
SLIDE 61

Fact 1:

A : L2(R3) → Range(P1)

Indeed,

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

= G((1, 1, 1)η, |η|2)

Gregynog May 2007 – p. 19/24

slide-62
SLIDE 62

Fact 1:

A : L2(R3) → Range(P1)

Indeed,

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

= G((1, 1, 1)η, |η|2)

is invariant under rotations of R3 which keep (1, 1, 1) fixed.

Gregynog May 2007 – p. 19/24

slide-63
SLIDE 63

Fact 1:

A : L2(R3) → Range(P1)

Indeed,

AG(η) = 1 2π

  • R3 δ((1, 1, 1)(η − ζ))δ(|η|2 − |ζ|2)G(ζ) dζ

= G((1, 1, 1)η, |η|2)

is invariant under rotations of R3 which keep (1, 1, 1) fixed. Fact 2:

2 √ 3A is the identity on Range(P1)

Gregynog May 2007 – p. 19/24

slide-64
SLIDE 64

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

Gregynog May 2007 – p. 20/24

slide-65
SLIDE 65

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

Gregynog May 2007 – p. 20/24

slide-66
SLIDE 66

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

= √ 3 π

  • R2
  • R
  • G(

√ 3ζ1, |ζ|2)δ(τ − √ 3ζ1)δ(ξ − |ζ|2) dζ1dζ2,3

Gregynog May 2007 – p. 20/24

slide-67
SLIDE 67

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

= √ 3 π

  • R2
  • R
  • G(

√ 3ζ1, |ζ|2)δ(τ − √ 3ζ1)δ(ξ − |ζ|2) dζ1dζ2,3 = 1 π

  • R2
  • G(τ, |ζ2,3|2 + τ2/3)δ(ξ − τ2/3 − |ζ2,3|2) dζ2,3

Gregynog May 2007 – p. 20/24

slide-68
SLIDE 68

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

= √ 3 π

  • R2
  • R
  • G(

√ 3ζ1, |ζ|2)δ(τ − √ 3ζ1)δ(ξ − |ζ|2) dζ1dζ2,3 = 1 π

  • R2
  • G(τ, |ζ2,3|2 + τ2/3)δ(ξ − τ2/3 − |ζ2,3|2) dζ2,3

= 2 ∞

  • G(τ, r2 + τ2/3)δ(ξ − τ2/3 − r|2) rdr

Gregynog May 2007 – p. 20/24

slide-69
SLIDE 69

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

= √ 3 π

  • R2
  • R
  • G(

√ 3ζ1, |ζ|2)δ(τ − √ 3ζ1)δ(ξ − |ζ|2) dζ1dζ2,3 = 1 π

  • R2
  • G(τ, |ζ2,3|2 + τ2/3)δ(ξ − τ2/3 − |ζ2,3|2) dζ2,3

= ∞

  • G(τ, r2 + τ2/3)δ(ξ − τ2/3 − r2) d(r2)

Gregynog May 2007 – p. 20/24

slide-70
SLIDE 70

Indeed, put τ = (1, 1, 1)η and ξ = |η|2 and apply 2

√ 3A to

  • G((1, 1, 1)ζ, |ζ|2).

2 √ 3A G(η) = √ 3 π

  • R3
  • G((1, 1, 1)·ζ, |ζ|2)δ(τ − (1, 1, 1)ζ)δ(ξ − |ζ|2) dζ

= √ 3 π

  • R2
  • R
  • G(

√ 3ζ1, |ζ|2)δ(τ − √ 3ζ1)δ(ξ − |ζ|2) dζ1dζ2,3 = 1 π

  • R2
  • G(τ, |ζ2,3|2 + τ2/3)δ(ξ − τ2/3 − |ζ2,3|2) dζ2,3

= ∞

  • G(τ, r2 + τ2/3)δ(ξ − τ2/3 − r2) d(r2)

= G(τ, ξ) = G((1, 1, 1)η, |η|2)

Gregynog May 2007 – p. 20/24

slide-71
SLIDE 71

Gaussians and rotations

Gregynog May 2007 – p. 21/24

slide-72
SLIDE 72

Gaussians and rotations

Toy problem: Assume that for f ∈ L2(R) the function

h =f ⊗ f : R2 → C (x, y) → h(x, y) := f(x)f(y)

is invariant under rotations of R2. Then f is a centered Gaussian.

Gregynog May 2007 – p. 21/24

slide-73
SLIDE 73

Step 1

Assume f is differentiable, never zero and h = f ⊗ f is invariant under rotations of R2. Then f is a centered Gaussian:

Gregynog May 2007 – p. 22/24

slide-74
SLIDE 74

Step 1

Assume f is differentiable, never zero and h = f ⊗ f is invariant under rotations of R2. Then f is a centered Gaussian: Let L = x ∂

∂y − y ∂ ∂x be the generator of rotations of R2.

Gregynog May 2007 – p. 22/24

slide-75
SLIDE 75

Step 1

Assume f is differentiable, never zero and h = f ⊗ f is invariant under rotations of R2. Then f is a centered Gaussian: Let L = x ∂

∂y − y ∂ ∂x be the generator of rotations of R2.

Must have

0 = Lh = xf(x)f′(y) − yf′(x)f(y)

Gregynog May 2007 – p. 22/24

slide-76
SLIDE 76

Step 1

Assume f is differentiable, never zero and h = f ⊗ f is invariant under rotations of R2. Then f is a centered Gaussian: Let L = x ∂

∂y − y ∂ ∂x be the generator of rotations of R2.

Must have

0 = Lh = xf(x)f′(y) − yf′(x)f(y)

  • r equivalently

f′(x) xf(x) = f′(y) yf(y)

for all x, y = 0.

Gregynog May 2007 – p. 22/24

slide-77
SLIDE 77

Step 1

Assume f is differentiable, never zero and h = f ⊗ f is invariant under rotations of R2. Then f is a centered Gaussian: Let L = x ∂

∂y − y ∂ ∂x be the generator of rotations of R2.

Must have

0 = Lh = xf(x)f′(y) − yf′(x)f(y)

  • r equivalently

f′(x) xf(x) = f′(y) yf(y)

for all x, y = 0. Thus (log(f))′ = cx and f is a centered Gauss.

Gregynog May 2007 – p. 22/24

slide-78
SLIDE 78

Step 2

Let Pt(z) =

1 2πte−(z)2/(2t) for z ∈ R2 and Qt(x) = 1 √ 2πte−x2/(2t)

for x ∈ R.

Gregynog May 2007 – p. 23/24

slide-79
SLIDE 79

Step 2

Let Pt(z) =

1 2πte−(z)2/(2t) for z ∈ R2 and Qt(x) = 1 √ 2πte−x2/(2t)

for x ∈ R. Assume that Qt ∗ f is never zero (for all small t) and that

h = f ⊗ f is invariant under rotations of R2. Then f is a

centered Gauss.

Gregynog May 2007 – p. 23/24

slide-80
SLIDE 80

Step 2

Let Pt(z) =

1 2πte−(z)2/(2t) for z ∈ R2 and Qt(x) = 1 √ 2πte−x2/(2t)

for x ∈ R. Assume that Qt ∗ f is never zero (for all small t) and that

h = f ⊗ f is invariant under rotations of R2. Then f is a

centered Gauss.

Pt ∗ h = Qt ∗ f ⊗ Qt ∗ f

is also invariant under rotations and Qt ∗ f is smooth and never vanishes, by assumption.

Gregynog May 2007 – p. 23/24

slide-81
SLIDE 81

Step 2

Let Pt(z) =

1 2πte−(z)2/(2t) for z ∈ R2 and Qt(x) = 1 √ 2πte−x2/(2t)

for x ∈ R. Assume that Qt ∗ f is never zero (for all small t) and that

h = f ⊗ f is invariant under rotations of R2. Then f is a

centered Gauss.

Pt ∗ h = Qt ∗ f ⊗ Qt ∗ f

is also invariant under rotations and Qt ∗ f is smooth and never vanishes, by assumption.

Step 1

= ⇒ Qt ∗ f is a centered Gauss

Gregynog May 2007 – p. 23/24

slide-82
SLIDE 82

Step 2

Let Pt(z) =

1 2πte−(z)2/(2t) for z ∈ R2 and Qt(x) = 1 √ 2πte−x2/(2t)

for x ∈ R. Assume that Qt ∗ f is never zero (for all small t) and that

h = f ⊗ f is invariant under rotations of R2. Then f is a

centered Gauss.

Pt ∗ h = Qt ∗ f ⊗ Qt ∗ f

is also invariant under rotations and Qt ∗ f is smooth and never vanishes, by assumption.

Step 1

= ⇒ Qt ∗ f is a centered Gauss = ⇒f = lim

t→ 0 Qt ∗ f is a centered Gauss

Gregynog May 2007 – p. 23/24

slide-83
SLIDE 83

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Gregynog May 2007 – p. 24/24

slide-84
SLIDE 84

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pt ∗ h = Qt ∗ f ⊗ Qt ∗ f

is invariant under rotations of R2.

Gregynog May 2007 – p. 24/24

slide-85
SLIDE 85

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

|Pt ∗ h| = |Qt ∗ f| ⊗ |Qt ∗ f|

is invariant under rotations of R2.

Gregynog May 2007 – p. 24/24

slide-86
SLIDE 86

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pε∗|Pt ∗ h| = Qε∗|Qt ∗ f| ⊗ Qε∗|Qt ∗ f|

is invariant under rotations of R2.

Gregynog May 2007 – p. 24/24

slide-87
SLIDE 87

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pε∗|Pt ∗ h| = Qε∗|Qt ∗ f| ⊗ Qε∗|Qt ∗ f|

is invariant under rotations of R2. Note that Qt ∗ f is not identically zero for all small enough t. Hence |Qt ∗ f| is non-negative and strictly positive somewhere.

Gregynog May 2007 – p. 24/24

slide-88
SLIDE 88

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pε∗|Pt ∗ h| = Qε∗|Qt ∗ f| ⊗ Qε∗|Qt ∗ f|

is invariant under rotations of R2. Note that Qt ∗ f is not identically zero for all small enough t. Hence |Qt ∗ f| is non-negative and strictly positive somewhere. Thus Qε∗|Qt ∗ f| > 0.

Gregynog May 2007 – p. 24/24

slide-89
SLIDE 89

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pε∗|Pt ∗ h| = Qε∗|Qt ∗ f| ⊗ Qε∗|Qt ∗ f|

is invariant under rotations of R2. Note that Qt ∗ f is not identically zero for all small enough t. Hence |Qt ∗ f| is non-negative and strictly positive somewhere. Thus Qε∗|Qt ∗ f| > 0.

Step 2

= ⇒ |Qt ∗ f| = lim

ε→0 Qε∗|Qt ∗ f| is a centered Gauss

Gregynog May 2007 – p. 24/24

slide-90
SLIDE 90

Step 3

If f ∈ L2(R) is not indentically zero and h = f ⊗ f is invariant under rotations of R2, then Qt ∗ f never vanishes.

Pε∗|Pt ∗ h| = Qε∗|Qt ∗ f| ⊗ Qε∗|Qt ∗ f|

is invariant under rotations of R2. Note that Qt ∗ f is not identically zero for all small enough t. Hence |Qt ∗ f| is non-negative and strictly positive somewhere. Thus Qε∗|Qt ∗ f| > 0.

Step 2

= ⇒ |Qt ∗ f| = lim

ε→0 Qε∗|Qt ∗ f| is a centered Gauss

In particular, Qt ∗ f never vanishes!

Gregynog May 2007 – p. 24/24