Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Diameter of undersmoothed multiscale credible bands

Statement

Assume all hypotheses of CDF and multiscale credible-band calibration from weak BvM limits at a fixed credibility level 1−α, 0<α<1, and use its M0(w) credible ball CnM and scaled radius RnM. Let γ>0, assume the compactly supported wavelets have uniformly bounded overlap and ∥ψlk∥∞≤C2l/2, and define ∥f∥Cψγ:=sup⁡l,k2l(γ+1/2)∣⟨f,ψlk⟩∣. Suppose ∥f0∥Cψγ<∞. Choose integers jn with 2jn≍(n/log⁡n)1/(2γ+1) and let un=wjn/jn→∞. Intersect the credible ball with the coefficient smoothness ball: C‾n=CnM∩{f:∥f∥Cψγ≤un}. Then Pf0(n){f0∈C‾n}→1−α, and its L∞ diameter satisfies diam⁡L∞(C‾n)=OPf0(n) ⁣((n/log⁡n)−γ/(2γ+1)un).

Facts & Assumptions

Given: All hypotheses, the credible ball and radius of CDF and multiscale credible-band calibration from weak BvM limits, the coefficient smoothness norm and wavelet assumptions in the Statement, γ>0, and un→∞.

[F1]

Little-o multiscale coefficient space M0(w): the multiscale ball bounds each level-l coefficient by wl times its radius.

[F2]

CDF and multiscale credible-band calibration from weak BvM limits: CnM has frequentist coverage tending to 1−α, and its scaled radius RnM converges in probability to a finite quantile, hence is OP(1).

[L1]

The Statement defines Cψγ by the displayed coefficient norm sup⁡l,k2l(γ+1/2)∣⟨f,ψlk⟩∣.

Proof

1.1F2L1given

Since ∥f0∥Cψγ<∞ and un→∞, [L1] implies the truth belongs to the coefficient smoothness ball for all sufficiently large n. For those n, {f0∈C‾n}={f0∈CnM}, so the asserted coverage follows from [F2].

1.2F1L1givenalgebra

Let f,g∈C‾n. For l≤jn, [F1] gives max⁡k∣flk−glk∣≤2RnMwl/n. For l>jn, [L1] and membership in the coefficient smoothness ball give max⁡k∣flk−glk∣≤2un2−l(γ+1/2). At each point, only a uniformly bounded number of level-l wavelets are nonzero, each bounded by C2l/2. Therefore the low-frequency contribution to ∥f−g∥∞ is at most CRnMn−1/2∑l≤jn2l/2wl, and the high-frequency contribution is at most Cun∑l>jn2−lγ. These series also give uniformly convergent representatives because γ>0.

2.1step 1.2algebra

Since wl is nondecreasing, ∑l≤jn2l/2wl≤C2jn/2wjn by summing a geometric series. Also ∑l>jn2−lγ≤Cγ2−jnγ. The first bound in step 1.2 is thus at most CRnMwjn2jn/2/n=CRnMunjn2jn/2/n.

3.1F2step 1.2step 2.1algebra∎

The relation 2jn≍(n/log⁡n)1/(2γ+1) implies both 2−jnγ≍(n/log⁡n)−γ/(2γ+1) and jn2jn/2/n≤Cγ(n/log⁡n)−γ/(2γ+1). Combining the low- and high-frequency bounds in steps 1.2 and 2.1 and using RnM=OP(1) from [F2] yields the stated diameter bound.

Depends on

Used by

Dependency tree · two levels

14 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