Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Two-dimensional Navier–Stokes benchmark

Example

In the InverseBench two-dimensional Navier–Stokes case, the spatial domain is the periodic square (0,2π)2 (the flat torus). In the physical vorticity model, the periodic velocity u(x,t)∈R2 is divergence-free and its scalar curl is ω=∂1u2−∂2u1. This curl has zero spatial mean. Taking the spatial mean of u to be zero fixes the constant-velocity ambiguity. For viscosity ν>0, forcing f(x)=−4cos⁡(4x2), and compatible initial curl ω0, the physical model is

∂tω+u⋅∇ω=νΔω+f,∇⋅u=0,ω(⋅,0)=ω0.

The released benchmark uses a finite-grid scalar state denoted w. Its pinned solver computes velocity by Fourier streamfunction derivatives, which select zero spatial mean velocity and ignore the constant Fourier mode of the scalar state. The nonlinear term uses a dealiased state with zero mode removed, while the time-update formula retains the original state's zero mode; the specified forcing also has zero mean. Thus the solver defines a scalar-state extension even when w‾≠0. One must not identify such an entire state with the curl of a periodic velocity. In the corresponding continuum mean-split convention, w=w‾+ω, −Δψ=ω, and u=(∂2ψ,−∂1ψ); only ω=w−w‾ is the curl, and w‾ is a conserved scalar offset. This convention explains the zero-mode distinction; it does not assert that the finite-grid dealiased scheme is an exact continuum solution or that the released dataset has been projected to zero mean.

The reconstruction target is the supplied dataset field z=w0 used as initial state for the inversion solver; the observation is y=PL(z)+n, where L is this numerical scalar-state solution map over the specified inversion horizon T, P samples the final field, and n is Gaussian measurement noise. The dataset-generation horizon is a separate five time units: §4.1 and Appendix B.5 report independent Gaussian seed fields ξ∼N(0,(−Δ+9I)−4), evolved under the stated forcing for five time units to produce the dataset of nontrivial initial fields. Accordingly, z denotes the evolved field, not a claim that the inversion-input distribution remains Gaussian with the seed covariance. On the full periodic space the reported covariance gives the constant eigenmode variance 9−4>0; the paper does not specify a zero-mode projection for the seed law. The scalar-state implementation permits retaining that offset without asserting the incompatible identity w=∇×u for arbitrary seeds.

InverseBench uses a pseudo-spectral solver with adaptive time stepping; the reported setup has a 128×128 grid, Reynolds number 200, 10,000 training samples, one validation sample, and ten test samples. The paper reports black-box forward access without a closed-form gradient for this implementation; the one-validation/ten-test split is part of this empirical benchmark, not a population-level guarantee.

Facts & Assumptions

Given: The periodic domain, physical mean-zero-curl convention, forcing f(x)=−4cos⁡(4x2), the pinned finite-grid scalar-state solver with its streamfunction velocity and retained constant mode, the reported Gaussian seed law and five-time-unit dataset preparation, the supplied evolved inversion input z=w0, final-time sampling map, Gaussian observation noise, and stated finite dataset split.

[F1]

Benchmark risk, compute budgets, and uncertainty records: the benchmark specification includes the forward solver, noise law, compute/interface constraints, and test population.

[F2]

Scope of InverseBench findings: this numerical PDE result uses a validation split of size one and a test split of size ten, so it supports no broad-population performance theorem.

Verification

1.1givenconstruct

The supplied evolved dataset field z=w0 is the initial scalar state for the specified numerical map L. Applying its final-time sampling operator P and adding the stated observation noise gives exactly y=PL(z)+n; the separate five-time-unit seed evolution prepares z and is not the inversion horizon.

2.1F1F2given∎

The stated forcing and seed-to-dataset preparation, grid, pseudo-spectral solver, noise model, and finite data split fill the solver/population fields of [F1]. The empirical scope in [F2] is retained, and no closed-form-gradient or convergence claim is added.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources