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.

Compact potential multiplication without a Dirichlet restriction

Statement

Assume the Axiom of Choice and the weighted exterior chart conventions, with 0<α<1 and arbitrary real β. For every fixed V∈C−42,α, multiplication MV:u↦Vu is a compact bounded linear map from the full space Cβ4,α to Cβ−22,α. Compact means that the image of every bounded set has compact closure in the target norm. Restricting this map to Xβ={u∈Cβ4,α:u∣∂Σ=0} remains compact.

Facts & Assumptions

Given: The hypotheses of the Statement.

Goal: Establish its stated analytic ingredients and qualifications.

[F1]

The Axiom of Choice supplies the inherited analytic compactness assumptions. The Axiom of Choice

[F2]

Every bounded full-input sequence has a subsequence converging in compact-truncation C2,α norms, without a trace condition. Local compactness of full weighted Hölder inputs

[F3]

Multiplication by the fixed potential is bounded and has a uniform target tail of order T−2 on bounded full-input sets. Weighted product and uniform potential tails on the full input space

[F4]

Ordinary Hölder spaces on bounded domains are Banach spaces; Fredholm-continuation terminology defines compact linear maps by relative compactness of bounded images. Under the assumed choice axioms, compactness of a metric space is equivalent to sequential compactness. The closure Hölder spaces are Banach spaces Fredholm and Banach continuation interfaces For a metric space, compact, countably compact, limit point compact, sequentially compact, and complete together with totally bounded are all equivalent, given countable choice and dependent choice

[F5]

The weighted exterior chart norms define the full input, target and zero-Dirichlet subspace. Weighted Hölder norms on a three-dimensional exterior Weighted exterior elliptic domains and admissible weights

Proof

1.1F4F5algebra

The target weighted space is complete: a target-norm Cauchy sequence is Cauchy in each bounded chart Hölder norm and hence converges there. The local limits agree on overlaps. Pass the Cauchy inequalities to the limit in each derivative supremum and Hölder difference quotient and then take the annular supremum. This gives a global target element and convergence in the weighted norm. Thus the local Banach completeness patches to the given target norm.

2.1F2F3F5step 1.1algebra

Given a bounded sequence uj in the full input space, take the locally convergent subsequence of the local-compactness lemma. Multiplication by V preserves compact C2,α convergence, by the same product inequality as in the tail lemma. For any tolerance first make the common annular tails small by choosing T large, then make the subsequence products close on the compact truncation through r=2T. Annuli with R<T lie inside that truncation and have uniformly bounded weight factors because R≥r0>0. Hence the products form a target-norm Cauchy subsequence and converge by target completeness.

3.1F1F3F4step 2.1∎

Every sequence in the image of a bounded input set therefore has a convergent subsequence in the target. The metric compactness criterion gives relative compactness, which is the definition of compactness here; equivalently the same tail and compact-truncation argument supplies finite nets for the image. Boundedness and linearity were supplied by the product lemma. A bounded sequence in the Dirichlet subspace is also a bounded sequence in the full space, proving the restricted assertion.

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.