Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f

Remark: 331-07. Midpoint convexity from two recursive potentials

Manuscript map · lines 8835–8844

OpenAI@2026-10-07#rem:oai-p-331-07

Back to manuscript

Authors: OpenAI. Family 331.

Title: Midpoint convexity from two recursive potentials.

Abstract: 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 $t{}3/128$ for $0{}lt t{}lt 1$, 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.

This abstract is a catalogue record. It is not a verification and not a premise. It does not close O.1. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted.

Nearby in this section