All OpenAI manuscripts

OpenAI · 331-07 · 2026-09-27 · Functional analysis

Midpoint convexity from two recursive potentials

preprints/Midpoint-convexity-from-two-recursive-potentials-September-27-2026

Family 331. Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming.

The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.

Read against the standing problems

Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N

Constructs a real reflexive Banach space with an asymptotically midpoint uniformly convex norm but no equivalent asymptotically uniformly convex norm, extending Baudier's separation to reflexive spaces. In the same space, depth- countably branching diamonds require distortion at least , so midpoint uniform convexity does not force uniformly bounded diamond distortion even under reflexivity.

We study tree norms computed by two least nonnegative fields whose difference is the vector. For Euclidean child aggregation, two root-sum spaces have an averaged asymptotic midpoint modulus of at least for , including a reflexive joining-root space. A reflexive construction with a fixed zero root also satisfies a homogeneous cubic estimate. These spaces admit no equivalent asymptotically uniformly convex norm. We also obtain sixth-power and cubic estimates when the aggregation exponent depends on the height of a finite component.

Preprint source and Lean scope

The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.

This preprint is named in the Lean scope note for 331: Reflexive midpoint convexity and diamond distortion. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.

ForestSpace.lean · ForestSpace.lean

Statement file

MidpointLenses.lean · MidpointLenses.lean

Statement file

DiamondDistortion.lean · DiamondDistortion.lean

Statement file

DaugavetModuli.lean · DaugavetModuli.lean

Statement file

BoundedTreePotentials.lean · BoundedTreePotentials.lean

Statement file

IndependentProducts.lean · IndependentProducts.lean

Statement file

RecursivePotentials.lean · RecursivePotentials.lean

Statement file