Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Finite-dimensional VMS residual closure has an explicit Schur defect bound

Statement

Use the block operators and residual closure of Finite-dimensional resolved–unresolved VMS split and residual closure. Equip Xc,Xf and their duals with norms, and use the corresponding induced operator norms. Let G:=Aff−1, assume the exact Schur system has a solution uc, and put rf:=Ff−Afcuc. Suppose the closure map T has S~:=Acc−AcfTAfc invertible, and let u~c solve the approximate Schur system. Then ∥u~c−uc∥≤∥S~−1∥ ∥Acf∥ ∥T−G∥ ∥rf∥, and for the modeled fine component u~f=T(Ff−Afcu~c), ∥u~f−uf∥≤∥T−G∥ ∥rf∥+∥T∥ ∥Afc∥ ∥u~c−uc∥. The exact fine scale is uf=Grf. These bounds concern finite-dimensional algebraic blocks; they do not certify a universal PDE subgrid model.

Facts & Assumptions

Given: The direct-sum block system and residual closure in Finite-dimensional resolved–unresolved VMS split and residual closure, an invertible exact fine block Aff, and an invertible approximate Schur operator S~.

[F1]

Finite-dimensional resolved–unresolved VMS split and residual closure: exact elimination uses G=Aff−1 and residual rf=Ff−Afcuc; the closure replaces G by T in both the Schur operator and load.

Proof

1.1F1givenalgebra

Write the exact Schur operator and load as S=Acc−AcfGAfc and g=Fc−AcfGFf, so Suc=g. Put Δ:=T−G. The approximate quantities satisfy S~=S−AcfΔAfc and g~=g−AcfΔFf.

2.1step 1.1givenalgebra

Since S~u~c=g~, step 1.1 gives S~(u~c−uc)=g~−S~uc=−AcfΔ(Ff−Afcuc)=−AcfΔrf. Apply the induced operator norms and multiply by ∥S~−1∥ to prove the coarse bound.

3.1F1step 2.1algebra∎

The exact fine component is uf=Grf. The modeled component is u~f=T(rf−Afc(u~c−uc)). Subtracting gives u~f−uf=(T−G)rf−TAfc(u~c−uc). The triangle inequality and operator norms give the stated fine-scale bound.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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