On Banach spaces which are weak sequentially dense in its bidual - - PowerPoint PPT Presentation

on banach spaces which are weak sequentially dense in its
SMART_READER_LITE
LIVE PREVIEW

On Banach spaces which are weak sequentially dense in its bidual - - PowerPoint PPT Presentation

On Banach spaces which are weak sequentially dense in its bidual Jos e Rodr guez Universidad de Murcia Workshop on Banach spaces and Banach lattices Madrid, September 9, 2019 Research supported by Agencia Estatal de Investigaci


slide-1
SLIDE 1

On Banach spaces which are weak∗ sequentially dense in its bidual

Jos´ e Rodr´ ıguez

Universidad de Murcia

Workshop on Banach spaces and Banach lattices Madrid, September 9, 2019

Research supported by Agencia Estatal de Investigaci´

  • n/FEDER (MTM2017-86182-P) and Fundaci´
  • n S´

eneca (20797/PI/18)

slide-2
SLIDE 2

Throughout this talk X is a Banach space.

slide-3
SLIDE 3

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗.

slide-4
SLIDE 4

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗.

slide-5
SLIDE 5

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗.

slide-6
SLIDE 6

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious)

slide-7
SLIDE 7

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ]

slide-8
SLIDE 8

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ] (BX ∗∗,w∗) is Fr´ echet-Urysohn = ⇒ X ∈ SD

slide-9
SLIDE 9

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ] X ∈ SD if X is weakly sequentially complete and non-reflexive (e.g. ℓ1 and L1) (BX ∗∗,w∗) is Fr´ echet-Urysohn = ⇒ X ∈ SD

slide-10
SLIDE 10

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ] X ∈ SD if X is weakly sequentially complete and non-reflexive (e.g. ℓ1 and L1) X = c0(Γ) for uncountable Γ (BX ∗∗,w∗) is Fr´ echet-Urysohn = ⇒ X ∈ SD

slide-11
SLIDE 11

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ] X ∈ SD if X is weakly sequentially complete and non-reflexive (e.g. ℓ1 and L1) X = c0(Γ) for uncountable Γ (BX ∗∗,w∗) is Fr´ echet-Urysohn = ⇒ X ∈ SD = ⇒ X ⊃ ℓ1.

slide-12
SLIDE 12

Throughout this talk X is a Banach space. Goldstine’s theorem BX is w∗-dense in BX ∗∗. Therefore, X is w∗-dense in X ∗∗. Notation X ∈ SD iff X is w∗-sequentially dense in X ∗∗. X ∈ SD if X is reflexive (obvious) X ∗ is separable [ ⇐ ⇒ (BX ∗∗,w∗) is metrizable ] X ∈ SD if X is weakly sequentially complete and non-reflexive (e.g. ℓ1 and L1) X = c0(Γ) for uncountable Γ (BX ∗∗,w∗) is Fr´ echet-Urysohn = ⇒ X ∈ SD = ⇒ X ⊃ ℓ1. Theorem (Odell-Rosenthal, Bourgain-Fremlin-Talagrand) Suppose X is separable. Then: (BX ∗∗,w∗) is Fr´ echet-Urysohn ⇐ ⇒ X ∈ SD ⇐ ⇒ X ⊃ ℓ1.

slide-13
SLIDE 13

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1

slide-14
SLIDE 14

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson

slide-15
SLIDE 15

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG

slide-16
SLIDE 16

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG X is Asplund

