Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 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.

A compact diagonal map with dense nonclosed range

Example

Assume the Axiom of Countable Choice. On the real Hilbert space H=ℓ2(N,R), define the diagonal map (Kx)n=xn/(n+1) for n∈N, where N={0,1,2,…} and en is the coordinate vector at n. In positive indexing, its singular system is sj=1/j and vj=uj=ej−1 for j≥1. Then K is compact and its range is dense but not closed. The datum y=(1/(n+1))n∈N lies in H and in R(K)‾, but not in R(K); its Picard sum ∑j=1∞∣⟨y,ej−1⟩∣2sj2 diverges, so the equation Kx=y has no exact solution.

Facts & Assumptions

Given: Countable Choice and H=ℓ2(N,R) with the map (Kx)n=xn/(n+1).

[F1]

For x,z∈H, the canonical pairing is ⟨x,z⟩=∑nxnzn, the norm satisfies ∥x∥22=∑n∣xn∣2, and en is the sequence equal to 1 at n and 0 elsewhere. Whenever ∑n∣xn∣2<∞, every ε>0 admits a finite set F with ∑n∉F∣xn∣2<ε (Square-summable families on an arbitrary index set and the space ℓ2(I)).

[F2]

H is complete and hence a real Hilbert space (The real square-summable sequence space is complete, Hilbert space).

[F3]

A bounded linear map with finite-dimensional range is compact (Bounded finite rank operators are compact).

[F4]

Under Countable Choice, a norm limit of compact maps into a Banach space is compact (Norm limit of compact operators is compact).

[F5]

For a compact operator with singular values sn and complete positive singular vectors un, exact range membership is equivalent to orthogonality to N(K∗) and finiteness of the Picard sum (Picard range and pseudoinverse-domain criterion).

[F6]

The series ∑m≥1m−2 converges (The p-series for a real exponent p converges exactly when p is greater than one).

[F7]

For every real ε>0 there is n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

[F8]

The compact linear inverse model has Hilbert parameter/data spaces and a compact forward map, and exact data have the form Kx† (Compact linear inverse model between Hilbert spaces).

[F9]

The Hilbert adjoint is characterized by ⟨Kx,z⟩=⟨x,K∗z⟩ (The Hilbert-space adjoint of a bounded operator).

[A1]

Countable Choice is required by [F4] and by the compact singular-system theorem used in [F5], and is the hypothesis of [F9] (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1givenF1F2F3F4F8A1algebraconstruct

The map K is linear and satisfies ∥Kx∥22=∑n∣xn∣2/(n+1)2≤∥x∥22, so it is bounded. For N∈N, let (KNx)n=xn/(n+1) when n≤N and 0 otherwise. The estimate ∥KNx∥22≤∥x∥22 makes KN bounded, and its range is spanned by the finite ordered family (e0,…,eN): every output has no coordinates beyond N, and KN((n+1)en)=en for each n≤N, while these coordinate vectors are linearly independent. Thus they form an ordered basis of the range, and KN is compact by [F3]. For every x, ∥(K−KN)x∥22=∑n>N∣xn∣2/(n+1)2≤∥x∥22/(N+2)2, with equality in the operator norm at x=eN+1. Hence ∥K−KN∥=1/(N+2)→0. By [F2] the codomain is Banach, so [F4] gives compactness of K. It is a compact inverse model by [F8].

1.2givenF1constructalgebra

Every finitely supported z∈H belongs to R(K): set xn=(n+1)zn, which is finitely supported and satisfies Kx=z. For any z∈H and ε>0, [F1] gives a finite set F⊆N with ∑n∉F∣zn∣2<ε2; choose N containing F. Then the truncation z(N) supported on indices n≤N obeys ∥z−z(N)∥22=∑n>N∣zn∣2<ε2. Thus finitely supported vectors are dense, and since all lie in R(K), R(K) is dense in H.

2.1step 1.2F1F6F7algebra

For yn=1/(n+1), [F6] gives y∈H. Its finite truncations are in R(K) by step 1.2 and converge to y because the tails of its square-sum tend to zero; hence y∈R(K)‾. If Kx=y, then every coordinate equation gives xn=1, contradicting x∈H. Indeed, if the finite sums ∑n=0N∣xn∣2=N+1 had an upper bound B≥0, [F7] with ε=1/(B+1) would give m>B+1, and the partial sum at N=m would exceed B. Therefore y∉R(K) and the dense range is not closed.

3.1step 1.1step 2.1F1F5F7F9A1algebra∎

The coordinate vectors are orthonormal because [F1] gives ⟨ei,ej⟩=1 when i=j and 0 otherwise. They are complete: for any x∈H and ε>0, [F1] gives a finite set F with ∑n∉F∣xn∣2<ε2; choose N containing F, so the truncation's squared error is at most this tail. Direct calculation gives N(K)={0} and R(K)‾=H by step 1.2. For x,z∈H, the canonical inner product gives ⟨Kx,z⟩=∑nxnzn/(n+1)=⟨x,Kz⟩; hence [F9] identifies K∗=K. Since all diagonal coefficients are positive, N(K∗)={0}. Therefore Ken=(n+1)−1en and K∗en=(n+1)−1en, and the family is complete on both N(K)⊥ and R(K)‾. Reindexing by j=n+1 gives the positive singular system sj=1/j, vj=uj=ej−1 for j≥1. The datum has ⟨y,ej−1⟩=1/j, so every Picard summand equals 1. For any real bound B≥0, [F7] applied with ε=1/(B+1) gives an index m>B+1, so the corresponding finite subsums are unbounded and the Picard sum diverges, as [F5] predicts for a datum outside the range.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

84 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