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.
Design-indexed dominated inverse experiment
Definition
Let be a finite set of design indices, let and be measurable spaces, let be a probability measure on , and let be a sigma-finite measure on . For each , let be a probability kernel from to with a specified nonnegative jointly measurable density relative to , so Define the prior-predictive density . For each datum with , define the posterior probability measure The dominated-kernel Bayes formula makes the observation law and identifies as a posterior version on these positive finite evidence fibers. No posterior formula is assigned on fibers with zero or infinite evidence; their prior-predictive probability is zero.
Definition references
A finite set has a finite cardinality.
A measurable space consists of a set and a sigma-algebra.
A probability measure has total mass one.
Sigma-finiteness is witnessed by a countable cover with finite measure.
A probability kernel has measurable evaluations and probability-measure rows.
Joint measurability is with respect to the product sigma-algebra.
A measurable function has measurable preimages.
A posterior is a regular conditional law of the parameter given the observations.
Depends on
- Measurable spaces and measurable sets
- The cardinality $\lvert A\rvert$ of a finite set
- Probability measures and probability spaces
- Measure kernel and probability kernel
- Finite, sigma-finite, and semifinite measures
- The product sigma-algebra and its finite iterates
- A measurable function between measurable spaces
- Bayes formula for dominated kernels
- Bayesian posterior as a regular conditional law
Used by
- Finite-candidate information design Algorithm
- Expected information gain under a wrong operator does not identify the operator-parameter pair Counterexample
- Expected information gain Definition
- Information gain on a singular prior support Example
- Repeated measurements with correlated noise Example
- Sensor placement along a high prior-variance direction Example
- Expected information gain is joint relative entropy Theorem
Dependency tree · two levels
31 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
- Kathryn Chaloner and Isabella Verdinelli, Bayesian Experimental Design: A Review, Statistical Science 10(3) (1995), 273–304 (standard reference, not scraped)
- David J. C. MacKay, Information-Based Objective Functions for Active Data Selection, Neural Computation 4(4) (1992), 590–604 (standard reference, not scraped)