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.

Positive anchor values and the limits of uniform Harnack propagation

Statement

Let a family of positive Schrödinger solutions have a common finite chain cover joining a compact interior set K to an anchor point x∗, with common comparison constant H. If u(x∗)≥a>0 uniformly, then inf⁡Ku≥a/H. A common limit u→c>0 on the end supplies such an anchor if the end threshold giving, for example, u≥c/2 is uniform in the family, with the comparison controls extending to the chosen anchor. A uniform end threshold is sufficient, but is not necessary for a uniform anchor. Individual end limits alone guarantee neither a fixed point with a positive uniform anchor value, nor a uniform end threshold, nor a uniform compact lower bound, even on a fixed Euclidean three-dimensional exterior with smooth nonnegative potentials uniformly bounded everywhere.

Facts & Assumptions

[F1]

The finite-chain comparison is the conditional part of Finite Harnack chains on fixed compact connected interior sets: common local pairwise comparisons on the half-balls of a common finite connected chain cover give a common comparison constant on the covered set. For a connected compact K and an anchor outside K, include a fixed path from K to x∗ and cover its compact image together with K; a connected smooth manifold is path connected because chart balls are path connected and its path components are open. More generally, the assumed common connected chain cover must contain all of K and x∗. The coefficient and cover controls, when used to obtain the local comparisons, must hold on this enlarged compact region. Below, the examples' local comparisons are proved directly; the supplier's ZFC analytic consequence is not invoked.

[F2]

The exterior and Laplacian conventions are Weighted exterior elliptic domains and admissible weights. For the examples take Σ=R3 with its Euclidean metric and empty compact boundary; outside the closed unit ball this is the prescribed exterior chart. Here Δu=∑i=13∂i2u. For a smooth positive u, define V=Δu/u, so (Δ−V)u=0 pointwise. No boundary condition is assumed in this lemma.

[F3]

Coordinatewise sum, product, quotient and chain differentiation use Sum, product, quotient, and chain rules from difference quotients. All functions differentiated below have strictly positive square-root arguments and denominators. Their potentials, signs, bounds and local comparisons are computed locally rather than imported from an external result.

Proof

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

Goal: Prove the anchor estimate and both distinctions concerning end normalization.

Proof technique: direct.

1.1F1givenalgebra

By [F1], u(x∗)≤Hu(x) for every x∈K. Insert u(x∗)≥a and take the infimum to obtain inf⁡Ku≥a/H. A common end threshold permits a single fixed x∗ beyond it, with a=c/2, provided the same comparison controls hold to this point. This proves the anchor estimate and the sufficiency assertion.

1.2F2F3algebra

For 0<b<1, λ>0 and z∈R3, put Q(x)=1+λ2∣x−z∣2 and f(x)=1−bQ(x)−1/2. This is smooth and f≥1−b>0. For t>0, rationalizing gives (t+h−t)/h=1/(t+h+t) for nonzero sufficiently small h; the quotient rule then gives (t−1/2)′=−1/(2t3/2). Repeated differentiation on t>0 gives smoothness. Applying [F3] coordinatewise yields ∂if=bλ2(xi−zi)Q−3/2 and ∂i2f=bλ2Q−3/2−3bλ4(xi−zi)2Q−5/2. Summing in [F2] yields Δf=3bλ2Q−5/2, hence 0≤Vf:=Δf/f≤3bλ2/(1−b). For fixed parameters, f→1 uniformly as ∣x∣→∞, since ∣x−z∣≥∣x∣−∣z∣.

2.1step 1.2F1algebra

To show that a uniform threshold is not necessary, let e1=(1,0,0) and, for integers n≥1, set wn(x)=1−34(1+∣x−2ne1∣2)−1/2. Step 1.2 gives positive smooth Schrödinger solutions with 0≤Vwn≤9, and each has end limit 1. At the fixed anchor 0, wn(0)≥1−3/(45)>1/2. Nevertheless wn(2ne1)=1/4, so no radius works for the inequality wn≥1/2 for every n beyond that radius. The bounds 1/4≤wn≤1 give wn(x)≤4wn(y) for all x,y, directly supplying common local comparisons on every fixed chain cover in [F1]. The Euclidean metric and the displayed potential bounds also give uniform coefficient controls there. Thus a common anchor can exist without the indicated uniform end threshold.

3.1step 1.2F1algebra∎

For 0<ε≤1/2 set uε(x)=1−(1−ε)(1+ε2∣x∣2)−1/2. Step 1.2 gives uε≥ε>0, uε→1 at infinity for each ε, and 0≤Vε≤3ε(1−ε)≤3/4 everywhere. The Euclidean metric and these potential bounds give uniform coefficient controls on every fixed finite compact chain cover. To check the local comparisons directly, write s=(1+ε2∣x∣2)1/2≥1. Then uε(x)=ε+(1−ε)ε2∣x∣2/[s(s+1)]. On ∣x∣≤R this implies ε≤uε(x)≤ε(1+R2/4), using s(s+1)≥2 and ε≤1/2. Thus for all x,y in this ball, uε(x)≤(1+R2/4)uε(y), uniformly in ε, and every fixed finite chart cover with compact closures fits into such a ball. For the closed unit ball K, inf⁡Kuε=uε(0)=ε→0. Moreover the same bound gives uε(x)→0 at every fixed x, so there is no fixed point with a positive uniform anchor value. For any proposed common end radius R0, fix x with ∣x∣>R0; then uε(x)<1/2 for sufficiently small ε. Hence the individual common end limits supply neither a uniform threshold nor a uniform compact lower bound, despite the common local comparison controls in [F1].

Depends on

Used by · 1

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.