we-solve (beta)

Math-2273-A1 · revision r1 · on Math-2273

OpenAI claim summary for Math-2273

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: open. 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 problem asks for an asymptotic or correct-order GPY count of prime tuples and for an adaptation that produces small distances between Gaussian primes. A bound on the sizes of bounded-step components does not give either count or adaptation: infinitely many close pairs can lie in distinct finite components. The manuscript addresses infinite walks, which are not a clause of this question. Its result is related background rather than a partial solution of the displayed problem.

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

Manuscript

Contents
  1. GPY lower bounds and distances between Gaussian primes
  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

GPY lower bounds and distances between Gaussian primes

OpenAI's claim

The selected manuscript concerns walks through Gaussian primes with a fixed bound on each step. Fix $D<\infty$. Put an edge between distinct Gaussian primes $z,z'$ when $|z-z'|\le D$. OpenAI asserts a bound $B_D$, depending only on $D$, for the cardinality of each connected component. An infinite path of distinct primes with that step bound is consequently excluded. This is related to Gaussian-prime spacing, but is not a claimed GPY tuple-count estimate or a construction of close prime pairs.

Mathematical statement of the claimed result

Manuscript 1.
For $D<\infty$, form $G_D$ on all Gaussian primes in $\mathbb Z[i]$, joining distinct vertices when their Euclidean distance is at most $D$. The claimed uniform bound is \[ \forall D<\infty\ \exists B_D<\infty\ \forall\text{ connected components }C\subseteq G_D:\quad |C|\le B_D. \] Axis primes are included. Consequently a sequence of distinct Gaussian primes with every successive distance at most $D$ has at most $B_D$ terms; the bound does not depend on its starting point.

Outline of the argument

For manuscript 1 (family 028; 2026-09-26), geometric sampling of a hypothetical long walk produces many residue differences. Shared continuation data create an entropy budget incompatible with avoiding zero residues, yielding a finite periodic sieve barrier and hence the uniform component bound.

Formal verification

For manuscript 1 (family 028; 2026-09-26), OpenAI lists Lean statements for this assertion: for each finite step bound, all connected Gaussian-prime components have a common finite size bound, ruling out infinite injective walks, including those meeting axis primes.

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

The linked family Comparator checks are GaussianMoat.lean.

Their named declarations include OAI.GaussianMoat.fullMain.

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