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.
One high-frequency mode in the finite one-dimensional Poisson two-grid cycle
Example
Use the four-interval mesh from the homogeneous weak Dirichlet Poisson form on and the exact piecewise-linear coarse correction. Here , where , and . For the error , the coarse correction leaves the vector unchanged, while one Richardson sweep with step damps it by . The symmetric two-grid error map therefore sends this particular mode to . The level-uniform theorem bounds the full operator norm by for one sweep, not merely this single mode.
The calculation uses the homogeneous weak-form convention and makes no claim about solution existence or finite-element discretization error.
Facts & Assumptions
Given: The homogeneous weak Dirichlet Poisson form on , the four-interval fine mesh with , , coarse prolongation , the error , and one Richardson sweep.
Weak Dirichlet solutions for a divergence-form operator: the homogeneous weak Dirichlet problem uses and the form identity against every test function; this branch assumes Countable Choice.
Uniformly elliptic divergence-form operators and their sesquilinear forms: for the real Poisson coefficients , , the form is .
Galerkin coarse matrices and the exact coarse-correction error map: and when is invertible.
The symmetric two-grid error map from a pre-smoother and Galerkin correction: the symmetric cycle map is .
The symmetric 1D Poisson two-grid cycle is uniformly contractive: the symmetric 1D Poisson map has for every and every even .
Continuous piecewise-affine functions with zero endpoints lie in H1-zero: each continuous piecewise-affine function on vanishing at and belongs to .
Assume The Axiom of Countable Choice () for the homogeneous Sobolev interface in [F1]. This example uses the homogeneous branch and makes no inhomogeneous trace claim.
Verification
The fine nodal hats are continuous piecewise affine and vanish at both endpoints, so [F6] puts them in the homogeneous test space of [F1] under [A1]; [F2] then gives their form as . Direct determinant expansion gives so , while direct multiplication gives . Thus one pre-sweep sends to .
Direct multiplication gives and . Hence and , since the middle component of is zero. Since is symmetric and commutes with , its -adjoint equals . Thus [F4] gives .
Since (equivalently after multiplying by positive quantities and squaring), this mode is damped by less than . [F5] with bounds the full energy operator norm by , including every fine-grid mode.
Depends on
- The symmetric 1D Poisson two-grid cycle is uniformly contractive
- Galerkin coarse matrices and the exact coarse-correction error map
- The Galerkin coarse correction is an energy-orthogonal projector
- The symmetric two-grid error map from a pre-smoother and Galerkin correction
- Continuous piecewise-affine functions with zero endpoints lie in H1-zero
- Weak Dirichlet solutions for a divergence-form operator
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 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)