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.
Quasi-orthogonality for constant convection on a fine initial mesh
Statement
Assume Countable Choice, as in the zero-boundary Sobolev convention.
Let be nested conforming meshes and let be exact P1 Galerkin solutions for the constant-convection model of Residual indicators and data oscillation for P1 AFEM. Write and . For , For constant , assume the explicit dual-pickup bound for the nested sequence, with , where , and put . Then The dual-pickup bound is an additional hypothesis. It is not asserted for every polygon or mesh.
Facts & Assumptions
Countable Choice is assumed in the cited Sobolev and reference-simplex suppliers (The Axiom of Countable Choice ()).
Given: Countable Choice, nested conforming P1 spaces, exact Galerkin solutions, constant , and in the nonsymmetric case the stated dual-pickup bound.
Galerkin orthogonality says for every ; nestedness puts in the fine space (Galerkin orthogonality for conforming approximations).
is the closure of compactly supported smooth functions in ; constant-vector integration by parts on those functions extends by continuity to this closure (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).
Proof
If , [F1] with gives . Since , expanding the squared norm yields . Rearrangement is the symmetric identity.
For constant , [F1] gives . By [F2], . Expanding therefore gives The sign in this identity follows directly from the preceding orthogonality equation.
By the assumed dual-pickup estimate and Cauchy–Schwarz, . Using this in step 1.2 gives . Divide by to obtain the stated estimate.
Depends on
Used by
Dependency tree · two levels
25 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 3 (standard reference, not scraped)
- Cascón, Kreuzer, Nochetto & Siebert, Quasi-optimal convergence rate for an AFEM (standard reference, not scraped)