slide-17
SLIDE 17

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG X is Asplund Theorem (Deville-Godefroy, Orihuela) (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD and X is Asplund.

slide-18
SLIDE 18

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG X is Asplund Theorem (Deville-Godefroy, Orihuela) (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD and X is Asplund. A Banach lattice X is Asplund if and only if X ⊃ ℓ1.

slide-19
SLIDE 19

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG X is Asplund Theorem (Deville-Godefroy, Orihuela) (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD and X is Asplund. A Banach lattice X is Asplund if and only if X ⊃ ℓ1. Corollary Suppose X is a Banach lattice. Then (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD.

slide-20
SLIDE 20

(BX ∗∗,w∗) is Fr´ echet-Urysohn X ∈ SD X ⊃ ℓ1 (BX ∗∗,w∗) is Corson X ∗ is WCG X is Asplund Theorem (Deville-Godefroy, Orihuela) (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD and X is Asplund. A Banach lattice X is Asplund if and only if X ⊃ ℓ1. Corollary Suppose X is a Banach lattice. Then (BX ∗∗,w∗) is Corson ⇐ ⇒ X ∈ SD. Question X ∈ SD = ⇒ (BX ∗∗,w∗) is Fr´ echet-Urysohn ???

slide-21
SLIDE 21

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ???

slide-22
SLIDE 22

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

.

slide-23
SLIDE 23

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

slide-24
SLIDE 24

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

2

convexly sequential iff for every convex set C ⊂ BX ∗ we have S1(C) = C = ⇒ C is w∗-closed;

slide-25
SLIDE 25

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

2

convexly sequential iff for every convex set C ⊂ BX ∗ we have S1(C) = C = ⇒ C is w∗-closed; Efremov convexly sequential Fr´ echet-Urysohn sequential

slide-26
SLIDE 26

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

2

convexly sequential iff for every convex set C ⊂ BX ∗ we have S1(C) = C = ⇒ C is w∗-closed; Efremov convexly sequential Fr´ echet-Urysohn sequential sequentially compact

slide-27
SLIDE 27

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

2

convexly sequential iff for every convex set C ⊂ BX ∗ we have S1(C) = C = ⇒ C is w∗-closed;

3

convex block compact iff every sequence in BX ∗ admits a w∗-convergent convex block subsequence. Efremov convexly sequential Fr´ echet-Urysohn sequential sequentially compact convex block compact

slide-28
SLIDE 28

“Vague” question Which topological properties does (BX ∗,w∗) enjoy whenever X ∈ SD ??? Given a set A ⊂ X ∗, we write S1(A) :=

  • x∗ ∈ X ∗ : ∃(x∗

n) ⊂ A such that w∗- lim n→∞x∗ n = x∗

. Definition We say that (BX ∗,w∗) is

1

Efremov iff S1(C) = C w ∗ for every convex set C ⊂ BX ∗;

2

convexly sequential iff for every convex set C ⊂ BX ∗ we have S1(C) = C = ⇒ C is w∗-closed;

3

convex block compact iff every sequence in BX ∗ admits a w∗-convergent convex block subsequence. Efremov convexly sequential Fr´ echet-Urysohn sequential sequentially compact convex block compact

(Mart´ ınez-Cervantes)

slide-29
SLIDE 29

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact

slide-30
SLIDE 30

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness

slide-31
SLIDE 31

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD

slide-32
SLIDE 32

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn.

slide-33
SLIDE 33

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn. Moreover: (BX ∗,w∗) is sequential (Mart´ ınez-Cervantes);

slide-34
SLIDE 34

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn. Moreover: (BX ∗,w∗) is sequential (Mart´ ınez-Cervantes); Under CH, there exist MAD families F for which (BX ∗,w∗) is/isn’t Efremov (Avil´ es, Mart´ ınez-Cervantes, R.).

slide-35
SLIDE 35

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn. Moreover: (BX ∗,w∗) is sequential (Mart´ ınez-Cervantes); Under CH, there exist MAD families F for which (BX ∗,w∗) is/isn’t Efremov (Avil´ es, Mart´ ınez-Cervantes, R.). Theorem If X ∈ SD, then (BX ∗,w∗) has countable tightness [Hern´ andez-Rubio]

slide-36
SLIDE 36

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn. Moreover: (BX ∗,w∗) is sequential (Mart´ ınez-Cervantes); Under CH, there exist MAD families F for which (BX ∗,w∗) is/isn’t Efremov (Avil´ es, Mart´ ınez-Cervantes, R.). Theorem If X ∈ SD, then (BX ∗,w∗) has countable tightness [Hern´ andez-Rubio] and is convexly sequential [Avil´ es, Mart´ ınez-Cervantes, R.].

slide-37
SLIDE 37

Efremov convexly sequential convex block compact Fr´ echet-Urysohn sequential sequentially compact countable tightness Example Let X = JL2(F) be the Johnson-Lindenstrauss space associated to a MAD family F. Then X ∈ SD and (BX ∗,w∗) is not Fr´ echet-Urysohn. Moreover: (BX ∗,w∗) is sequential (Mart´ ınez-Cervantes); Under CH, there exist MAD families F for which (BX ∗,w∗) is/isn’t Efremov (Avil´ es, Mart´ ınez-Cervantes, R.). Theorem If X ∈ SD, then (BX ∗,w∗) has countable tightness [Hern´ andez-Rubio] and is convexly sequential [Avil´ es, Mart´ ınez-Cervantes, R.]. Question X ∈ SD = ⇒ (BX ∗,w∗) is sequential or sequentially compact ???

slide-38
SLIDE 38

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients:

slide-39
SLIDE 39

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact.

slide-40
SLIDE 40

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact. Definition Let K ⊂ X ∗ be convex w∗-compact. A set B ⊂ K is a boundary of K iff ∀x ∈ X ∃x∗

0 ∈ B

such that x∗

0(x) = sup{x∗(x) : x∗ ∈ K}.

slide-41
SLIDE 41

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact. Definition Let K ⊂ X ∗ be convex w∗-compact. A set B ⊂ K is a boundary of K iff ∀x ∈ X ∃x∗

0 ∈ B

such that x∗

0(x) = sup{x∗(x) : x∗ ∈ K}.

Theorem (Efremov, Godefroy) X ∈ SD = ⇒ K = conv(B)

·

for all K and B as above.

slide-42
SLIDE 42

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact. Definition Let K ⊂ X ∗ be convex w∗-compact. A set B ⊂ K is a boundary of K iff ∀x ∈ X ∃x∗

0 ∈ B

such that x∗

0(x) = sup{x∗(x) : x∗ ∈ K}.

Theorem (Efremov, Godefroy) X ∈ SD = ⇒ K = conv(B)

·

for all K and B as above. Sketch of proof of the implication: Take C ⊂ BX ∗ convex. Claim: C w ∗ = S1(S1(C)). Why?

slide-43
SLIDE 43

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact. Definition Let K ⊂ X ∗ be convex w∗-compact. A set B ⊂ K is a boundary of K iff ∀x ∈ X ∃x∗

0 ∈ B

such that x∗

0(x) = sup{x∗(x) : x∗ ∈ K}.

Theorem (Efremov, Godefroy) X ∈ SD = ⇒ K = conv(B)

·

for all K and B as above. Sketch of proof of the implication: Take C ⊂ BX ∗ convex. Claim: C w ∗ = S1(S1(C)). Why?

  • S1(C) is a boundary of C w ∗

.

slide-44
SLIDE 44

X ∈ SD = ⇒ (BX ∗,w∗) is convexly sequential. Ingredients: Theorem (Bourgain) X ⊃ ℓ1 = ⇒ (BX ∗,w∗) is convex block compact. Definition Let K ⊂ X ∗ be convex w∗-compact. A set B ⊂ K is a boundary of K iff ∀x ∈ X ∃x∗

0 ∈ B

such that x∗

0(x) = sup{x∗(x) : x∗ ∈ K}.

Theorem (Efremov, Godefroy) X ∈ SD = ⇒ K = conv(B)

·

for all K and B as above. Sketch of proof of the implication: Take C ⊂ BX ∗ convex. Claim: C w ∗ = S1(S1(C)). Why?

  • S1(C) is a boundary of C w ∗

.

  • C w ∗

= S1(C)

· ⊂ S1(S1(C)).