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.
Exact Schwarz local corrections are energy-orthogonal projections
Statement
For the data of Finite-dimensional Schwarz subspace-correction data, every is an -orthogonal projection, meaning an idempotent -self-adjoint operator, with range . Consequently, for every ,
Facts & Assumptions
Given: A real SPD matrix , the full-column-rank prolongations, and the index set of Finite-dimensional Schwarz subspace-correction data.
The Schwarz definition gives and (Finite-dimensional Schwarz subspace-correction data).
Every local matrix is SPD and invertible (Schwarz local matrices and exact solves are well defined).
If the coarse index is present, then is the -orthogonal projector onto (The Galerkin coarse correction is an energy-orthogonal projector).
Transposition reverses products, and a two-sided inverse of a symmetric invertible matrix is symmetric (Transpose is linear and involutive, and ).
Proof
Fix with . Multiplication using [F1] gives By [F2], is symmetric; [F4] therefore gives . Its range is contained in , and , so its range is exactly .
If , write with from [F3]. Since and is -self-adjoint, is also idempotent and -self-adjoint. Moreover, because projects onto . Thus is the -orthogonal projection onto . If , there is no coarse projection to check.
For every present index , idempotence and -self-adjointness give . Expanding the squared norm of proves the Pythagorean identity. Also by the same orthogonality.
Depends on
Used by
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.
Sources
- Jinchao Xu, Iterative Methods by Space Decomposition and Subspace Correction, SIAM Review 34(4) (1992) (standard reference, not scraped)
- Peter Bastian, Lecture Notes on Parallel Solution of Large Sparse Linear Systems, University of Heidelberg (2015) (standard reference, not scraped)