Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pass
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 Θ={0,1} have equal prior mass, let Y={0,1}2 have the power-set sigma-algebra, and for parameter θ define Pθ{(z,w)}=121{z=θ}. Take S(z,w)=w, observe y=(0,0), and use zero tolerance ϵ=0.

[F1]

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

[F2]

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

[F3]

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

[F4]

A fixed measurable likelihood with finite positive evidence defines the exact target by normalizing its prior-weighted integral. Exact inferential targets and approximation chains

[F6]

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.

1.1givenF5construct

Put the discrete metric on Θ and Y. A Cauchy sequence is eventually constant because its tail has pairwise distances below 1/2; 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].

1.2F3given

The event A={(z,w):z=0} has probabilities P0(A)=1 and P1(A)=0. Thus the two full-data laws are not observationally equivalent, and the identity parameter is identifiable by [F3].

1.3F4givenalgebra

The full-data likelihood at y=(0,0) is 1/2 under θ=0 and 0 under θ=1. Its prior evidence is (1/2)(1/2)+(1/2)0=1/4, so [F4] gives exact posterior Πy=δ0.

2.1F2step 1.1givenalgebra

For each θ, exactly two pairs (z,w) have z=θ, each with mass 1/2, so Pθ is a probability law; because the parameter sigma-algebra is also the power set, the displayed family is a probability kernel. The map S is nonconstant, since S(0,0)=0 and S(0,1)=1, and it is measurable because every subset of the finite source is measurable.

2.2F1givenstep 1.1algebra

The summary law is Bernoulli(1/2) under each parameter. The zero-tolerance ball in R centered at S(y)=0 is {0}, and each parameter has acceptance probability 1/2, so prior-predictive acceptance is 1/2>0. Conditioning the equal prior on this event leaves ΠABC,0{θ=0}=(1/2)(1/2)1/2=1/2 by [F1].

3.1F6step 1.3step 2.2algebra∎

On event {θ=0} the exact posterior gives mass 1 and the zero-tolerance ABC target gives mass 1/2. By [F6], their total-variation distance is at least 1/2. The full model is identifiable, but the nonconstant summary has parameter-independent law and its ABC target remains the prior.

Depends on

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