Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedverified 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.

Conditional flow matching for inverse posteriors

Definition

Assume the Axiom of Choice. Let d,m,n,B≥1, let η be a reference probability on Rd, and let π be the proper joint law of an unknown X1∈Rd and data Y∈Rm in a specified Bayesian inverse model. Write πY for the data marginal and πy for a posterior-kernel version of the conditional law of X1 given Y=y. Assume ∫Rd×Rm∣x1∣2 π(dx1,dy)+∫Rd∣x0∣2 η(dx0)<∞. Choose a jointly measurable parameterized vector-field family vθ:[0,1]×Rd×Rm→Rd, with parameter set Θ⊆Rp for some p≥1, whose candidates have finite population squared loss under the training law below.

Declared inputs. Supply independent sampling routines for Unif⁡[0,1], η, and π; here Unif⁡[0,1] is Lebesgue probability on the unit interval. Supply an initialiser Init returning a parameter in Θ or failure; an optimizer update callable Update(k,θ,L^n,Dn) returning a parameter in Θ or failure, with each call counting as one optimizer step; a named stopping statistic callable S(k,θ,L^n,Dn) returning a finite real value when evaluation succeeds; a finite step budget M≥1 and tolerance εopt>0; a flow-check callable; and a numerical ODE solver with a declared finite step or tolerance budget h. Every callable must return its specified value or a failure status in finite time. Any randomization used by these callables is part of the declared input.

Training and optimizer instructions. Draw n independent triples (ti,X0i,(X1i,Yi))∼Unif⁡[0,1]⊗η⊗π, and form Xti=(1−ti)X0i+tiX1i and Vi=X1i−X0i. Let Dn=((ti,Xti,Yi,Vi))i=1n and evaluate the empirical squared loss L^n(θ)=1n∑i=1n∣vθ(ti,Xti,Yi)−Vi∣2. If sampling fails, return sampling-failed. Otherwise call Init; if it fails or returns a parameter outside Θ, return optimizer-failed with no fitted field. Set k=0 and repeat the following steps in order: evaluate L^n(θk) and S(k,θk,L^n,Dn); if either evaluation fails or either value is nonfinite, return optimizer-failed with no fitted field; if S≤εopt, stop with status criterion-met; if k=M, stop with status budget-exhausted; otherwise call Update(k,θk,L^n,Dn), returning optimizer-failed with no fitted field if the call fails, returns a parameter outside Θ, or yields a nonfinite value, and then set θk+1 to its output and increase k by one. For either successful stopping status, return v^=vθk, its achieved training loss, the last value of S, k, M, εopt and the optimizer status. A finite-data stopping status does not certify v^=v∗.

The population least-squares target is the conditional-expectation class v∗(t,x,y)=E[X1−X0∣σ(t,Xt,Y)] coordinatewise, evaluated at (t,x,y) through a chosen measurable representative. A conditional expectation is only an almost-sure equivalence class, so this formula does not specify an off-support pointwise extension.

Flow and sampling instructions. For a query datum y, call the flow checker on v^ and the data-parameter domain containing y. It returns pass only when it certifies all hypotheses of the ODE flow lemma, including joint continuity and the integrable global spatial-Lipschitz and origin-growth bounds on compact data-parameter sets containing y. If it does not return pass, return field-regularity-failed with the optimizer record and no terminal samples. Otherwise, for j=1,…,B, draw independent Z0j∼η and call the declared solver to integrate on 0≤t≤1 Z˙tj=v^(t,Ztj,y),Z0j, with budget h. Record the returned finite endpoint as the terminal approximation Z^1j only when the solver reports success; treat a success response with a nonfinite endpoint as a failed integration. Also record each status and any certified solver error estimate, marking an unavailable estimate unquantified. Continue through all B calls after a solver failure. Return the successful terminal approximations and all per-call records, together with the field and optimizer records; the overall status is completed if every integration succeeds and solver-failed otherwise. A sampling-call failure returns sampling-failed and the records collected so far.

If the exact triangular flow of v^ were known to satisfy T#(η⊗πY)=π, the exact transport theorem would imply Ty#η=πy for πY-almost every y. Finite regression loss, optimizer termination, and solver success alone do not establish this joint pushforward identity or exact posterior sampling. Record posterior model, discretization, kernel, burn-in, Monte Carlo and solver components under the declared posterior-computation error budget when applicable. The budget does not supply a learned-flow regression or optimizer-error estimate; report those separately as measured or certified quantities, and mark unavailable quantities unquantified rather than zero.

Definition references

Facts & Assumptions

Given: AC; proper joint posterior law π on finite-dimensional unknown/data spaces; independent reference law η; finite second moments; a chosen measurable vector-field family with finite squared population loss; finite optimizer and ODE budgets; and a numerical solver that returns either an endpoint or an explicit status.

[A1]

AC is assumed for the conditional-expectation projection and standard-Borel posterior-kernel interfaces. Its implications include Countable Choice and Dependent Choice for the flow lemma. The Axiom of Choice, AC implies DC implies countable choice, Conditional expectation is the l2 orthogonal projection, Misfit evidence and the potential posterior law

[F1]

In a proper Bayesian model, π is the joint unknown/data law and πy is a version of the posterior conditional law; values on a πY-null set are not fixed by the conditional identity. Misfit evidence and the potential posterior law, Conditional law given a random element

[F2]

For a square-integrable target, the conditional expectation given σ(t,Xt,Y) is the unique L2 minimizer of the population squared prediction loss, coordinatewise. Conditional expectation given a sigma algebra, Conditional expectation is the l2 orthogonal projection

[F3]

Under AC, a conditional expectation given a random element in a standard Borel space has a measurable representative as a function of that conditioning element; the identity with the conditional expectation holds almost surely. Conditional expectation as a measurable function of the conditioning variable, Finite-dimensional Euclidean space with its Borel sigma-algebra is standard Borel

[F4]

Independent sampling from Unif⁡[0,1], η, and π gives the stated product training law; product probabilities have the rectangle formula, and the expectation of a finite sum of integrable losses is the sum of their expectations. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, The Lebesgue integral is linear on L1(μ)

[F5]

Under [A1], a fitted field jointly continuous in (t,x,y) and satisfying the ODE lemma's compact-parameter-uniform integrable global spatial-Lipschitz and origin-growth bounds, holding almost everywhere in time simultaneously for all states and parameters in each compact set, has a unique global flow and a jointly continuous terminal map; these facts do not certify that its output law is the target. Global Lipschitz ODE flows and the C1 density formula

[F6]

If the exact triangular terminal map has joint pushforward π, its exact conditional fibers push η to πy for πY-almost every datum; this needs the joint identity as a separate hypothesis. An exact triangular transport disintegrates to the posterior

[F7]

The six-term posterior-computation budget is a telescoping ledger and supplies no learned-flow regression or optimizer bound. Posterior computation error budget

Depends on

Used by

Dependency tree · two levels

112 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