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 nonconstant summary can lose an identifiable parameter
Statement refuted
Full-data identifiability and nonconstancy of a summary do not imply that the summary retains information about the identifiable parameter or that the ABC target equals the exact posterior.
Facts & Assumptions
Given: Let have equal prior mass, let have the power-set sigma-algebra, and for parameter define Take , observe , and use zero tolerance .
For standard Borel parameter/data spaces and a positive acceptance event, the indicator ABC target is the prior-simulator law conditioned on the closed summary-tolerance ball. Approximate Bayesian computation and the tolerance-conditioned target
A probability kernel assigns a probability measure at each parameter and measurable event probabilities in the parameter; a statistic is a measurable map. Measure kernel and probability kernel Statistics and estimators
Observational equivalence means equality of the full sampling laws, and the identity estimand is identifiable when equivalent parameters must agree. Parametric statistical models Observational equivalence Identifiability of an estimand
A fixed measurable likelihood with finite positive evidence defines the exact target by normalizing its prior-weighted integral. Exact inferential targets and approximation chains
A finite discrete space is standard Borel when its discrete metric is complete and separable and its Borel sigma-algebra is its power set; is standard Borel because its Euclidean metric is complete and is countable and dense. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric Complete metric space: every Cauchy sequence converges in the space Separability: the existence of an at most countable dense subset Polish spaces are separable completely metrizable spaces Standard Borel spaces and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in is countably infinite The rationals embed densely in the reals
The TV distance is the supremum of event-probability differences. Total variation distance for probability laws
Counterexample
Given: The finite prior, model, summary, observation, and tolerance in Facts & Assumptions.
Put the discrete metric on and . A Cauchy sequence is eventually constant because its tail has pairwise distances below ; each finite space is separable since the whole finite set is a countable dense subset. Every subset is open, so the Borel sigma-algebra is the power set. Thus both are standard Borel by [F5]. The real target is standard Borel by [F5].
The event has probabilities and . Thus the two full-data laws are not observationally equivalent, and the identity parameter is identifiable by [F3].
The full-data likelihood at is under and under . Its prior evidence is , so [F4] gives exact posterior .
For each , exactly two pairs have , each with mass , so is a probability law; because the parameter sigma-algebra is also the power set, the displayed family is a probability kernel. The map is nonconstant, since and , and it is measurable because every subset of the finite source is measurable.
The summary law is Bernoulli under each parameter. The zero-tolerance ball in centered at is , and each parameter has acceptance probability , so prior-predictive acceptance is . Conditioning the equal prior on this event leaves by [F1].
On event the exact posterior gives mass and the zero-tolerance ABC target gives mass . By [F6], their total-variation distance is at least . The full model is identifiable, but the nonconstant summary has parameter-independent law and its ABC target remains the prior.
Depends on
- Approximate Bayesian computation and the tolerance-conditioned target
- The Borel sigma-algebra of a topological space
- Complete metric space: every Cauchy sequence converges in the space
- Estimands on a statistical model
- Exact inferential targets and approximation chains
- Identifiability of an estimand
- Measure kernel and probability kernel
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Observational equivalence
- Parametric statistical models
- Polish spaces are separable completely metrizable spaces
- Probability measures and probability spaces
- Separability: the existence of an at most countable dense subset
- Standard Borel spaces
- Statistical experiments
- Statistics and estimators
- Total variation distance for probability laws
- The rationals embed densely in the reals
- $\mathbb{R}$ and $\mathbb{R}^n$ for $n \ge 1$ with the Euclidean metric are complete, componentwise from the Cauchy criterion in $\mathbb{R}$
- $\mathbb{Q}$ is countably infinite
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
81 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
- Christian P. Robert, Jean-Marie Cornuet, Jean-Michel Marin, and Natesh S. Pillai, Lack of Confidence in Approximate Bayesian Computation Model Choice (2011) (standard reference, not scraped)
- Jarno Lintusaari et al., Fundamentals and Recent Developments in Approximate Bayesian Computation (2017) (standard reference, not scraped)
- Paul Fearnhead and Dennis Prangle, Constructing Summary Statistics for Approximate Bayesian Computation: Semi-automatic ABC (2012) (standard reference, not scraped)
- Michael G. B. Blum, Approximate Bayesian Computation: A Nonparametric Perspective (2010) (standard reference, not scraped)