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.
Hilbert inf-sup gives a bounded constraint right inverse
Statement
Assume Countable Choice. Let be real Hilbert spaces and let be a bounded bilinear form. Define by . If , the unique zero map is a bounded right inverse. If , assume and define When , is onto and has a bounded linear right inverse with and .
Facts & Assumptions
Given: Real Hilbert spaces , a bounded bilinear form, and as displayed.
Countable Choice is used by the Lax–Milgram theorem applied to the coercive form (B* q,B* r). (The Axiom of Countable Choice ())
In a real Hilbert space every bounded linear functional is inner product with a unique vector of the same norm. (Riesz representation for Hilbert spaces)
Lax–Milgram under Countable Choice solves every bounded coercive real bilinear form on a Hilbert space, with solution norm at most the functional norm divided by the coercivity constant. (The Lax--Milgram theorem, The Axiom of Countable Choice ())
Riesz representation applied to defines by and gives . (Riesz representation for Hilbert spaces, Hilbert space)
Proof
If , the unique map is a bounded right inverse and the claim is complete. Otherwise, since the scalar field is real, replacing by changes the sign of ; hence the displayed supremum equals the supremum of . By [F3], .
On , define . It is bounded by and coercive with constant by step 1.1. For arbitrary , the functional is bounded, so [F2] gives a unique with for all . The adjoint identity implies .
Set , with from step 2.1. Uniqueness in Lax–Milgram makes this assignment linear, and the adjoint identity in [F3] gives . Also while step 2.1 gives . If the desired bound is immediate; otherwise combine and divide to obtain . Thus is the claimed bounded right inverse.
Depends on
Used by
Dependency tree · two levels
27 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)