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 Gaussian synthetic likelihood can change an exact posterior

Statement refuted

An identifiable discrete summary model's Gaussian synthetic likelihood need not preserve the exact posterior, even when the ideal Gaussian uses the exact first two summary moments.

Facts & Assumptions

Given: Let Θ={0,1} with equal prior mass and let the summary/data space be {0,1,2,3} with its power-set sigma-algebra. Regard the identity summary as a map into (R,B(R)). Define the two sampling laws by y0123P0(y)6/246/246/246/24P1(y)5/249/243/247/24 and observe y=1. Define the exact posterior from this likelihood, and define the synthetic-likelihood posterior by normalizing the ideal Gaussian synthetic likelihood against the same prior.

[F1]

An exact target is Πx(A)=Zx−1∫Aℓx dΠ0 for an explicitly measurable likelihood and finite positive evidence. Exact inferential targets and approximation chains

[F2]

A statistic is a measurable map to a declared measurable target, and the ideal synthetic likelihood is the Gaussian density at the observed summary using the exact summary mean and covariance when that covariance is positive definite. Statistics and estimators A measurable function between measurable spaces The Borel sigma-algebra of a topological space Ideal and finite-simulation synthetic likelihood

[F3]

The identity estimand is identifiable when equal sampling laws imply equal parameter values. Parametric statistical models Observational equivalence Identifiability of an estimand

[F4]

Under the Axiom of Choice, positive-definite summary covariance supplies the ideal Gaussian density; no equality with the exact summary law is part of that definition. The Axiom of Choice Ideal and finite-simulation synthetic likelihood

[F5]

Total variation is the event-probability supremum. Total variation distance for probability laws

Counterexample

Given: The finite model and prior in Facts & Assumptions.

1.1givenF2F3algebra

Each row is nonnegative and sums to one. The laws differ because P0({1})=1/4 whereas P1({1})=3/8; hence the identity estimand is identifiable by [F3]. The finite identity summary is measurable because the source and target carry their stated power-set and Borel sigma-algebras.

1.2F2F4givenalgebra

Under P0, E[S]=(0+1+2+3)/4=3/2 and E[S2]=(0+1+4+9)/4=7/2. Under P1, the corresponding weighted sums are (9+6+21)/24=3/2 and (9+12+63)/24=7/2. Thus both variances equal 7/2−(3/2)2=5/4>0, so the one-dimensional covariance is positive definite and the ideal Gaussian synthetic likelihood is defined by [F2], [F4].

2.1F1F2step 1.2algebra

The exact likelihoods at y=1 are 1/4 and 3/8, so the equal-prior exact posterior mass at θ=1 is (3/8)/(1/4+3/8)=3/5. The ideal Gaussian synthetic likelihoods coincide because their means and variances coincide. Their common positive value cancels in normalization against the equal prior, so the synthetic-likelihood posterior has mass 1/2 at θ=1.

3.1F5step 2.1algebra∎

The two posterior measures differ on event {1} by ∣3/5−1/2∣=1/10, so their total-variation distance is at least 1/10 by [F5]. Thus matching the first two moments does not remove this posterior target bias.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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