Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Certified inverse bounds turn finite-element solve residuals into state and adjoint error bounds

Statement

Let A∈Rn×n and B∈Rr×r be invertible finite-element state and adjoint system matrices. Let u=A−1b and p=B−1c be the exact solutions, and let u~,p~ be computed vectors. Suppose certified residual upper bounds ρu,ρp≥0 and certified operator bounds Ku,Kp≥0 satisfy

∥Au~−b∥2≤ρu,∥Bp~−c∥2≤ρp,∥A−1∥≤Ku,∥B−1∥≤Kp.

Then the exact state and adjoint errors satisfy

∥u−u~∥2≤Kuρu,∥p−p~∥2≤Kpρp.

The inverse-norm bounds are separate inputs; a residual bound alone gives no state or adjoint error estimate.

Facts & Assumptions

Given: Invertible state and adjoint matrices, exact and computed vectors, certified residual upper bounds, and certified upper bounds for both inverse norms.

[F1]

The state and adjoint residual upper bounds are the certified norms of the finite-dimensional equations defined by the model contract (Finite-element PDE solver admissibility and certificate contract).

[F2]

The operator norm satisfies ∥Tx∥2≤∥T∥∥x∥2 for each bounded linear map T (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

1.1givenF1F2algebra

Since Au=b, we have A(u−u~)=b−Au~. Apply A−1 and then [F2] to obtain ∥u−u~∥2=∥A−1(b−Au~)∥2≤∥A−1∥ ∥b−Au~∥2≤Kuρu.

2.1givenF1F2step 1.1algebra∎

Likewise, B(p−p~)=c−Bp~. Applying B−1 and [F2] gives ∥p−p~∥2=∥B−1(c−Bp~)∥2≤∥B−1∥ ∥c−Bp~∥2≤Kpρp. Together with step 1.1, this proves both bounds.

Remarks

This finite-dimensional estimate is choice-free. It does not provide Ku or Kp; the model must certify them separately. For a nonlinear state equation or a continuous-to-discrete comparison, another stability argument is required.

Depends on

Used by

Dependency tree · two levels

24 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