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.
RT0/P0 Darcy stability and flux/pressure error bound
Statement
Assume Countable Choice, the Darcy data in No-flow mixed Darcy problem and coefficient norms, and a facet-connected shape-regular mesh. For at least two cells, set as in the stable lift theorem and define Let solve the continuous source-only Darcy problem () and the RT0/P0 Galerkin system. For any , put , , and Then the discrete pair exists uniquely and For a one-cell mesh , so the unique discrete pair is ; the nonzero- error theorem is not invoked. The constants display permeability contrast and do not assert contrast-independent robustness.
Facts & Assumptions
Given: Countable Choice, a continuous source-only Darcy solution, a facet-connected shape-regular mesh, and the stated permeability bounds.
Countable Choice is required by the continuous mixed and Galerkin solvability suppliers. (The Axiom of Countable Choice ())
The continuous Darcy pair exists uniquely in . (Continuous mixed Darcy well-posedness with pressure gauge)
For nonzero , the stable lift gives . (Uniform RT0/P0 divergence lift and inf-sup bound)
The discrete mixed kernel is exactly divergencefree. (The RT0/P0 discrete kernel is exactly divergence-free)
The Darcy form obeys and ; on the divergencefree kernel, . (No-flow mixed Darcy problem and coefficient norms)
For nonzero conforming finite-dimensional subspaces, positive , and discrete-kernel coercivity, the actual mixed Galerkin solution is unique and satisfies the displayed explicit bound with retained and with the exact bilinear-form norms as continuity constants. (Mixed Galerkin error bound retaining beta_h)
A one-cell RT0 field with zero flux on every facet is zero, by facet-flux unisolvence; a one-cell mean-zero P0 space is zero. (RT0 facet-flux unisolvence and global H(div) conformity, Affine simplicial meshes and RT/BDM spaces)
Proof
Suppose first there are at least two cells. Their independent cell constants, subject to one mean constraint, give . The stable lift [F2] then gives and a positive discrete inf-sup constant. If belongs to the discrete kernel, [F3] gives ; hence its graph norm is its norm and the coefficient lower bound [F4] gives discrete coercivity with . Write and for the exact norms on and . By [F4], and .
Apply [F5] to the conforming spaces , , continuous solution [F1], and the exact norms from step 1.1. This gives a unique Galerkin pair and the error bounds with . The supplied expressions are nondecreasing in the nonnegative quantities : is nondecreasing first, then , then . Since , , and , these replacements give exactly the stated upper bounds . For , the weighted bound follows from [F4] and , since .
If the mesh has one cell, every facet is a physical-boundary facet. The boundary-zero facet moments and [F6] force , while a constant with zero global mean is zero, so . The zero pair is the sole discrete pair. Finally , making the permeability-contrast dependence explicit in the formulas rather than uniform in that ratio.
Depends on
- No-flow mixed Darcy problem and coefficient norms
- Affine simplicial meshes and RT/BDM spaces
- RT0 facet-flux unisolvence and global H(div) conformity
- Continuous mixed Darcy well-posedness with pressure gauge
- Uniform RT0/P0 divergence lift and inf-sup bound
- The RT0/P0 discrete kernel is exactly divergence-free
- Mixed Galerkin error bound retaining beta_h
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
36 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Part XI Chapter 49: Well-posedness for PDEs in mixed form (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi and Michel Fortin, Mixed Finite Element Methods and Applications (standard reference, not scraped)