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.
A nearly noiseless weakly scaled observation amplifies innovation-solve residual
Example
Take a scalar predicted variance , observation coefficient , and measurement variance . For innovation , suppose the computed triangular solve has residual , with no other mean-update error.
Facts & Assumptions
Given: The scalar data and the exact factor mean update of Finite-horizon square-root Kalman filter by rectangular factors and QR.
The innovation variance is , the cross covariance is , and the exact gain is . The block QR measurement update gives the canonical Kalman update
The finite-horizon bound includes the forward-solve residual multiplied by an upper bound for the gain norm. The square-root filter has an explicit conditioned finite-horizon error bound
Proof
Given: The scalar inputs in the Example.
The signal part of the observation variance is , so and the observation noise is small relative to the predicted signal variance. The innovation variance and cross covariance are Thus the exact gain is
In the scalar block QR, and , so . If , then . The induced mean-update error is therefore An absolute solve residual of has produced an update error about because the gain is about . The term in [F2] provides a certified upper-bound counterpart when only a gain norm bound is available.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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.