Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 multiscale coefficient space is separable and has vanishing projection tails

Statement

For every weight sequence in Little-o multiscale coefficient space M0(w), M0(w) is a separable Banach space. If PJ retains exactly the coefficients at levels l≤J, then ∥PJx∥M(w)≤∥x∥M(w) and ∥x−PJx∥M(w)→0 for each x∈M0(w). Every square-summable coefficient sequence belongs to M0(w).

Facts & Assumptions

Given: The finite level sets Kl, weights wl≥1, and the vanishing-tail definition of M0(w).

[F1]

Little-o multiscale coefficient space M0(w): the detail norm is D(x)=sup⁡lwl−1max⁡k∈Kl∣xlk∣. Without an extra scaling coordinate the norm is D(x); in the Haar convention, writing x∗ for that coordinate, it is max⁡(∣x∗∣,D(x)). Membership in M0(w) means the normalized detail maximum tends to zero. As in that definition, every PJ retains the finite coarsest coordinates, including x∗ when present.

Proof

1.1F1givenchoosealgebra

Let (x(m)) be Cauchy in M0(w). Each coordinate is Cauchy because ∣xlk(m)−xlk(n)∣≤wl∥x(m)−x(n)∥M(w). In the Haar case also ∣x∗(m)−x∗(n)∣≤∥x(m)−x(n)∥M(w). Let xlk and, when present, x∗ be the scalar limits. The uniform Cauchy bound passes to every finite collection of coordinates and then to the supremum, so x(m)→x in the weighted supremum norm. To see x∈M0(w), fix ε>0, choose m with ∥x−x(m)∥M(w)<ε, then choose J so the normalized tail of x(m) is below ε; for l>J the normalized tail of x is at most 2ε. Thus M0(w) is complete.

1.2F1givenchoosealgebra

Finite-support sequences with rational coordinates are countable and dense: first choose J to make the tail of any x∈M0(w) small, then approximate its finitely many coordinates through level J, including the scaling coordinate when present, by rationals. Hence M0(w) is separable. The formula for the norm shows PJ is a contraction, and the defining tail limit gives ∥x−PJx∥M(w)→0.

2.1F1givenalgebra∎

If x∈ℓ2, then wl≥1 implies wl−1max⁡k∣xlk∣≤(∑k∣xlk∣2)1/2. The right side tends to zero because its squares are level blocks of a convergent nonnegative series. Its supremum and the absolute scaling coordinate, when present, are at most ∥x∥ℓ2, so x∈M0(w).

Depends on

Used by

Cited to discharge well-definedness by Little-o multiscale coefficient space M0(w).

Dependency tree · two levels

2 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