97d7b4d9 Thomas Schlumprecht 118 C EDITED

97d7b4d9 Thomas Schlumprecht 118 C EDITED

🎙 Thomas Schlumprecht 👥 60K 📅 September 14, 2026 ⏱ 48 min 👁 6 📄 original study 🧭 2026-09-14
Available in: English (current) Français

Keywords

asymptotic gamesFDDtree propertiesembeddingreflexive spaces

Summary

The lecture by Thomas Schlumprecht at ICM 2026 addresses three fundamental problems in the theory of Banach spaces related to embeddings and asymptotic properties. He introduces the concept of infinite asymptotic games, where two players alternately choose cofinite-dimensional subspaces and vectors, and the outcome is a sequence in the sphere of the space. This game framework provides a coordinate-free way to characterize properties like upper and lower estimates, unconditionality, and the structure of finite-dimensional decompositions. The first problem, due to Johnson, asks for an intrinsic characterization of spaces that embed into an ℓ_p-sum of finite-dimensional spaces; the answer involves a tree property ensuring every weakly null tree has a branch equivalent to the ℓ_p basis. The second problem, from Bourgain, concerns the existence of a reflexive separable space containing all separable super-reflexive spaces; a partial solution by Pisier for spaces with an FDD is extended using tree QP-estimates. The third problem, solved by Johnson and Jen, characterizes embeddability into spaces with unconditional FDDs via an unconditional tree property. Schlumprecht then presents a new unified approach using Markushevich bases, which every separable space admits, to simplify proofs and avoid the technical obstacles of the earlier embedding strategy. He outlines a blocking theorem that converts a winning strategy in an asymptotic game into a norming Markushevich basis with a uniform blocking, thereby providing a simpler, more constructive mechanism to build super-spaces with desired properties.

232 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk presents original research with rigorous mathematical arguments. The value lies in unifying several known results under a common framework of asymptotic games and Markushevich bases, and in providing characterizations that are both necessary and sufficient. The argumentation is solid: the speaker carefully defines concepts, states theorems with precise hypotheses, and sketches proofs that highlight the key ideas. The use of infinite games and determinacy (via Martin’s theorem) adds a novel perspective that clarifies why tree-like conditions are essential. The presentation is systematic and the reasoning is convincing, though it assumes a high level of familiarity with Banach space theory.

Scientific Rigor, Source Quality, Title Accuracy

The lecture demonstrates strong scientific rigor: it builds on established results by Johnson, Pisier, James, Zippin, and Markushevich, and the speaker acknowledges the provenance of each problem. The sources cited within the talk are foundational and credible. However, the video description contains no external links, so only the internal mentions can be considered. The title appears to be a cryptic identifier rather than a descriptive one, which may confuse viewers; the content fully aligns with the stated description ‘Asymptotic Properties of Banach Spaces’. Overall, the talk is mathematically precise and the sources are authoritative.

210 words

Title / Content Match

The title appears to be an internal identifier rather than a descriptive one; however, the content aligns with the video description 'Asymptotic Properties of Banach Spaces'.

Quality & Reliability

9/10

The talk is given by a leading expert at the International Congress of Mathematicians 2026, presenting rigorous mathematical results with proof sketches. The content is highly technical, well-structured, and relies on foundational contributions from renowned researchers, making it highly reliable.

Key Moments

Cited Sources

  • Johnson (1977) - Intrinsic characterization for embedding into ℓ_p-sums — Mentioned as the origin of the first problem on characterizing subspaces of ℓ_p-sums of finite-dimensional spaces.
  • Bourgain - Existence of a universal reflexive space — Problem posed by Bourgain about reflexive spaces containing all separable super-reflexive spaces.
  • Pisier (1987) - Positive answer for spaces with FDD — Pisier solved Bourgain's problem under the assumption of an FDD, using James's theorem on super-reflexive spaces.
  • James - Theorem on super-reflexive spaces — James's result is used to show that every super-reflexive space with FDD satisfies ℓ_p-ℓ_q estimates.
  • Zippin (1988) - Embedding into spaces with shrinking basis — Zippin's theorem ensures that every separable Banach space with separable dual embeds into a space with a shrinking basis, used in earlier approaches.
  • Markushevich - Basis theorem — Markushevich's theorem guarantees that every separable Banach space admits a norming M-basis, central to the new unified approach.

Contribution & Novelties

The lecture introduces a novel unified framework for studying asymptotic properties of Banach spaces using infinite asymptotic games and Markushevich bases. The main contribution is a blocking theorem that shows that if a player has a winning strategy in an asymptotic game, then there exists a norming M-basis and a blocking such that every normalized skipped block sequence lies in the desired set. This simplifies and generalizes earlier proofs of embedding theorem, avoiding the need to embed the space into a larger space with a Schauder basis as an intermediate step. The new approach also clarifies the role of tree properties and provides a more constructive construction of super-spaces.

Pour aller plus loin :

  • Banach space — Essential background on the main objects of study.
  • Markushevich basis — The weaker basis concept central to the new method.
  • Schauder basis — Related notion of basis, and the context for FDDs.
  • James space — Example of a non-reflexive space that illustrates limitations of simpler conditions.
  • Unconditional basis — Key concept in the third problem and its solution.

175 words

Radar Profile

The radar profile shows very high scores on all axes (except perhaps fiabilite slightly lower than information quantity due to the unavailability of external references). This indicates a technically dense, high-quality lecture with a strong mathematical foundation, but the lack of accessible references beyond the spoken content slightly reduces the reliability score.

Reliability 9/10