Alphabeta Math
Open problemQuestion: AI-adaptedProof: Not applicablePipeline-generated‡ sources checked 2026-10-22↗ rests on later material‡ unresolved
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.

This problem is unresolved. Its sources and status may be reviewed, but no solution is accepted here. It cannot be used as a proof premise.

Coverage error under score, forward-solver, and finite-time error

Open problem

Fix integers d,n≥1, parameters p,s,a,R,σ>0, a credibility error γ∈(0,1), and a continuous schedule β:[0,T]→(0,∞) with T>0. Let Θs(R)={θ∈Rd:∑j=1dj2sθj2≤R2},Ap=diag⁡(1−p,2−p,…,d−p). Observe Yi=Apθ+εi, 1≤i≤n, with independent εi∼N(0,σ2Id). Use the proper Gaussian prior Π0=N(0,diag⁡(j−1−2a)j=1d), and let Πn(⋅∣Y) be its exact posterior under the stated forward operator and noise law. Let mn(Y) be the posterior mean and let rn,γ(Y) be the unique radius for which the Euclidean ball Cn,γ(Y)={u∈Rd:∥u−mn(Y)∥2≤rn,γ(Y)} has posterior probability 1−γ. Define the exact frequentist coverage cn,γ(θ)=Pn,θ{θ∈Cn,γ(Y)} and its baseline error δn,γ0=sup⁡θ∈Θs(R)∣cn,γ(θ)−(1−γ)∣.

For a deterministic numerical matrix A^n∈Rd×d with δA≥0 and ∥A^n−Ap∥op≤δA, let Π^n(⋅∣Y) be the Gaussian posterior formed with A^n and the same prior and noise variance. Write p^n,tY for the density obtained by applying the forward variance-preserving diffusion dXt=−12β(t)Xt dt+β(t) dWt to X0∼Π^n(⋅∣Y), and set s^n,tY=∇log⁡p^n,tY. A jointly Borel learned score field sn,tY is required to satisfy sup⁡θ∈Θs(R)EY∼Pn,θ[1T∫0T∫Rd∥sn,tY(x)−s^n,tY(x)∥22p^n,tY(x) dx dt]≤εs2. For h=T/K, define the reverse-time Euler chain by Z0∼p^n,TY and, for k=0,…,K−1, Zk+1=Zk+h[12β(T−kh)Zk+β(T−kh)sn,T−khY(Zk)]+hβ(T−kh) ζk, where the ζk are independent N(0,Id) vectors independent of Z0 and the observations. Draw M independent copies of this chain conditionally on Y and denote their terminal values by X(1),…,X(M). Let Xˉ=M−1∑iX(i), let r^ be the empirical 1−γ quantile of {∥X(i)−Xˉ∥2}i=1M (the smallest order statistic whose empirical cumulative mass is at least 1−γ), and put C^n,K,M(Y)={u:∥u−Xˉ∥2≤r^}. Suppose the exact credible-ball boundary satisfies the uniform margin condition sup⁡θ∈Θs(R)Pn,θ(∣∥θ−mn(Y)∥2−rn,γ(Y)∣≤u)≤Cacuκ(0<u≤u0) for fixed Cac,u0>0 and κ>0. Determine whether a minimax-sharp nonasymptotic function Φ exists uniformly over all such score fields and, if it does, find it as a function of d,n,p,s,a,R,σ,T,γ,Cac,u0,κ,δA,εs,K−1, and M−1/2 such that sup⁡θ∈Θs(R)∣Pn,θ,sampler{θ∈C^n,K,M(Y)}−(1−γ)∣≤δn,γ0+Φ, with matching lower bounds that identify when Φ→0. The probability includes observation noise and sampler randomness. The target concerns the additional coverage error introduced by the approximate forward operator, learned score, finite reverse discretization, and finite posterior sample; it does not assume that the exact Bayesian credible ball is already calibrated on every truth class.

Status

As of 2026-10-19, the full original minimax question is not resolved by this review. A specific obstruction is now proved: with d=n=R=σ=T=1, β=1, γ=1/4, and zero numerical-operator and integrated score errors, changing the score only at the deterministic Euler grid times can make empirical-ball coverage at truth zero tend to zero along M=K→∞. The required uniform boundary-margin condition still holds, and the exact credible-ball baseline error is strictly smaller than 3/4. Every valid bound therefore has a positive limiting additional-error term along this admissible scalar path; zero integrated score error and a refined solver grid do not by themselves imply vanishing additional coverage error.

This is a partial answer, not a solution of the full parameter-dependent minimax problem. The original question asks for a sharp function and the regimes in which it vanishes; it does not require it to vanish along every path on which the listed approximation parameters tend to zero. Constant upper bounds exist because every coverage probability lies in [0,1]. The proved scalar obstruction does not determine the optimal bound across all original dimensions, sample sizes, credibility levels, margins and error parameters, or characterize every possible vanishing regime. Those parts of the unchanged original formulation remain unanswered here.

The cited Gaussian inverse-sequence papers address exact credible-set coverage and prior/truth dependence. Narnhofer et al.'s conformal error-quantile coverage concerns a different set and does not supply the requested Bayesian credible-ball perturbation bound. No global novelty claim or formulation-specific solution is inferred from the absence of that joint result in these sources.

Used by

Nothing in the library uses this result yet.

Dependency tree · 0 levels

Nothing. This result depends on no other item in the library.

Sources