Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass
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 V,Q be real Hilbert spaces and let b:V×Q→R be a bounded bilinear form. Define B:V→Q by (Bv,q)Q=b(v,q). If Q={0}, the unique zero map is a bounded right inverse. If Q≠{0}, assume V≠{0} and define β:=inf⁡q≠0sup⁡v≠0b(v,q)∥v∥V∥q∥Q. When β>0, B is onto and has a bounded linear right inverse R:Q→V with BR=IQ and ∥R∥≤β−1.

Facts & Assumptions

Given: Real Hilbert spaces V,Q, a bounded bilinear form, and β>0 as displayed.

[A1]

Countable Choice is used by the Lax–Milgram theorem applied to the coercive form (B* q,B* r). (The Axiom of Countable Choice (ACω))

[F1]

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)

[F2]

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 (ACω))

[F3]

Riesz representation applied to v↦b(v,q) defines B∗q by (Bv,q)Q=(v,B∗q)V and gives ∥B∗q∥V=sup⁡v≠0∣b(v,q)∣/∥v∥V. (Riesz representation for Hilbert spaces, Hilbert space)

Proof

1.1givenF3algebra

If Q={0}, the unique map R:Q→V is a bounded right inverse and the claim is complete. Otherwise, since the scalar field is real, replacing v by −v changes the sign of b(v,q); hence the displayed supremum equals the supremum of ∣b(v,q)∣/(∥v∥∥q∥). By [F3], ∥B∗q∥V≥β∥q∥Q.

2.1A1F1F2F3step 1.1

On Q, define c(q,r):=(B∗q,B∗r)V. It is bounded by ∥B∥2∥q∥∥r∥ and coercive with constant β2 by step 1.1. For arbitrary g∈Q, the functional r↦(g,r)Q is bounded, so [F2] gives a unique q∈Q with (B∗q,B∗r)V=(g,r)Q for all r. The adjoint identity implies BB∗q=g.

3.1A1F2F3algebrastep 1.1step 2.1∎

Set Rg:=B∗q, with q from step 2.1. Uniqueness in Lax–Milgram makes this assignment linear, and the adjoint identity in [F3] gives BRg=g. Also ∥Rg∥2=(g,q)≤∥g∥∥q∥ while step 2.1 gives β∥q∥≤∥Rg∥. If Rg=0 the desired bound is immediate; otherwise combine and divide to obtain ∥Rg∥≤β−1∥g∥. Thus R 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