Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 n≥2, let Ω⊂Rn be a bounded C1 domain, and let L, a and the real coefficient functions aij,bi,c be as in Weak subsolutions and supersolutions of a divergence-form equation, with ellipticity constant θ and bounds Ma,Mb,Mc. Let f∈Lloc1(Ω;R) and u∈H1(Ω;R) be a real local weak subsolution of Lu=f. Suppose the weak sign condition ∫Ω(c ζ+biDiζ)dx≥0for every ζ∈Cc∞(Ω), ζ≥0, holds, and assume c≥0 a.e. on Ω. Then:

  1. Homogeneous case. If f=0 a.e., then ess sup⁡Ωu≤sup⁡∂Ωu+, with the boundary supremum of Weak subsolutions and supersolutions of a divergence-form equation. If in addition b≡0, c≡0, and u is a weak solution of Lu=0, then ess sup⁡Ωu=sup⁡∂Ωu.

  2. Forcing with signed lower order. If b≡0, c≥0 a.e. and f∈Lq(Ω) for some q>n/2 (q>1 when n=2), then the local inequality extends to all nonnegative H01(Ω) tests and ess sup⁡Ωu≤sup⁡∂Ωu++C∥f+∥Lq(Ω),C=C(n,q,θ,Ma,Mc,Ω), where Ω enters C only through its Poincare constant and volume.

If u is a weak supersolution of Lu=f under either set of hypotheses, apply the corresponding bound to −u for the same operator coefficients (a,b,c) and source −f. This gives ess inf⁡Ωu≥−sup⁡∂Ωu− in the homogeneous case and ess inf⁡Ωu≥−sup⁡∂Ωu−−C∥f−∥Lq(Ω) 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 C1 domain Ω⊂Rn, n≥2; real coefficients aij,bi,c∈L∞(Ω) with θ∣ξ∣2≤⟨Aξ,ξ⟩ and ∣aij∣≤Ma, ∣bi∣≤Mb, ∣c∣≤Mc a.e.; f∈Lq(Ω) with q>n/2; and a weak subsolution u∈H1(Ω;R) satisfying the weak sign condition.

[F1]

Assume the Axiom of Choice. Trace, boundary order and truncation: sup⁡∂Ωu=ess sup⁡∂ΩTu and (u−k)+∈H01(Ω) if and only if Tu≤k a.e.; moreover (u−k)+∈H1(Ω) with D(u−k)+=1{u>k}Du, and for η∈Cc∞(Ω) the class η2(u−k)+ 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 Lp trace operator on a bounded C1 domain, The kernel of the trace is the closure of the test functions).

[F2]

Sobolev inputs, all in the stated dimension n≥2. The Gagliardo--Nirenberg--Sobolev inequality is stated for Cc∞(Rn) (The p=1 Gagliardo-Nirenberg-Sobolev inequality); if w∈W01,1(Ω), approximate it in W1,1 by Cc∞(Ω), extend each approximant by zero to Rn, and pass to the limit to get ∥w∥Ln/(n−1)(Ω)≤C(n)∥Dw∥L1(Ω). Holder on measurable E⊆Ω then gives ∫E∣w∣ dx≤C(n)∣E∣1/n∫Ω∣Dw∣ dx. 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 n≥3 and 1≤p<n there is S=S(n,p) with ∥w∥Lp∗≤S∥Dw∥Lp for w∈W01,p(Ω), p∗=np/(n−p) (The Sobolev inequality for zero-boundary Sobolev closures on open sets); for n=2 the embedding W1,2(Ω)↪Lκ(Ω) holds on bounded extension domains for every finite κ≥1 (The critical Sobolev embedding into every finite Lq). In particular, on the bounded C1 domain Ω, for n≥3 one has H01(Ω)↪Lκ(Ω) for 2≤κ≤2∗, while for n=2 every finite κ≥2 is available, with corresponding constants Sκ. In dimension two these zero-boundary constants require only the volume: for κ>2, set p=2κ/(κ+2)∈(1,2), so p∗=κ. Finite measure makes H01(Ω)⊂W01,p(Ω) by the same smooth approximants, and the zero-boundary Sobolev inequality gives ∥w∥κ≤C(2,p)∥Dw∥p≤C(2,p)∣Ω∣1/κ∥Dw∥2. This proves the claimed dependence of the forcing constant on volume and Poincare constant alone.

[F3]

Poincare inequality on W01,2(Ω): there is CP=CP(Ω) with ∥w∥L2(Ω)≤CP∥Dw∥L2(Ω) for every w∈H01(Ω) (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction).

[F4]

