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 square-root filter has an explicit conditioned finite-horizon error bound
Statement
Fix a finite horizon and let and be the exact real-arithmetic prediction and update recursions of Exact linear-Gaussian Kalman filter. Let Suppose each innovation has a certified lower bound Let the procedure Finite-horizon square-root Kalman filter by rectangular factors and QR output represented covariances and means . At step , assume certified local bounds where and is the joint covariance represented by the measurement QR blocks. Let , , , and be certified finite upper bounds. Choose .
Define recursively If , put Then each is positive definite, the factor update is defined, and, with , where . Also Equivalently, where an empty product is . The bound is finite-horizon and explicitly conditioned on the innovation margins and data scales. It implies no uniform-in-time stability or accuracy claim.
Facts & Assumptions
Given: The exact and computed finite-horizon recursions, local defect bounds in the Statement, and for each step.
The exact Kalman recursion uses and , . Exact linear-Gaussian Kalman filter
The measurement QR blocks satisfy and when . The block QR measurement update gives the canonical Kalman update
Under its successful no-underflow QR and precision hypotheses (, and for nonempty product inner dimensions), the prearray bound includes input-factor, rounded-product, and Householder QR contributions to ; the prediction array has the analogous bound for . Product and Householder QR errors bound the represented joint covariance
The Schur perturbation lemma proves inverse, gain and covariance estimates under Frobenius block-error bounds. Its resolvent and Schur expansions are algebraic identities; the operator-norm estimates needed here are derived directly in step 3.1. Innovation, gain, and posterior errors follow from joint covariance perturbations
The operator norm is the maximum Euclidean stretch of a unit vector, and compatible operator norms are submultiplicative. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv|| The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
If is nonsingular and , then ; if , then . An innovation solve residual gives a singular-value forward bound
Proof
Given: The hypotheses in the Statement.
Put and . By [F1], [F5] and the prediction defect,
Let . Direct block multiplication gives . For every , , so [F5] and the joint defect imply If , the right side is at most . Each of its observation, cross, and state blocks therefore has operator error at most : every block is obtained by left- and right-multiplying by coordinate projections of operator norm at most one, so [F5] and submultiplicativity give the bound.
Assume and suppress . Write , , and . Step 2.1 bounds their operator norms by . Cauchy–Schwarz gives , hence . The same inequality applied to and gives and . The resolvent identity then bounds the inverse difference by . Expanding the gain and Schur differences as in [F4], now applying operator-norm triangle and product inequalities throughout, yields Here [F2] identifies the represented posterior as the Schur complement, and . Finally, . These estimates use operator block bounds directly, without a Frobenius conversion.
The innovation residual and computed-innovation defect give Let . By [F6] and the bound from step 3.1, , as included in the Statement. Because with , [F2] gives . Subtract the exact mean equation in [F1], insert and subtract , and use step 3.1. The result is
Add the covariance bound in step 3.1 to the mean bound in step 4.1. Using and the definition of yields Induction from the stated proves the bound for each . Repeated substitution of the scalar recurrence gives the displayed product-and-sum formula at . Since each assumption and step concerns only the finite indices , no uniform-in-time conclusion follows.
Depends on
- Finite-horizon square-root Kalman filter by rectangular factors and QR
- Exact linear-Gaussian Kalman filter
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- The operator norm is submultiplicative and satisfies ||T^*T|| = ||T||^2
- QR prediction preserves the canonical covariance factor
- The block QR measurement update gives the canonical Kalman update
- Product and Householder QR errors bound the represented joint covariance
- Innovation, gain, and posterior errors follow from joint covariance perturbations
- An innovation solve residual gives a singular-value forward bound
Used by
Dependency tree · two levels
30 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
- Kevin S. Tracy, A Square-Root Kalman Filter Using Only QR Decompositions (standard reference, not scraped)
- M. A. Salzmann, Some Aspects of Kalman Filtering, Technical Report 140 (standard reference, not scraped)
- Simo Särkkä, Bayesian Filtering and Smoothing (standard reference, not scraped)