Complex Analytic Methods in Free vvb Probability Theory Hari - - PowerPoint PPT Presentation

complex analytic methods in free
SMART_READER_LITE
LIVE PREVIEW

Complex Analytic Methods in Free vvb Probability Theory Hari - - PowerPoint PPT Presentation

f ( z ) , , etc. H. Bercovici Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions Complex Analytic Methods in Free vvb Probability Theory Hari Bercovici BIRS, January 2008 Random variables f (


slide-1
SLIDE 1

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Complex Analytic Methods in Free Probability Theory

Hari Bercovici BIRS, January 2008

slide-2
SLIDE 2

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
slide-3
SLIDE 3

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
  • L0(τ) = {y−1x : x, y ∈ A, y = 0 a.s.} arbitrary random

variables

slide-4
SLIDE 4

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
  • L0(τ) = {y−1x : x, y ∈ A, y = 0 a.s.} arbitrary random

variables

  • This is still a *-algebra
slide-5
SLIDE 5

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
  • L0(τ) = {y−1x : x, y ∈ A, y = 0 a.s.} arbitrary random

variables

  • This is still a *-algebra
  • x ∈ L0(τ), x = x∗ =

−∞ t dex(t)

slide-6
SLIDE 6

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
  • L0(τ) = {y−1x : x, y ∈ A, y = 0 a.s.} arbitrary random

variables

  • This is still a *-algebra
  • x ∈ L0(τ), x = x∗ =

−∞ t dex(t)

  • µx(σ) = τ(ex(σ)) probability distribution of x
slide-7
SLIDE 7

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Random variables

  • (A, τ) a W*-probability space; A = L∞(τ)
  • L0(τ) = {y−1x : x, y ∈ A, y = 0 a.s.} arbitrary random

variables

  • This is still a *-algebra
  • x ∈ L0(τ), x = x∗ =

−∞ t dex(t)

  • µx(σ) = τ(ex(σ)) probability distribution of x
  • Ax w* closed algebra generated by

{ex((−∞, t)) : t ∈ R} (σ-algebra of x)

slide-8
SLIDE 8

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Freeness

  • (xi)i∈I ⊂ L0(τ), xi = x∗

i

slide-9
SLIDE 9

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Freeness

  • (xi)i∈I ⊂ L0(τ), xi = x∗

i

  • (xi)i∈I is free if (Axi)i∈I are free in (A, τ)
slide-10
SLIDE 10

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Freeness

  • (xi)i∈I ⊂ L0(τ), xi = x∗

i

  • (xi)i∈I is free if (Axi)i∈I are free in (A, τ)
  • When x not selfadjoint, x = h + ik, Ax generated by

Ah ∪ Ak

slide-11
SLIDE 11

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Freeness

  • (xi)i∈I ⊂ L0(τ), xi = x∗

i

  • (xi)i∈I is free if (Axi)i∈I are free in (A, τ)
  • When x not selfadjoint, x = h + ik, Ax generated by

Ah ∪ Ak

  • Corresponding notion: *-freeness
slide-12
SLIDE 12

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
slide-13
SLIDE 13

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
slide-14
SLIDE 14

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
slide-15
SLIDE 15

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
  • assume x ≥ 0
slide-16
SLIDE 16

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
  • assume x ≥ 0
  • µ√xy√x depends only on µx and µy
slide-17
SLIDE 17

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
  • assume x ≥ 0
  • µ√xy√x depends only on µx and µy
  • µ√xy√x = µx ⊠ µy free multiplicative convolution
slide-18
SLIDE 18

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
  • assume x ≥ 0
  • µ√xy√x depends only on µx and µy
  • µ√xy√x = µx ⊠ µy free multiplicative convolution
  • x, y free unitary, µxy = µyx = µx ⊠ µy
slide-19
SLIDE 19

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Convolutions

  • x = x∗, y = y∗ free variables
  • µx+y depends only on µx and µy
  • µx+y = µx ⊞ µy free additive convolution
  • assume x ≥ 0
  • µ√xy√x depends only on µx and µy
  • µ√xy√x = µx ⊠ µy free multiplicative convolution
  • x, y free unitary, µxy = µyx = µx ⊠ µy
  • same notation, different semigroup
slide-20
SLIDE 20

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Examples

  • δr ⊞ δs = δr+s; cr ⊞ cs = cr+s for Cauchy (arctangent)

dcr = r dt π(t2 + r 2)

slide-21
SLIDE 21

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Examples

  • δr ⊞ δs = δr+s; cr ⊞ cs = cr+s for Cauchy (arctangent)

dcr = r dt π(t2 + r 2)

  • γr ⊞ γs = γr+s for semicircle of variance r

dγr = 1 2πr

  • 4r − t2 dt
slide-22
SLIDE 22

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Examples

  • δr ⊞ δs = δr+s; cr ⊞ cs = cr+s for Cauchy (arctangent)

dcr = r dt π(t2 + r 2)

  • γr ⊞ γs = γr+s for semicircle of variance r

dγr = 1 2πr

  • 4r − t2 dt
  • µ = ν = (δ1 + δ−1)/2
slide-23
SLIDE 23

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Examples

  • δr ⊞ δs = δr+s; cr ⊞ cs = cr+s for Cauchy (arctangent)

dcr = r dt π(t2 + r 2)

  • γr ⊞ γs = γr+s for semicircle of variance r

dγr = 1 2πr

  • 4r − t2 dt
  • µ = ν = (δ1 + δ−1)/2
  • µ ⊞ ν =

dt π √ 4 − t2

slide-24
SLIDE 24

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
slide-25
SLIDE 25

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
slide-26
SLIDE 26

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

slide-27
SLIDE 27

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

  • Fµ(z) = 1/Gµ(z); Fµ : C+ → C+
slide-28
SLIDE 28

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

  • Fµ(z) = 1/Gµ(z); Fµ : C+ → C+
  • Function inverse F <−1>

µ

defined in Dr,ε = {z : |z − ir| < (1 − ε)r} for large r

slide-29
SLIDE 29

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

  • Fµ(z) = 1/Gµ(z); Fµ : C+ → C+
  • Function inverse F <−1>

µ

defined in Dr,ε = {z : |z − ir| < (1 − ε)r} for large r

  • ϕµ(z) = Rµ(1/z) = F <−1>

µ

(z) − z V-transform of µ

slide-30
SLIDE 30

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

  • Fµ(z) = 1/Gµ(z); Fµ : C+ → C+
  • Function inverse F <−1>

µ

defined in Dr,ε = {z : |z − ir| < (1 − ε)r} for large r

  • ϕµ(z) = Rµ(1/z) = F <−1>

µ

(z) − z V-transform of µ

  • ϕµ⊞ν = ϕµ + ϕν
slide-31
SLIDE 31

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Cauchy transforms

  • µ probability distribution on R
  • z ∈ C+ upper half-plane
  • Gµ(z) =

−∞

dµ(t) z − t

  • Fµ(z) = 1/Gµ(z); Fµ : C+ → C+
  • Function inverse F <−1>

µ

defined in Dr,ε = {z : |z − ir| < (1 − ε)r} for large r

  • ϕµ(z) = Rµ(1/z) = F <−1>

µ

(z) − z V-transform of µ

  • ϕµ⊞ν = ϕµ + ϕν
  • There are corresponding results for ⊠
slide-32
SLIDE 32

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

A basic tool

  • ϕµ(z) = F <−1>

µ

(z) − z

slide-33
SLIDE 33

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

A basic tool

  • ϕµ(z) = F <−1>

µ

(z) − z

  • ϕµ(z) ≈ z − Fµ(z) in Dr,ε as r → ∞
slide-34
SLIDE 34

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

A basic tool

  • ϕµ(z) = F <−1>

µ

(z) − z

  • ϕµ(z) ≈ z − Fµ(z) in Dr,ε as r → ∞
  • The approximation is uniformly better when µ is

concentrated near zero.

slide-35
SLIDE 35

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

A basic tool

  • ϕµ(z) = F <−1>

µ

(z) − z

  • ϕµ(z) ≈ z − Fµ(z) in Dr,ε as r → ∞
  • The approximation is uniformly better when µ is

concentrated near zero.

  • meaning: ratio closer to one
slide-36
SLIDE 36

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

A basic tool

  • ϕµ(z) = F <−1>

µ

(z) − z

  • ϕµ(z) ≈ z − Fµ(z) in Dr,ε as r → ∞
  • The approximation is uniformly better when µ is

concentrated near zero.

  • meaning: ratio closer to one
  • larger r
  • smaller ε
slide-37
SLIDE 37

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

slide-38
SLIDE 38

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

  • {µn}n≥1, νn = µ1 ⊞ µ2 ⊞ · · · ⊞ µn, ρn = µ1 ∗ µ2 ∗ · · · ∗ µn
slide-39
SLIDE 39

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

  • {µn}n≥1, νn = µ1 ⊞ µ2 ⊞ · · · ⊞ µn, ρn = µ1 ∗ µ2 ∗ · · · ∗ µn
  • νn → ν ⇔ ρn → ρ (three series theorem)
slide-40
SLIDE 40

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

  • {µn}n≥1, νn = µ1 ⊞ µ2 ⊞ · · · ⊞ µn, ρn = µ1 ∗ µ2 ∗ · · · ∗ µn
  • νn → ν ⇔ ρn → ρ (three series theorem)
  • n-divisibility: µ = ν ⊞ ν ⊞ · · · ⊞ ν
  • n times
slide-41
SLIDE 41

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

  • {µn}n≥1, νn = µ1 ⊞ µ2 ⊞ · · · ⊞ µn, ρn = µ1 ∗ µ2 ∗ · · · ∗ µn
  • νn → ν ⇔ ρn → ρ (three series theorem)
  • n-divisibility: µ = ν ⊞ ν ⊞ · · · ⊞ ν
  • n times
  • infinite-divisibility: all n
slide-42
SLIDE 42

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Some results

  • µn → µ equivalent to ϕµn → ϕµ in Dr,ε, ε fixed, r large,

with some uniformity at ∞

  • {µn}n≥1, νn = µ1 ⊞ µ2 ⊞ · · · ⊞ µn, ρn = µ1 ∗ µ2 ∗ · · · ∗ µn
  • νn → ν ⇔ ρn → ρ (three series theorem)
  • n-divisibility: µ = ν ⊞ ν ⊞ · · · ⊞ ν
  • n times
  • infinite-divisibility: all n
  • µ is ∞-divisible ⇔ϕµ : C+ → C−
slide-43
SLIDE 43

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
slide-44
SLIDE 44

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

slide-45
SLIDE 45

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
slide-46
SLIDE 46

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
  • If µn → µ then µ is ∞-divisible
slide-47
SLIDE 47

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
  • If µn → µ then µ is ∞-divisible
  • µn → µ ⇔ νn → ν, where ν is uniquely determined by

µ. (Ex.: µ semicircle corresponds with ν normal; CLT)

slide-48
SLIDE 48

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
  • If µn → µ then µ is ∞-divisible
  • µn → µ ⇔ νn → ν, where ν is uniquely determined by

µ. (Ex.: µ semicircle corresponds with ν normal; CLT)

  • almost analogous results for ⊠
slide-49
SLIDE 49

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
  • If µn → µ then µ is ∞-divisible
  • µn → µ ⇔ νn → ν, where ν is uniquely determined by

µ. (Ex.: µ semicircle corresponds with ν normal; CLT)

  • almost analogous results for ⊠
  • differences: the correspondence µ ↔ ν not bijective
slide-50
SLIDE 50

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Limit laws

  • {µnj : n ≥ 1, 1 ≤ j ≤ kn} distributions on R
  • Infinitesimal if for all ε > 0

lim

n→∞ min 1≤j≤kn µnj((−ε, ε)) = 1

  • µn = µn1 ⊞ µn2 ⊞ · · · ⊞ µnkn, νn = µn1 ∗ µn2 ∗ · · · ∗ µnkn
  • If µn → µ then µ is ∞-divisible
  • µn → µ ⇔ νn → ν, where ν is uniquely determined by

µ. (Ex.: µ semicircle corresponds with ν normal; CLT)

  • almost analogous results for ⊠
  • differences: the correspondence µ ↔ ν not bijective
  • for the circle, there are no ⊠-idempotents
slide-51
SLIDE 51

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Another basic tool

  • f, g : C+ → C analytic
slide-52
SLIDE 52

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Another basic tool

  • f, g : C+ → C analytic
  • f ≺ g if f(z) = g(h(z)) for some h : C+ → C+ analytic

(Littlewood subordination)

slide-53
SLIDE 53

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Another basic tool

  • f, g : C+ → C analytic
  • f ≺ g if f(z) = g(h(z)) for some h : C+ → C+ analytic

(Littlewood subordination)

  • µ, ν distributions on R
slide-54
SLIDE 54

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Another basic tool

  • f, g : C+ → C analytic
  • f ≺ g if f(z) = g(h(z)) for some h : C+ → C+ analytic

(Littlewood subordination)

  • µ, ν distributions on R
  • Then Fµ⊞ν ≺ Fµ (and Fµ⊞ν ≺ Fν)
slide-55
SLIDE 55

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Another basic tool

  • f, g : C+ → C analytic
  • f ≺ g if f(z) = g(h(z)) for some h : C+ → C+ analytic

(Littlewood subordination)

  • µ, ν distributions on R
  • Then Fµ⊞ν ≺ Fµ (and Fµ⊞ν ≺ Fν)
  • Note: subordination functions F <−1>

µ

  • Fµ⊞ν obviously

exist at ∞; the important point is they continue to C+.

slide-56
SLIDE 56

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Regularity consequences

  • If dµ/dt ∈ Lp, same is true for µ ⊞ ν
slide-57
SLIDE 57

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Regularity consequences

  • If dµ/dt ∈ Lp, same is true for µ ⊞ ν
  • µ ⊞ ν has only finitely many atoms, with total mass < 1
slide-58
SLIDE 58

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Regularity consequences

  • If dµ/dt ∈ Lp, same is true for µ ⊞ ν
  • µ ⊞ ν has only finitely many atoms, with total mass < 1
  • µ ⊞ ν has no singular continuous component
slide-59
SLIDE 59

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Regularity consequences

  • If dµ/dt ∈ Lp, same is true for µ ⊞ ν
  • µ ⊞ ν has only finitely many atoms, with total mass < 1
  • µ ⊞ ν has no singular continuous component
  • the density of µ ⊞ ν is locally analytic a.e.
slide-60
SLIDE 60

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Regularity consequences

  • If dµ/dt ∈ Lp, same is true for µ ⊞ ν
  • µ ⊞ ν has only finitely many atoms, with total mass < 1
  • µ ⊞ ν has no singular continuous component
  • the density of µ ⊞ ν is locally analytic a.e.
  • But: the density of µ ⊞ ν may have points of

nondifferentiability even when those of µ and ν don’t

slide-61
SLIDE 61

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
slide-62
SLIDE 62

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
  • ν symmetric to µ (µ = µx, ν = µ−x)
slide-63
SLIDE 63

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
  • ν symmetric to µ (µ = µx, ν = µ−x)
  • ρ = µ ∗ ν, λ = µ ⊞ ν; ρ and λ are symmetric
slide-64
SLIDE 64

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
  • ν symmetric to µ (µ = µx, ν = µ−x)
  • ρ = µ ∗ ν, λ = µ ⊞ ν; ρ and λ are symmetric
  • tails of ρ: 1 − ρ((−t, t)), t → ∞
slide-65
SLIDE 65

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
  • ν symmetric to µ (µ = µx, ν = µ−x)
  • ρ = µ ∗ ν, λ = µ ⊞ ν; ρ and λ are symmetric
  • tails of ρ: 1 − ρ((−t, t)), t → ∞
  • are comparable to those of µ
slide-66
SLIDE 66

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Ignorance

  • µ distribution of R
  • ν symmetric to µ (µ = µx, ν = µ−x)
  • ρ = µ ∗ ν, λ = µ ⊞ ν; ρ and λ are symmetric
  • tails of ρ: 1 − ρ((−t, t)), t → ∞
  • are comparable to those of µ
  • what about λ?
slide-67
SLIDE 67

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
slide-68
SLIDE 68

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
slide-69
SLIDE 69

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
slide-70
SLIDE 70

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
  • Freeness can be defined relative to such τ
slide-71
SLIDE 71

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
  • Freeness can be defined relative to such τ
  • x ∈ A has a combinatorial analogue of a distribution

τ(ab1ab2a · · · bn−1a)

slide-72
SLIDE 72

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
  • Freeness can be defined relative to such τ
  • x ∈ A has a combinatorial analogue of a distribution

τ(ab1ab2a · · · bn−1a)

  • This is a “Fourier coefficient” of order n
slide-73
SLIDE 73

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
  • Freeness can be defined relative to such τ
  • x ∈ A has a combinatorial analogue of a distribution

τ(ab1ab2a · · · bn−1a)

  • This is a “Fourier coefficient” of order n
  • µx+y = µx ⊞ µy where ⊞ is defined combinatorially
slide-74
SLIDE 74

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Operator-valued

  • A algebra, B ⊂ A unital subalgebra
  • τ : A → B conditional expectation
  • projection so τ(bab′) = bτ(a)b′ for b, b′ ∈ B
  • Freeness can be defined relative to such τ
  • x ∈ A has a combinatorial analogue of a distribution

τ(ab1ab2a · · · bn−1a)

  • This is a “Fourier coefficient” of order n
  • µx+y = µx ⊞ µy where ⊞ is defined combinatorially
  • Subordination survives
slide-75
SLIDE 75

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Analytic despair

  • Gx(z) = τ((z − x)−1)
slide-76
SLIDE 76

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Analytic despair

  • Gx(z) = τ((z − x)−1)
  • To be viewed as a function of z ∈ B. (If x = x∗, z can

be anything with positive invertible imaginary part; Siegel half-plane.)

slide-77
SLIDE 77

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Analytic despair

  • Gx(z) = τ((z − x)−1)
  • To be viewed as a function of z ∈ B. (If x = x∗, z can

be anything with positive invertible imaginary part; Siegel half-plane.)

  • Function theory not sufficiently well developed to

undertake the analysis available when B = C.

slide-78
SLIDE 78

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Analytic despair

  • Gx(z) = τ((z − x)−1)
  • To be viewed as a function of z ∈ B. (If x = x∗, z can

be anything with positive invertible imaginary part; Siegel half-plane.)

  • Function theory not sufficiently well developed to

undertake the analysis available when B = C.

  • Fully matricial analytic functions may be needed for full

understanding.

slide-79
SLIDE 79

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

slide-80
SLIDE 80

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

slide-81
SLIDE 81

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
slide-82
SLIDE 82

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
  • Xn, Yn independent (classically) with asymptotic

distributions µ, ν

slide-83
SLIDE 83

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
  • Xn, Yn independent (classically) with asymptotic

distributions µ, ν

  • Then (spoonful of salt here): Xn + Yn has asymptotic

distribution µ ⊞ ν.

slide-84
SLIDE 84

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
  • Xn, Yn independent (classically) with asymptotic

distributions µ, ν

  • Then (spoonful of salt here): Xn + Yn has asymptotic

distribution µ ⊞ ν.

  • Assume now Xn, Yn are n × λn matrices, and

|Xn| = (X ∗

n Xn)1/2, |Yn| have asymptotic distributions µ, ν

slide-85
SLIDE 85

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
  • Xn, Yn independent (classically) with asymptotic

distributions µ, ν

  • Then (spoonful of salt here): Xn + Yn has asymptotic

distribution µ ⊞ ν.

  • Assume now Xn, Yn are n × λn matrices, and

|Xn| = (X ∗

n Xn)1/2, |Yn| have asymptotic distributions µ, ν

  • Then: |Xn + Yn| has asymptotic distribution µ ⊞λ ν
slide-86
SLIDE 86

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

⊞λ

  • Xn(ω) an n × n random matrix, Xn = X ∗

n

  • With E expected value, τn = Tr/n, Xn has distribution

given by GµXn(z) = Eτn((zI − Xn)−1) z ∈ C+

  • Asymptotic (eigenvalue) distribution of Xn: limn µXn
  • Xn, Yn independent (classically) with asymptotic

distributions µ, ν

  • Then (spoonful of salt here): Xn + Yn has asymptotic

distribution µ ⊞ ν.

  • Assume now Xn, Yn are n × λn matrices, and

|Xn| = (X ∗

n Xn)1/2, |Yn| have asymptotic distributions µ, ν

  • Then: |Xn + Yn| has asymptotic distribution µ ⊞λ ν
  • many results extend to this operation, questions remain
slide-87
SLIDE 87

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

slide-88
SLIDE 88

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

slide-89
SLIDE 89

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

  • µb+c = µb ⊎ µc for b ∈ B, c ∈ C
slide-90
SLIDE 90

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

  • µb+c = µb ⊎ µc for b ∈ B, c ∈ C
  • analytic calculation:

Fµ⊎ν(z) − z = [Fµ(z) − z] + [Fν(z) − z]

slide-91
SLIDE 91

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

  • µb+c = µb ⊎ µc for b ∈ B, c ∈ C
  • analytic calculation:

Fµ⊎ν(z) − z = [Fµ(z) − z] + [Fν(z) − z]

  • much of the limit theory is preserved, but
slide-92
SLIDE 92

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

  • µb+c = µb ⊎ µc for b ∈ B, c ∈ C
  • analytic calculation:

Fµ⊎ν(z) − z = [Fµ(z) − z] + [Fν(z) − z]

  • much of the limit theory is preserved, but
  • generally δs ⊎ δt = δs+t
slide-93
SLIDE 93

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Boolean

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are Boolean independent if for bj ∈ B, cj ∈ C,

τ(·b1c1b2c2 · · · bncn·) = ·τ(b1)τ(c1) · · · τ(bn)τ(cn)·

  • µb+c = µb ⊎ µc for b ∈ B, c ∈ C
  • analytic calculation:

Fµ⊎ν(z) − z = [Fµ(z) − z] + [Fν(z) − z]

  • much of the limit theory is preserved, but
  • generally δs ⊎ δt = δs+t
  • There is a multiplicative analogue
slide-94
SLIDE 94

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

slide-95
SLIDE 95

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

slide-96
SLIDE 96

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
slide-97
SLIDE 97

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
  • analytic calculation: Fµ⊲ν = Fµ ◦ Fν
slide-98
SLIDE 98

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
  • analytic calculation: Fµ⊲ν = Fµ ◦ Fν
  • some of the limit theory is preserved
slide-99
SLIDE 99

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
  • analytic calculation: Fµ⊲ν = Fµ ◦ Fν
  • some of the limit theory is preserved
  • δs ⊲ δt = δs+t
slide-100
SLIDE 100

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
  • analytic calculation: Fµ⊲ν = Fµ ◦ Fν
  • some of the limit theory is preserved
  • δs ⊲ δt = δs+t
  • there is a multiplicative version of the convolution
slide-101
SLIDE 101

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Monotonic

  • (A, τ) probability space, B, C ⊂ A subalgebras not

containing the unit.

  • B and C are monotone independent if for bj ∈ B, cj ∈ C,

τ(b1c1) = τ(c1b1) = τ(b1)τ(c1), τ(c1b1c2) = τ(c1)τ(b1)τ(c2), and b1c1b2 = τ(c1)b1b2,

  • µb+c = µb ⊲ µc b ∈ B, c ∈ C
  • analytic calculation: Fµ⊲ν = Fµ ◦ Fν
  • some of the limit theory is preserved
  • δs ⊲ δt = δs+t
  • there is a multiplicative version of the convolution
  • there is an operator-valued version as well
slide-102
SLIDE 102

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Omitted

  • c-freeness
slide-103
SLIDE 103

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Omitted

  • c-freeness
  • rates of convergence
slide-104
SLIDE 104

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Omitted

  • c-freeness
  • rates of convergence
  • convolution powers
slide-105
SLIDE 105

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Omitted

  • c-freeness
  • rates of convergence
  • convolution powers
  • much more
slide-106
SLIDE 106

f(z), µ ⊞ ν, etc.

  • H. Bercovici

Free convolutions Analytic apparatus Limit theorems Regularity Extensions Omissions vvb

Omitted

  • c-freeness
  • rates of convergence
  • convolution powers
  • much more
  • credits
slide-107
SLIDE 107