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 and their duals with norms, and use the corresponding induced operator norms. Let , assume the exact Schur system has a solution , and put . Suppose the closure map has invertible, and let solve the approximate Schur system. Then and for the modeled fine component , The exact fine scale is . 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 , and an invertible approximate Schur operator .
Finite-dimensional resolved–unresolved VMS split and residual closure: exact elimination uses and residual ; the closure replaces by in both the Schur operator and load.
Proof
Write the exact Schur operator and load as and , so . Put . The approximate quantities satisfy and .
Since , step 1.1 gives . Apply the induced operator norms and multiply by to prove the coarse bound.
The exact fine component is . The modeled component is . Subtracting gives . 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
- Thomas J. R. Hughes, Guglielmo Scovazzi, and Leopoldo P. Franca, Multiscale and Stabilized Methods, Encyclopedia of Computational Mechanics, ICES Report 04-18 (2004) (standard reference, not scraped)
- Volker John, Numerical Methods for Convection-Dominated Problems, lecture notes, Chapter 5 (standard reference, not scraped)