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 elliptic Fredholm range condition is orthogonality to the adjoint kernel
Statement
Assume the Axiom of Choice and Countable Choice. Let be bounded open, , and let be as in The adjoint solution operator solves the adjoint form problem. For , where is the adjoint form of The formal adjoint and the adjoint weak Dirichlet problem and is the shifted solution operator of The shifted elliptic solution operator.
Facts & Assumptions
Given: the Axiom of Choice and Countable Choice; a bounded open set ; a fixed ; the operators on ; and .
Compactness: is a compact operator on the Banach space , so is an identity-minus-compact operator (The shifted solution operator is compact on , The space as the quotient by null functions, The Axiom of Choice).
Fredholm alternative: for a compact operator on a Banach space and , an element lies in if and only if for every in , where is the transpose on the dual (Fredholm alternative for identity minus compact, The transpose of a bounded operator).
Riesz representation: every bounded linear functional on has the form for a unique , and for the Hilbert adjoint one has (Riesz representation for Hilbert spaces, The Hilbert-space adjoint of a bounded operator, The dual space X^* of a normed space and its dual norm).
Kernel of : for , if and only if and for every (The adjoint solution operator solves the adjoint form problem).
Adjoint identity: for all , and (The adjoint solution operator solves the adjoint form problem, The shifted elliptic solution operator).
Proof
The operator is a bounded linear operator on the Banach space , and is compact by [F1]. By the Fredholm alternative [F2] applied with and , the inclusion is equivalent to the vanishing of for every bounded linear functional with .
Description of . For let be its Riesz vector, as in [F3]. Then, using the transpose identity and the Hilbert adjoint, for all , so if and only if . For such a vector, [F5] gives since ; because this vanishes if and only if .
Weak form of the kernel. By [F4] the condition is equivalent to and for every . Substituting into step 2.1, holds if and only if for every with for all , as claimed.
Depends on
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The dual space X^* of a normed space and its dual norm
- The formal adjoint and the adjoint weak Dirichlet problem
- The Hilbert-space adjoint of a bounded operator
- The space $L^p(\mu)$ as the quotient by null functions
- The shifted elliptic solution operator
- The transpose of a bounded operator
- The adjoint solution operator solves the adjoint form problem
- Elementary kernel and range annihilator identities
- The shifted solution operator is compact on $L^2$
- Fredholm alternative for identity minus compact
- Riesz representation for Hilbert spaces
Used by
Dependency tree · two levels
66 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)
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations (Springer Universitext, 2011, complete 614-page text) (standard reference, not scraped)