Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The Kalman filter is exact conditional on a nonlinear path

Statement

Assume the model of Conditionally linear-Gaussian state-space model and fix a nonlinear path z0:T. Run Exact linear-Gaussian Kalman filter on the resulting deterministic linear-Gaussian model for a fixed observation path y1:T. Write mt∣t−1,Pt∣t−1 and mt∣t,Pt∣t for its predicted and updated moments, and define vt=yt−Ct(z0:t)mt∣t−1,St=Ct(z0:t)Pt∣t−1Ct(z0:t)T+Rt(z0:t). Then L(Ut∣Z0:T=z0:T,Y1:t=y1:t) has the Gaussian version N(mt∣t,Pt∣t) for every 0≤t≤T. At time t≥1, the conditional observation density given the nonlinear path and earlier observations is ℓt(z0:t;y1:t)=(2π)−pt/2det⁡(St)−1/2exp⁡ ⁣(−12vtTSt−1vt). Each St is positive definite, each Pt∣t is positive semidefinite, and ℓt is finite, strictly positive, and Borel in the nonlinear path. For every 1≤t≤T whose observation evidence is finite positive, the conditional density of Y1:t given the nonlinear path is ∏s=1tℓs(z0:s;y1:s). Consequently the conditional law of Z0:t given Y1:t=y1:t is the normalized Feynman–Kac path measure with path-extension transitions induced by Ms, initial potential G0≡1, and potentials Gs(z0:s)=ℓs(z0:s;y1:s). At t=0 it is the initial nonlinear law μ0.

Facts & Assumptions

Given: AC, the fixed path and observations, and the conditional model in the Statement.

[A1]

AC is inherited from the Gaussian-law and Kalman conditional-law conventions. The Axiom of Choice

[F1]

Conditional on a fixed nonlinear path, the initial state and all state and observation noises are mutually independent Gaussian vectors with the displayed positive-semidefinite covariances; the coefficient matrices are deterministic for that path. Conditionally linear-Gaussian state-space model

[F2]

The finite-horizon linear-Gaussian model with independent noises has an exact Kalman filtering version whenever every innovation covariance is positive definite; state and noise covariances may be singular. The finite-horizon linear-Gaussian Kalman filter is exact

[F3]

One prediction and observation step from a Gaussian state with positive-semidefinite covariance produces a jointly Gaussian state-observation pair with innovation covariance S, and when S is positive definite the conditional state law has the stated Kalman update. One-step Gaussian prediction and conditioning

[F4]

A positive-definite covariance matrix gives the multivariate normal law its Lebesgue density (2π)−p/2det⁡(S)−1/2exp⁡(−vTS−1v/2). A positive-definite multivariate normal law has its Gaussian density

[F5]

A joint probability with a product-measurable density has the normalized conditional-density kernel on finite-positive evidence fibers. Conditional density formula

[F6]

A normalized Feynman–Kac path measure is the Markov path law weighted by the product of its nonnegative potentials, and it is normalized only at finite positive normalizer. Feynman–Kac path targets and normalizers

[F7]

Extending a nonlinear prefix by its transition kernel gives a probability kernel on the standard-Borel path spaces, and the ordered extensions give the nonlinear path law. Nonlinear path extension is a probability kernel

Proof

Given: The hypotheses in the Statement.

1.1A1F1givenalgebra

Initially P0∣0=P0(z0) is positive semidefinite. If Pt−1∣t−1 is positive semidefinite, then Pt∣t−1=AtPt−1∣t−1AtT+Qt is positive semidefinite because uTPt∣t−1u=(AtTu)TPt−1∣t−1(AtTu)+uTQtu≥0. For every nonzero observation vector a, aTSta=(CtTa)TPt∣t−1(CtTa)+aTRta>0, since the first term is nonnegative and Rt is positive definite. Induction proves all innovation matrices meet the Kalman algorithm's domain.

2.1F1F2F3F4givenstep 1.1

By [F1], for this fixed path the conditional model is the deterministic finite-horizon model of [F2]. Step 1.1 verifies its positive-innovation hypothesis, so [F2] gives the exact conditional Gaussian filter at every observation history, including singular state covariances. At each time, [F3] gives the marginal observation law N(Ctmt∣t−1,St); applying [F4] yields the displayed density.

3.1F1step 1.1step 2.1algebra

The coefficient functions are Borel by [F1]. Finite sums and products preserve Borel measurability, and matrix inversion and determinant are continuous on the positive-definite matrices established in step 1.1. The Kalman moment recursion and the displayed density are therefore Borel functions of the path. The covariance determinant is finite and positive and the exponential is finite and strictly positive, so ℓt has the claimed range.

4.1F1F5F6F7step 2.1step 3.1given∎

For a fixed nonlinear path, step 2.1 gives the one-step conditional density ℓs of Ys given Y1:s−1. By the defining event-integral identity for conditional densities, p(y1:s∣z)=p(y1:s−1∣z)ℓs(z0:s;y1:s) on finite-positive fibers; induction from the empty history, whose density is one, gives the product ∏s=1tℓs. By [F7], the ordered path-extension kernels are probability kernels on the standard-Borel path spaces and give the nonlinear path law. The joint law of Z0:t and Y1:t therefore has this product as its observation-density factor relative to that path law and Lebesgue observation measure. By [F5], conditioning on a history with finite positive evidence weights the nonlinear path law by this product and divides by its integral. Comparing with [F6] gives exactly the stated normalized Feynman–Kac path measure. This assertion is restricted to those finite-positive evidence fibers; null and infinite fibers are not normalized.

Depends on

Used by

Dependency tree · two levels

59 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