Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generatedprecheck pendingverified 2026-10-23 (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.

Failure-aware fluid UQ callback and certified sampling budget

Definition

Fixed-size callback mode. Inputs are a finite integer N≥2, the specified input law μ and exact/numerical observable interface, an IID sampler for μ, and a solver callback with a supplied finite computational budget for each invocation. The callback is total, with a measurable success set and measurable successful outputs: for every input θ it returns either solver-failed or a numerical state sh(θ) with finite real observable qh(θ)=Jh(sh(θ)), together with a finite b(θ)≥0 and its supplied pointwise certificate ∣Y(θ)−qh(θ)∣≤b(θ). A stated failure result is allowed when the finite budget is exhausted; the procedure asserts no universal numerical solver termination theorem.

Draw θ1,…,θN independently with law μ and call the callback exactly once on each draw, including the draws after any earlier failure. If any call fails, return incomplete with the failed indices and the collected outputs, and no IID mean/error certificate for μ. Never delete, replace or resample failed cases. If all calls succeed with finite arithmetic values, set qˉh=N−1∑i=1Nqi,sN2=(N−1)−1∑i=1N(qi−qˉh)2,se^N=sN/N,bˉ=N−1∑i=1Nbi. Return N,qˉh,sN2,se^N,bˉ and complete; if sN2=0, also return zero-sample-variance. This diagnostic asserts neither a deterministic population nor zero estimation error. The sample mean of certificates bˉ is a diagnostic, not a rigorous upper bound on Eb. The plug-in standard error has only the moment/asymptotic interpretation supplied by the sampling theorem, not an exact confidence guarantee. If callback failure has positive μ-probability, conditioning on complete changes the input law and does not certify IID sampling of the original μ.

Optional certified-budget mode. This retains a separate finite-sample guarantee when externally proved global bounds are available. Inputs are the numerical output law Yh, a total oracle returning independent finite real samples of that law, finite ϵb,Vh≥0, ϵs>0, δ∈(0,1), and a certificate that Y∈L1, Yh∈L2, ∣EYh−EY∣≤ϵb, Var⁡(Yh)≤Vh, and the oracle has that IID law. The algorithm does not validate a supplied mathematical certificate. Apply the input guards in this order: if the certificate or oracle is absent, return not-certified; if both are supplied but any of ϵb,Vh,ϵs,δ is nonfinite or outside its stated admissible range, return invalid-input. Otherwise set N:=max⁡{1,⌈Vh/(δϵs2)⌉}. Request exactly N samples and return conditional-budget, N, their mean θ^h,N, tolerance ϵb+ϵs, failure bound δ and RMS upper bound Vh/N+ϵb2, conditional on the certificate. If an oracle invocation instead fails its total-return contract, return incomplete and no guarantee. This mode permits N=1 but then supplies no sample variance or plug-in standard error. When implemented through the callback mode, its certificate additionally requires callback success μ-almost surely; the probability guarantee is not conditional on deleting failed inputs.

Neither mode infers a bias/variance certificate from a sample or mesh trend. Numerical bias, physical model discrepancy and measurement uncertainty are different quantities; the latter two are absent unless separately quantified. Both tolerance allocations use the declared observable unit, variance bounds use its square and δ is dimensionless. The operation counts concern the specified finite callback/oracle contract, not uncontrolled floating-point error.

Depends on

Dependency tree · 2 levels

Sources