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.
Weak maximum principle for coercive divergence-form equations
Statement
Assume Countable Choice and the Axiom of Choice through the Poincare and Sobolev suppliers below. Let , let be a bounded domain, and let , and the real coefficient functions be as in Weak subsolutions and supersolutions of a divergence-form equation, with ellipticity constant and bounds . Let and be a real local weak subsolution of . Suppose the weak sign condition holds, and assume a.e. on . Then:
-
Homogeneous case. If a.e., then with the boundary supremum of Weak subsolutions and supersolutions of a divergence-form equation. If in addition , , and is a weak solution of , then .
-
Forcing with signed lower order. If , a.e. and for some ( when ), then the local inequality extends to all nonnegative tests and where enters only through its Poincare constant and volume.
If is a weak supersolution of under either set of hypotheses, apply the corresponding bound to for the same operator coefficients and source . This gives in the homogeneous case and in the forcing case. The maximum-principle conclusions concern real-valued classes and real coefficients.
Facts & Assumptions
Given: Countable Choice and the Axiom of Choice; a bounded domain , ; real coefficients with and , , a.e.; with ; and a weak subsolution satisfying the weak sign condition.
Assume the Axiom of Choice. Trace, boundary order and truncation: and if and only if a.e.; moreover with , and for the class is an admissible nonnegative test (A function whose trace is at most a level has positive part in the zero-boundary space, Positive-part truncation calculus and admissible cut-off weak tests, Weak subsolutions and supersolutions of a divergence-form equation, The trace operator on a bounded domain, The kernel of the trace is the closure of the test functions).
Sobolev inputs, all in the stated dimension . The Gagliardo--Nirenberg--Sobolev inequality is stated for (The p=1 Gagliardo-Nirenberg-Sobolev inequality); if , approximate it in by , extend each approximant by zero to , and pass to the limit to get . Holder on measurable then gives . The density and zero-extension convention is Zero-boundary Sobolev space as a norm closure, and the Sobolev norms are those of Integer-order Sobolev spaces and their norms. For and there is with for , (The Sobolev inequality for zero-boundary Sobolev closures on open sets); for the embedding holds on bounded extension domains for every finite (The critical Sobolev embedding into every finite ). In particular, on the bounded domain , for one has for , while for every finite is available, with corresponding constants . In dimension two these zero-boundary constants require only the volume: for , set , so . Finite measure makes by the same smooth approximants, and the zero-boundary Sobolev inequality gives . This proves the claimed dependence of the forcing constant on volume and Poincare constant alone.
Poincare inequality on : there is with for every (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction).
Chebyshev and Holder: for nonnegative measurable ; and for exponents one has for measurable of finite measure (Chebyshev-Markov inequality for the integral, Holder's inequality for integrals, including the endpoint cases, The space as the quotient by null functions, The essential supremum of a measurable function with respect to a measure, The essential supremum is attained as the least essential bound).
Nonlinear iteration: if with , and , then with and (The nonlinear geometric iteration: an explicit threshold forces convergence to zero).
Proof
Homogeneous maximum bound. Put . If the bound is immediate. Otherwise and by [F1]. Since the equation is homogeneous, boundedness of the form and density extend its inequality from nonnegative compactly supported smooth tests to all nonnegative tests. For the weak sign condition, choose real with in . Then and in , since Cauchy--Schwarz gives convergence of both the functions and their gradients. Thus with , and boundedness of makes continuous on ; the sign condition therefore holds on without asserting . Testing with and using on gives The lower-order quadratic term is by and the extended weak sign condition; the boundary-shift term is nonnegative as well. Hence , and Poincare gives . Therefore .
Forcing energy bound. Assume , , and with the stated exponent. If , the claim is immediate; otherwise set . Since , Sobolev and Holder show that defines a continuous functional on , so the local subsolution inequality extends to this test. On , , and testing gives For take ; for take any finite . Holder, Poincare and the available Sobolev embedding imply . Thus , where constants depend only on the parameters in the Statement.
The forcing iteration. Write . If , step 1.2 gives . Otherwise fix and define , , , and . Let be conjugate to , and choose for ; for choose finite . Set , , and . For , and gives ; for , by the choice of . Testing with and using , Holder on , and Sobolev gives (if , Poincare gives ). Also and Sobolev gives . Consequently Set and . Choose with and , where by step 1.2. Then and . The nonlinear iteration [F5] gives , hence . Since and , this forces a.e. on , proving the forcing bound. The finite choice in dimension two uses the full open range of the critical Sobolev embedding.
Supersolutions and equality. If is a weak supersolution of , then is a weak subsolution of the same operator with coefficients and source , by linearity of the form; applying step 1.1 or step 2.1 yields the stated lower-bound versions with and . If is a weak solution of with , let . For every finite a.e. upper bound on , , so [F1] implies a.e.; taking infima gives . If , this forces . If is finite, , and density extends the weak identity to this test. Since , it gives , so a.e. The reverse trace bound just proved gives , and hence .
Depends on
- Weak subsolutions and supersolutions of a divergence-form equation
- Positive-part truncation calculus and admissible cut-off weak tests
- A function whose trace is at most a level has positive part in the zero-boundary space
- The nonlinear geometric iteration: an explicit threshold forces convergence to zero
- The p=1 Gagliardo-Nirenberg-Sobolev inequality
- Zero-boundary Sobolev space as a norm closure
- Integer-order Sobolev spaces and their norms
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- The Sobolev inequality for zero-boundary Sobolev closures on open sets
- The critical Sobolev embedding into every finite $L^q$
- Chebyshev-Markov inequality for the integral
- Holder's inequality for integrals, including the endpoint cases
- The essential supremum is attained as the least essential bound
- The essential supremum of a measurable function with respect to a measure
- The space $L^p(\mu)$ as the quotient by null functions
- The $L^p$ trace operator on a bounded $C^1$ domain
- The kernel of the trace is the closure of the test functions
- Bounded C^k domains and boundary charts
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
- Weak comparison and uniqueness for the Dirichlet problem Corollary
- The weak maximum principle needs the zero-order sign condition Counterexample
- The weak and the classical maximum principles agree on a smooth subsolution Example
- De Giorgi local boundedness with a scale-correct forcing term Theorem
- Weak Harnack inequality for nonnegative supersolutions Theorem
Dependency tree · two levels
102 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
- Leon Simon, Lectures on Partial Differential Equations (Stanford University; complete author scan, 118 sheets reproducing the 223 printed pages of the manuscript, two logical pages per sheet) (standard reference, not scraped)
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (author manuscript, version 11 February 2025; complete 392-page archived text) (standard reference, not scraped)
- Brian Krummel, DeGiorgi-Nash lecture notes (15 March 2016; complete 9-page notes) (standard reference, not scraped)