Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 primitive map is continuous into C[0,1]

Statement

Let (ψlk) be a compactly supported wavelet basis of Logarithmic negative Sobolev spaces for white noise. The Haar basis with its finite scaling coordinate, as specified in Little-o multiscale coefficient space M0(w), is also allowed. Assume each level-l wavelet for l≥l0 has zero integral, uniformly bounded overlap, support length at most C02−l, and ∥ψlk∥1≤C02−l/2. Let M0(w) be as in Little-o multiscale coefficient space M0(w), and suppose Sw:=∑l≥l0wl2−l/2<∞. For x∈M0(w) define Jx(t):=∑l,kxlk⟨1[0,t],ψlk⟩L2,0≤t≤1. Then this series converges absolutely and uniformly in t, Jx∈C([0,1]), and ∥Jx−Jy∥∞≤CSw∥x−y∥M(w) after adding the finite coarsest-level constant to CSw. If x is the coefficient sequence of f∈L2, then Jx(t)=∫0tf(u) du.

Facts & Assumptions

Given: The wavelet geometry, summability condition, and multiscale space in the Statement.

[F1]

Little-o multiscale coefficient space M0(w): ∥x∥M(w)=sup⁡lwl−1max⁡k∣xlk∣.

[F2]

Logarithmic negative Sobolev spaces for white noise: (ψlk) is a complete orthonormal basis of L2([0,1]); finite orthogonal projections converge in L2.

Proof

1.1givenalgebra

For fixed t and level l≥l0, a wavelet whose support lies wholly on one side of t contributes zero: it is either disjoint from [0,t] or its entire support is integrated and its mean is zero. Only supports meeting t can contribute. Uniformly bounded overlap bounds their number by a constant, and each coefficient has magnitude at most ∥ψlk∥1≤C02−l/2. Thus sup⁡t∑k∣⟨1[0,t],ψlk⟩∣≤C12−l/2. The finitely many coarsest levels have a finite uniform sum as well.

2.1F1givenstep 1.1algebra

By [F1] and step 1.1, the absolute sum of all terms at levels l≥l0 is at most C1∥x∥M(w)∑l≥l0wl2−l/2, uniformly over t. Its tails tend uniformly to zero because Sw<∞. Each finite-level sum is continuous in t, since t↦∫0tψlk(u)du is continuous for an L1 function. The uniform limit is continuous. Applying the same estimate to x−y proves the stated operator-norm bound.

3.1F2step 2.1algebra∎

If xlk=⟨f,ψlk⟩ for f∈L2, the finite orthogonal projections converge to f in L2 by [F2]. The map f↦∫0tf(u)du=⟨f,1[0,t]⟩ is a continuous L2 functional because ∥1[0,t]∥2≤1. Applying it to the finite projections shows that their coefficient sums converge to ∫0tf, while step 2.1 identifies the same limit with Jx(t).

Depends on

Used by

Dependency tree · two levels

5 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