Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Ideal and finite-simulation synthetic likelihood

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment and let S:X→Rd be a statistic, meaning a measurable map to its declared Borel target as in Statistics and estimators, where d≥1 is finite. Expectations are Lebesgue integrals under Pθ as in Expectation of a nonnegative or integrable random variable, and variances and covariances use centered second moments as in Moments, variance, and covariance on a probability space. For every θ∈Θ, assume Eθ ⁣[∥S∥22]<∞,∥x∥22:=∑j=1dxj2. The binding mean and summary covariance are the pointwise-defined quantities bj(θ):=Eθ[Sj],Σjk(θ):=Eθ ⁣[(Sj−bj(θ))(Sk−bk(θ))](1≤j,k≤d). Each covariance entry is finite since 2∣uv∣≤u2+v2 and the coordinates are square-integrable. The matrix is symmetric and positive semidefinite because for a∈Rd, aTΣ(θ)a=Eθ ⁣[(aT(S−b(θ)))2]≥0. No measurability or continuity of θ↦b(θ) or θ↦Σ(θ) follows from these pointwise definitions.

Assume AC (The Axiom of Choice). If Σ(θ) is positive definite, the ideal Gaussian synthetic likelihood for observed data y∈X is the Gaussian density evaluated at its summary, as supplied by Multivariate normal law, including singular covariance and A positive-definite multivariate normal law has its Gaussian density, gSL(y∣θ):=φd ⁣(S(y);b(θ),Σ(θ))=(2π)−d/2det⁡(Σ(θ))−1/2exp⁡ ⁣[−12(S(y)−b(θ))TΣ(θ)−1(S(y)−b(θ))]. Here φd( ⋅ ;m,Σ) is the Lebesgue density of Nd(m,Σ). If Σ(θ) is singular, this positive-definite-covariance density is not defined by this item.

Let Qθ:=Pθ∘S−1 be the pushforward law of the statistic under Pθ as in Law or distribution of a random element. For m≥2, let S1,…,Sm be IID simulated summaries with common law Qθ, where IID means a common law and mutual independence as in Identical distribution and IID families. Set Sˉm:=m−1∑i=1mSi,Σ^m:=(m−1)−1∑i=1m(Si−Sˉm)(Si−Sˉm)T. The finite-simulation plug-in synthetic likelihood is the random quantity g^SL,m(y∣θ):=φd(S(y);Sˉm,Σ^m). when Σ^m is positive definite, and is unavailable otherwise. The finite plug-in quantity is a function of simulated summaries; it is not defined as an unbiased estimator of the ideal Gaussian density.

The exact experiment’s likelihood density, when the experiment is dominated as in Dominated statistical experiments and given a pointwise density as in Likelihood densities, and this Gaussian summary approximation are different objects. The latter density-selection interface assumes AC and does not assert a common exceptional null set across an arbitrary parameter set; the present definition adds no parameter-indexed measurability. This definition makes no claim that the actual summary law is Gaussian, that gSL equals an exact likelihood, or that it yields posterior calibration, consistency, a Bernstein–von Mises theorem, or coverage. No optimizer or optimizer convergence property is included.

Remarks

If a positive-definite covariance matrix varies differentiably in a real matrix direction H, Jacobi’s formula gives Ddet⁡(Σ)[H]=det⁡(Σ)tr⁡(Σ−1H) by The determinant differential is Ddet⁡(A)[H]=tr⁡(adj⁡(A)H) at every matrix, and Jacobi's formula holds on the invertible locus. This differentiates the determinant factor only; this definition assumes no differentiability of the binding mean or covariance.

A positive-definite matrix has the unique Cholesky factor used in numerical evaluation by A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique. This factorization does not ensure that a finite-simulation covariance is positive definite.

Depends on

Used by

Dependency tree · two levels

65 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