Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck pass
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 scalar multiples of self-adjoint operators: domains, resolvents, spectra and eigenbases

Statement

Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Let H≠{0} be a complex Hilbert space (Hilbert space), let A:D(A)⊂H→H be a densely defined self-adjoint operator (Symmetric, self-adjoint and essentially self-adjoint operators, Adjoint of a densely defined operator), and let c>0 be real. Write cA for the operator with domain D(cA):=D(A) and (cA)x:=c (Ax). Then:

(a) cA is self-adjoint.

(b) For every z∈C one has z∈ρ(cA) if and only if z/c∈ρ(A), and then (cA−z)−1=c−1(A−z/c)−1; consequently ρ(cA)=c ρ(A) and σ(cA)=c σ(A).

(c) If some, hence every, resolvent of A is compact (Resolvent and spectrum of an unbounded operator, Compact linear operator), then every resolvent of cA is compact and A and cA have the same complete orthonormal eigenfamily (ej)j∈J. If N:=dim⁡H<∞, take J={1,…,N}; if H is infinite dimensional, take J=N, with ∣μj∣→∞ and each eigenvalue repeated according to its finite multiplicity. In both cases Aej=μjej, (cA)ej=cμjej, and σ(A)={μj:j∈J},σ(cA)={cμj:j∈J} with no other spectral points. The finite-dimensional conclusion also holds without a separate compactness assumption, since bounded operators on such H are compact.

(d) Eigenvectors correspond exactly: for λ∈R and x∈H, x≠0, one has x∈D(A) and Ax=λx if and only if x∈D(cA) and (cA)x=(cλ)x; and every eigenvalue of cA has the same eigenspace as the corresponding eigenvalue of A.

(e) If A≥γ in the quadratic-form sense, meaning that ⟨Ax,x⟩≥γ∥x∥2 for every x∈D(A), then cA≥cγ in the same sense.

Only the scaling of the given operator is asserted; no domain, spectrum or eigenvector is claimed for any other rescaling, and no physical interpretation is attached.

Facts & Assumptions

Given: A complex Hilbert space H≠{0}; a densely defined self-adjoint A; a real c>0; the operator cA with domain D(A).

[F1]

Adjoints and symmetry. For densely defined T, the adjoint T∗ has domain consisting of those y for which x↦⟨Tx,y⟩ is bounded on D(T), and T is self-adjoint when T=T∗ including domains; T is symmetric when ⟨Tx,y⟩=⟨x,Ty⟩ for all x,y∈D(T) (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators).

[F2]

Inner-product algebra. The inner product is linear in its first argument and conjugate-linear in its second, and ⟨αx,y⟩=α⟨x,y⟩, ⟨x,αy⟩=α‾⟨x,y⟩ for α∈C (Hilbert space).

[F3]

Resolvent and spectrum. For a closed operator T, the resolvent set ρ(T) consists of the z∈C for which T−z is a bijection of D(T) onto H with bounded inverse (T−z)−1∈B(H), and σ(T)=C∖ρ(T) (Resolvent and spectrum of an unbounded operator, A bounded linear operator between normed spaces).

[F4]

Compactness of scalar multiples. If K∈B(H) is compact and c≠0, then cK is compact (Compact linear operator; scalar multiples of compact operators are compact as part of the linear-subspace statement of the compact-operator ideal).

[F5]

Compact spectral decomposition. Every compact self-adjoint bounded operator has a complete orthonormal eigenfamily, allowing a kernel basis; each nonzero eigenspace is finite dimensional and only finitely many nonzero eigenvalues have modulus above a fixed positive threshold (Spectral theorem for compact self adjoint operators, Orthonormal eigenbasis for a compact self adjoint operator). Products with a bounded operator preserve compactness (Compositions with a compact operator are compact). For a self-adjoint unbounded A, ±i∈ρ(A) with bounded resolvents (Resolvent of a self-adjoint operator: nonreal resolvents and the estimate); if a real compact resolvent has already been obtained, the infinite-dimensional conclusion is also Self-adjoint operators with compact resolvent: eigenbasis and discrete spectrum.

Proof

technique · direct; verify symmetry and the adjoint domain of $cA$ by scaling the defining pairings, transfer resolvents by the identity $cA-z=c(A-z/c)$, and read off eigenpairs and quadratic forms

Given: The data and hypotheses of the statement and [F1]-[F5].

1.1givenF1F2algebra

[Symmetry] For x,y∈D(A)=D(cA), [F2] gives ⟨(cA)x,y⟩=c⟨Ax,y⟩=c⟨x,Ay⟩=⟨x,cAy⟩=⟨x,(cA)y⟩; since c is real, the scalar passes through the pairing in both slots, so cA is symmetric.

1.2givenF3algebra

[Resolvent identity] Fix z∈C and write B:=cA−z and B′:=A−z/c on the common domain D(A). Then B=cB′ as operators, since c(A−z/c)x=cAx−zx=(cA−z)x for every x∈D(A). If z/c∈ρ(A), then B′ is a bijection D(A)→H with bounded inverse, so B=cB′ is a bijection with inverse c−1B′−1∈B(H), which is the displayed identity; conversely if z∈ρ(cA), then c−1B=B′ is a bijection with bounded inverse c B−1, so z/c∈ρ(A). Therefore ρ(cA)=c ρ(A) and, taking complements in C, σ(cA)=c σ(A); this is (b).

1.3givenalgebra

[Eigenpairs] Let λ∈R and x∈H, x≠0. Since D(cA)=D(A), x∈D(A) if and only if x∈D(cA). For such x, Ax=λx if and only if cAx=cλx, because multiplication by c≠0 is injective; hence the eigenspaces coincide, which is (d).

