we-solve (beta)

Math-2274-A1 · revision r1 · on Math-2274

OpenAI claim summary for Math-2274

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status at unsolvedmath.com: partially solved. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

The prefix estimate is Euclidean. This statement also ranges over arbitrary norms, where square-root-dimensional growth cannot simply be imported, and the paper does not remove the distinct non-Euclidean obstruction.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Steinitz prefix bounds for arbitrary norms
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Manuscript 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Steinitz prefix bounds for arbitrary norms

OpenAI's claim

OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 097; 2026-09-24), the asserted result is that one signing controls every prescribed-order prefix by $C\sqrt d$, and every zero-sum Euclidean unit-ball family has an ordering with that bound.

Mathematical statement of the claimed result

Manuscript 1.
For all integers $d,N\ge1$ and vectors $v_1,\ldots,v_N\in\mathbb R^d$ of Euclidean norm at most one, one absolute $C$ is claimed to permit signs with \[ \max_{0\le k\le N}\|\sum_{i=1}^k\varepsilon_iv_i\|_2\le C\sqrt d. \] The prescribed vector order is retained and the same signs control every prefix. If additionally $\sum_iv_i=0$, the asserted Steinitz--Bergström consequence instead gives a permutation $\pi$ with \[ \max_{0\le k\le N}\|\sum_{i=1}^kv_{\pi(i)}\|_2\le C\sqrt d. \] The constant is independent of dimension, vector count and the particular family.

Outline of the argument

For manuscript 1 (family 097; 2026-09-24), a filtered signed walk balances contractions against imposed linear constraints. Matrix trace budgets bound accumulated energy, and Brownian slab estimates turn low energy into shifted signs; a sign-to-ordering reduction gives the zero-sum conclusion.

Formal verification

For manuscript 1 (family 097; 2026-09-24), OpenAI lists Lean statements for this assertion: one signing controls every prescribed-order prefix by $C\sqrt d$, and every zero-sum Euclidean unit-ball family has an ordering with that bound.

This coverage does not establish a formal proof of the complete problem as stated here.

The linked family Comparator checks are SteinitzBergstrom.lean.

Their named declarations include OAI.EuclideanSteinitzBergstrom.main.

This site has not executed the Lean code. Described statement coverage is not an independent proof check.

Status caveat

The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.

Sources