Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The resolvent star algebra is dense in C_0(R)

Statement

Fix zR and let r(x)=(xz)1. Let A be the -algebra generated by r in C0(R), that is, the uniform closure of the linear span of the products rkrj with k+j1. Then A=C0(R). Under Countable Choice (The Axiom of Countable Choice (ACω)), consequently, if self-adjoint An,A satisfy RAn(z)RA(z) strongly (respectively in norm) at one nonreal z, then the same convergence holds at every nonreal z, in particular at z.

Facts & Assumptions

[A2]

Let X be a compact Hausdorff space and let BC(X,C) be a self-adjoint complex function algebra containing the constants, separating points, with no common zero. Then B is uniformly dense in C(X,C) (Complex Stone–Weierstrass dichotomy for separating self-adjoint algebras; the unital case is dense).

[A3]

Under Countable Choice, with Dz:=RA(z)RA(z) for self-adjoint A,A and nonreal z, the resolvent identity gives Dz=[I+(zz)RA(z)]1Dz[I(zz)RA(z)] for nonreal z, the first factor being I+(zz)RA(z) and the second I+(zz)RA(z); these affine transforms of resolvents are bounded with norms at most 1+zz/Imz (Resolvent and spectrum of an unbounded operator, Resolvent of a self-adjoint operator: nonreal resolvents and the estimate, Norm and strong resolvent convergence, The Axiom of Countable Choice (ACω)).

Proof

technique · direct

Given: zR, r(x)=(xz)1 and the -algebra A generated by r.

1.1

Extend r to R by r()=0; then rC0(R)C(R) and r separates the points of R: it is injective on R, and r(x)0=r().

A1
1.2

Parameter independence: for nonreal z the difference Dz=RA(z)RA(z) factors as in [A3] through Dz, with both outer factors of norm at most 1+zz/Imz, since they are I+(zz)RA(z) and I+(zz)RA(z) and RA(z),RA(z)1/Imz; hence Dz0 in norm whenever Dz0 in norm, and Dzx0 for every x whenever Dzy0 for every y, because bounded operators preserve both modes of convergence.

A3
2.1

The algebra B:={f+c1:fA,cC}C(R) contains the constants and r,r, is self-adjoint, separates points by step 1.1, and has no common zero because of the constant function 1; hence B is uniformly dense in C(R) by [A2].

A1A2step 1.1
3.1

Therefore A=C0(R): given fC0(R) and ε>0, density of B gives f=c1+g with gA and fc1g<ε; evaluating at , where f()=0, gives c<ε, so fg<2ε and gA.

A1step 2.1
4.1

The density claim is step 3.1 and the consequence is step 1.2, which also covers z=z. ∎

Depends on

Used by

Dependency tree · two levels

56 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