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.
Unknown operators, model mismatch, and robustness limits
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Conditional Distributions and Regular Conditional Probability
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inverse maps, identifiability, and stability
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Logical flowchart
3 · Definitions, theorems and proofs
Operator, noise-law, and prior-support mismatch
Definition
Let and be metric spaces, let be a nonempty class of admissible truths, and let assign each truth its recovery target in a metric space . Let index forward maps ; in this definition an operator means such a forward map, and linearity is not assumed. A specified set records which truth/operator pairs are admissible; no full-product assumption is made. Equip with a sigma-algebra and an addition operation such that every translation is measurable. A noise law is a probability measure on . For each admissible pair , the observation random element on the probability space is , and its sampling law is The translation measurability assumption makes this law a probability measure.
For a true specification with and a specified working operator and noise law , there is operator mismatch at the truth when , and there is noise-law mismatch when . A working statistical model is a metric index space , a family of sampling laws on the same data space, and a prior probability measure on a sigma-algebra containing every open metric ball. The statistical model is misspecified for true observation law when . If a true model index is specified, there is a prior-support mismatch at when some open ball , , has . These are distinct properties; an operator or noise-law mismatch need not by itself make the statistical model misspecified or exclude the true index from the prior's support. This definition makes no assertion about posterior existence or convergence.
Definition references
Metric parameter and data spaces, admissible truths, forward maps, and metric recovery targets
Metric spaces and metric balls
Measurable data and index spaces
Noise laws and priors as probability measures
Sampling laws indexed by parameters
An observation random element is a measurable map
The law is a probability measure
Dashti and Stuart, The Bayesian Approach to Inverse Problems
Remarks
InverseBench's reported algorithm comparisons and prior-shift observations are empirical for its selected tasks, datasets, and tuning. Its reported setup assumes exact forward models and lists robustness to forward-model mismatch as future work; these observations do not establish a general robustness theorem.
Equal observation laws force a metric-risk lower bound
Statement
Let be a metric target space and let be a sigma-algebra on . Let , , be two admissible truth/operator/noise specifications on one measurable data space , with sampling laws and targets . Assume the metric-loss sections are -measurable. Let be one randomized decision rule from to , used under both specifications, and define its expected metric risk by If and , then Each risk is an extended nonnegative integral; deterministic measurable estimators are included as point-mass decision kernels. This theorem makes no assertion when the observation laws differ, and quantitative robustness requires a separately established stability modulus.
Statement references
Facts & Assumptions
Given: Two admissible specifications with sampling laws on , one randomized decision kernel from to , , and .
Operator, noise-law, and prior-support mismatch: each admissible truth/operator/noise specification defines its sampling law as a probability measure on the common data space.
Inverse-problem models and solution classes: each admissible truth has a target in the metric target space .
Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric: is symmetric and satisfies for all .
Nonnegativity of a metric is a consequence of the other axioms, not an axiom: every metric distance is nonnegative.
Loss functions and risk: a randomized decision rule is a probability kernel.
Additivity of the nonnegative Lebesgue integral: integrals of sums of nonnegative measurable functions equal the sum of their extended nonnegative integrals.
Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and homogeneous under nonnegative finite scalars.
The nonnegative Lebesgue integral The nonnegative integral agrees with the simple integral on simple functions The integral of a nonnegative simple function: for a probability measure on a measurable space , the constant function is simple and has integral .
A randomized procedure has a measurable action law: if is a nonnegative measurable loss section and is a probability kernel, then is measurable.
Loss functions and risk: risk is the outer integral of the kernel-averaged nonnegative measurable loss under the sampling law; a deterministic measurable estimator is included as a point-mass kernel.
Proof
By [F2], are points of . For every and , [F3] gives . Integrating this pointwise inequality against the probability measure , using nonnegativity in [F4], monotonicity in [F7], total mass one in [F8], the constant integral identity in [F9], symmetry in [F3] to write , the probability-kernel property in [F5], and additivity in [F6], yields . The integrands are measurable by Given and nonnegative by [F4].
The inner loss functions of are measurable by [F10], so we may integrate step 1.1 under the common law . By [F11], these outer integrals are and . Monotonicity and additivity give . By [F1], is a sampling law; by [F8] and [F9], the left side is . Each risk is nonnegative by [F4] and [F11]. If , both risks are finite and their sum is less than , contradicting the preceding inequality. Hence , including the case of an infinite risk.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Youngsoo Baek, Wilkins Aquino, and Sayan Mukherjee, Generalized Bayes Approach to Inverse Problems with Model Misspecification
- Nada Cvetković, Han Cheng Lie, Harshit Bansal, and Karen Veroy, Choosing Observation Operators to Mitigate Model Error in Bayesian Inverse Problems
- Masoumeh Dashti and Andrew M. Stuart, The Bayesian Approach to Inverse Problems
- Hongkai Zheng et al., InverseBench: Benchmarking Plug-and-Play Diffusion Priors for Inverse Problems in Physical Sciences
- Maxim Raginsky, Minimax lower bounds, §1, Lemma 1 and complete proof, PDF pp. 3–5
- John Duchi, Lecture Notes on Statistics and Information Theory, Chapter 8, §§8.1–8.3