The cotype–cotype conjecture under the approximation property

For Banach spaces with the approximation property, K-convexity equals finite cotype of the space and its dual.

1 paper September 23, 2026 Explained by AI

Type and cotype measure how random sums of vectors with plus-or-minus signs grow in a Banach space. K-convexity is a key property that lets type and cotype pass cleanly between a space and its dual. The cotype–cotype conjecture says K-convexity follows when both the space and its dual have finite cotype. The paper proves this for every real Banach space with the approximation property, and Lean checks it. Without that property the statement is known to fail.

First step
1981
Gilles Pisier, K-convexity under a cotype restriction, and the question of removing it
Significance
Solid
It settles the cotype–cotype conjecture for all finite cotype exponents under the ordinary approximation property, extending Pisier's partial results.
Trust
Formal proof listed
Field
Functional analysis
1 paper

The explanation

Take two vectors in the plane, (1, 0) and (0, 1). Flip a fair coin for each and attach a plus or minus sign. Then add them. Every one of the four outcomes has squared length 2. So the average squared length is 2. The sum of the squared lengths of the two vectors is also 2. In ordinary space, random signed sums grow exactly like this. That balance is what type 2 and cotype 2 measure.

Now try a different way to measure length. In the space ℓ₁, the length of a vector is the sum of the sizes of its entries. Take 100 unit vectors, one along each axis. Any signed sum of them has ℓ₁ length 100. In ordinary 100-dimensional space the same sum has length only √100 = 10. With 10,000 vectors the gap is 10,000 against 100. So ℓ₁ behaves very differently from ordinary space.

A Banach space is a vector space with a length for each vector, where good sequences always have limits. Its dual is the space of bounded linear maps from it to the real numbers. Type and cotype compare random signed sums with the sizes of the vectors. Type bounds the sum from above, cotype from below. K-convexity is a further property. It says a certain averaging projection, which keeps only the first-order part of a function of random signs, stays bounded. Classical theorems of Maurey and Pisier identify K-convexity with nontrivial type. Maurey and Pisier introduced K-convexity for the question of passing between type and cotype under duality. The space ℓ₁ above has no nontrivial type, so it is not K-convex.

The question is whether finite cotype on both sides is enough. For cotype two on both sides, Pisier proved more: a space with the approximation property is then a Hilbert space. The approximation property says compact sets can be approximated by finite-rank maps. Pisier then proved K-convexity under a restriction on the cotype exponents. He asked whether that restriction could be removed. Gupta, Misra and Ray stated a version with the bounded approximation property.

The paper proves the cotype–cotype conjecture under the ordinary approximation property. A nonzero real Banach space with this property is K-convex exactly when it and its dual both have finite cotype. One direction holds for every real Banach space, with no approximation hypothesis. Without any approximation hypothesis the full statement is false. Pisier's construction starting from ℓ₁ gives a space that is not K-convex, and such examples fail the approximation property.

The obstacle is the approximation property itself. Enflo showed that even a separable reflexive Banach space can fail it. Figiel and Johnson separated it from its bounded version. So an argument using the ordinary property must handle approximating maps whose sizes have no common bound. As a consequence, the paper also gets dimension-free constants for a duality of covering numbers of convex bodies.

How sure is this? Lean, a computer proof checker, proves the main equivalence for every nonzero real Banach space with the approximation property. No specialist review has been published, but the main statement has a Lean proof.

What it doesn't show. This does not cover Banach spaces without the approximation property, where counterexamples already exist.

Where it came from

This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026.

Hype check

Solid. The main equivalence has a Lean proof; it needs the approximation property, without which the statement is known to fail.

Words used

Banach space
A vector space with a notion of length in which every Cauchy sequence has a limit.
Dual space
The space of all bounded linear maps from a Banach space to the real numbers.
Rademacher type
An upper bound on random plus-or-minus sums of vectors in terms of the vectors' sizes.
Rademacher cotype
A lower bound on random plus-or-minus sums of vectors in terms of the vectors' sizes.
K-convexity
The property that the projection keeping the first-order part of functions of random signs stays bounded.
ℓ₁
The space of sequences whose entries have a finite sum of sizes, with that sum as the length.
Approximation property
Every compact set can be approximated arbitrarily well by maps of finite rank.
Hilbert space
A space with lengths and angles, like ordinary space, possibly of infinite dimension.

The original paper

All quoted lines (13)

  1. The classical theorems of Maurey–Pisier and Pisier identify KK-convexity with nontrivial type: K(X)<∞ ⟺ X has Rademacher type p for some p>1 ⟺ X does not contain the ℓ1s’s uniformly.\begin{split} K(X)<\infty &\ \Longleftrightarrow\ X\text{ has Rademacher type }p\text{ for some }p>1\\ &\ \Longleftrightarrow\ X\text{ does not contain the }\ell_1^s\text{'s uniformly}. \end{split} These equivalences require no approximation hypothesis; precise formulations are and.
    The cotype–cotype conjecture under the approximation property Back to text
  2. Maurey and Pisier introduced KK-convexity as the setting for this duality question; Pisier's holomorphic-semigroup theorem subsequently identified it with nontrivial type.
    The cotype–cotype conjecture under the approximation property Back to text
  3. For cotype two on both sides, Pisier established the stronger conclusion that an AP space is isomorphic to a Hilbert space.
    The cotype–cotype conjecture under the approximation property Back to text
  4. He asked whether the exponent restriction could be removed.
    The cotype–cotype conjecture under the approximation property Back to text
  5. Gupta, Misra, and Ray state the BAP formulation in.
    The cotype–cotype conjecture under the approximation property Back to text
  6. We prove the cotype–cotype conjecture under the ordinary approximation property.
    The cotype–cotype conjecture under the approximation property Back to text
  7. The forward implication holds for every real Banach space, without an approximation hypothesis.
    The cotype–cotype conjecture under the approximation property Back to text
  8. The assertion with no approximation hypothesis is false.
    The cotype–cotype conjecture under the approximation property Back to text
  9. Starting with ℓ1\ell_1 therefore gives a space which is not KK-convex; these examples fail AP.
    The cotype–cotype conjecture under the approximation property Back to text
  10. Enflo's counterexample showed that a separable reflexive Banach space can fail AP.
    The cotype–cotype conjecture under the approximation property Back to text
  11. A Schauder basis gives uniformly bounded finite-rank approximations, but the converse implications in the hierarchy Schauder basis ⟹ BAP ⟹ AP\text{Schauder basis}\ \Longrightarrow\ \text{BAP}\ \Longrightarrow\ \text{AP} fail: Figiel and Johnson separated AP from BAP, and Szarek constructed a superreflexive space with BAP but no Schauder basis.
    The cotype–cotype conjecture under the approximation property Back to text
  12. Thus an argument using ordinary AP must accommodate approximants whose norms have no common bound.
    The cotype–cotype conjecture under the approximation property Back to text
  13. Its finite-dimensional form also supplies a class of convex bodies for which ordinary metric-entropy duality has dimension-free constants.
    The cotype–cotype conjecture under the approximation property Back to text

Other sources

  1. openai/math, Lean scope note for family 326 The formalized result establishes this equivalence for every nonzero real Banach space with the approximation property: XX is KK-convex exactly when both XX and X∗X^* have finite cotype.
  2. openai/math release notes (2026): model provenance and review status manuscripts and supporting proof artifacts produced by an internal OpenAI model

Browse Functional analysis Named conjecturesOpen since the 1980sLean-checked resultsSolid results