Chebyshev and Holder: ∣{w>t}∣≤t−p∫wp for nonnegative measurable w; and for exponents 1≤r<κ one has ∥w∥Lr(E)≤∣E∣1/r−1/κ∥w∥Lκ(E) for measurable E of finite measure (Chebyshev-Markov inequality for the integral, Holder's inequality for integrals, including the endpoint cases, The space Lp(μ) 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).

[F5]

Nonlinear iteration: if Yj+1≤CB jYj 1+δ with C,B≥1, δ>0 and Y0≤C−1/δ(2B)−1/δ2, then Yj≤Y0λj with λ=(2B)−1/δ and Yj→0 (The nonlinear geometric iteration: an explicit threshold forces convergence to zero).

Proof

technique · use the weak sign condition on the first- and second-order truncation tests for the homogeneous maximum bound; for forcing, combine the energy estimate with a De Giorgi iteration whose finite Sobolev exponent is chosen to make the recurrence superlinear
1.1givenF1F3algebra

Homogeneous maximum bound. Put t:=sup⁡∂Ωu+. If t=+∞ the bound is immediate. Otherwise t≥0 and w:=(u−t)+∈H01(Ω) 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 H01 tests. For the weak sign condition, choose real ϕj∈Cc∞(Ω) with ϕj→w in H01. Then ϕj2≥0 and ϕj2→w2 in W1,1, since Cauchy--Schwarz gives convergence of both the functions and their gradients. Thus w2∈W01,1 with D(w2)=2wDw, and boundedness of b,c makes ζ↦∫(cζ+biDiζ) continuous on W1,1; the sign condition therefore holds on w2 without asserting w2∈H01. Testing with w and using u=w+t on {w>0} gives 0≥a(u,w)=∫ΩaijDjwDiw+∫Ω(cw2+biDiw w)+t∫Ωcw. The lower-order quadratic term is ∫Ω(cw2+biDiw w)=12∫Ωcw2+12∫Ω(cw2+biDi(w2))≥0, by c≥0 and the extended weak sign condition; the boundary-shift term t∫cw is nonnegative as well. Hence θ∥Dw∥22≤0, and Poincare gives w=0. Therefore ess sup⁡Ωu≤t.

1.2givenF2F3F4algebra

Forcing energy bound. Assume b≡0, c≥0, and f∈Lq(Ω) with the stated exponent. If t:=sup⁡∂Ωu+=+∞, the claim is immediate; otherwise set v:=(u−t)+∈H01(Ω). Since q>n/2, Sobolev and Holder show that f defines a continuous functional on H01(Ω), so the local subsolution inequality extends to this test. On {v>0}, u=v+t, and testing gives θ∥Dv∥22≤∫Ωf+v≤∥f+∥q∥v∥q′. For n≥3 take κ=2∗; for n=2 take any finite κ>q′. Holder, Poincare and the available Sobolev embedding imply ∥v∥q′≤C∥Dv∥2. Thus ∥v∥H01+∥v∥2≤CE∥f+∥q, where constants depend only on the parameters in the Statement.

2.1step 1.2F2F3F4F5algebra

The forcing iteration. Write a:=∥f+∥Lq(Ω). If a=0, step 1.2 gives v=0. Otherwise fix T>0 and define kj=t+T(1−2−j), Ej:={u>kj}, Yj:=∫Ej(u−kj)2, and Bj:=∫Ω∣D(u−kj)+∣2. Let q′ be conjugate to q, and choose κ=2∗ for n≥3; for n=2 choose finite κ>2q′. Set δ:=1−2/κ>0, γ:=1/q′−1/κ>0, and β:=δ+2γ. For n≥3, δ=2/n and q>n/2 gives β=1+4/n−2/q>1; for n=2, β=1+2/q′−4/κ>1 by the choice of κ. Testing with (u−kj)+ and using c≥0, Holder on Ej, and Sobolev gives Bj1/2≤Ca∣Ej∣γ (if Bj=0, Poincare gives (u−kj)+=0). Also ∣Ej+1∣≤(T2−j−1)−2Yj and Sobolev gives Yj+1≤C∣Ej+1∣δBj+1. Consequently Yj+1≤C0a2T−2β22β(j+1)Yjβ. Set B:=22β and Zj:=Yj/T2. Choose T=C1a with C12≥C0B and C12≥CE(2B)1/(β−1)2, where Y0≤CEa2 by step 1.2. Then Zj+1≤(C0B/C12)BjZjβ≤BjZj1+(β−1) and Z0≤(2B)−1/(β−1)2. The nonlinear iteration [F5] gives Zj→0, hence Yj→0. Since (u−t−T)+≤(u−kj)+ and (u−t−T)+∈L2(Ω), this forces (u−t−T)+=0 a.e. on Ω, proving the forcing bound. The finite κ choice in dimension two uses the full open range of the critical Sobolev embedding.

3.1step 1.1F1F3algebra∎

Supersolutions and equality. If u is a weak supersolution of Lu=f, then −u is a weak subsolution of the same operator with coefficients (a,b,c) and source −f, by linearity of the form; applying step 1.1 or step 2.1 yields the stated lower-bound versions with u−=(−u)+ and f−. If u is a weak solution of Lu=0 with b=c=0, let s:=sup⁡∂Ωu. For every finite a.e. upper bound t on u, (u−t)+=0, so [F1] implies Tu≤t a.e.; taking infima gives s≤ess sup⁡Ωu. If s=+∞, this forces ess sup⁡Ωu=+∞=s. If s is finite, (u−s)+∈H01(Ω), and density extends the weak identity to this test. Since b=c=0, it gives 0=a(u,(u−s)+)=∫aijDj(u−s)+Di(u−s)+, so u≤s a.e. The reverse trace bound just proved gives s≤ess sup⁡Ωu, and hence ess sup⁡Ωu=s.

Depends on

Used by

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