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.
A zero-evidence fiber has no normalized fiberwise update
Example
Let with its usual real Banach norm, let with the Borel subspace structure, and let the forward map be the constant map . Give the parameter the Borel probability for Borel . Take data space with the usual subspace metric, its power-set sigma-algebra and counting measure, and deterministic sampling kernel . Its density is for and for , with potential and . Thus but . At no normalized fiberwise update is defined; the data law assigns probability zero, so a posterior-kernel version may use the prior filler there or any other probability measure on . The finite-potential propriety theorem does not apply at .
Example references
The sufficient propriety theorem requires finite continuous potential sections.
A forward map is a map on an admissible truth set.
A prior on the forward domain has full measure on that domain.
A proper model uses a probability prior and sampling kernel.
A point mass assigns mass one to sets containing its point and zero otherwise.
The dominated formula fills zero-evidence fibers with the prior and gives a conditional law version.
A conditional kernel may be changed on a measurable data-marginal-null set.
Facts & Assumptions
Given: The finite parameter domain , the half-half prior, the constant forward map, the deterministic sampling kernel and its counting-measure density.
A prior on a forward domain is a Borel probability on with full mass on . A Borel prior concentrated on a forward-map domain
Evidence is the integral of the nonnegative likelihood section; the normalized update is defined only when that evidence is positive and finite. Misfit evidence and the potential posterior law
A proper Bayesian model consists of a probability prior and a parameter-measurable probability kernel. Bayesian model as a prior and sampling kernel
The Dirac set function gives mass one to sets containing its point and zero otherwise, and is a probability measure. The Dirac set function at a point, A Dirac set function is a probability measure
Counting measure on assigns finite sets their cardinality and infinite sets . Counting measure on an arbitrary set
Counting measure is a measure on the power-set sigma-algebra. Counting measure is a measure
A probability kernel has probability sections at every parameter and measurable evaluations. Measure kernel and probability kernel
In a dominated model, the evidence is the data-marginal density and the kernel with prior fillers on zero and infinite fibers is a conditional law version. Bayes formula for dominated kernels
A finite positive scaling of the zero likelihood measure cannot be a probability. Fiberwise posterior propriety is equivalent to finite positive evidence
Changing a data-indexed conditional kernel on a measurable data-marginal-null set preserves its conditional identities. Conditional law given a random element
The propriety theorem assumes every potential section in its specified data set is finite and continuous. Function-space posterior propriety from a common lower envelope
An inverse-problem forward map has metric parameter and data spaces, a nonempty admissible truth set, and a map defined on it. Inverse-problem models and solution classes
The product sigma-algebra is generated by measurable rectangles, and a map is measurable when preimages of target-measurable sets are measurable. The product sigma-algebra and its finite iterates, A measurable function between measurable spaces
Verification
Given: The hypotheses and conventions in the Statement.
The half-half set function is a probability: in any disjoint Borel sequence each of and occurs in at most one member, so the mass of the union equals the sum of the masses, and . Since , it is a prior on by [F1]. The constant map is a forward map on the nonempty truth set by [F12], and its restriction is measurable because every preimage is or . For each , is a probability measure by [F4], and every evaluation is measurable on finite ; hence [F7] makes a probability kernel. Thus [F3] gives a proper Bayesian model.
With counting measure on , the density is for both parameter values; its sum over is one, so it represents the stated kernel. The potential and density are jointly measurable: each singleton rectangle is measurable, so every subset of finite is a finite union of measurable rectangles by [F13]. Integrating the kernel against the half-half prior gives data law concentrated at , and the same density gives and . At , [F9] rules out any finite positive scaling of the zero likelihood measure as a probability. The potential equals on at this datum, so the finite-section hypothesis in [F11] fails.
The explicit dominated kernel from [F8] uses the normalized update at and prior filler at . The data law gives probability zero by step 2.1, so [F10] allows replacing that filler by without changing the conditional identities. Both fillers are probability measures on by [F4], but neither is obtained by normalizing the zero-evidence fiber.
Depends on
- Misfit evidence and the potential posterior law
- Function-space posterior propriety from a common lower envelope
- Inverse-problem models and solution classes
- A Borel prior concentrated on a forward-map domain
- The product sigma-algebra and its finite iterates
- A measurable function between measurable spaces
- Bayesian model as a prior and sampling kernel
- Measure kernel and probability kernel
- The Dirac set function at a point
- A Dirac set function is a probability measure
- Counting measure on an arbitrary set
- Counting measure is a measure
- Bayes formula for dominated kernels
- Conditional law given a random element
- Fiberwise posterior propriety is equivalent to finite positive evidence
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
69 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)