Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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 weak maximum principle needs the zero-order sign condition

Statement refuted

Statement refuted. Let L be a uniformly elliptic divergence-form operator on a bounded smooth domain with bounded coefficients. Without a sign condition on its zero-order coefficient, every weak subsolution of Lu=0 satisfies ess sup⁡Ωu≤sup⁡∂Ωu+, where boundary order means (u−k)+∈H01(Ω).

Counterexample. Assume the Axiom of Choice and Countable Choice. Let Ω=Bπ(0)⊂R3, aij=δij, b=0, c=−1, and L=−Δ−1 in the convention of Uniformly elliptic divergence-form operators and their sesquilinear forms. Set u(x)=sin⁡∣x∣/∣x∣ for x≠0 and u(0)=1. Then u∈C∞(Ω‾)∩H01(Ω), Lu=0, u>0 in Ω and u=0 on ∂Ω. Thus u is a weak solution and a weak subsolution, but ess sup⁡Ωu=1>0=sup⁡∂Ωu+. The sign condition in Weak maximum principle for coercive divergence-form equations fails: for every nonzero nonnegative ζ∈Cc∞(Ω), ∫Ωcζ dx<0.

Facts & Assumptions

Given: The Axiom of Choice and Countable Choice; the ball Ω=Bπ(0)⊂R3; the coefficients aij=δij, bi=0, c=−1; and the function u(x)=sin⁡∣x∣/∣x∣ for x≠0, u(0)=1.

[F1]

The operator L=−Δ−1 is the divergence-form operator with aij=δij, b=0, c=−1 in the convention of Uniformly elliptic divergence-form operators and their sesquilinear forms; the ball Bπ(0) is a bounded C∞ domain with trace T (Bounded C^k domains and boundary charts, Weak subsolutions and supersolutions of a divergence-form equation).

[F2]

Assume the Axiom of Choice and Countable Choice. Classical-to-weak consistency: if Ω is a bounded C1 domain, u∈C2(Ω‾)∩H01(Ω) and Lu=f with f∈C(Ω‾), then u is a weak solution of Lu=f in the sense of Weak Dirichlet solutions for a divergence-form operator, i.e. a(u,v)=∫Ωfv‾ dx for every v∈H01(Ω) (Classical solutions satisfy the weak formulation).

[F3]

Assume the Axiom of Choice. {w∈H1(Ω):Tw=0}=H01(Ω) (The kernel of the trace is the closure of the test functions); consequently a class in C(Ω‾)∩H1(Ω) vanishing on ∂Ω has zero trace and belongs to H01(Ω).

[F4]

The smooth radial function r↦sin⁡r/r on (0,∞) has the convergent power series ∑j≥0(−1)jr2j/(2j+1)!, so u extends to a C∞ function on R3 with u(0)=1 (The notation Hk and the reserved zero-boundary symbol for the Sobolev class notation).

Counterexample

1.1givenF4algebra

The function u is smooth and solves the equation classically. Because the power series ∑j≥0(−1)jr2j/(2j+1)! converges everywhere, u is the C∞ function x↦∑j≥0(−1)j∣x∣2j/(2j+1)! on R3, with u(x)>0 for ∣x∣<π and u=0 on the sphere ∣x∣=π. On r>0 one computes u′(r)=cos⁡r/r−sin⁡r/r2 and u′′(r)=−sin⁡r/r−2cos⁡r/r2+2sin⁡r/r3, hence the radial Laplacian satisfies u′′(r)+2u′(r)/r=−sin⁡r/r=−u(r); by continuity this identity Δu=−u holds on all of Ω, and Lu=−Δu−u=0 there.

2.1step 1.1F1F2F3

The boundary conditions and the weak equation. Since u is smooth on the closed ball and u=0 on ∂Ω, its trace vanishes; by [F3] u∈H01(Ω), and with u∈C2(Ω‾) and f=0∈C(Ω‾), [F2] exhibits u as a weak solution of Lu=0 in the sense of Weak subsolutions and supersolutions of a divergence-form equation.

3.1step 2.1F1algebra

The supremum is larger than the boundary supremum. As a weak solution u is also a weak subsolution; since u(x)>0 for ∣x∣<π and u(0)=1, while u(x)<1 for every x≠0 (because sin⁡r<r on (0,π)), the essential supremum is ess sup⁡Ωu=1. On the boundary u=0≥0 is nonnegative, so u+=u and (u−0)+=u∈H01(Ω); thus sup⁡∂Ωu+=0 in the boundary-order convention of [F1]. Hence ess sup⁡Ωu=1>0=sup⁡∂Ωu+, and the refuted statement fails for this weak subsolution.

4.1step 1.1step 3.1F1∎

The sign condition fails. For every nonnegative ζ∈Cc∞(Ω) with ζ≢0, the sign functional is ∫Ω(cζ+biDiζ)dx=−∫Ωζ dx<0, so the weak sign condition required by Weak maximum principle for coercive divergence-form equations does not hold. This is a direct adaptation of the adverse-zero-order obstruction in [S] Section II.2; the radial eigenfunction and its weak verification are computed here, and the example uses only the explicit function, the trace theorem and the classical-to-weak consistency, so no choice principle beyond the declared Axiom of Choice and Countable Choice is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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