we-solve (beta)

Math-2958-A1 · revision r1 · on Math-2958

OpenAI claim summary for Math-2958

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: 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.

Maximal triangular Hilbert transform: The primary statement says: The hard-truncated maximal triangular Hilbert transform maps complex L3(R2) times L3(R2) to L^(3/2)(R2), uniformly in both annulus endpoints. The target retains these quantified objects and hypotheses, so its positive assertion is covered.

With the hypotheses and conventions above, the claimed result addresses the whole mathematical assertion on this page.

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

Manuscript

Contents
  1. The symmetric maximal triangular Hilbert transform
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Mathematical claim 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

The symmetric maximal triangular Hilbert transform

OpenAI's claim

Maximal triangular Hilbert transform: The announced symmetric triangular Hilbert estimate controls the supremum over both finite hard cutoffs for arbitrary complex $L^3$ inputs. It also gives joint principal-value convergence almost everywhere and in $L^{3/2}$.

Mathematical statement of the claimed result

Mathematical claim 1.
For $F,G\in L^3(\mathbb R^2;\mathbb C)$ let \[B_*(F,G)(x,y)=\sup_{0<a<b<\infty}\left|\int_{a<|t|<b}F(x+t,y)G(x,y+t)\,\frac{dt}{t}\right|.\] There is an absolute finite $C$ with $\|B_*(F,G)\|_{L^{3/2}(\mathbb R^2)}\le C\|F\|_3\|G\|_3$. Both finite hard-truncation endpoints vary in the pointwise supremum; this is the balanced exponent pair $(3,3)$.

Outline of the argument

Maximal triangular Hilbert transform: The cyclic form is represented by matrix traces and a positive energy evolving under Gaussian smoothing. Mixed trace estimates compare energy derivatives at adjacent variables. A further bound pays for entries switched on or off at separately chosen scales, so telescoping remains uniform under pointwise selection of the cutoffs.

Formal verification

Family 082 describes Lean coverage for the two-cutoff symmetric maximal estimate for complex inputs; later variation and dyadic absolute-sum refinements are separate.

Maximal triangular Hilbert transform: The manuscript links TriangularHilbert.lean (declaration OAI.TriangularHilbert.main_estimate).

The documented selection includes this manuscript’s main assertion; that assertion retains the restrictions stated above.

This site has not run the Lean development. These links describe OpenAI’s selected formal statements and should be read with their stated scope.

Status caveat

OpenAI reports that an internal model produced the manuscripts. Their arguments have not been independently verified as proofs by this site. Any portion outside the documented formal scope may contain mistakes, and the catalogue label reports the announced mathematical claim.

Sources