Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Finite-horizon SMC CLT classes and variance recursions

Definition

Fix a finite horizon T. At each 0≤t≤T, let πt be a probability law on a measurable particle space Θt. Let π~0 be an initial proposal with π0≪π~0, and fix υ0=dπ0/dπ~0. For 1≤t≤T, let kt be a probability kernel from Θt−1 to Θt, and put π~t(A)=∫Θt−1kt(x,A) πt−1(dx). Assume πt≪π~t and fix a nonnegative Radon–Nikodym version υt=dπt/dπ~t, so π~t(υt)=1. The BCS-41 sequential importance-resampling algorithm Sequential importance resampling for Feynman–Kac path targets is this scheme on path spaces when kt appends a proposal transition. Under the support and measurable versions of Feynman–Kac path Radon–Nikodym weight, its normalized incremental weight is υt=(Zt−1/Zt)Gtrt for t≥1, and υ0=G0ρ0/Z0 initially. The previous normalized target is already part of π~t; one does not multiply by the full earlier path-weight product again.

For a measurable vector function ϕ:Θt→Rd, write μ(ϕ)=∫ϕ dμ and Cov⁡μ(ϕ)=∫(ϕ−μ(ϕ))(ϕ−μ(ϕ))⊤ dμ, when the second moment is finite. Also write ktϕ(x)=∫ϕ(z)kt(x,dz) and Cov⁡kt(ϕ)(x)=∫(ϕ(z)−ktϕ(x))(ϕ(z)−ktϕ(x))⊤kt(x,dz).

The source recursive test classes are Φ0(d)={ϕ:π~0(∥ϕ∥2)<∞}, and, for t≥1, Φt(d)={ϕ: for some δ>0, π~t(∥υtϕ∥2+δ)<∞  and  x↦kt(υtϕ)(x)∈Φt−1(d)}. Assume 1∈Φt(1) for every t. This is the source theorem's explicit normalizing-weight condition. For the recursive post-resampling CLTs proved on this page, use the stronger classes Ψt(d). At t=0, let Ψ0(d) consist of the ϕ∈Φ0(d) for which π~0(∥υ0(ϕ−π0(ϕ))∥2)<∞ and π0(∥ϕ∥2)<∞. The initial normalizing denominator needs only its finite first moment π~0(υ0)=1. For t≥1, let Ψt(d) consist of the ϕ∈Φt(d) for which πt(∥ϕ∥2)<∞ and x↦Et(ϕ−πt(ϕ))(x)∈Ψt−1(d). Here Eth=kt(υth) is the operator defined below. Only target second moments are required: fixed-tail truncation supplies the conditional selection Lindeberg condition without a target higher-moment assumption. The recursive target moments supply the offspring variance at every earlier selection used in the induction. The source Φt conditions alone need not imply them. The source condition 1∈Φt and these recursive target moments are the stated hypotheses for the CLT induction; no higher initial normalizer moment is required.

Define the mutation covariance operators recursively. At time zero, V~0(ϕ)=Cov⁡π~0(ϕ). For t≥1, V~t(ϕ)=V^t−1(ktϕ)+∫Cov⁡kt(ϕ)(x) πt−1(dx). The weighted-estimator covariance is Vt(ϕ)=V~t ⁣(υt(ϕ−πt(ϕ))). For a measurable vector function h on Θt, define the forward operator from Θt−1 by Eth(x)=kt(υth)(x)=∫υt(z)h(z) kt(x,dz). For k<t, write Ek+1:t=Ek+1∘⋯∘Et; set Et+1:t to the identity operator. For multinomial offspring resampling set V^tmulti(ϕ)=Vt(ϕ)+Cov⁡πt(ϕ). For residual offspring resampling, let r(u)=u−⌊u⌋. When ct=π~t(r(υt))>0, define the formal source candidate Rtcand(ϕ)=π~t ⁣(r(υt)ϕϕ⊤)−π~t(r(υt)ϕ) π~t(r(υt)ϕ)⊤ct. Set Rt=Rtcand and V^tres=Vt+Rt only when π~t(υt∈{1,2,…})=0; then ct>0 and the finite-sample floor discontinuities are avoided. If υt=1 π~t-almost everywhere, put Rt=0. Residual offspring are deterministic whenever all sampled weights equal one. In SIR this holds almost surely outside earlier zero-weight fallback events, whose probability tends to zero at a fixed horizon; the almost-everywhere condition alone does not prescribe weights on proposal-null states reached after a fallback. No residual covariance is assigned when ct=0 but υt is not almost everywhere one: the finite-sample normalization can move positive integer weights across floor boundaries. The B-page counterexamples show why the general positive-integer-atom branch remains unassigned.

Remarks

The classes and recursions are definitions. The fixed-horizon CLT proofs below establish finiteness where their stated hypotheses apply. In particular, the source class Φt(d) alone does not ensure Cov⁡πt(ϕ)<∞; the recursive target-moment class Ψt(d) is used for the stated post-resampling conclusions. The residual formula requires a separate continuity condition at positive integer weights; the B-page records finite-state failures without it. For an arbitrary weighted initial proposal, the source class Φ0=L2(π~0) is not by itself enough: the displayed initial weighted-numerator and target moments in Ψ0 are imposed explicitly.

The stronger Ψ hypotheses retain both locally proved fixed-horizon outputs, not the false claim that every source-Φ test has finite post-selection covariance. Separately, a weighted-only initial ratio CLT needs only a target-integrable test and its centered weighted numerator in L2(π~0); its denominator still needs only π~0(υ0)=1.

Depends on

Used by

Dependency tree · two levels

21 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