MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The space $\ell_1$ has loads of (isomorphic) predulas. They can be as weird as possible but I am interested in Banach lattices.

Question: Let $X$ be a Banach lattice with dual isomorphic to $\ell_1$. Must $X$ be isomorphic to $C(K)$ for some countable $K$?

Well, the classical Bourgain-Delbaen spaces are not good candidates because they have no copies of $c_0$, hence they are not isomorphic to a Banach lattice (a Banach lattice without a copy of $c_0$ is weakly sequentially complete and weakly sequentially Banach lattices are complemented in their biduals).

share|cite|improve this question
My guess is "yes". I think it is known that $\ell_1$ has a unique lattice structure, which means that the lattice structure on $X^*$ as a dual to the lattice $X$ is just the usual lattice structure on $\ell_1$. This means that disjoint sequences in $X$ add in an $\ell_\infty$ way, which says that $X$ is (isomorphically) an abstract $M$-space. An abstract $M$-space whose dual is $\ell_1$ should be (isomorphic to) $C(K)$ for some countable $K$, yes? – Bill Johnson Jun 24 '12 at 18:12
Gasparis has several strong results on $\ell_1 $ preduals. His papers have very well-written and lengthy introductions. It may be worth taking a look: – Kevin Beanland Jun 25 '12 at 13:33
I think that the lattice structure on $\ell_1$ need not be unique (cf. p. 84, par. 3 of Lacey's and Wojtaszczyk's paper: ) – Tomek Kania Jun 26 '12 at 12:57
I was thinking isomorphically, Tomek. The example in Lacey-Wojtaszczyk is lattice isomorphic to $\ell_1$. – Bill Johnson Jun 29 '12 at 16:14
Benyamini proved that a separable $M$ space is isomorphic to a $C(K)$ space, and $K$ must then be a space of ordinals if the dual is separable. So I think the outline I gave above really does yield a proof. – Bill Johnson Jun 29 '12 at 16:18

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.