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.
Projected data oscillation on a reference triangle
Example
Assume Countable Choice for the cited Sobolev/L2 interface.
Let , let , and mark this single cell with . Use the uniform three-generation refinement, any estimator marking fraction, and a per-call budget sufficient for completion.
Facts & Assumptions
Countable Choice is the background assumption in the cited Sobolev and suppliers (The Axiom of Countable Choice ()).
Given: Countable Choice, The P0 cell oscillation and the three-generation refinement rule.
Cell oscillation is (Residual indicators and data oscillation for P1 AFEM).
The marked triangle's edge midpoints and the midpoint on its median occur in the three-generation NVB refinement (Shape regularity and local reduction under 2D newest-vertex bisection).
The Dörfler-marked three-generation refinement reduces oscillation by at least the factor (Data oscillation reduction under three-generation refinement).
Verification
The triangle has area , while the subtriangle where has area , so . Therefore . Since , the initial oscillation square is .
The region is the corner triangle whose other two vertices are the midpoints of the coordinate-axis edges. By [F2] its boundary is a union of refined edges; each refined leaf lies wholly in this region or its complement. Thus is constant on every child, every child P0 projection is exact, and the refined oscillation is zero. This verifies the strict reduction and agrees with [F3], which gives at .
Finite check
The parent mean is and its variance integral is ; the child partition aligns with the indicator boundary, so each child variance is zero.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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)
- Bonito, Canuto, Nochetto & Veeser, Adaptive Finite Element Methods (2024) (standard reference, not scraped)