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 reliability and local efficiency for P1 AFEM
Statement
Assume Countable Choice, as in the Sobolev trace and inverse-estimate suppliers.
Let be a conforming shape-regular triangular mesh, let solve the model of Residual indicators and data oscillation for P1 AFEM, and let be its exact P1 Galerkin solution. There are constants depending only on the shape bound and such that and for every , where is the union of and its edge neighbors. If contains the uniform three-generation subdivision of every cell in the original edge-neighbor patch of (in particular, every complete call of Dorfler marking and conforming newest-vertex refinement has this property) and is the exact fine Galerkin solution, then with the union of edge-neighbor patches of marked cells. All constants are independent of the refinement level.
Facts & Assumptions
Countable Choice is assumed in the cited Sobolev and reference-simplex suppliers (The Axiom of Countable Choice ()).
Given: Countable Choice, the exact weak solution, conforming P1 Galerkin solution, shape-regular matching mesh, residual estimator, and three-generation refinement of the bulk marks and their original edge neighbors.
The error pairs with an arbitrary test function as the sum of cell residuals and negative outward flux jumps (Element and edge residual representation for P1 Galerkin errors).
The moment interpolant has local , gradient, edge-trace bounds, maps into the conforming zero-boundary P1 space, and reproduces P1 functions (Local approximation and reproduction of the P1 moment interpolant).
Polynomial inverse and affine-scaling estimates on shape-regular triangles give uniform norm bounds for fixed-degree barycentric bubbles and P1 hats (Polynomial inverse and discrete trace inequalities, Shape regularity controls affine simplex geometry).
Three generations place an interior median midpoint in each requested triangle, with the eight explicit leaves of the reference pattern, and a midpoint in each original edge; the refined family is uniformly shape regular (Shape regularity and local reduction under 2D newest-vertex bisection).
Continuous matching piecewise polynomials with zero boundary trace belong to (Continuous matching piecewise polynomials belong to W1p, Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).
Proof
Put and write . By the exact Galerkin equation, for every ; subtracting from the weak equation gives . For , constancy of gives . The map is continuous in , so density extends this identity to all . Hence and, since , . Apply [F1] to . Cauchy–Schwarz, the cell and edge interpolation bounds [F2], and finite overlap of vertex patches give If reliability is immediate; otherwise divide by it and square. This proves the global upper bound.
For each cell let , and let be its barycentric coordinates. The polynomial , extended by zero outside , has zero trace on , satisfies , and has . Thus is an admissible test by [F5]. By affine scaling and [F3], and . The residual identity has no edge term for this test, so . The left side is at least , while the two terms on the right are bounded by and , respectively. If , division and multiplication by give ; if it is zero, the same bound for follows from . Hence in all cases .
On an interior edge write , and let be the barycentric coordinates of its endpoints on the two incident cells. Define on , on , and zero outside their union. These traces agree on , vanish on the other edges of the patch, and satisfy , , and by [F3]. The function is an admissible test by [F5]. Put , which is constant for P1 with , and test [F1] with . All edge terms other than the one on vanish. Its magnitude is . The cell terms are bounded by , and the form term by . Use step 1.2, , and the definitions of the oscillations to obtain ; the bound is trivial if . Since , summing with bounded patch overlap and the cell estimate of step 1.2 proves the local efficiency assertion.
Set . For every original cell in , use its fixed uniform-three-generation pattern from [F4]. Its P1 hat at the interior median midpoint is zero on . Exactly four of the eight equal-area leaves meet that midpoint, so . Reference scaling gives and . Extend by zero and prolong to : containment of the fixed pattern makes this a fine P1 function even after arbitrary additional closure or refinement. For every fine test , fine Galerkin orthogonality gives . Testing with , where , yields the cell estimate by exactly the residual splitting and zero-mean remainder argument of step 1.2, now with : The case uses only the oscillation remainder, so no zero quantity is divided by. This bound is now available on every neighbor needed below.
For each interior edge incident to a cell of , both original incident cells belong to . Define a common trace tent on : it is zero at its two endpoints, one at its midpoint, and affine on each half. On each incident cell's fixed three-generation pattern, prescribe nodal values at nodes on and zero at every pattern node off , then interpolate P1. In particular any quarter points on a reference edge have value , rather than zero. The traces from the two cells equal the same full tent even when their reference labels differ; all other original edge traces are zero. Thus the two pieces glue to a continuous function supported on , zero on its boundary, with Indeed each cell uses eight fixed-shape leaves, nodal values in , and affine scaling; shape regularity gives for the two cells. Prolong these reference functions to , retaining their values, support, integrals and bounds; do not replace them by nodal hats on the possibly much finer actual mesh. For , test with . The only original edge term is , so the residual identity and local form bound give For this is immediate. Applying step 2.2 on both incident cells yields the desired edge estimate in terms of correction energy and oscillation on . Summing squared cell and edge estimates over has bounded overlap: each triangle belongs to at most its own and its three neighbors' patches. This proves the marked estimate with precisely on the right and constants independent of all extra refinement.
Depends on
- Residual indicators and data oscillation for P1 AFEM
- Compatible 2D newest-vertex-bisection meshes
- Dorfler marking and conforming newest-vertex refinement
- Shape regularity and local reduction under 2D newest-vertex bisection
- Element and edge residual representation for P1 Galerkin errors
- Local approximation and reproduction of the P1 moment interpolant
- Polynomial inverse and discrete trace inequalities
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Shape regularity controls affine simplex geometry
- Continuous matching piecewise polynomials belong to W1p
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
Used by
Dependency tree · two levels
39 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)