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.
Galerkin coarse matrices and the exact coarse-correction error map
Definition
Work over the real field with standard coordinate inner products. Let be symmetric positive definite (equivalently, positive definite in the Cholesky convention of Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal) and let have full column rank, where . The map sends coarse-grid coordinate vectors to fine-grid coordinate vectors; its Euclidean adjoint is the transpose by In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix. Define the Galerkin coarse matrix
Whenever is invertible, define the exact Galerkin coarse-correction error map
This definition is conditional on invertibility of . The next theorem proves that condition from positive definiteness of and full column rank of . The formula is in exact real arithmetic; a rediscretized operator is not identified with unless equality is separately shown.
Depends on
- Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
Used by
- Finite recursive Galerkin V- and W-cycle for an SPD hierarchy Algorithm
- Finite strength-graph aggregation and Galerkin hierarchy with explicit statuses Algorithm
- Finite-dimensional Schwarz subspace-correction data Definition
- The symmetric two-grid error map from a pre-smoother and Galerkin correction Definition
- A linear error on the one-dimensional Poisson coarse space is removed exactly Example
- One high-frequency mode in the finite one-dimensional Poisson two-grid cycle Example
- Level-uniform 1D Poisson smoothing and approximation bounds Lemma
- The Galerkin coarse correction is an energy-orthogonal projector Theorem
Dependency tree · two levels
20 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
- Susanne C. Brenner and L. Ridgway Scott, The Mathematical Theory of Finite Element Methods, 3rd ed., Chapter 6 (standard reference, not scraped)
- Numerical Methods II, University of Heidelberg lecture notes, Chapter 10 (standard reference, not scraped)