Alphabeta Math
Pipeline-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.

✓ 4 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Square root covariance update error and stability — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A nonzero prearray perturbation changes the posterior but keeps its factor product PSD

Example

Use a scalar state and observation with P−=R=H=1. The exact measurement prearray is Z=[1101]. For the perturbation calculation take E=[01/1000],Z^=Z+E. This is a mathematical backward-perturbation example; it does not assert that a particular floating-point QR produces this exact E. The perturbed prearray has the measurement form with LR=L−=1 and observation coefficient H^=11/10, 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.

[F1]

A factor perturbation E changes the Gram matrix by at most 2∥Z∥F∥E∥F+∥E∥F2. A factor perturbation gives an explicit Gram-matrix error

[F2]

When the innovation block is positive, the lower-right Schur complement of the block QR Gram matrix is represented as L22L22T. The block QR measurement update gives the canonical Kalman update

Proof

Given: The matrices in the Example.

1.1F2givenalgebra

The exact Gram matrix is ZZT=[2111]. Its innovation variance is 2, its cross covariance is 1, and its exact posterior covariance is 1−1/2=1/2.

2.1F1givenstep 1.1algebra

The perturbed array and its Gram matrix are Z^=[111/1001],Z^Z^T=[221/10011/1011/101]. Here ∥E∥F=1/10, ∥Z∥F=3, and the Gram difference is [21/1001/101/100], whose Frobenius norm is 641/100; it is bounded by [F1]. The perturbed innovation remains positive, and its Schur complement is 1−(11/10)2221/100=1−121221=100221>0. This differs from 1/2 by −21/442.

3.1F2step 2.1algebra∎

By [F2], the perturbed Schur complement is exactly the represented factor product L22L22T, so it is positive semidefinite; here it is the positive scalar 100/221. The nonzero prearray perturbation changes the posterior covariance, while the factor representation retains positive semidefiniteness.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A rounded subtractive covariance update can become indefinite

Example

Use binary floating-point arithmetic with precision p=24, round-to-nearest ties-to-even, and a normal exponent range containing the values below. Let c=1−2−24,P−=[1cc1],H=[11],R=2−22. Compute B=P−HT, then S=HB+R, then K=B/S, and finally Psub=P−−(KS)KT, rounding every displayed operation in the specified format.

Facts & Assumptions

Given: The stated real matrices and the binary floating-point model.

[F1]

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

[F2]

The canonical covariance map uses P+=P−−KSKT with innovation S=HP−HT+R and K=P−HTS−1. Exact linear-Gaussian Kalman filter

[F3]

Any successful square-root block update represents its posterior covariance as L22L22T, 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.

1.1F2givenalgebra

Since 0<c<1, for (x1,x2)≠(0,0), (x1,x2)P−(x1,x2)T=(x1+cx2)2+(1−c2)x22>0. Thus P− is positive definite. Also 1−c2=2−23−2−48>0. The exact innovation is S=HP−HT+R=4−2−23+2−22=4+2−23>0.

2.1F1step 1.1algebra

In precision p=24, the exact sum 1+c=2−2−24 is halfway between the representable predecessor 2−2−23 and 2; ties-to-even rounds it to 2. Hence the computed B is (2,2)T. The next exact addition is 4+2−22, halfway between 4 and its next representable successor 4+2−21; ties-to-even rounds it to Sfl=4. All these operands and results are normal.

3.1F1F2F3step 2.1algebra∎

The computed gain is K=(1/2,1/2)T. Multiplication gives (KS)KT=[1111] exactly, so the rounded subtractive update is Psub=[0−2−24−2−240]. Its eigenvalues are 2−24 and −2−24, 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A singular prior factor with a positive innovation remains admissible

Example

Take one state and one observation, one update step, m0=2, F=H=1, y=7, and factors L0=LQ=0, LR=1. The initial, process, and measurement covariances are P0=Q=0 and R=1.

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.

[F1]

Prediction concatenates FL0 and LQ, then pads the factor array by zero columns as needed. Finite-horizon square-root Kalman filter by rectangular factors and QR

[F2]

The measurement prearray has blocks [LRpadHL−0L−]. Finite-horizon square-root Kalman filter by rectangular factors and QR

[F3]

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.

1.1F1givenalgebra

The prediction array is [FL0,LQ]=[0,0]. Its QR upper factor is zero, so L−=0 and P−=0. The predicted mean is m−=1⋅2=2. The innovation is v=7−1⋅2=5, and its covariance is S=HP−HT+R=1. Thus the canonical innovation is positive definite even though P0 and Q are singular.

2.1F2step 1.1algebra

The measurement prearray is Z=[1000]. Its exact QR gives L11=1, L21=0, L22=0. The solve gives z=5, so m+=m−+L21z=2, while the represented posterior covariance is L22L22T=0.

3.1F3step 2.1algebra∎

The canonical covariance update is P+=0−0⋅1−1⋅0=0 and the canonical mean update is 2+0⋅1−1⋅5=2. 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.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

A nearly noiseless weakly scaled observation amplifies innovation-solve residual

Example

Take a scalar predicted variance P−=1, observation coefficient H=10−3, and measurement variance R=10−12. For innovation v=1, suppose the computed triangular solve has residual L11z^−v=10−9, 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.

[F1]

The innovation variance is S=HP−HT+R, the cross covariance is B=P−HT, and the exact gain is BS−1. The block QR measurement update gives the canonical Kalman update

[F2]

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.

1.1F1givenalgebra

The signal part of the observation variance is HP−HT=10−6, so R/(HP−HT)=10−6 and the observation noise is small relative to the predicted signal variance. The innovation variance and cross covariance are S=10−6+10−12=10000011012,B=10−3. Thus the exact gain is K=BS=1091000001.

2.1F1F2step 1.1algebra∎

In the scalar block QR, L112=S and L21L11=B, so L21/L11=K. If L11z^−v=ρ=10−9, then z^=(v+ρ)/L11. The induced mean-update error is therefore L21z^−Kv=Kρ=11000001≈9.99999000001×10−7. An absolute solve residual of 10−9 has produced an update error about 10−6 because the gain is about 103. The K#ρ term in [F2] provides a certified upper-bound counterpart when only a gain norm bound is available.