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.
Residual indicators and data oscillation for P1 AFEM
Definition
Assume Countable Choice for the and Sobolev conventions of The Axiom of Countable Choice ().
All functions and data are real-valued. Let be a bounded polygon and let be a finite conforming matching triangulation by nondegenerate affine triangles, with maximum shape-regularity constant . Write and . Let be the continuous, piecewise-affine zero-boundary subspace of Broken and conforming polynomial spaces on a matching mesh, which lies in by Continuous matching piecewise polynomials belong to W1p and Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare. The exact weak model is The weak form is for every . The case is the symmetric Laplace model. Given , its cell residual is ; this is because on each cell. For an interior edge define the outward flux jump where are the unit outward normals. Set and for . The factor assigns each interior-edge contribution once globally. Let be the projection onto constants. The cell data oscillation is Since is constant on , this oscillation equals .
For a separate definitional interface, consider the symmetric diffusion model , where is a symmetric uniformly elliptic matrix field in the sense of Uniformly elliptic divergence-form operators and their sesquilinear forms and is Lipschitz on each cell. Its cell residual for a piecewise-affine is , and its outward conormal-flux jump is the sum of from the two incident cells. Let be the projection onto constants. The projected edge term records nonconstant conormal flux. The reliability, contraction, and complexity results authored here concern only; this extension supplies notation and no coefficient-dependent theorem.
Prerequisite interface
The matching affine mesh and continuous broken-polynomial conventions are those of Matching affine simplicial meshes and shape regularity and Broken and conforming polynomial spaces on a matching mesh. The proof of the weak representation uses Sobolev face traces and Gauss–Green on a reference simplex and Interior facet orientations cancel in a matching mesh.
Depends on
- Matching affine simplicial meshes and shape regularity
- Broken and conforming polynomial spaces on a matching mesh
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- Integer-order Sobolev spaces and their norms
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Continuous matching piecewise polynomials belong to W1p
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
Used by
- Dorfler marking and conforming newest-vertex refinement Algorithm
- The P1 AFEM approximation class Definition
- A coefficient jump creates nonzero edge-flux oscillation Example
- Projected data oscillation on a reference triangle Example
- Data oscillation reduction under three-generation refinement Lemma
- Dorfler marking is cardinality-optimal up to mesh closure Lemma
- Element and edge residual representation for P1 Galerkin errors Lemma
- Localized energy estimate for nested Galerkin solutions Lemma
- Quasi-orthogonality for constant convection on a fine initial mesh Lemma
- Reduction of the P1 residual estimator after marked refinement Lemma
- Linear contraction of AFEM energy error and oscillation Theorem
- Optimal P1 AFEM complexity for the Laplacian Theorem
- Residual reliability and local efficiency for P1 AFEM Theorem
Dependency tree · two levels
37 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
- Ricardo H. Nochetto, Adaptive Finite Element Methods, Lecture 2 (standard reference, not scraped)
- Cascón, Kreuzer, Nochetto & Siebert, Quasi-optimal convergence rate for an AFEM (standard reference, not scraped)
- Bonito, Canuto, Nochetto & Veeser, Adaptive Finite Element Methods (2024) (standard reference, not scraped)