Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Injective resolvents need not be bounded below

Statement refuted

False assertion: for every densely defined nonnegative self-adjoint operator A on a nonzero complex Hilbert space, if B=(I+A)−1 is injective then 0∉σ(B).

Facts & Assumptions

Given: the Axiom of Choice, H=ℓ2(N>0) over C, where N>0:={1,2,3,…}, and the definitions of A and B in the Counterexample.

[A1]

The Axiom of Choice: every family of nonempty sets has a choice function.

[F1]

Positive unbounded spectral calculus from a bounded resolvent: under the Axiom of Choice, B=(I+A)−1 is bounded positive self-adjoint on a nonzero complex Hilbert space, and its compact spectrum has a unique regular spectral PVM EB on its Borel sets with B=∫b dEB(b); the push-forward under b↦b−1−1 has domain and operator A, and the theorem permits EB({0})=0 while 0∈σ(B).

[F2]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: for square-summable complex sequences x,y, ∣∑nxnyn‾∣≤(∑n∣xn∣2)1/2(∑n∣yn∣2)1/2.

Counterexample

technique · direct

Given: [A1], [F1]–[F2], and the false assertion in the Statement.

1.1givenF2algebra

On H=ℓ2(N>0)={x:N>0→C:∑n≥1∣xn∣2<∞}, with inner product ⟨x,y⟩=∑n≥1xnyn‾ and standard basis en given by (en)m=1 if m=n and 0 otherwise, all coordinate indices below range over N>0. Define D(A)={x=(xn):∑n≥1n2∣xn∣2<∞} and (Ax)n=nxn. Finite sequences lie in D(A) and are dense. For x∈D(A), Cauchy–Schwarz [F2] gives ∑n∣xn∣2≤(∑n2∣xn∣2)1/2(∑∣xn∣2)1/2<∞, so ⟨Ax,x⟩=∑n∣xn∣2≥0 and A is nonnegative.

2.1step 1.1F2algebra

The operator is self-adjoint. If y∈D(A∗), there is z∈ℓ2 with ⟨Ax,y⟩=⟨x,z⟩ for every finite sequence x; choosing x=en gives zn=nyn, so ∑n2∣yn∣2=∥z∥2<∞ and y∈D(A). Conversely, if y∈D(A) then z=(nyn)∈ℓ2 satisfies the adjoint identity for every x∈D(A): both inner-product series converge by [F2] because Ax,y,x,z∈ℓ2, and their terms agree. Thus D(A∗)=D(A) and A∗=A.

3.1step 1.1step 2.1algebra

The inverse of I+A is the bounded diagonal operator Ben=(n+1)−1en. Indeed for any x∈ℓ2, yn=xn/(n+1) satisfies ∑n2∣yn∣2≤∑∣xn∣2, and (I+A)y=x. The operator B is positive and injective, but it is not bounded below because ∥Ben∥=(n+1)−1→0 for unit vectors en. The vector y=(1/n)n≥1 belongs to ℓ2: for n≥2, n−2≤(n−1)−1−n−1, so ∑n≥1n−2≤2. It is not in Ran⁡B, since Bx=y would require xn=(n+1)/n>1 for every n, which is not square-summable. Hence B is not surjective and 0∈σ(B).

4.1A1F1step 3.1algebra∎

Define EB(S)x=∑n:(n+1)−1∈Sxnen for Borel S⊆σ(B). Its values are orthogonal coordinate projections, and the coordinate definition gives EB(∅)=0, EB(σ(B))=I, and EB(S)EB(T)=EB(S∩T). For disjoint Borel Sk, each coordinate n occurs in at most one projection, so the partial sums ∑k≤NEB(Sk)x converge in ℓ2 to EB(⋃kSk)x: the squared norm of the omitted coordinates is a tail of the convergent nonnegative series ∑n∣xn∣2. Thus EB is strongly countably additive. It integrates the coordinate function to B, because its integral acts diagonally by (n+1)−1 on each en. For every x, its finite scalar measure is μx(S):=⟨EB(S)x,x⟩=∑n:(n+1)−1∈S∣xn∣2. For any Borel S⊆σ(B), the finite set KN:={(n+1)−1:n≤N, (n+1)−1∈S} is compact and contained in S, and μx(KN)↑μx(S) because ∑n∣xn∣2<∞. Hence μx is inner regular on every Borel set. Since σ(B) is compact, for any Borel S and ε>0, inner regularity of Sc gives a compact K⊆Sc with μx(Sc∖K)<ε; then the open set σ(B)∖K contains S and its excess measure is less than ε. Thus μx is also outer regular, so EB is a regular PVM. Hence [F1] identifies it with the bounded-resolvent spectral PVM. Since no atom is at zero, EB({0})=0, although step 3.1 proves 0∈σ(B). This refutes the asserted implication and shows why a zero spectral projection must be distinguished from a spectral value.

Depends on

Dependency tree · 2 levels

Sources