Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Little-o multiscale coefficient space M0(w)

Definition

Use the wavelet coefficient levels (l,k) and multiplicities ∣Kl∣=2l from Logarithmic negative Sobolev spaces for white noise. The same coefficient-space definition applies to the Haar system used for type-H histograms: detail levels l≥0 have 2l coefficients, and the single scaling coefficient is an additional finite coarsest coordinate, included in the norm with weight 1. Finite projections always retain that scaling coordinate; this finite convention does not alter any tail assertion. Let w=(wl) be nondecreasing with wl≥1. Define M(w)={x=(xlk):∥x∥M(w):=sup⁡lmax⁡k∈Kl∣xlk∣wl<∞} and its closed little-o subspace M0(w)={x∈M(w):max⁡k∈Kl∣xlk∣wl⟶0 as l→∞}, with the same norm. Call w admissible when wl/l→∞. The finite coarsest level is included in the norm and does not affect this limit. Elements are coefficient sequences; in particular, they need not be L2 functions. The multiscale coefficient space is separable and has vanishing projection tails ↗ proves that M0(w) is a separable Banach space, that L2 coefficient sequences embed in it, and that finite-level projections converge in its norm.

Depends on

Used by

Dependency tree · two levels

4 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