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.
A mini-element bubble detects an affine pressure gradient
Statement
Assume Countable Choice. Let be a -simplex, its interior barycentric bubble, and a nonconstant affine pressure. Define the local pairing and let . Then . This positive cell contribution does not by itself prove a global inf-sup bound.
Facts & Assumptions
Given: Countable Choice; a simplex , a nonconstant affine , and the mini-element scalar bubble .
The bubble is positive in the cell interior and vanishes on its boundary. (The conforming P1-bubble/P1 mini element)
The Stokes convention is ; the local pairing is its cell restriction. (Stokes velocity and pressure spaces and weak forms)
Countable Choice is assumed by the affine simplex Gauss--Green supplier. (The Axiom of Countable Choice ())
The divergence integral on an affine simplex equals its outward boundary flux. (Gauss–Green formula on an affine simplex)
Example
The local bubble-pressure pairing is computed by integration by parts.
Verification
Since is constant, . Apply [F3] to ; the boundary flux vanishes because on . Thus .
Because is nonconstant, ; because in the interior, the integrand is positive on a set of positive volume. Its integral is therefore strictly positive. The calculation concerns one cell contribution only.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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, Chapter 54 (complete course notes) (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi, Michel Fortin, Mixed Finite Element Methods and Applications (complete textbook) (standard reference, not scraped)