Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Particle Gibbs extended target

Definition

Let (Θ,T) be a standard-Borel parameter space with a prior π0. Use common standard-Borel state spaces and a jointly measurable parameterized target/proposal family: the initial and transition target and proposal laws are probability kernels in θ and their state arguments, the potentials are jointly measurable, and the chosen Radon–Nikodym weight versions are jointly measurable. Thus θ↦γθ,T and θ↦ψθ are measure and probability kernels, and the SIR weights and normalizer are jointly measurable in (θ,U). The prior-kernel law π0(dθ)ψθ(du) is a probability measure by A prior and model kernel define a joint law.

Use the finite-horizon state path model and proposal support conditions in Feynman–Kac path targets and normalizers, Feynman–Kac path Radon–Nikodym weight, and Sequential importance resampling for Feynman–Kac path targets. Select the multinomial resampling branch, returning ancestor indices in sampled order. Residual resampling is not the labeled particle law used by this genealogical construction. Write γθ,T for the Feynman–Kac path measure at parameter θ and set Lθ=γθ,T(1). Assume 0<Lθ<∞ for π0-almost every θ, and C=∫Lθ π0(dθ),0<C<∞. For a fixed particle count N≥2, write U=(X01:N,A11:N,X11:N,…,AT1:N,XT1:N) for the full particle system and ancestor indices generated by Sequential importance resampling for Feynman–Kac path targets. Its forward probability law at parameter θ is ψθ(du). The algorithm defines the product normalizer estimate Z^T(U) and final normalized weights WT1(U),…,WTN(U); K is a terminal particle index. The path X0:TK means the states on the ancestral lineage of particle K, traced through the arrays A11:N,…,AT1:N.

More explicitly, relative to counting measure on ancestor arrays and the ordered SIR proposal-kernel integrals for the states, ψθ(du)=∏i=1Nνθ,0(dx0i)∏t=1T∏i=1N[Wt−1Ati(U)Rθ,t(Xt−1Ati,dxti)]. Each factor Wt−1Ati(U) is the categorical mass of that ancestor choice; no state transition density is assumed for the genealogical variant.

The genealogical particle Gibbs extended target is the measure φN(dθ,du,k)=C−1π0(dθ) ψθ(du) Z^T(u)WTk(u),k∈{1,…,N}. The selected state is (θ,X0:TK). The zero-weight fallback in the particle algorithm defines WT everywhere; when Z^T=0 the extended target assigns the configuration zero mass.

The measure is a probability and has the exact joint smoothing posterior as its selected (θ,X0:TK) marginal by The particle Gibbs extended target has the exact smoothing marginal ↗.

Conditional-version convention

All particle variables, indices, parameter and retained-path coordinates are standard Borel. Under AC, Disintegration of a joint law on standard borel spaces supplies everywhere probability-kernel conditional versions of this extended target. The explicit conditional-filter formulas below identify those versions only outside a measurable null set of retained parameter-path-lineage values. Fix a measurable full-measure set D on which the formulas are defined and normalized, intersected over the finitely many lineages and conditional updates. Reference paths are admitted through D, rather than through an assertion about arbitrary points of topological support. On its complement a particle Gibbs sweep leaves the retained state unchanged. This identity fallback is measurable and changes the kernel only on a posterior-null set. The factorization theorem establishes the required full-measure property; no pointwise validity for arbitrary Radon–Nikodym versions is asserted.

Depends on

Used by

Dependency tree · two levels

45 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