Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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.

Stampacchia's variational inequality

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a real Hilbert space (Hilbert space), let K⊆H be nonempty, closed and convex, let a:H×H→R be a bounded coercive bilinear form with constants M,α>0 (Bounded, coercive and symmetric sesquilinear forms; no symmetry is assumed), and let F:H→R be a bounded linear functional. Then there is exactly one u∈K with a(u, v−u)≥F(v−u)for every v∈K.

Facts & Assumptions

Given: A real Hilbert space H with inner product ⟨⋅,⋅⟩ linear in the first argument, a nonempty closed convex K⊆H, a bilinear form a bounded by M and coercive with constant α, and a bounded linear functional F, with Countable Choice available.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice, consumed through the Riesz representation theorem and the projection theorem.

[F1]

Riesz representation for Hilbert spaces: there is a unique f∈H with F(w)=⟨w,f⟩ for every w∈H.

[F2]

A bounded form is represented by a unique bounded operator: there is a unique bounded linear operator A∈B(H) with a(u,v)=⟨Au,v⟩ for all u,v∈H and ∥A∥≤M; coercivity is equivalent to ⟨Au,u⟩≥α∥u∥2 for every u∈H.

[F3]

Bounded, coercive and symmetric sesquilinear forms, Real and complex inner-product spaces and their induced length: ∣a(u,v)∣≤M∥u∥∥v∥ and a(u,u)≥α∥u∥2, and on a real inner product space ∥z−ρAz∥2=∥z∥2−2ρ⟨Az,z⟩+ρ2∥Az∥2.

[F4]

Projection onto a nonempty closed convex set, The metric projection onto a closed convex set is nonexpansive: the metric projection PK:H→K is well defined and 1-Lipschitz on H.

[F7]

The projection onto a closed convex set is characterised by a variational inequality: for u∈K one has u=PKx if and only if ⟨u−x,v−u⟩≥0 for every v∈K.

[F8]

A bounded linear operator between normed spaces: a bounded linear operator is continuous and ∥Aw∥≤∥A∥∥w∥ for every w.

[F9]

Bounded, coercive and symmetric sesquilinear forms: in the real convention, boundedness and coercivity are defined by their inequalities without requiring symmetry; symmetry is an additional property.

Proof

technique · direct

Given: A real Hilbert space H, a nonempty closed convex K⊆H, a bounded coercive bilinear form a with constants M,α>0, a bounded linear functional F, and Countable Choice.

1.1givenA1F1F2F9

By [F1] fix f∈H with F(w)=⟨w,f⟩ for all w; by [F2] fix A∈B(H) with a(u,v)=⟨Au,v⟩, ∥A∥≤M and ⟨Au,u⟩≥α∥u∥2 for all u. The real bilinear form need not be symmetric by [F9].

2.1step 1.1F2F3F4F6F8algebra

If H={0}, then K={0} and u=0 is the unique solution, since a(0,0)=F(0)=0. Otherwise choose z0≠0; boundedness and coercivity give α∥z0∥2≤a(z0,z0)≤M∥z0∥2, so 0<α≤M. Choose ρ:=α/M2 and q:=1−α2/M2, which satisfies 0≤q<1 and q2=1−2ρα+ρ2M2. For z∈H the expansion of [F3] together with ⟨Az,z⟩≥α∥z∥2 and ∥Az∥≤M∥z∥ [F2, F8] gives ∥(I−ρA)z∥2=∥z∥2−2ρ⟨Az,z⟩+ρ2∥Az∥2≤(1−2ρα+ρ2M2)∥z∥2=q2∥z∥2. Hence the map T(w):=PK(w−ρ(Aw−f)) satisfies ∥T(w)−T(w′)∥≤∥(I−ρA)(w−w′)∥≤q∥w−w′∥ for all w,w′∈K by the nonexpansiveness of PK [F4], that is, T is a contraction of K with constant q<1 [F6].

3.1step 2.1F5F6

The set K is a nonempty closed subset of the complete metric space H, hence complete for the subspace metric [F5]; the contraction T:K→K of step 2.1 therefore has exactly one fixed point u∈K by [F6], that is, u=PK(u−ρ(Au−f)).

4.1step 1.1step 3.1F7algebra

For u∈K, the fixed point equation u=PK(u−ρ(Au−f)) is equivalent, by [F7] applied with x=u−ρ(Au−f), to ⟨u−(u−ρ(Au−f)),v−u⟩≥0 for every v∈K, that is, to ρ⟨Au−f,v−u⟩≥0 for every v∈K; since ρ>0 this is equivalent to ⟨Au−f,v−u⟩≥0, hence to a(u,v−u)≥F(v−u) for every v∈K by step 1.1.

5.1step 4.1A1algebra∎

(Uniqueness and conclusion) Let u,u′∈K both satisfy the variational inequality. Testing the inequality for u at v=u′ and the inequality for u′ at v=u and adding gives a(u,u′−u)+a(u′,u−u′)≥F(u′−u)+F(u−u′)=0; bilinearity turns the left-hand side into −a(u−u′,u−u′), so a(u−u′,u−u′)≤0, and coercivity gives α∥u−u′∥2≤a(u−u′,u−u′)≤0, hence u=u′. The zero-dimensional case was settled in step 2.1; in the remaining case steps 3.1 and 4.1 exhibit the unique fixed point u∈K which solves the inequality, and the uniqueness argument just given makes it the only solution. This proves the statement, Countable Choice having entered only through [F1] and [F4] [A1].

Depends on

Used by

Dependency tree · two levels

80 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