Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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.

Entire harmonic functions with bounded gradient are affine

Statement

Assume the Axiom of Countable Choice ACω. Let n≥2. If u:Rn→R is harmonic and sup⁡x∣∇u(x)∣<∞, then u(x)=b+c⋅x for some b∈R and c∈Rn.

Facts & Assumptions

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

[F1]

Partial derivatives of smooth harmonic functions are smooth harmonic. (Derivatives of harmonic functions are harmonic).

[F2]

An entire real harmonic function with a one-sided bound is constant. (Liouville theorem for bounded harmonic functions).

[F3]

Harmonic functions have the ball mean-value property. (Ball mean-value property for harmonic functions under Countable Choice).

[F4]

A continuous function with the ball mean-value property is smooth harmonic. (Continuous ball-mean-value functions are harmonic).

Proof

technique · direct
1.1F1F2F3F4given

The ball mean property and the continuous mean-value theorem give smoothness of u. Each ∂iu is therefore an entire harmonic function; boundedness of the gradient bounds its absolute value. Liouville makes it a constant ci.

2.1step 1.1algebra∎

For fixed x, the fundamental theorem along the segment t↦tx gives u(x)−u(0)=∫01∇u(tx)⋅x dt=c⋅x. Set b=u(0).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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