Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Exact adaptive credible coverage by posterior-null deletion

Example

Assume AC and Countable Choice. Fix p>0, C≥1, 0<β−<β+<A<∞, R≥1, L0≥1, an integer N0≥1, ρ≥2, m∈(0,R], and 0<γ<1. Let a known positive singular-value sequence satisfy C−2i−2p≤κi2≤C2i−2p, and observe Xi=κiθi+n−1/2ξi for i≥1, where the fixed truth θ=(θi)∈ℓ2(N,R) and the ξi are independent N(0,1) variables. For α>0, use the product prior Πα=⨂i≥1N(0,i−1−2α) and its product Gaussian posterior with coordinate mean nκiXi/(i1+2α+nκi2) and variance (i1+2α+nκi2)−1. Select α^n as a Borel global maximizer over [0,A] of the marginal log-likelihood score ℓn(α;X)=−12∑i≥1[log⁡(1+nκi2i1+2α)−n2κi2Xi2i1+2α+nκi2], assuming the score series is finite on a Borel data domain of probability one for the truths below and is upper semicontinuous in α there. The α^n=0 branch uses the whole space ℓ2 and asserts no posterior probability on ℓ2.

For θ∈ℓ2, write ∥θ∥2=(∑i≥1θi2)1/2. For B⊆ℓ2, define diam⁡ℓ2(B)=sup⁡u,v∈B∥u−v∥2, with diam⁡ℓ2(∅)=0.

For β∈[β−,β+], let Θβ(R)={θ∈ℓ2:∑i≥1i2βθi2≤R2} and let Θpt(L0,N0,ρ) consist of those θ∈ℓ2 satisfying ∑i=N∞θi2≤L0∑i=N⌊ρN⌋θi2 for every integer N≥N0. Put Gβ=Θβ(R)∩Θpt(L0,N0,ρ)∩{θ:θ1=0, ∥θ∥2≥m} and assume the fixed constants make each Gβ nonempty. There exists a single graph-measurable data-indexed set rule Cn,γ(X)⊆ℓ2, depending only on the known model and class constants and not on θ or β, such that on α^n>0 it has posterior mass Πα^n(Cn,γ(X)∣X)≥1−γ, its uniform frequentist coverage satisfies sup⁡β∈[β−,β+]sup⁡θ∈Gβ∣Pθ(n){θ∈Cn,γ(X)}−(1−γ)∣⟶0, and its ℓ2-diameter has the no-log rate n−β/(1+2β+2p) uniformly in the following sense: for every η>0 there is Kη<∞ such that lim sup⁡n→∞sup⁡β∈[β−,β+]sup⁡θ∈GβPθ(n){diam⁡ℓ2(Cn,γ(X))>Kηn−β/(1+2β+2p)}≤η.

Example references

Uniform conservative coverage of an inflated empirical-Bayes ball

The lower-selector bracket used in the diameter proof

Szabó, van der Vaart and van Zanten (2015), Theorem 3.6 and §5. The null-deletion construction is a local consequence for the unrestricted set-rule formulation; it is not attributed to that paper.

Facts & Assumptions

Given: Exactly the original question's model, constants, score domain and selector, posterior, nonempty classes Gβ, AC and Countable Choice. No change in the permitted set geometry is made.

[A1]

AC and Countable Choice are assumed as stated. The Axiom of Choice, The Axiom of Countable Choice (ACω)

[F2]

For fixed cap A, a constant inflation L≥1 gives coverage tending uniformly to one over polished-tail truths with first coordinate zero, with the whole-space convention at selector zero. Conservative coverage of adaptive empirical-Bayes credible balls on polished tails

[F3]

The lower-selector bracket holds uniformly over all square-summable truths, with the score normalization and threshold t=(16C8)−1 stated there. Marginal-likelihood maximizer bracket on polished tails Its score hypotheses and uniform probability bound are supplied by Uniform marginal-score bounds by derivative integration.

[F4]

Credibility means graph-measurable membership and posterior mass at least 1−γ on the declared domain; coverage is fixed-truth sampling probability. Posterior credibility and frequentist coverage

[F5]

The polished-tail condition is the fixed tail-to-block energy inequality in the Example. Polished-tail class for a Gaussian sequence

Verification

Given: The complete model, class constants, supplied score domain and selector, and quantified conclusions in the Example and Facts & Assumptions. The sequence coordinates are exactly i≥1, as in the displayed model and norm; thus ℓ2 here means ℓ2({1,2,…},R). No coordinate zero is added to that model.

1.1A1F2F5given

Fix the inflation L≥1 in [F2], depending only on the known constants. Let Bn=C^n(L), including its whole-space zero-selector branch. With U=⋃β∈[β−,β+]Gβ, [F2] gives ϵn:=sup⁡θ∈UPθ(n){θ∉Bn}→0. This is uniform because U is a subset of the single polished-tail class in that theorem. This step claims conservative coverage only.

1.2F1givenconstruct

The random positive-selector posterior is supported on ℓ2 on a single Borel domain, not merely on a separate almost-sure domain for each fixed hyperparameter. Indeed intersect the supplied score domain with Tn={x:∑in2κi2xi2/i2<∞}. For every square-summable truth the expectation of this nonnegative sum is n2∑iκi4θi2/i2+n∑iκi2/i2<∞. Thus Tn is Borel and has probability one under every such truth. For every x∈Tn and every a≥0, the squared posterior mean is bounded by that same sum, since i1+2a+nκi2≥i. For every a>0 the variance trace is finite. Hence all positive-parameter posterior laws at these data are supported on ℓ2, including the selected law. Extend the selector by zero and use the whole space outside this common declared domain. This changes none of the sampling probabilities and asserts no posterior on the zero branch.

