Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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 chains on fixed compact connected interior sets

Statement

Let (Σ,h) be a smooth three-dimensional Riemannian exterior and let K⊂Σ∘ be a nonempty compact connected subset, with compactness and connectedness taken in its subspace topology. There are finitely many interior coordinate balls Ui, 1≤i≤N, with compact closures in their chart domains, whose concentric half-balls Hi cover K. Each Hi meets K, and the graph with vertices 1,…,N and an edge between distinct i,j exactly when Hi∩Hj∩K≠∅ is connected, meaning any two vertices can be joined by a finite sequence of edges. All balls are Euclidean in their respective coordinates. For any positive real function u on ⋃iUi, if C∗≥1 and u(x)≤C∗u(y) for every x,y∈Hi and every i, then sup⁡Ku≤C∗Ninf⁡Ku. Thus the conditional comparison applies to every positive solution of (Δh−V)u=0 for which these local comparisons hold.

In particular, work in ZFC for the following analytic consequence. Fix such a finite chart cover. Consider smooth Riemannian metrics h, potentials V:⋃iUi→[0,∞) bounded on each Ui, and positive real C2 functions u solving (Δh−V)u=0 pointwise there, where Δh=div⁡hgrad⁡h. Write ri for the coordinate radius of Ui and, in its coordinates, put mi=det⁡(hab), Ai=(mihab) and qi=miV. Suppose fixed constants λi>0, Mi<∞ and Qi≥0, independent of the family member, satisfy ξTAi(x)ξ≥λi∣ξ∣2, ∥Ai(x)∥op≤Mi and qi(x)≤Qi on Ui for every ξ∈R3. Then the comparison is uniform over the family: C∗ can be chosen using only the finitely many parameters 3, Mi/λi and ri2Qi/λi. No measurability or smoothness of V beyond these hypotheses is required. The preceding conditional chain comparison does not impose a sign condition on V when the local comparisons are supplied independently.

Facts & Assumptions

[F1]

Compact subsets are compact in their subspace topology by Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right: every relatively open cover has a finite subcover. Connected subsets admit no partition into two disjoint nonempty relatively open sets by Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets.

[F2]

The smooth exterior, its interior charts, the Riemannian metric and the Laplacian convention are those of Weighted exterior elliptic domains and admissible weights. The letter K here denotes the subset in the Statement, not necessarily the compact core of that definition. The sets Ui,Hi and their graph are defined in the Statement; they are not required to be metric balls.

[F3]

Multiplicative interior Harnack for geometric Schrödinger solutions applies to a nonnegative real C2 pointwise solution on a coordinate ball for a smooth metric and a bounded nonnegative potential, with the displayed bounds on Ai,qi. It gives a half-ball comparison constant at least one depending only on dimension, Mi/λi and ri2Qi/λi. The analytic consequence inherits its ZFC assumption, including The Axiom of Choice; that imported assumption is used precisely when this supplier is invoked in step 3.1. The finite-cover and finite-chain arguments themselves require no arbitrary-index choice.

Proof

Given: The data and hypotheses in the Statement and [F1]–[F3].

Goal: The finite connected cover, conditional chain comparison and stated uniform analytic consequence.

Proof technique: direct.

1.1givenF1F2

Consider all interior chart balls centered at points of K with compact closures inside their chart domains, together with their concentric half-balls. Such balls exist around every point by shrinking an interior coordinate neighborhood. The traces of these half-balls on K are a relatively open cover of K, so [F1] supplies a finite subcover; retain the associated balls and discard any empty traces. Write Ui,Hi, 1≤i≤N, for the resulting balls and half-balls. If their graph were disconnected, fix a vertex and let I consist of the vertices reachable from it by finite edge sequences. Then I and its complement are both nonempty, and there is no edge between them. The unions of Hi∩K over these two index sets are nonempty, relatively open, disjoint, and cover K. This contradicts connectedness in [F1], proving the geometric assertion.

2.1givenstep 1.1algebra

For x,y∈K, choose half-balls containing them. By step 1.1 their vertices are joined by a finite edge sequence; deleting segments between repeated vertices gives a path of s≤N distinct vertices. At each edge take a point in the corresponding intersection with K. The resulting sequence starts at x, ends at y, and each consecutive pair lies in one of the s half-balls. Applying the assumed local comparisons and multiplying gives u(x)≤C∗su(y)≤C∗Nu(y), also when s=1. Taking the supremum in x and then the infimum in y proves the conditional bound. These extrema are finite and positive as bounded by any fixed value through the pairwise inequalities; continuity is not needed for this conditional argument.

3.1givenF2F3step 2.1∎

For the analytic family, on each fixed Ui the metric is smooth, V is bounded and nonnegative, u is positive and C2, and the pointwise equation and all three coefficient bounds are exactly those of [F3], with dimension three. Thus [F3] supplies a constant Ci≥1 using only 3, Mi/λi and ri2Qi/λi, common to all family members. Take C∗=max⁡1≤i≤NCi and apply step 2.1. Both N and these coefficient parameters are fixed, so the resulting comparison is uniform as asserted.

Depends on

Used by · 2

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.