Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Weighted coefficient spaces form a Hilbert scale

Statement

Assume countable choice. Let H0 be a separable real Hilbert space with a complete orthonormal basis indexed by the disjoint union of a finite set I∗ and the level indices (ℓ,k) with ℓ≥0 and 0≤k<2ℓ. Write the basis vectors as (ei)i∈I∗ and (eℓk). For r≥0, define Hr:={x∈H0:∑i∈I∗∣⟨x,ei⟩H0∣2+∑ℓ≥022rℓ∑k<2ℓ∣⟨x,eℓk⟩H0∣2<∞}, with inner product given by the corresponding weighted coefficient sum and norm squared ∥x∥Hr2:=∑i∈I∗∣⟨x,ei⟩H0∣2+∑ℓ≥022rℓ∑k<2ℓ∣⟨x,eℓk⟩H0∣2. Then Hr is a separable real Hilbert space. Its displayed basis is complete and orthogonal in Hr, with squared basis norms 1 on the finite family and 22rℓ on level ℓ, and the inclusion Hr↪H0 is continuous with operator norm at most 1.

Facts & Assumptions

Given: Countable choice, H0, its finite orthonormal family and level-indexed orthonormal families, and r≥0.

[A1]

Countable choice is the principle that every countable family of nonempty sets has a choice function. The Axiom of Countable Choice (ACω)

[F1]

Under countable choice, a complete orthonormal family satisfies Parseval's identity: the sum of squared coefficients of each vector equals its squared norm. Parseval equivalences for an orthonormal family

[F2]

Real square-summable sequences with their canonical inner product are complete and hence Hilbert. The real square-summable sequence space is complete

[F3]

Under countable choice, square-summable coefficients on an orthonormal family give a norm-convergent sum whose limit has those coefficients and the corresponding squared norm. Square-summable orthogonal families have norm-convergent finite sums

[F4]

A topological space is separable when it has an at most countable dense subset. Separability: the existence of an at most countable dense subset

Proof

Given: Countable choice, H0, (eℓk), and r≥0 as in the Statement.

1.1A1F1givenconstructalgebra

Write m=∣I∗∣ and enumerate the basis by placing the finite family first, followed by (ℓ,k) at index m+(2ℓ−1)+k, since 2ℓ−1 is the number of level indices below ℓ. For x∈Hr, define Trx by (Trx)t=⟨x,eit⟩H0 for the finite coordinates and (Trx)m+(2ℓ−1)+k=2rℓ⟨x,eℓk⟩H0. Parseval [F1] gives ∥Trx∥ℓ22=∥x∥Hr2, so Tr is an isometry into real ℓ2(N).

2.1A1F2F3step 1.1givenconstructalgebra

Given b∈ℓ2(N,R), set the finite-family coefficients equal to its first m coordinates and put aℓk=2−rℓbm+(2ℓ−1)+k. Since r≥0, the sum of squares of all these coefficients is at most ∑n∣bn∣2<∞. By [F3], their orthonormal expansion converges in H0 to a vector x with those coefficients. Thus x∈Hr and Trx=b, so Tr is onto. By [F2], the isometric pullback of the real ℓ2 inner product makes Hr complete, and hence a real Hilbert space.

3.1F4step 1.1step 2.1algebra

The finite-support rational sequences form a countable subset of real ℓ2: each is encoded by a finite list of coordinate indices, integer numerators, and positive denominators, and such finite integer lists have an explicit natural-number encoding. Given b∈ℓ2 and ε>0, choose N≥1 so that (∑n≥N∣bn∣2)1/2<ε/2, then choose rationals q0,…,qN−1 with ∣bn−qn∣<ε/(2N) for each 0≤n<N, and set qn=0 for n≥N. Then ∥b−q∥22=∑n<N∣bn−qn∣2+∑n≥N∣bn∣2<ε2/2<ε2, so these finite-support rational sequences are dense. Because Tr is an isometric bijection by steps 1.1 and 2.1, their inverse images are a countable dense subset of Hr. Hence Hr is separable by [F4].

4.1A1F1step 3.1givenalgebra∎

Each basis vector has a single nonzero coefficient, so its squared Hr norm is 1 on I∗ and 22rℓ on level ℓ; distinct basis vectors are orthogonal under the weighted inner product. The finite-support coefficient vectors are dense by step 3.1, so the orthogonal family is complete in Hr. Finally Parseval [F1] gives ∥x∥H02=∑i∈I∗∣⟨x,ei⟩∣2+∑ℓ,k∣⟨x,eℓk⟩∣2≤∥x∥Hr2 for x∈Hr, because 22rℓ≥1. Thus the inclusion has operator norm at most 1.

Depends on

Used by

Dependency tree · two levels

46 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