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

Finite harnack chain on a compact connected subset

Statement

Let n2, let ΩRn be a domain, and let KΩ be compact, possibly empty or disconnected. There is a finite nonempty family {Brj(aj)}j=1N covering K, with rj>0 and B4rj(aj)Ω, whose overlap graph is connected. An edge means that the two open balls intersect. The family depends only on K and Ω.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[F1]

A nonempty clopen subset of a connected space is the whole space, since its nonempty complement would give a separation. (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).

Proof

technique · direct
1.1

Call a ball admissible if its radius is positive and its fourfold closed ball lies in Ω. Every point centers such a ball by openness. Fix one admissible base ball, using nonemptiness of Ω. Let E be the union of all admissible balls joined to it by a finite sequence of overlapping admissible balls.

given
2.1

The set E is nonempty and open. If xΩ is a relative closure point of E, an admissible ball centered at x meets E, hence meets a ball in one of the finite sequences. Appending the new ball proves it is in the reachable family and xE. Thus E is relatively closed, and connectedness implies E=Ω.

F1step 1.1
3.1

Compactness gives a finite subcover of K by admissible balls. Each selected ball meets a reachable ball by the preceding conclusion, and can be appended to a finite sequence from the base. Take the union of these finitely many finite sequences together with the base ball. The resulting finite family covers K and its overlap graph is connected. If K is empty, take just the base ball. All its fourfold closed balls are compact by Heine–Borel and remain in Ω.

F2step 2.1given

Depends on

Used by

Dependency tree · two levels

36 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