Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedaudited 2026-09-22
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.

Relative compactness with respect to an operator

Definition

Assume the Axiom of Choice. Let A be a self-adjoint operator on a complex Hilbert space H, and let B:D(A)H be linear and bounded for the graph norm of A (Relative boundedness with respect to an operator). Then B is A-compact, or relatively compact with respect to A, when BRA(z)K(H) is a compact operator (Compact linear operator) for one, equivalently for every, zρ(A).

The resolvent set is nonempty: iρ(A) by Resolvent of a self-adjoint operator: nonreal resolvents and the estimate. If H={0}, all operators here are the unique operator, compact with bound zero; the assertions hold directly. Below suppose H{0}.

Well-definedness, with proofs.

  1. BRA(z) is everywhere defined and bounded. RA(z) maps H into D(A) and B is graph-norm bounded there, so BRA(z)yaARA(z)y+bRA(z)y(a(1+zRA(z))+bRA(z))y using ARA(z)=zRA(z)I, so that ARA(z)1+zRA(z) (Resolvent and spectrum of an unbounded operator).

  2. Independence of z. Write Rz=(zIA)1. For yH, RwyD(A) and (zIA)Rwy=y+(zw)Rwy. Applying Rz gives Rwy=Rzy+(zw)RzRwy, since Rz(zIA) is the identity on D(A). Thus RzRw=(wz)RzRw. Interchanging z,w also gives RzRw=(wz)RwRz. This derives both orders without an unproved resolvent identity; the two sides of the latter identity have values in D(A), so applying the linear map B gives BRz=BRw+(wz)(BRw)Rz. Compactness at w implies compactness at z by composition with the bounded Rz and finite linear combinations Compositions with a compact operator are compact Linear combinations of compact operators are compact. Exchanging z,w proves the converse, including the trivial case z=w.

  3. Vector space. If B1,B2 are graph-norm bounded and A-compact, then αB1+βB2 is graph-norm bounded and (αB1+βB2)RA(z)=αB1RA(z)+βB2RA(z) is compact, being a linear combination of compact operators (Linear combinations of compact operators are compact).

  4. An A-compact B has A-bound zero. For zρ(A) and ψD(A), the inverse identity gives Bψ=BRA(z)(zIA)ψ. Hence, with az=BRA(z), BψazAψ+azzψ. It suffices to prove ain0 along positive integers n. The spectral theorem Spectral theorem for unbounded self-adjoint operators (PVM form) and product/domain rule Unbounded Borel functional calculus: domains, products, spectral mapping identify RA(in) with the bounded function (inμ)1 of A: multiplication by inμ gives the two inverse identities, with range in D(A) since both (inμ)1 and μ(inμ)1 are bounded. Consequently Fn:=(iIA)RA(in) is the bounded function hn(μ)=(iμ)/(inμ) of A. For real μ and n1, hn(μ)2=1+μ2n2+μ21,hn(μ)0. The bounded PVM calculus and its adjoint rule Bounded borel pvm integral Pvm integral is a star homomorphism give Fn=hn(A). For every vH both squared norms Fnv2 and Fnv2 equal hn2dEv, which tends to zero by Dominated convergence, dominated by 1 in the finite measure of mass v2. In particular both families converge strongly to zero.

    Put C=BRA(i), compact by item 2. The inverse identity on D(A) gives CFn=BRA(in). Suppose its norm does not tend to zero. There exist δ>0, a strictly increasing integer subsequence nk, and, using the declared AC, vectors yk with yk1 and CFnkyk>δ. For any vH, Fnkyk,v=yk,FnkvFnkv0. Riesz representation Riesz representation for Hilbert spaces therefore proves Fnkyk0. A compact operator sends a weakly null sequence to a norm-null sequence under AC Compact operator sends weakly convergent sequences to norm convergent sequences, contradicting the displayed lower bound. Thus ain0. Given any ε>0, choose n with ain<ε in the first estimate: b=nain is finite and the A coefficient is below ε. Its infimum is therefore zero. This does not assert that the zero coefficient itself is attained. The full AC assumption covers the spectral theorem and the compactness/sequence argument.

Depends on

Used by

Dependency tree · two levels

93 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