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.
Misfit evidence and the potential posterior law
Definition
Let be a separable real Banach space with its norm topology, a Borel forward-map domain, and a Borel probability measure on with . Write for its restriction to , so for . Let be a measurable data space. A likelihood potential is a function that is measurable from to , where is the trace of on . Viewing via the inclusion , it is also product-measurable as an extended-real-valued map because for every Borel set , is measurable by the definition of the trace sigma-algebra. Here is allowed and is excluded; set . The scalar map on this range is continuous at finite , and is continuous at : given , the limit supplies such that implies , and the order-topology neighborhood maps into . Hence it is Borel, so , , is product-measurable by composition, and each section is nonnegative and measurable. Define its evidence by
For each fixed with , define the normalized fiberwise update on by No normalized fiberwise update is defined by this formula when or .
For a data-indexed claim, an observation model and its version convention must also be specified. In the dominated case, let be a proper probability kernel from to , let be a sigma-finite measure on , and suppose for every and . Then is the density of the prior-predictive data law with respect to ; a data-indexed conditional-law version uses when and the prior when is zero or infinite. These filled fibers have zero prior-predictive mass, and their chosen values are not normalized fiberwise updates. More generally, for a proper Bayesian model with standard-Borel parameter space and data space (each measurably isomorphic to the Borel space of a Polish space), the Axiom of Choice guarantees a data-indexed posterior kernel; its values are unique as probability measures outside one data-marginal-null set, and values on that null set remain version choices. The dominated construction is choice-free; the separate standard-Borel existence branch assumes the Axiom of Choice.
Definition references
A measurable space consists of a set and a sigma-algebra.
Joint measurability uses the product sigma-algebra.
The potential takes extended real values, allows positive infinity, and excludes negative infinity.
The extended real line carries its order-topology Borel sigma-algebra.
A function is measurable when preimages of measurable target sets are measurable in the source.
Every section of a product-measurable extended-real function is measurable.
Composing a measurable map with a Borel outer map preserves measurability.
The real exponential is continuous on finite inputs.
A continuous scalar map has Borel preimages of Borel sets.
A probability kernel has measurable evaluations and probability sections at every parameter.
The dominating data measure is sigma-finite.
Standard Borel means measurably isomorphic to a Polish space with its Borel sigma-algebra.
The Axiom of Choice states that every family of nonempty sets has a choice function.
Dashti and Stuart, §3.2 and §4.1, full lecture notes
Latz, §2.2, Theorem 2.5 and its proof in Appendix B (printed p. 23), full paper
Depends on
- A Borel prior concentrated on a forward-map domain
- Measurable spaces and measurable sets
- The product sigma-algebra and its finite iterates
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- The Borel sigma-algebra on the extended real line
- A measurable function between measurable spaces
- Every section of a product-measurable function is measurable
- Composition with a Borel measurable outer map preserves measurability
- The exponential function is strictly increasing
- The exponential tends to $+\infty$ at $+\infty$ and to $0$ at $-\infty$
- A continuous map has Borel preimages of Borel sets
- Bayesian model as a prior and sampling kernel
- Measure kernel and probability kernel
- Finite, sigma-finite, and semifinite measures
- Evidence normalizer and fiberwise posterior update
- Fiberwise posterior propriety is equivalent to finite positive evidence
- Bayes formula for dominated kernels
- Bayesian posterior as a regular conditional law
- Conditional law given a random element
- Standard Borel spaces
- The Axiom of Choice
- Standard-Borel Bayesian posterior kernel exists
Used by
- Conditional flow matching for inverse posteriors Algorithm
- Prior-preserving Crank–Nicolson sampler Algorithm
- A non-Gaussian posterior can have different MAP and mean Counterexample
- A nonintegrable error envelope destroys the linear Hellinger rate Counterexample
- Equal posterior means do not control the full posterior Counterexample
- Learned inverse estimators and reconstruction targets Definition
- Small-ball MAP conventions and Cameron–Martin relative modes Definition
- A proper Gaussian likelihood gives a proper posterior Example
- A stable two-point potential gives a Lipschitz posterior Example
- A zero-evidence fiber has no normalized fiberwise update Example
- Finite-dimensional small-ball MAP equals the density mode Example
- Likelihood-free conditional flow matching without an MH correction Example
- The posterior mean need not be a small-ball MAP Example
- Population regression and exact-flow meaning of conditional flow matching Lemma
- Dimension-uniform conditional flow error for function-valued Bayesian posteriors Open problem
- An exact triangular transport disintegrates to the posterior Theorem
- Finite linear Gaussian inverse posterior with singular prior covariance Theorem
- Function-space posterior propriety from a common lower envelope Theorem
- Gaussian posterior small-ball ratios and the Onsager–Machlup functional Theorem
- Hellinger error bound for posterior potential discretization Theorem
- Hellinger stability of function-space posteriors under data perturbations Theorem
- pCN stationary mean acceptance tends to one at small scale Theorem
- The pCN accept-reject kernel preserves the posterior Theorem
Dependency tree · two levels
73 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
- M. Dashti and A. M. Stuart, The Bayesian Approach to Inverse Problems (full lecture notes, arXiv:1302.6989) (standard reference, not scraped)
- J. Latz, On the Well-posedness of Bayesian Inverse Problems, SIAM/ASA Journal on Uncertainty Quantification 8 (2020) (standard reference, not scraped)