Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 the laplacian

Statement

Let n2 and let ΩRn be bounded, nonempty and open. If uC2(Ω)C(Ω) and Δu0, then maxΩu=maxΩu. No connectedness or boundary smoothness is required.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[F1]

Adding εx2 to a subharmonic function, with ε>0, excludes interior local maxima. (Strict subharmonic perturbation).

[F3]

A continuous real function on a nonempty compact metric space attains its maximum and minimum. (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).

Proof

technique · direct
1.1

Choose R>0 with ΩBR(0). The closure is nonempty compact. For each ε>0, continuity makes uε=u+εx2 attain its maximum on that closure.

F2F3given
2.1

The maximizer cannot lie in Ω, so it lies in Ω. In particular the boundary is nonempty; it is closed and bounded, hence compact, and m=maxΩu exists.

F1F2F3step 1.1
3.1

For every xΩ, u(x)uε(x)m+εR2. Letting ε0 yields u(x)m. Since a boundary maximizer belongs to the closure, equality of the maxima follows.

step 2.1algebra

Depends on

Used by

Dependency tree · two levels

40 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