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 formal adjoint and the adjoint weak Dirichlet problem
Definition
Assume Countable Choice. Let be open and let be as in Uniformly elliptic divergence-form operators and their sesquilinear forms. The adjoint form is a bounded sesquilinear form on with the same bound as (Bounded, coercive and symmetric sesquilinear forms, The elliptic form is well defined and bounded on ); in coefficients The formal adjoint is the expression , understood as a distribution: for , . Indeed the coefficient products are locally integrable, hence define regular distributions by Locally integrable functions embed in distributions, and the signed derivative rule of Distributional derivative gives exactly the displayed form. Even for smooth , need not be a locally integrable function when the coefficients are merely measurable; an integral is used only when it is represented by such a function; the form is the primary object and is defined before any integration by parts. The adjoint weak Dirichlet problem with datum asks for with and its homogeneous version is for all . No orthogonality is invoked in this definition. Since , the Garding constants of Garding's inequality for a divergence-form elliptic operator also apply to , and is coercive for (A sufficiently large shift is coercive).
Conventions recorded with the definition. All pairings are the or pairings of the cited items, with conjugation in the second slot; the datum acts through the conjugate-linear functional , which is an element of by the Cauchy--Schwarz estimate (The negative Sobolev space , Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure, Real and imaginary parts, complex conjugation, and modulus). The formal expression is recorded as the operator whose weak pairing reproduces on smooth compactly supported functions; is not claimed to be of the same divergence form as , and no boundary condition is attached to it beyond the test class . The adjoint weak problem is stated for test functions exactly as in Weak Dirichlet solutions for a divergence-form operator, and no existence or uniqueness is asserted here.
Depends on
- A sufficiently large shift is coercive
- Bounded, coercive and symmetric sesquilinear forms
- Real and imaginary parts, complex conjugation, and modulus
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The negative Sobolev space $H^{-1}(\Omega)$
- Integer-order Sobolev spaces and their norms
- Uniformly elliptic divergence-form operators and their sesquilinear forms
- Weak Dirichlet solutions for a divergence-form operator
- Zero-boundary Sobolev space as a norm closure
- The elliptic form is well defined and bounded on $H^1$
- Garding's inequality for a divergence-form elliptic operator
- Locally integrable functions embed in distributions
- Distributional derivative
Used by
- Elliptic Fredholm solvability can fail at an eigenvalue Counterexample
- The L² operator associated with a symmetric elliptic form Definition
- The adjoint solution operator solves the adjoint form problem Lemma
- The associated elliptic operator is densely defined, symmetric and lower bounded Lemma
- The elliptic Fredholm range condition is orthogonality to the adjoint kernel Lemma
- The symmetric shifted solution operator is positive and self-adjoint Lemma
- The Fredholm alternative for weak elliptic Dirichlet problems Theorem
Dependency tree · two levels
63 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 notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, 2020, complete 158-page graduate notes) (standard reference, not scraped)
- Leon Simon, Lectures on Partial Differential Equations (Stanford, complete 223-page author scan) (standard reference, not scraped)