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.
Fortin operators transfer the continuous inf-sup bound
Statement
Let and , and suppose the continuous inf-sup constant of is . If the constraint assertion is vacuous. Otherwise, for a Fortin operator as in Fortin operator for a discrete constraint with bound , define . Then .
Facts & Assumptions
Given: Conforming subspaces, , and a bounded linear Fortin operator preserving against .
For all and , and . (Fortin operator for a discrete constraint)
Proof
The case is vacuous, so fix . In these real spaces, replacing a nonzero velocity by its negative shows that the supremum of equals the supremum with in the numerator, both on and on any nonzero subspace . The continuous inf-sup bound gives , so some has . Constraint preservation [F1] then implies , and its norm bound forces ; in particular . Define . For every nonzero with , [F1] and the definition of this fixed- supremum give . If , preservation gives , so the same bound holds.
Taking the supremum over nonzero in step 1.1 and using the continuous bound yields . Divide by the positive , and only then take the infimum over . The real-sign equivalence in step 1.1 identifies with the stated , giving .
Depends on
Used by
Dependency tree · two levels
2 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, Chapters 53–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)