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.
Injectivity removes the term from the global estimate
Statement
Assume the Axiom of Choice. Let , , let be a bounded domain and let be uniformly elliptic with , as in Global Dirichlet estimate on a domain. Assume that the homogeneous Dirichlet problem has only the trivial strong solution: if and almost everywhere, then . Then there is with No symmetry of is used and no spectral hypothesis beyond the stated injectivity enters; the constant can additionally depend on the particular operator through its separation from a nontrivial Dirichlet kernel. Injectivity alone supplies no bound uniform over all operators with the same coefficient upper bounds. The Axiom of Choice is needed because the compactness alternatives of Rellich--Kondrachov are invoked.
Facts & Assumptions
Given: the Axiom of Choice, , , the bounded domain , the operator with the stated coefficient bounds, the injectivity hypothesis, and the a priori estimate of Global Dirichlet estimate on a domain.
The Axiom of Choice is the standing hypothesis; it is inherited by the a priori estimate and Sobolev completeness, and used through the compactness and extension theorems that make a bounded extension domain. (The Axiom of Choice)
A priori estimate (Global Dirichlet estimate on a domain): there is with for all .
Compactness alternatives for a bounded extension domain : for every bounded sequence in has a subsequence converging in (The Rellich--Kondrachov theorem for on bounded extension domains with ); for every bounded sequence in has a subsequence converging in for each fixed finite , in particular (Rellich--Kondrachov at the critical source exponent ); for every bounded sequence in has a subsequence converging in for every , in particular (Morrey--Rellich compactness for ).
A bounded domain is a bounded Lipschitz extension domain for : there is a bounded extension operator (Bounded C^k domains and boundary charts, Bounded C^k domains admit integer-order Sobolev extension). This is the only extension input used here, to verify that the Rellich--Kondrachov results in [F2] apply; no extension for is needed.
On the subspace , which is closed in the operator is bounded into : for ; the space is closed in and hence in . (Integer-order Sobolev spaces and their norms, Zero-boundary Sobolev space as a norm closure)
Proof
Contradiction setup and a bounded sequence. Suppose the inequality fails: then for every integer there is with and ; equivalently, after rescaling, a sequence with and . For each the norm is bounded by the norm up to constants, so is bounded in , and by [F3] the domain is a bounded extension domain for .
An -convergent subsequence. By [F2] applied to the bounded sequence , in each of the three cases , , there is a subsequence, relabelled , converging in to some . In the case the admissible exponents form the interval and is admissible; in the case every finite is admissible and ; in the case every is admissible and .
Cauchy in via the a priori estimate. Apply [F1] to the differences : The first two terms tend to by construction, and the third by the convergence of step 2.1; hence is Cauchy in , which is complete by Integer-order Sobolev spaces are Banach, and converges to some with equal to the -limit of step 2.1.
The limit is a vanishing strong solution. The space is closed in by [F4], so belongs to it; the boundedness of and in give almost everywhere. By the injectivity hypothesis .
Contradiction. Applying [F1] to and using the normalization, because and by steps 2.1 and 4.1. This contradiction shows that the failure assumed in step 1.1 is impossible, that is, there is with for all .
Conclusion. Assume that the only strong solution of in is . Then the compactness of the Sobolev embedding upgrades the a priori estimate [F1] to the pure estimate displayed in the statement, the constant absorbing the term through the contradiction argument. No symmetry, self-adjointness or spectral hypothesis on is used, and the only choice principle invoked is the Axiom of Choice, including its inherited uses in the a priori estimate, completeness, Rellich--Kondrachov and extension theorems.
Remarks
- The structure is the classical one: a priori estimate plus compactness turns injectivity of the homogeneous problem into the sharper estimate without the term. The compactness is used only to extract an -convergent subsequence; the convergence is then produced by the estimate itself.
- The three Rellich--Kondrachov branches are the reason the corollary assumes the Axiom of Choice, and the a priori estimate used here also assumes Choice through its trace and extension suppliers. If one of the suppliers were only available under a weaker principle, the corresponding branch would have to be stated separately.
Depends on
- Global $W^{2,p}$ Dirichlet estimate on a $C^{1,1}$ domain
- The Rellich--Kondrachov theorem for $1\le p<n$ on bounded extension domains
- Rellich--Kondrachov at the critical source exponent $p=n$
- Morrey--Rellich compactness for $p>n$
- Bounded C^k domains admit integer-order Sobolev extension
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- The Axiom of Choice
- Bounded C^k domains and boundary charts
- Integer-order Sobolev spaces are Banach
Used by
Nothing in the library uses this result yet.
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
- Armin Schikorra, Partial Differential Equations I & II (version October 1, 2025; complete 281-page graduate lecture notes) (standard reference, not scraped)
- John Villavert, Elementary Theory and Methods for Elliptic Partial Differential Equations (2017; complete 220-page lecture notes) (standard reference, not scraped)
- Leon Simon, Lectures on Partial Differential Equations (Stanford University; complete 118-page author notes, Chapter 12 Schauder Theory) (standard reference, not scraped)