2.1step 1.1F1F2algebra

[Adjoint domain] Let y∈D((cA)∗). Then x↦⟨(cA)x,y⟩=c⟨Ax,y⟩ is bounded on D(A), and since c>0, x↦⟨Ax,y⟩ is bounded on D(A) as well; hence y∈D(A∗)=D(A) and A∗y=Ay. For every x∈D(A) the defining identity of the adjoint and [F2] then give ⟨x,(cA)∗y⟩=⟨(cA)x,y⟩=c⟨Ax,y⟩=c⟨x,Ay⟩=⟨x,cAy⟩, and density of D(A) in H gives (cA)∗y=cAy. Hence D((cA)∗)⊆D(cA); the reverse inclusion holds because cA is symmetric, so D((cA)∗)=D(cA) and (cA)∗=cA. This proves (a).

2.2step 1.2F4F5algebra

[All resolvents are compact] Write Rz=(A−z)−1 and suppose Rz0 is compact. The resolvent identity, obtained by subtracting the two inverses on their common operator domain, is Rz=Rz0+(z−z0)Rz0Rz=Rz0[I+(z−z0)Rz]. Thus every Rz is compact by [F5], irrespective of whether z0 is real. Step 1.2 now gives compactness of every resolvent of cA.

2.3step 1.2step 1.3F1F5algebra

[Finite-dimensional case] If dim⁡H=N<∞, the dense linear domain D(A) equals H, since every finite-dimensional subspace is closed (A finite-dimensional normed subspace is closed). The operator A is then bounded and compact, and its self-adjointness and [F5] give an orthonormal eigenbasis of precisely N vectors, including a basis of its zero eigenspace if necessary. In that basis A is the diagonal matrix with real entries μj, so its spectrum is exactly those entries: off that set the diagonal inverse exists and is bounded, while at an entry there is a nonzero kernel vector. Step 1.3 gives the same family for cA, and step 1.2 gives the scaled spectrum.

3.1step 2.2step 2.3F1F5algebra

[Infinite-dimensional eigenfamily from an arbitrary compact resolvent] Suppose H is infinite dimensional. By step 2.2 both Ri and R−i are compact; their adjoint relation Ri∗=R−i follows from the defining self-adjoint pairings, and the resolvent identity shows they commute. Hence K:=R−iRi=Ri∗Ri is compact, self-adjoint, positive and injective. Its range lies in D(A2): Ri maps into D(A), R−i preserves D(A) and commutes there with A, by (A−z)Rz=I and Rz(A−z)=I on D(A). [F5] decomposes H into the closed span of its finite-dimensional positive K-eigenspaces Eν, with no kernel part. For e∈Eν, e=ν−1Ke∈D(A2) and K(Ae)=A(Ke)=νAe, so Eν is invariant under A. The restriction of A there is a finite-dimensional self-adjoint operator; step 2.3 gives an orthonormal eigenbasis of that restriction. The union is a complete orthonormal eigenfamily of A. If Ae=μe, direct resolvent evaluation gives Ke=(μ2+1)−1e. There are only finitely many such vectors with ∣μ∣≤M for each fixed M, since [F5] gives only finitely many K-eigenvalues above (M2+1)−1 and each has finite multiplicity. The union is countable and infinite, hence can be indexed by N under the retained choice assumptions, and ∣μn∣→∞.

4.1step 1.2step 1.3step 3.1F1F3algebra

[No additional spectrum] In the eigenbasis of step 3.1, self-adjointness gives ⟨Ax,en⟩=μn⟨x,en⟩ for x∈D(A), so ∑nμn2∣⟨x,en⟩∣2=∥Ax∥2. Conversely, if this sum is finite, the finite sums xN and AxN converge to x and y:=∑nμn⟨x,en⟩en; passing to the limit in ⟨AxN,v⟩=⟨xN,Av⟩ for every v∈D(A) puts x in D(A∗)=D(A) and gives Ax=y. Thus A has exactly this maximal diagonal domain. Since ∣μn∣→∞, a complex z outside {μn} has positive distance from that set. The diagonal map with entries (μn−z)−1 is bounded and maps H into the displayed domain because sup⁡n∣μn/(μn−z)∣<∞; it is the two-sided inverse of A−z. Every μn is an eigenvalue. This proves σ(A)={μn}, and steps 1.2 and 1.3 give the scaled spectrum and common eigenfamily, completing (c).

5.1step 1.3F2algebra∎

[Quadratic forms] If ⟨Ax,x⟩≥γ∥x∥2 for every x∈D(A), then for x∈D(cA)=D(A) the same inequality scaled by c>0 gives ⟨(cA)x,x⟩=c⟨Ax,x⟩≥cγ∥x∥2; this is (e), and steps 2.1, 1.2, 2.3, 4.1 and 1.3 complete the proof.

Remarks

  • Where positivity is used. c>0 is used in step 2.1 (boundedness of the pairing is preserved under multiplication by c≠0, but the adjoint computation needs c real, and the resolvent identity needs c≠0), and in step 5.1 for the direction of the form inequality. For c<0 the operator cA is still self-adjoint when A is, but the form inequality reverses; no such statement is used here.
  • What is not asserted. The lemma transfers self-adjointness, resolvents, spectra, eigenfamilies and form lower bounds along positive scaling of a fixed operator. It does not construct a self-adjoint operator from a symmetric one, does not assert any min-max formula, and does not identify any operator with a physical energy.

Depends on

Dependency tree · 2 levels

Sources