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 negative Sobolev space
Definition
Assume Countable Choice (The Axiom of Countable Choice ()) and let be open, , with the zero-boundary Sobolev space over (Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms, The notation and the reserved zero-boundary symbol). Define with Pairing convention. The pairing is linear in and conjugate-linear in ; it is the dual pairing of with , not the inner product. The map is an isometric conjugate-linear bijection of onto the Banach dual of The dual space X^* of a normed space and its dual norm (The operator norm as the least bound and as the unit-sphere or unit-ball supremum, The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators); the design's notation is read through this identification, which is the one compatible with the page's sesquilinear convention (linear in the first argument, conjugate-linear in the second) fixed in Bounded, coercive and symmetric sesquilinear forms. The space is a normed space, complete because is complete and is an isometry in both directions (If (Y) is Banach then (\mathcal B(X,Y)) is Banach, Real and imaginary parts, complex conjugation, and modulus). For the map is the corresponding element of under the conventions of The space as the quotient by null functions and Complex Lp classes and Euclidean test-function conventions, where complex integrability is in the sense of the latter; identifying a general element of with an function is an embedding statement, never a definition. Elements of are defined here by their action on Sobolev classes; this does not exclude their identification with distributions through smooth test functions.
Depends on
- Bounded, coercive and symmetric sesquilinear forms
- Real and imaginary parts, complex conjugation, and modulus
- Complex Lp classes and Euclidean test-function conventions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The dual space X^* of a normed space and its dual norm
- The notation $H^k$ and the reserved zero-boundary symbol
- The space $L^p(\mu)$ as the quotient by null functions
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- Integer-order Sobolev spaces and their norms
- The spaces \(\mathcal B(X,Y)\) and \(\mathcal B(X)\) of bounded linear operators
- Zero-boundary Sobolev space as a norm closure
- If \(Y\) is Banach then \(\mathcal B(X,Y)\) is Banach
Used by
- Obstacle complementarity in distribution form Corollary
- The inhomogeneous weak Dirichlet problem by a trace lifting Corollary
- Weak solutions depend continuously on the data Corollary
- The closed convex obstacle set and the obstacle variational inequality Definition
- The formal adjoint and the adjoint weak Dirichlet problem Definition
- Weak Dirichlet solutions for a divergence-form operator Definition
- Weak subsolutions and supersolutions of a divergence-form equation Definition
- L² forcing defines an H⁻¹ functional Example
- The weak Dirichlet Poisson problem on an interval Example
- L² forcing and divergence data embed in H⁻¹ with a quantitative bound Lemma
- De Giorgi local boundedness with a scale-correct forcing term Theorem
- Every H⁻¹ functional is an L² function plus a divergence Theorem
- Existence and uniqueness for the obstacle problem Theorem
- Existence and uniqueness for the weak Dirichlet Poisson problem Theorem
- Lax--Milgram solvability for coercive divergence-form equations Theorem
- Lewy–Stampacchia distribution bound for bounded-coefficient obstacle forms Theorem
- Weak Harnack inequality for nonnegative supersolutions Theorem
Dependency tree · two levels
54 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 notes) (standard reference, not scraped)
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations (Springer Universitext, 2011, complete 614-page text) (standard reference, not scraped)
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations (Springer Universitext, 2011, complete 614-page text) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (archived 2025 author manuscript) (standard reference, not scraped)