Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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.