OctoInformBeta

Independence of the separable quotient problem

The separable quotient problem asks whether every infinite-dimensional Banach space over ℝ\mathbb R or ℂ\mathbb C admits a bounded linear surjection onto a separable infinite-dimensional Banach space. Write 𝔠=2ℵ0\mathfrak c=2^{\aleph_0} for the cardinality of the continuum. The continuum hypothesis, abbreviated CH, is the assertion 𝔠=ℵ1\mathfrak c=\aleph_1. An uncountable cardinal κ\kappa is real-valued measurable if its full power set carries a probability measure vanishing on singletons and additive on disjoint families of cardinality less than κ\kappa.

Johnson and Rosenthal proved that every separable infinite-dimensional Banach space has an infinite-dimensional quotient with a Schauder basis. Argyros, Dodos and Kanellopoulos proved that every infinite-dimensional dual Banach space has a separable infinite-dimensional quotient. Odell and Rosenthal proved that every element of the bidual of a separable Banach space containing no isomorphic copy of ℓ1\ell_1 is the weak-star limit of a sequence from that space.

If 𝔠\mathfrak c is real-valued measurable, the preprint proves that every infinite-dimensional real or complex Banach space has a separable infinite-dimensional quotient. Under CH, the preprint constructs, over each scalar field, a Banach space of norm density ℵ1\aleph_1 with no such quotient. The preprint derives independence of the universal separable quotient assertion from ZFC, relative to the consistency of ZFC with a measurable cardinal.

The Lean library SeparableQuotients contains the negative implication. The positive implication and the consistency conclusions are outside the Lean library. For its partial positive argument, the Lean library assumes the existence of nearly Euclidean finite-dimensional sections with additional norming and annihilation properties. The existence of nearly Euclidean finite-dimensional sections is Dvoretzky’s theorem, for which Figiel gave a short proof. The Lean library also assumes a norm density condition. The Lean library takes a sequential approximation hypothesis rather than deriving it from the Odell and Rosenthal theorem. Lean has checked every result of the Lean library, so the Lean library is the reference for these pages. Each result on these pages is stated as in the Lean library and linked to its declaration. Where the preprint gives a different statement, the Lean library’s statement appears with the preprint’s statement beside it. The preprint is a guide only to the order and names of the results.

The Lean library: SeparableQuotients

SeparableQuotients is a Lean library: 37 items, in nine groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. §1 (setting): separable quotients and the set-theoretic hypotheses Separable quotient assertions and the continuum.
  2. Theorem 1.1 The continuum hypothesis gives separable quotient counterexamples.
§2. Separable evaluation images 5 items
  1. §2 (setting): evaluation and finite prefix normers Evaluation and norming finite dual prefixes.
  2. Lemma 2.1 Finite prefix normers give uniform prefix bounds.
  3. Proposition 2.2 Separable quotients through dual evaluation.
  4. §2 (setting): strictly singular operators When an operator is strictly singular.
  5. Lemma 2.3 Strictly singular operators admit small restrictions.
§3. A measure on the continuum gives separable quotients 5 items
  1. §3 (setting): the continuum index and strong additivity A measure hypothesis on the continuum index.
  2. Lemma 3.1 Null singletons and continuum additivity force regularity.
  3. Lemma 3.2 A quotient criterion from nearly Euclidean rows.
  4. Lemma 3.3 Uniformly nonzero functionals with null evaluations.
  5. Lemma 3.4 An unconditional sequence from coded dual functionals.
§4. Passing between real and complex spaces 3 items
  1. Proposition 4.1 Separable quotients pass from real to complex.
  2. Lemma 4.2 A separable product quotient ensures a factor quotient.
  3. Corollary 4.3 Real and complex quotient assertions are equivalent.
§5. A dual space with coded norming functionals 7 items
  1. §5 (setting): colors, operation families and exponents Colors and succession for norming operations.
  2. Lemma 5.1 Explicit parameters satisfy the norming estimates.
  3. Lemma 5.2 Countable initial segments admit coherent finite closures.
  4. §5 (setting): rational normers, coded paths and the completed space Rational normers and their completed space.
  5. Lemma 5.3 Norming arrays determine the coordinate completion.
  6. Lemma 5.4 A coordinate bound within each color.
  7. Proposition 5.5 The coordinate span gives an isometric predual.
§6. Infinite paths and weak-Cauchy block sequences 4 items
  1. §6 (setting): actual infinite paths and admissible blocks Infinite paths retain their original pieces.
  2. Lemma 6.1 Infinite paths yield bounded functionals.
  3. Lemma 6.2 Infinite paths admit disjoint weight tails.
  4. Proposition 6.3 Bounded block sequences admit pathwise Cauchy subsequences.
§7. Vectors detected at a prescribed weight 4 items
  1. Proposition 7.1 A prescribed weight detects a tail vector.
  2. Lemma 7.2 Tail vectors with controlled interval projections.
  3. §7 (setting): weight windows and hits Blocks with separated weight windows.
  4. Lemma 7.3 Thinning block indices to exclude four hits.
§8. Path functionals on arbitrary subspaces 2 items
  1. Lemma 8.1 Subspace reductions that preserve branch evaluations.
  2. Theorem 8.2 Separated path functionals on infinite-dimensional subspaces.
§9. Changing the predual 5 items
  1. §9 (setting): quotient, path synthesis and the perturbation Changing the predual by path synthesis.
  2. Lemma 9.1 Changing preduals by perturbing a quotient.
  3. Lemma 9.2 Path cosets admit contractive sequence synthesis.
  4. Lemma 9.3 Path cosets in the perturbation image.
  5. Theorem 9.4 The continuum hypothesis gives a real counterexample.

No item matches.