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.
Finite-volume companions, mean tests and weak-gradient closure
Statement
Assume the Axiom of Choice and a family in Finite-volume families with a regular simplicial companion. For and zero boundary face values, put where have the formulas in Hybrid mimetic finite-volume diffusion on general meshes. Then, with constants independent of , Here . If and , also For , . If the cell points are volume centroids, then for smooth with compact support in , uniformly and , where . Finally, for every smooth vector field on a neighborhood of , Consequently bounded , strong convergence , and weak convergence imply distributionally. The same statements hold after integration in time with the corresponding bounds.
Facts & Assumptions
Given: AC, the explicit regular companion geometry, , the mean interpolator and zero boundary cell-face vectors.
Finite-volume families with a regular simplicial companion gives , , , shape-regular simplex maps, and uniformly bounded vertex-star paths.
Sobolev face traces and Gauss–Green on a reference simplex and Poincare–Wirtinger inequality on a reference simplex give the face trace, Gauss–Green and mean-zero Poincaré inequalities. Affine rescaling gives on a subdivision simplex and facet the bounds and .
Hybrid mimetic finite-volume diffusion on general meshes defines and ; its face-moment identities hold for actual polytopes by applying simplex Gauss–Green to constants and coordinate functions and cancelling subdivision facets.
The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction bounds by for ; The subcritical W0 one p embedding into L2 gives the continuous inclusion on the strict stated branch. Finite-sum and integral Hölder inequalities are Holder's inequality for integrals, including the endpoint cases.
Proof
Write . The moment cancellation gives . Hölder, the bounded face count and [F1] imply . Since and , summing gives . Conversely gives .
If share , . Along a supplied vertex-star path, the difference between and any other incident cell value is a sum of at most such increments. At a boundary vertex the same telescoping ends at a zero boundary face. Hence for every simplex and its vertex , , where is the union of the finitely many supplied paths at its vertices. These sets have bounded cardinality and bounded overlap: a cell has at most subdivision vertices and each vertex has at most incident cells.
The scaled simplex estimates [F2] first bound the difference between the mean on a simplex and the mean on one of its facets by . Means on adjacent simplices differ by the sum of their differences to the shared facet mean, since their traces agree. The fan subdivision is a connected finite union of at most simplices. Telescoping between their means, and averaging over each original cell or original face, therefore gives . The same trace argument applies to boundary faces; zero-boundary approximation makes their means zero. Multiplication by and summation proves .
For smooth , Gauss–Green gives exactly. On each cell Taylor expansion around its centroid and the corresponding face averages show under the stated centroid hypothesis. Thus for this mean interpolator the residual sum is at most , because there are cells. Uniform continuity of gives the asserted gradient consistency.
Barycentric coordinates on have absolute value at most one and gradients at most , by the inradius bound. Applying step 1.2 to gives its th-power norm at most times the path sum, and its gradient norm at most times that sum. Summing with bounded overlap proves and . The continuous piecewise affine function vanishes on all boundary facets. Its zero extension is globally Lipschitz and has compact support: along a segment, the finite simplex pieces and the exterior zero pieces have derivative bounded by the largest simplex gradient and agree at crossings. To verify the zero-boundary closure directly, multiply by . The error and its gradient are supported in shrinking boundary layers, and bounds the cutoff-gradient term by on the layer . They tend to zero in by absolute continuity of the integral. Each cutoff is Lipschitz with compact support in and can be mollified inside , producing smooth compactly supported approximants. Thus , and [F4] proves the full bound and the state bound.
For , the same barycentric estimate in and for the combined finite coefficient list give . For , finite-measure Hölder and step 2.1 give instead. The exponent is positive precisely on the stated strict branch. The continuous embedding [F4] bounds , proving the state estimate as well.
Let and denote vector means over cells and faces. Gauss–Green, shared face cancellation and on the boundary give exactly . Since , Hölder bounds this by . The last sum is uniformly bounded by [F1], proving the estimate. Strong and weak convergence pass its left side to , which is zero; interior compactly supported tests identify . Hölder in time gives the same assertions for space-time bounds.
Depends on
- Finite-volume families with a regular simplicial companion
- Hybrid mimetic finite-volume diffusion on general meshes
- Sobolev face traces and Gauss–Green on a reference simplex
- Poincare–Wirtinger inequality on a reference simplex
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- The subcritical W0 one p embedding into L2
- Holder's inequality for integrals, including the endpoint cases
- The Axiom of Choice
Used by
Dependency tree · two levels
47 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
- Jérôme Droniou, Finite volume schemes for diffusion equations: introduction to and review of modern methods, 2014 (standard reference, not scraped)