On subsets of deciding the norm convergence of sequences in 1 - - PowerPoint PPT Presentation

on subsets of deciding the norm convergence
SMART_READER_LITE
LIVE PREVIEW

On subsets of deciding the norm convergence of sequences in 1 - - PowerPoint PPT Presentation

On subsets of deciding the norm convergence of sequences in 1 Damian Sobota Institute of Mathematics, Polish Academy of Sciences SE | = OP 2016, Fru ska Gora 2016 Little -spaces x R : x 1 = n | x ( n


slide-1
SLIDE 1

On subsets of ℓ∞ deciding the norm convergence

  • f sequences in ℓ1

Damian Sobota

Institute of Mathematics, Polish Academy of Sciences

SE| =OP 2016, Fruˇ ska Gora 2016

slide-2
SLIDE 2

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
slide-3
SLIDE 3

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R

slide-4
SLIDE 4

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R So, ℓ∞ ∼ = ℓ∗

1 (the space of continuous linear functionals on ℓ1)

slide-5
SLIDE 5

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R So, ℓ∞ ∼ = ℓ∗

1 (the space of continuous linear functionals on ℓ1)

So, x1 = sup

  • x, y
  • : y ∈ Sℓ∞
slide-6
SLIDE 6

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R So, ℓ∞ ∼ = ℓ∗

1 (the space of continuous linear functionals on ℓ1)

So, x1 = sup

  • x, y
  • : y ∈ Sℓ∞
  • So, for (xn)n∈ω ⊆ ℓ1 we have
  • xn
  • 1 → 0 (the norm convergence)
slide-7
SLIDE 7

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R So, ℓ∞ ∼ = ℓ∗

1 (the space of continuous linear functionals on ℓ1)

So, x1 = sup

  • x, y
  • : y ∈ Sℓ∞
  • So, for (xn)n∈ω ⊆ ℓ1 we have
  • xn
  • 1 → 0 (the norm convergence)
  • nly if xn, y → 0 for every y ∈ Sℓ∞ (the weak convergence)
slide-8
SLIDE 8

Little ℓ-spaces

ℓ1 =

  • x ∈ Rω : x1 =

n |x(n)| < ∞

  • ℓ∞ =
  • y ∈ Rω : y∞ = supn |y(n)| < ∞
  • Sℓ∞ =
  • y ∈ ℓ∞ : y∞ = 1
  • The action of ℓ∞ on ℓ1

x ∈ ℓ1, y ∈ ℓ∞ − → x, y =

n x(n) · y(n)

∈ R So, ℓ∞ ∼ = ℓ∗

1 (the space of continuous linear functionals on ℓ1)

So, x1 = sup

  • x, y
  • : y ∈ Sℓ∞
  • So, for (xn)n∈ω ⊆ ℓ1 we have
  • xn
  • 1 → 0 (the norm convergence)
  • nly if xn, y → 0 for every y ∈ Sℓ∞ (the weak convergence)

What about if? Does the weak convergence imply the norm one?

slide-9
SLIDE 9

Schur’s theorem

Theorem (Schur, 1921) Every weakly convergent sequence in ℓ1 is norm convergent.

slide-10
SLIDE 10

Schur’s theorem

Theorem (Schur, 1921) Every weakly convergent sequence in ℓ1 is norm convergent. c0 =

  • x ∈ ℓ∞ :

limn x(n) = 0

  • with the sup norm

c∗

0 ∼

= ℓ1

slide-11
SLIDE 11

Schur’s theorem

Theorem (Schur, 1921) Every weakly convergent sequence in ℓ1 is norm convergent. c0 =

  • x ∈ ℓ∞ :

limn x(n) = 0

  • with the sup norm

c∗

0 ∼

= ℓ1 Let en =

0, . . . , 0, 1, 0, . . . ∈ c0

Then, (en)n∈ω doesn’t converge in norm But for every f ∈ ℓ1, en, f = f (n) → 0 So, (en)n∈ω converges weakly

slide-12
SLIDE 12

Measures on ω

A signed bounded finitely additive function µ: ℘(ω) → R is a measure on ω ba denotes the Banach space of all measures on ω with the variation norm

slide-13
SLIDE 13

Measures on ω

A signed bounded finitely additive function µ: ℘(ω) → R is a measure on ω ba denotes the Banach space of all measures on ω with the variation norm ℓ1 ֒ → ℓ∗∗

1 ∼

= ℓ∗

slide-14
SLIDE 14

Measures on ω

A signed bounded finitely additive function µ: ℘(ω) → R is a measure on ω ba denotes the Banach space of all measures on ω with the variation norm ℓ1 ֒ → ℓ∗∗

1 ∼

= ℓ∗

∞∼

= ba (by Riesz’s representation theorem)

slide-15
SLIDE 15

Measures on ω

A signed bounded finitely additive function µ: ℘(ω) → R is a measure on ω ba denotes the Banach space of all measures on ω with the variation norm ℓ1 ֒ → ℓ∗∗

1 ∼

= ℓ∗

∞∼

= ba (by Riesz’s representation theorem) ℓ1 ∋ x → µx ∈ ba by the formula: µx(A) = x, χA =

n∈A x(n)

for every A ∈ ℘(ω) Note that χA ∈ Sℓ∞!

slide-16
SLIDE 16

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then:

slide-17
SLIDE 17

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.
slide-18
SLIDE 18

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Let (xn)n∈ω ⊆ ℓ1 be weakly convergent

slide-19
SLIDE 19

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Let (xn)n∈ω ⊆ ℓ1 be weakly convergent Then, xn, χA → 0 for every A ∈ ℘(ω)

slide-20
SLIDE 20

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Let (xn)n∈ω ⊆ ℓ1 be weakly convergent Then, xn, χA → 0 for every A ∈ ℘(ω) Hence, µxn(A) → 0 for every A ∈ ℘(ω)

slide-21
SLIDE 21

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Let (xn)n∈ω ⊆ ℓ1 be weakly convergent Then, xn, χA → 0 for every A ∈ ℘(ω) Hence, µxn(A) → 0 for every A ∈ ℘(ω) So by Phillips: limn

  • j∈ω
  • µxn

{j}

  • = 0
slide-22
SLIDE 22

Phillips’s lemma

Theorem (Phillips, 1948) Let (µn)n∈ω ⊆ ba. If µn(A) → 0 for every A ∈ ℘(ω), then: lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Let (xn)n∈ω ⊆ ℓ1 be weakly convergent Then, xn, χA → 0 for every A ∈ ℘(ω) Hence, µxn(A) → 0 for every A ∈ ℘(ω) So by Phillips: limn

  • j∈ω
  • µxn

{j}

  • = 0

But this means exactly that: limn

  • xn
  • 1 = 0!
slide-23
SLIDE 23

Phillips and Schur families

Definition A family F ⊆ ℘(ω) is Phillips if for every sequence (µn)n∈ω ⊆ ba such that µn(A) → 0 for every A ∈ F, we have lim

n

  • j∈ω
  • µn

{j}

  • = 0.
slide-24
SLIDE 24

Phillips and Schur families

Definition A family F ⊆ ℘(ω) is Phillips if for every sequence (µn)n∈ω ⊆ ba such that µn(A) → 0 for every A ∈ F, we have lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Definition A family F ⊆ ℘(ω) is Schur if for every sequence (xn)n∈ω ⊆ ℓ1 such that xn, χA → 0 for every A ∈ F, we have lim

n

  • xn
  • 1 = 0.
slide-25
SLIDE 25

Phillips and Schur families

Definition A family F ⊆ ℘(ω) is Phillips if for every sequence (µn)n∈ω ⊆ ba such that µn(A) → 0 for every A ∈ F, we have lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Definition A family F ⊆ ℘(ω) is Schur if for every sequence (xn)n∈ω ⊆ ℓ1 such that xn, χA → 0 for every A ∈ F, we have lim

n

  • xn
  • 1 = 0.

Every Phillips family is Schur

slide-26
SLIDE 26

Phillips and Schur families

Definition A family F ⊆ ℘(ω) is Phillips if for every sequence (µn)n∈ω ⊆ ba such that µn(A) → 0 for every A ∈ F, we have lim

n

  • j∈ω
  • µn

{j}

  • = 0.

Definition A family F ⊆ ℘(ω) is Schur if for every sequence (xn)n∈ω ⊆ ℓ1 such that xn, χA → 0 for every A ∈ F, we have lim

n

  • xn
  • 1 = 0.

Every Phillips family is Schur ℘(ω) is Phillips

slide-27
SLIDE 27

Quest for small Phillips families

Question Is it consistent that there exists a Phillips family of cardinality strictly smaller than c?

slide-28
SLIDE 28

Martin’s axiom and Schur families

Theorem Assume MAκ(σ-centered) for some cardinal number κ. Let F ⊆ ℘(ω) be such that |F| κ.

slide-29
SLIDE 29

Martin’s axiom and Schur families

Theorem Assume MAκ(σ-centered) for some cardinal number κ. Let F ⊆ ℘(ω) be such that |F| κ. Then, there exists (xn)n∈ω ⊆ ℓ1 such that supn

  • xn
  • 1 = ∞ and limnxn, χA = 0 for every A ∈ F.

In particular, F is not Schur (and hence not Phillips).

slide-30
SLIDE 30

Martin’s axiom and Schur families

Definition A family F ⊆ [ω]ω has the strong finite intersection property (the SFIP) if G is infinite for every finite G ⊆ F. A set A ∈ [ω]ω is a pseudo-intersecton of F if A \ B is finite for every B ∈ F. p = min

|F|: F ⊆ [ω]ω has SFIP but no pseudo-intersection

slide-31
SLIDE 31

Martin’s axiom and Schur families

Definition A family F ⊆ [ω]ω has the strong finite intersection property (the SFIP) if G is infinite for every finite G ⊆ F. A set A ∈ [ω]ω is a pseudo-intersecton of F if A \ B is finite for every B ∈ F. p = min

|F|: F ⊆ [ω]ω has SFIP but no pseudo-intersection

  • Theorem (Bell 1981)

p > κ if and only if MAκ(σ-centered) holds.

slide-32
SLIDE 32

Martin’s axiom and Schur families

Definition A family F ⊆ [ω]ω has the strong finite intersection property (the SFIP) if G is infinite for every finite G ⊆ F. A set A ∈ [ω]ω is a pseudo-intersecton of F if A \ B is finite for every B ∈ F. p = min

|F|: F ⊆ [ω]ω has SFIP but no pseudo-intersection

  • Theorem (Bell 1981)

p > κ if and only if MAκ(σ-centered) holds. Theorem

1 Every Schur family is of cardinality at least p.

slide-33
SLIDE 33

Martin’s axiom and Schur families

Definition A family F ⊆ [ω]ω has the strong finite intersection property (the SFIP) if G is infinite for every finite G ⊆ F. A set A ∈ [ω]ω is a pseudo-intersecton of F if A \ B is finite for every B ∈ F. p = min

|F|: F ⊆ [ω]ω has SFIP but no pseudo-intersection

  • Theorem (Bell 1981)

p > κ if and only if MAκ(σ-centered) holds. Theorem

1 Every Schur family is of cardinality at least p. 2 Under Martin’s axiom, every Schur family is of cardinality c.

slide-34
SLIDE 34

cof(N) and Phillips families

Definition N denotes the Lebesgue null ideal cof(N) = min

|F|: F ⊆ N & ∀A ∈ N∃B ∈ F : A ⊆ B

slide-35
SLIDE 35

cof(N) and Phillips families

Definition N denotes the Lebesgue null ideal cof(N) = min

|F|: F ⊆ N & ∀A ∈ N∃B ∈ F : A ⊆ B

  • Theorem

There exists a Phillips family of cardinality cof(N).

slide-36
SLIDE 36

cof(N) and Phillips families

Definition N denotes the Lebesgue null ideal cof(N) = min

|F|: F ⊆ N & ∀A ∈ N∃B ∈ F : A ⊆ B

  • Theorem

There exists a Phillips family of cardinality cof(N). Bartoszyński–Judah characterization of cof(N), 1995 Let C denote the family of all subsets of ωω of the form

n Tn

such that Tn ∈ [ω]n+1 for all n ∈ ω. Then, cof(N) = min

|F|: F ⊆ C &

  • F = ωω.
slide-37
SLIDE 37

Undecidability

Theorem The existence of a Phillips (or Schur) family of cardinality strictly less than c is independent of ZFC+¬CH.

slide-38
SLIDE 38

Weak* Banach–Steinhaus sets in ℓ∞

Definition Let D ⊆ Sℓ∞. A sequence (xn)n∈ω is: pointwise bounded on D if supn

  • xn, y
  • < ∞ for every

y ∈ D

slide-39
SLIDE 39

Weak* Banach–Steinhaus sets in ℓ∞

Definition Let D ⊆ Sℓ∞. A sequence (xn)n∈ω is: pointwise bounded on D if supn

  • xn, y
  • < ∞ for every

y ∈ D uniformly bounded if supn

  • xn
  • 1 < ∞.
slide-40
SLIDE 40

Weak* Banach–Steinhaus sets in ℓ∞

Definition Let D ⊆ Sℓ∞. A sequence (xn)n∈ω is: pointwise bounded on D if supn

  • xn, y
  • < ∞ for every

y ∈ D uniformly bounded if supn

  • xn
  • 1 < ∞.

Definition A set D ⊆ Sℓ∞ is weak* Banach–Steinhaus if every pointwise bounded on D sequence (xn)n∈ω ⊆ ℓ1 is uniformly bounded.

slide-41
SLIDE 41

Weak* Banach–Steinhaus sets in ℓ∞

Definition Let D ⊆ Sℓ∞. A sequence (xn)n∈ω is: pointwise bounded on D if supn

  • xn, y
  • < ∞ for every

y ∈ D uniformly bounded if supn

  • xn
  • 1 < ∞.

Definition A set D ⊆ Sℓ∞ is weak* Banach–Steinhaus if every pointwise bounded on D sequence (xn)n∈ω ⊆ ℓ1 is uniformly bounded. Sℓ∞ is weak* Banach–Steinhaus

slide-42
SLIDE 42

Weak* Banach–Steinhaus sets in ℓ∞

Definition Let D ⊆ Sℓ∞. A sequence (xn)n∈ω is: pointwise bounded on D if supn

  • xn, y
  • < ∞ for every

y ∈ D uniformly bounded if supn

  • xn
  • 1 < ∞.

Definition A set D ⊆ Sℓ∞ is weak* Banach–Steinhaus if every pointwise bounded on D sequence (xn)n∈ω ⊆ ℓ1 is uniformly bounded. Sℓ∞ is weak* Banach–Steinhaus Weak* Banach–Steinhaus sets are uncountable and linearly weak* dense in ℓ∞

slide-43
SLIDE 43

Martin’s axiom and weak* Banach–Steinhaus sets in ℓ∞

Theorem Assume MAκ(σ-centered) for some cardinal number κ. Let D ⊆ Sℓ∞ be such that |D| κ. Then, there exists (xn)n∈ω ⊆ ℓ1 such that supn

  • xn
  • 1 = ∞ and limnxn, y = 0 for every y ∈ D.

In particular, D is not weak* Banach–Steinhaus in ℓ∞.

slide-44
SLIDE 44

Martin’s axiom and weak* Banach–Steinhaus sets in ℓ∞

Theorem Assume MAκ(σ-centered) for some cardinal number κ. Let D ⊆ Sℓ∞ be such that |D| κ. Then, there exists (xn)n∈ω ⊆ ℓ1 such that supn

  • xn
  • 1 = ∞ and limnxn, y = 0 for every y ∈ D.

In particular, D is not weak* Banach–Steinhaus in ℓ∞. Theorem

1 Every weak* Banach–Steinhaus set in ℓ∞ is of cardinality at

least p.

slide-45
SLIDE 45

Martin’s axiom and weak* Banach–Steinhaus sets in ℓ∞

Theorem Assume MAκ(σ-centered) for some cardinal number κ. Let D ⊆ Sℓ∞ be such that |D| κ. Then, there exists (xn)n∈ω ⊆ ℓ1 such that supn

  • xn
  • 1 = ∞ and limnxn, y = 0 for every y ∈ D.

In particular, D is not weak* Banach–Steinhaus in ℓ∞. Theorem

1 Every weak* Banach–Steinhaus set in ℓ∞ is of cardinality at

least p.

2 Under Martin’s axiom, every weak* Banach–Steinhaus set is

  • f cardinality c.
slide-46
SLIDE 46

Schur families and weak* Banach–Steinhaus sets in ℓ∞

Proposition If F ⊆ ℘(ω) is a Schur family, then

χA : A ∈ F is weak*

Banach–Steinhaus.

slide-47
SLIDE 47

Schur families and weak* Banach–Steinhaus sets in ℓ∞

Proposition If F ⊆ ℘(ω) is a Schur family, then

χA : A ∈ F is weak*

Banach–Steinhaus. Theorem There exists a weak* Banach–Steinhaus set in ℓ∞ of cardinality cof(N).

slide-48
SLIDE 48

Schur families and weak* Banach–Steinhaus sets in ℓ∞

Proposition If F ⊆ ℘(ω) is a Schur family, then

χA : A ∈ F is weak*

Banach–Steinhaus. Theorem There exists a weak* Banach–Steinhaus set in ℓ∞ of cardinality cof(N). Theorem The existence of a weak* Banach–Steinhaus set in ℓ∞ of cardinality strictly less than c is independent of ZFC+¬CH.

slide-49
SLIDE 49

Thank you for the attention!