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.
Multiplicative Schwarz projection sweeps contract with explicit overlap constants
Statement
Use the exact data of Finite-dimensional Schwarz subspace-correction data, with one coarse space and local spaces . Assume the stable-decomposition and synthesis hypotheses of Additive Schwarz condition bound from stable decomposition and synthesis hold with constants . Suppose a symmetric matrix has nonnegative entries and For a real matrix , write for its induced Euclidean operator norm. Set and . For the coarse-first exact multiplicative sweep , The ordered factors need not commute. Here is the induced operator norm.
Facts & Assumptions
Given: The local spaces, exact projections, constants , and pairwise overlap bounds in the statement.
The error map is the ordered product of the exact local corrections, with the coarse correction applied first (Finite-dimensional Schwarz subspace-correction data).
Each is an -orthogonal projection and (Exact Schwarz local corrections are energy-orthogonal projections).
The additive projection sum satisfies and (Additive Schwarz condition bound from stable decomposition and synthesis).
In the real energy inner product, (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Stable decomposition: every has with .
Pairwise local overlap: the stated inequalities hold, and is symmetric with nonnegative entries.
Proof
For an arbitrary initial error , set , , and . For , set and . By [F2], each correction is orthogonal to its updated error, so telescoping gives Also .
Fix a local index and set , , and . Since and is an orthogonal projection, and . Thus . The first term has absolute value at most and the second at most by [F4]; the remaining terms are at most by [A2]. If the resulting bound is immediate; otherwise divide by to obtain
Let be the strict lower-triangular part of , and let have entries . They are nonnegative and entrywise. Hence , and step 2.1 yields Furthermore, by [F2], The first inequality uses that is positive semidefinite; the last is [F3].
By , steps 1.1 and 3.1 give The left side is , which [F3] bounds below by . Thus . Since by step 1.1, .
Step 1.1 now gives Taking the supremum over nonzero proves the operator-norm bound; finiteness of makes the contraction factor strictly less than one.
Depends on
Used by
Dependency tree · two levels
18 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)