Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Weak solutions depend continuously on the data

Statement

Assume the Axiom of Choice and Countable Choice, and take the hypotheses of The inhomogeneous weak Dirichlet problem by a trace lifting with one fixed right inverse R and coercivity constant α=α0/(1+CP2) (the constant displayed there, where α0=θ−n CPMb−CP2Mc). If ui solve the weak Dirichlet problems with data (Fi,gi)∈H−1(Ω)×H1/2(∂Ω), i=1,2, then ∥u1−u2∥H1≤(1+Caα)∥R(g1−g2)∥H1+∥F1−F2∥H−1α≤C(Ω,a)(∥F1−F2∥H−1+∥g1−g2∥W1/2,2), where Ca=nMa+nMb+Mc is the full H1 bound of the form and C(Ω,a) depends only on the domain, the coefficients, the coercivity constant and the fixed right inverse. Thus the solution map is Lipschitz on the product of the data spaces, and u1=u2 when the data agree.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice; a bounded C1 domain Ω⊂Rn, n≥2; a divergence form a bounded on H1(Ω) with constant Ca and coercive on H01(Ω) with constant α>0; a fixed bounded right inverse R of the trace with T∘R=id; and solutions u1,u2∈H1(Ω) of the weak problems with data (Fi,gi).

[F1]

Each ui satisfies Tui=gi and a(ui,v)=Fi(v) for every v∈H01(Ω), and solve the problem via the lifting construction: ui=Rgi+wi with wi∈H01(Ω) (The inhomogeneous weak Dirichlet problem by a trace lifting, Weak Dirichlet solutions for a divergence-form operator).

[F2]

Linearity and boundedness: the same Ca from The elliptic form is well defined and bounded on H1 bounds a on all of H1(Ω)×H1(Ω), and hence also on the restriction to H01(Ω). Thus v↦(F1−F2)(v)−a(R(g1−g2),v) is a bounded conjugate-linear functional on H01(Ω) of norm at most ∥F1−F2∥H−1+Ca∥R(g1−g2)∥H1 (The negative Sobolev space H−1(Ω), The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

[F3]

A priori bound: any w∈H01(Ω) with a(w,v)=F~(v) for all v∈H01(Ω) satisfies α∥w∥H1≤∥F~∥H−1 (Testing a coercive weak solution with itself gives the energy bound, Lax--Milgram solvability for coercive divergence-form equations).

[F4]

Right-inverse bound: ∥R(g1−g2)∥H1≤∥R∥ ∥g1−g2∥W1/2,2 (A bounded right inverse of the trace, supported in a prescribed collar, The fractional Sobolev space on a compact C1 boundary, Integer-order Sobolev spaces and their norms).

[F5]

Proof

1.1F1F2algebra

The difference solves a shifted problem: put g:=g1−g2, F:=F1−F2 and w:=(u1−u2)−Rg. Then Tw=T(u1−u2)−TRg=g1−g2−g=0, so w∈H01(Ω), and for every v∈H01(Ω) first-slot linearity gives a(w,v)=a(u1,v)−a(u2,v)−a(Rg,v)=F(v)−a(Rg,v)=:F~(v).

1.2F2

Bound on the shifted datum: by [F2] the functional F~ is bounded and conjugate-linear with ∥F~∥H−1≤∥F∥H−1+Ca∥Rg∥H1.

2.1F3F4step 1.2algebra

Energy estimate and conclusion: the a priori bound [F3] applied to w and F~ gives ∥w∥H1≤∥F~∥H−1/α, hence by the triangle inequality and [F4] ∥u1−u2∥H1≤∥Rg∥H1+∥F∥H−1+Ca∥Rg∥H1α≤(1+Caα)∥R∥ ∥g1−g2∥W1/2,2+∥F1−F2∥H−1α, which is the first display; the second follows by absorbing 1+Ca/α and ∥R∥ into the constant C(Ω,a). If the data agree then g=0, F=0, F~=0 and w=0, so u1=u2.

3.1F5step 2.1∎

Operator form: the same estimate is the statement that the solution map (F,g)↦u is Lipschitz on H−1(Ω)×H1/2(∂Ω) with the displayed constant; the abstract mechanism is the norm bound ∥S∥≤1/α for the Lax--Milgram solution operator on the zero-boundary part.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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