1.3F3givenalgebra

We verify the diameter rate uniformly in β, rather than import a pointwise Sobolev assertion. Write qa=1+2a+2p, Na=n1/qa, and d=β−a≥0. In the score hn(a;θ) of [F3], put ei=i2βθi2, so ∑iei≤R2. For i≤Na, the multiplier of ei is at most i1−2dlog⁡iNalog⁡Na≤Na−min⁡(1,2d). If 1−2d≥0, bound both powers and logarithms by their values at Na; otherwise use i1−2d≤1. For i>Na, the multiplier is at most Na2qaNalog⁡Nai−1−2a−4p−2βlog⁡i≤Na−2d. The last function of i is decreasing for i≥Na once n is uniformly large, since its negative power has exponent at least 1+4p. Both ranges therefore give hn(a;θ)≤R2Na−min⁡(1,2(β−a)). These bounds hold simultaneously for 0≤a≤β, every β in the fixed compact interval, and every θ∈Θβ(R).

2.1F3step 1.3algebra

Choose a fixed D>0 with R2exp⁡{−2D/(1+2β++2p)}<t. For all sufficiently large n, put an,β=β−D/log⁡n≥β−/2. For every 0≤a≤an,β, step 1.3 makes hn(a;θ)<t: here min⁡(1,2(β−a))log⁡Na≥2D/(1+2β++2p) when log⁡n≥2D. Consequently α‾n≥an,β, including the empty-threshold convention α‾n=A. The uniform lower bracket [F3] yields sup⁡β,θ∈GβPθ(n){α^n<an,β}⟶0. In particular δn:=sup⁡θ∈UPθ(n){α^n=0}→0.

2.2F1F4step 1.2construct

Put H={u∈ℓ2:u1=0}, Zn={α^n=0} and En={nX1≤Φ−1(1−γ)}. Define Cn={ℓ2,Zn,Bn,Znc∩En,Bn∖H,Znc∩Enc. For n<3 one may use ℓ2. The positive-selector posterior's first-coordinate variance is (1+nκ12)−1>0, so it assigns H mass zero for every data point of the declared domain, even though the hyperparameter is data-selected. Since L≥1, Bn has posterior mass at least 1−γ; deleting H preserves that mass. On Zn the specified whole-space convention is retained.

3.1F1step 2.1algebra

Uniformly for a∈[β−/2,A], split the posterior variance trace at Na. Below that cutoff use vi(a)≤C2i2p/n; above it use vi(a)≤i−1−2a. Summation and an integral comparison give ∑ivi(a)≤Kn−2a/qa, where K depends only on the fixed constants (the tail factor 1/(2a) is uniformly bounded). Markov's inequality applied to the centered posterior squared norm bounds its (1−γ) norm quantile by K/γ n−a/qa. The variances, hence the norm quantile, decrease with a by coupling all centered coordinates with the same standard normals. On the event of step 2.1, the selected radius is therefore at most K/γ n−an,β/qan,β. The derivative of a/qa is (1+2p)/qa2≤1/(1+2p), so this is at most K′n−β/(1+2β+2p) with one K′ for the full compact β interval. Thus outside an event of uniformly vanishing probability, diam⁡(Bn)≤2LK′n−β/(1+2β+2p). This includes the uniformly negligible infinite-diameter zero-selector branch.

3.2F1step 1.2step 2.2construct

This is one rule independent of θ and β. Its graph is Borel: the coordinate posterior means and selector are Borel, and the squared norm is the limit of its finite coordinate sums. For completeness, on a fixed countable standard-normal product space the map (a,z)↦∑ivi(a)zi2 is nonnegative Borel. Integrating its threshold indicators gives a Borel distribution function in (a,s). Its quantile is Borel, by taking the infimum of positive rational radii whose distribution function is at least 1−γ; right continuity ensures this quantile has the required posterior mass. The centered norm has a positive finite quantile: it is finite by its finite second moment and has no atom at zero because its first coordinate is nondegenerate. Thus the radius is positive. Deleting the closed codimension-one hyperplane leaves a dense subset of any positive-radius ball: perturb a point toward the center if necessary and then a sufficiently small amount along the first coordinate. Hence Bn∖H has the same diameter 2Lrn,γ(α^n) as Bn. Diameter is consequently an extended Borel random variable, equal to this expression off Zn and infinity on Zn.

4.1F4step 1.1step 2.1step 3.1step 2.2algebra∎

Every allowed truth lies in H and has Pθ(n)(En)=1−γ exactly, since θ1=0. Its coverage equals Pθ(Zn)+Pθ(Znc∩En∩{θ∈Bn}). Subtracting Pθ(En) leaves Pθ(Zn∩Enc)−Pθ(Znc∩En∩{θ∉Bn}). Its absolute value is at most δn+ϵn→0 uniformly over both suprema in the question. No independence among En, the selector and Bn is used. Also Cn⊆Bn on every branch, so step 3.1 proves the requested diameter statement, in fact with limiting supremum zero for one sufficiently large fixed diameter constant. The nonzero lower norm bound m is retained and needs no additional argument. This answers the unchanged unrestricted existence question affirmatively. It does not identify the constructed sets as balls or attribute this null-deletion construction to the cited literature.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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