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.
Square root covariance update error and stability — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate families and Gaussian conditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Estimators and Randomized Procedures
- Exact linear-Gaussian Kalman filtering
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed effects and longitudinal models
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Square root covariance update error and stability
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- State-space models and exact Bayesian filtering
- Stationary means and sample autocovariance
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
Examples
The examples retain the approved scope: a singular prior with positive innovation, an ill-conditioned innovation solve, a finite binary floating point witness where the subtractive update loses positive semidefiniteness, and a nonzero prearray perturbation whose represented posterior remains a factor product. The binary witness is a direct exact calculation for the declared precision; it does not stand in for a general backward-error proof.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A nonzero prearray perturbation changes the posterior but keeps its factor product PSD
Example
Use a scalar state and observation with . The exact measurement prearray is For the perturbation calculation take This is a mathematical backward-perturbation example; it does not assert that a particular floating-point QR produces this exact . The perturbed prearray has the measurement form with and observation coefficient , so the block identity applies to it once its innovation is shown positive below.
Facts & Assumptions
Given: The scalar prearray and the stated nonzero matrix perturbation.
A factor perturbation changes the Gram matrix by at most . A factor perturbation gives an explicit Gram-matrix error
When the innovation block is positive, the lower-right Schur complement of the block QR Gram matrix is represented as . The block QR measurement update gives the canonical Kalman update
Proof
Given: The matrices in the Example.
The exact Gram matrix is Its innovation variance is , its cross covariance is , and its exact posterior covariance is .
The perturbed array and its Gram matrix are Here , , and the Gram difference is , whose Frobenius norm is ; it is bounded by [F1]. The perturbed innovation remains positive, and its Schur complement is This differs from by .
By [F2], the perturbed Schur complement is exactly the represented factor product , so it is positive semidefinite; here it is the positive scalar . The nonzero prearray perturbation changes the posterior covariance, while the factor representation retains positive semidefiniteness.
A rounded subtractive covariance update can become indefinite
Example
Use binary floating-point arithmetic with precision , round-to-nearest ties-to-even, and a normal exponent range containing the values below. Let Compute , then , then , and finally , rounding every displayed operation in the specified format.
Facts & Assumptions
Given: The stated real matrices and the binary floating-point model.
The operationwise model uses round-to-nearest, ties-to-even on normal results, and sign changes are exact. Operationwise real and complex floating point arithmetic with rounded square roots and fused multiply-add
The canonical covariance map uses with innovation and . Exact linear-Gaussian Kalman filter
Any successful square-root block update represents its posterior covariance as , an exact positive-semidefinite product, though this does not certify a separately rounded materialization. The block QR measurement update gives the canonical Kalman update
Proof
Given: The data and rounding rule in the Example.
Since , for , Thus is positive definite. Also . The exact innovation is
In precision , the exact sum is halfway between the representable predecessor and ; ties-to-even rounds it to . Hence the computed is . The next exact addition is , halfway between and its next representable successor ; ties-to-even rounds it to . All these operands and results are normal.
The computed gain is . Multiplication gives exactly, so the rounded subtractive update is Its eigenvalues are and , so it is indefinite. This shows cancellation can lose positive semidefiniteness even with an exact positive-definite prior and positive measurement variance. By contrast, when the factor procedure succeeds, [F3] gives a represented covariance that is an exact factor product; this example makes no claim that rounding a later materialization of that product preserves the property.
A singular prior factor with a positive innovation remains admissible
Example
Take one state and one observation, one update step, , , , and factors , . The initial, process, and measurement covariances are and .
Facts & Assumptions
Given: The scalar data in the Example and the exact factor update of Finite-horizon square-root Kalman filter by rectangular factors and QR.
Prediction concatenates and , then pads the factor array by zero columns as needed. Finite-horizon square-root Kalman filter by rectangular factors and QR
The measurement prearray has blocks . Finite-horizon square-root Kalman filter by rectangular factors and QR
For positive innovation, the block QR factor gives the canonical posterior covariance and mean, with singular posterior factors allowed. The block QR measurement update gives the canonical Kalman update
Proof
Given: The scalar inputs in the Example.
The prediction array is . Its QR upper factor is zero, so and . The predicted mean is . The innovation is , and its covariance is . Thus the canonical innovation is positive definite even though and are singular.
The measurement prearray is Its exact QR gives , , . The solve gives , so , while the represented posterior covariance is .
The canonical covariance update is and the canonical mean update is . They agree with the factor output in step 2.1. The zero posterior factor is admissible by [F3]; no Cholesky factor of a positive-definite state covariance is required.
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.