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 estimate without the term under uniqueness
Statement
Assume the Axiom of Choice and Countable Choice. In the setting of Global Dirichlet regularity suppose that the homogeneous problem has only the trivial solution: and for all imply . Then for every the unique weak solution of satisfies and there is with Thus the 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 domain and coefficient package of the global theorem; and the triviality of the homogeneous problem.
Global estimate: for every and every weak zero-trace solution of one has with . (Global Dirichlet regularity)
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 there is exactly one with for all , and the solution map is bounded from to . (Uniqueness implies existence for the elliptic Dirichlet problem) The operator norm is specific to this fixed operator and may grow as its spectrum approaches zero.
Proof
The solution map is bounded in . By [F2] and the triviality hypothesis, for every there is a unique zero-trace weak solution of , and the solution map is bounded from to : with for this fixed operator.
Combining with the estimate. Since , [F1] gives , and by step 1.1; hence with the constant of [F1].
Conclusion. Under the injectivity hypothesis the term of the solution may be replaced by the norm of the datum, and the resulting estimate is uniform over all ; without the hypothesis the companion counterexample shows that the term cannot be deleted.
Source notes
Hunter's Section 4.10 (printed pp. 106-110) proves the Fredholm alternatives for 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 term of the global 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
- The H² estimate needs the L² kernel term without injectivity Counterexample
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
- John K. Hunter, Notes on Partial Differential Equations (UC Davis, revised 18 June 2014, complete 242-page two-quarter graduate notes) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2025 archived author manuscript, complete 392 pages) (standard reference, not scraped)