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.
Cell-centered rectangular TPFA grid with homogeneous no-flux boundaries
Definition
Let , where , and let integers define . The finite cell set is , cell centers are , and every cell has volume . This is the uniform orthogonal Cartesian mesh; adjacent center segments are perpendicular to their shared faces. Take the scalar cellwise coefficient to be and give boundary faces homogeneous no-flux data, so they contribute no flux.
For a grid vector , define the positive cell-centered stencil
where an unavailable neighbor at a boundary is assigned the value of the boundary cell itself. Indeed a face normal to direction has area and adjacent centers are distance apart, so its TPFA transmissibility is ; dividing the cell balance by gives the displayed coefficient. Boundary faces contribute zero flux. Thus and are the mass and stiffness matrices of the no-flux specialization in No-flux TPFA diffusion generator. For species diffusivities , the finite-volume diffusion equation is .
Define the doubled periodic grid with cells per direction on side lengths , using the same widths , as in Periodic rectangular reaction-diffusion grid. The reflection map extends evenly across every boundary face: in one coordinate, its extended index is for and for ; apply this coordinatewise. This finite reflection convention is used in the error theorem below.
Depends on
Used by
Dependency tree · two levels
6 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
- R. Eymard, T. Gallouët, and R. Herbin, Finite Volume Methods, updated author text, 2019 (standard reference, not scraped)