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.

The global H2 estimate without the L2 term under uniqueness

Statement

Assume the Axiom of Choice and Countable Choice. In the setting of Global H2 Dirichlet regularity suppose that the homogeneous problem has only the trivial solution: u∈H01(Ω) and a(u,v)=0 for all v∈H01(Ω) imply u=0. Then for every f∈L2(Ω) the unique weak solution u∈H01(Ω) of Lu=f satisfies u∈H2(Ω) and there is C=C(n,Ω,θ,Ma,Mb,Mc,∥Daij∥∞,∥L−1∥L(L2(Ω),H01(Ω))) with ∥u∥H2(Ω)≤C ∥f∥L2(Ω). Thus the L2 term may be dropped exactly under the injectivity hypothesis, and the estimate is uniform over all data.

Facts & Assumptions

Given: the Axiom of Choice and Countable Choice; the bounded C2 domain and coefficient package of the global H2 theorem; and the triviality of the homogeneous problem.

[F1]

Global H2 estimate: for every f∈L2(Ω) and every weak zero-trace solution u of Lu=f one has ∥u∥H2(Ω)≤C1(∥f∥L2(Ω)+∥u∥L2(Ω)) with C1=C1(n,Ω,θ,Ma,Mb,Mc,∥Daij∥∞). (Global H2 Dirichlet regularity)

[F2]

Uniqueness implies existence and boundedness of the solution map: under the triviality of the homogeneous problem (the two homogeneous problems are equivalent by the finite dimension and equality of dimensions in the Fredholm alternative of The Fredholm alternative for weak elliptic Dirichlet problems), for every f∈L2(Ω) there is exactly one u∈H01(Ω) with a(u,v)=(f,v)L2 for all v∈H01(Ω), and the solution map f↦u is bounded from L2(Ω) to H01(Ω). (Uniqueness implies existence for the elliptic Dirichlet problem) The operator norm ∥L−1∥L(L2(Ω),H01(Ω)) is specific to this fixed operator and may grow as its spectrum approaches zero.

Proof

technique · direct
1.1F2

The solution map is bounded in H1. By [F2] and the triviality hypothesis, for every f∈L2(Ω) there is a unique zero-trace weak solution u of Lu=f, and the solution map is bounded from L2(Ω) to H01(Ω): ∥u∥H1(Ω)≤C2∥f∥L2(Ω) with C2=∥L−1∥L(L2,H01) for this fixed operator.

2.1F1step 1.1algebra

Combining with the H2 estimate. Since u∈H01(Ω)⊂L2(Ω), [F1] gives ∥u∥H2(Ω)≤C1(∥f∥L2(Ω)+∥u∥L2(Ω)), and ∥u∥L2(Ω)≤∥u∥H1(Ω)≤C2∥f∥L2(Ω) by step 1.1; hence ∥u∥H2(Ω)≤C(1+C2)∥f∥L2(Ω) with C the constant of [F1].

3.1step 2.1∎

Conclusion. Under the injectivity hypothesis the L2 term of the solution may be replaced by the norm of the datum, and the resulting estimate is uniform over all f∈L2(Ω); without the hypothesis the companion counterexample shows that the L2 term cannot be deleted.

Source notes

Hunter's Section 4.10 (printed pp. 106-110) proves the Fredholm alternatives for Lu−λu=f with the compact resolvent; the library's Fredholm page formalises them, and the corollary draws the standard consequence that a trivial kernel yields existence and a bounded solution map, which removes the L2 term of the global H2 estimate. The contradiction alternative via Rellich compactness recorded in the scaffold is subsumed by the formalised compactness statement of the Fredholm page.

Depends on

Used by

Dependency tree · two levels

42 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