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.
Two-level overlapping P1 Poisson bounds with explicit H-overlap dependence
Statement
Assume Countable Choice. For the two-level P1 Poisson family of Stable two-level P1 decomposition for structured Poisson meshes, let and . The coarse-plus-local synthesis constant can be chosen as , and the local overlap matrix can be chosen with . Consequently, for the exact additive Schwarz operator, For the coarse-first exact multiplicative sweep, In particular, if is uniformly bounded, both estimates are independent of the fine mesh size and the number of subdomains. These are constant-coefficient Poisson bounds; they assert no robustness for arbitrary coefficient contrast or anisotropy.
Facts & Assumptions
Given: Countable Choice, the structured nested meshes, padded cube subdomains, coarse and local P1 spaces, and Poisson energy of Stable two-level P1 decomposition for structured Poisson meshes.
The stable splitting constant satisfies (Stable two-level P1 decomposition for structured Poisson meshes).
The additive condition number and multiplicative sweep estimates use exactly as stated in their theorem contracts (Additive Schwarz condition bound from stable decomposition and synthesis, Multiplicative Schwarz projection sweeps contract with explicit overlap constants).
The local spaces consist of P1 functions supported in the padded coarse cubes, and the coarse space is global (Stable two-level P1 decomposition for structured Poisson meshes).
The real inner product satisfies (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
At almost every point of , at most local subdomains are present by [F3] and the coordinate count in Stable two-level P1 decomposition for structured Poisson meshes. For any coarse component and local components , at most gradients can be nonzero there. [F4] in the finite-dimensional Euclidean inner product gives the pointwise inequality . Integrating gives Thus is a valid synthesis constant.
Set when the interiors of and overlap in positive measure and otherwise, with . If the interiors are disjoint, local gradients have disjoint supports almost everywhere, so . If they overlap, [F4] gives . Thus this symmetric nonnegative matrix satisfies the pairwise overlap hypothesis. Since each padded cube has side at most , two cubes can intersect only when their coarse indices differ by at most five in each coordinate. Thus every row of the overlap matrix has at most nonzero entries. For any vector , applying [F4] to the vectors and gives . Summing over and using the column sums, also at most , yields . Hence .
Substituting the stable constant [F1] and from step 1.1 into the additive estimate [F2] proves .
Substituting [F1], step 1.1, and from step 1.2 into the multiplicative estimate [F2] gives the displayed contraction factor. Its denominator is finite and positive, and the multiplicative theorem proves the factor is nonnegative and strictly below one. The bound is uniform as and the subdomain count grows whenever stays bounded.
Depends on
- Finite-dimensional Schwarz subspace-correction data
- Stable two-level P1 decomposition for structured Poisson meshes
- Additive Schwarz condition bound from stable decomposition and synthesis
- Multiplicative Schwarz projection sweeps contract with explicit overlap constants
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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)