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

Harnack inequality on compact subsets

Statement

For n2, a domain ΩRn and a nonempty compact KΩ, there is C=C(K,Ω,n)1 such that every nonnegative harmonic function u on Ω satisfies supKuCinfKu. The compact set K need not be connected.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[F1]

On BR(a) a nonnegative harmonic function satisfies u(x)(R/(Rxa))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.1

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.

F2F3given
2.1

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

F1step 1.1
3.1

For x,yK, 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.

step 2.1algebra

Depends on

Used by

Dependency tree · two levels

8 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