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.
Multidimensional P1 SUPG consistency, coercivity, and error bound
Statement
Use the model of Stationary multidimensional convection–diffusion–reaction P1 model and form/parameter of Multidimensional P1 SUPG residual form and parameter scaling. Assume Countable Choice, and let solve the stated strong problem. For every continuous, zero-boundary function whose restriction to each cell has square-integrable values and square-integrable weak first derivatives, define Then the discrete form is coercive: the discrete problem has a unique solution , and the method is consistent, . Moreover, with depending only on dimension, shape regularity, and the interpolation constant, This is a P1 estimate for the stated strong regularity and parameter branch; it does not claim stability for unrestricted multidimensional parameters or weaker regularity.
Facts & Assumptions
Given: Countable Choice; a connected polyhedral domain with a finite shape-regular affine simplicial mesh; , , , , the parameter bound in Multidimensional P1 SUPG residual form and parameter scaling, and an exact solution with zero boundary values.
Stationary multidimensional convection–diffusion–reaction P1 model: the mesh is matching and shape regular, is continuous P1 with zero boundary values, and the coefficient and strong-solution hypotheses above hold.
Multidimensional P1 SUPG residual form and parameter scaling: is the Galerkin form plus the cell residual pairing with , and .
Gauss–Green formula on an affine simplex under The Axiom of Countable Choice (): on each affine simplex, a vector field has volume divergence integral equal to its outward facet flux sum.
Countable Choice is used only through the imported simplex Gauss–Green identity [F4] (The Axiom of Countable Choice ()).
Proof
For , apply [F4] on each cell to . Interior fluxes cancel because and are continuous and the outward normals oppose; boundary fluxes vanish because . Hence .
For the exact , apply [F4] cellwise to . The interior fluxes cancel and the boundary flux vanishes, so . Since , adding gives .
Let . Enlarge the interpolation constant if necessary so ; this preserves [F3]. By [F3], , , and . Cellwise, , so . The Euclidean matrix norm and Cauchy–Schwarz on the diagonal give ; integrating yields . The triangle inequality in the finite product of cellwise spaces then gives . Also , so the product norm satisfies .
Since is affine on each cell, . Substituting step 1.1 into [F2] gives . On each cell, Cauchy–Schwarz and [F2] give : write the left bound as , use the first factor , then . Since , this proves .
The linear map induced by has zero kernel: if for all , test with and use step 2.1 to get . The spaces have equal finite dimension, so this map is bijective and the discrete problem has a unique solution .
Subtract the discrete equation from step 1.2 to obtain for every . Put . Taking and using gives .
Cauchy–Schwarz bounds the diffusion, convection, reaction, and stabilization terms in by , , , and , respectively. If the bound below is immediate; otherwise divide step 4.1 by its norm and use coercivity in step 2.1 to get .
The norm in the statement is the product norm of , so . Using step 1.3 in step 5.1 bounds the sum by . Since , this is at most the displayed right-hand side with , which has the claimed dependence.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Volker John, Numerical Methods for Convection-Dominated Problems, lecture notes, Chapter 5 (standard reference, not scraped)
- Hans Petter Langtangen, INF5620: Numerical Methods for Partial Differential Equations, lecture slides (standard reference, not scraped)