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

Harnack inequality on compact subsets

Statement

Assume the Axiom of Countable Choice ACω.

For n≥2, a domain Ω⊆Rn and a nonempty compact K⊂Ω, there is C=C(K,Ω,n)≥1 such that every nonnegative harmonic function u on Ω satisfies sup⁡Ku≤Cinf⁡Ku. The compact set K need not be connected.

Facts & Assumptions

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

[F1]

Under Countable Choice, on BR(a) a nonnegative harmonic function satisfies u(x)≤(R/(R−∣x−a∣))nu(a). (Harnack inequality on a ball).

[F2]

Any compact subset of a domain has a finite cover by interior balls with connected overlap graph and fourfold closed balls in the domain. (Finite harnack chain on a compact connected subset).

[F3]

A nonnegative harmonic function on a domain is identically zero or strictly positive everywhere. (Nonnegative harmonic function with an interior zero vanishes).

Proof

technique · direct
1.1F2F3given

If u has an interior zero, it vanishes throughout Ω, and the inequality is immediate. Otherwise it is strictly positive. Fix the finite admissible-ball family of the chain lemma, of size N, independently of u.

2.1F1step 1.1

If x,y∈Br(a) from this family, then B3r(y)⊂B4r(a)⊂Ω and ∣x−y∣<2r. Ball Harnack gives u(x)≤3nu(y). Thus any two points of one of the small balls are comparable by the same constant.

3.1step 2.1algebra∎

For x,y∈K, connect balls containing them by a simple path in the finite connected graph, with at most N vertices. Choose one point in each of its finitely many overlaps and apply the local comparison in successive balls. It gives u(x)≤3nNu(y). Taking the supremum in x and the infimum in y proves the claim with C=3nN.

Depends on

Used by

Dependency tree · two levels

14 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