Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-23 (gpt-6-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.

Liouville theorem for bounded harmonic functions

Statement

Assume the Axiom of Countable Choice ACω. Let n≥2 and u:Rn→R be harmonic. If u is bounded above or bounded below on all of Rn, then u is constant.

Facts & Assumptions

Given: Countable Choice and the objects and hypotheses in the statement (The Axiom of Countable Choice (ACω)).

[F1]

Under Countable Choice, nonnegative harmonic functions on BR(y) satisfy v(x)≤(R/(R−∣x−y∣))nv(y) (Harnack inequality on a ball).

Proof

technique · direct
1.1givenalgebra

If u≥b, set v=u−b; if u≤b, set v=b−u. In either situation v is nonnegative and entire harmonic.

2.1F1step 1.1algebra∎

Fix x,y∈Rn. For every R>∣x−y∣, ball Harnack at center y gives v(x)≤(R/(R−∣x−y∣))nv(y). Let R→∞ to obtain v(x)≤v(y). Interchanging x,y gives equality. Therefore v, and hence u, is constant.

Depends on

Used by

Dependency tree · two levels

9 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