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.
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.
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 typeSource 1. Maurey and Pisier introduced K-convexity for the question of passing between type and cotype under dualitySource 2. 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 spaceSource 3. 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 removedSource 4. Gupta, Misra and Ray stated a version with the bounded approximation propertySource 5.
The paper proves the cotype–cotype conjecture under the ordinary approximation propertySource 6. 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 hypothesisSource 7. Without any approximation hypothesis the full statement is falseSource 8. Pisier's construction starting from ℓ₁ gives a space that is not K-convex, and such examples fail the approximation propertySource 9.
The obstacle is the approximation property itself. Enflo showed that even a separable reflexive Banach space can fail itSource 10. Figiel and Johnson separated it from its bounded versionSource 11. So an argument using the ordinary property must handle approximating maps whose sizes have no common boundSource 12. As a consequence, the paper also gets dimension-free constants for a duality of covering numbers of convex bodiesSource 13.
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
- The cotype–cotype conjecture under the approximation property (PDF, opens in a new tab) September 23, 2026 Formal proof listed
All quoted lines (13)
-
The classical theorems of Maurey–Pisier and Pisier identify -convexity with nontrivial type: These equivalences require no approximation hypothesis; precise formulations are and.
The cotype–cotype conjecture under the approximation property Back to text -
Maurey and Pisier introduced -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 -
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 -
He asked whether the exponent restriction could be removed.
The cotype–cotype conjecture under the approximation property Back to text -
Gupta, Misra, and Ray state the BAP formulation in.
The cotype–cotype conjecture under the approximation property Back to text -
We prove the cotype–cotype conjecture under the ordinary approximation property.
The cotype–cotype conjecture under the approximation property Back to text -
The forward implication holds for every real Banach space, without an approximation hypothesis.
The cotype–cotype conjecture under the approximation property Back to text -
The assertion with no approximation hypothesis is false.
The cotype–cotype conjecture under the approximation property Back to text -
Starting with therefore gives a space which is not -convex; these examples fail AP.
The cotype–cotype conjecture under the approximation property Back to text -
Enflo's counterexample showed that a separable reflexive Banach space can fail AP.
The cotype–cotype conjecture under the approximation property Back to text -
A Schauder basis gives uniformly bounded finite-rank approximations, but the converse implications in the hierarchy 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 -
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 -
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
- openai/math, Lean scope note for family 326
The formalized result establishes this equivalence for every nonzero real Banach space with the approximation property: is -convex exactly when both and have finite cotype.
- openai/math release notes (2026): model provenance and review status
manuscripts and supporting proof artifacts produced by an internal OpenAI model
Related results
- 325The complete Crouzeix conjectureFunctional analysis
- 338Yau's uniformization conjectureDifferential geometry
- 339Katok's entropy rigidity conjectureDifferential geometry
- 340A counterexample to the nearby Lagrangian conjectureDifferential geometry
- 305Four-dimensional disk embedding and Wall's conjectureTopology
Browse Functional analysis Named conjecturesOpen since the 1980sLean-checked resultsSolid results