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.

Severely ill-posed Sobolev q=2 detection rate

Example

Assume α,β>0, q=2, aj=jα, and σj=eβj in the Gaussian sequence detection experiment. A minimax separation rate over Θ2(r) is rε∗≍(log⁡ε−1β)−α.

Facts & Assumptions

Given: α,β>0, q=2, aj=jα, σj=eβj, and the finite-support extremal profile for sufficiently small r. For this rate comparison, Xε≍Yε means the ratio is bounded above and away from zero by constants independent of ε.

[F1]

q=2 Gaussian-sequence ellipsoid detection boundary: r2=AJ1/J2, uε2=(r/ε)4J0/(2J12), and uε→0 or ∞ gives the two minimax risk regimes.

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index, so (m+1)−2α≤A<m−2α, and write ℓ=m−j. For 1≤ℓ≤m/2, the mean-value theorem applied to x2α on [1/2,1] gives cαℓ+1m≤1−A(m−ℓ)2α≤Cαℓ+1m. For ℓ>m/2, the profile factor is at most one. Summing against σj4=e4βme−4βℓ, the near terms are bounded by the convergent sums ∑ℓ≥0(ℓ+1)e−4βℓ and ∑ℓ≥0(ℓ+1)2e−4βℓ, and the far tail is exponentially smaller than m−2. The ℓ=1 term supplies matching lower bounds. Thus J1≍J2≍e4βm/m,J0≍e4βm/m2. For J2, its extra factor Aaj2 is at most one and is bounded below by a positive constant at j=m−1. Consequently [F1] gives r2≍A≍m−2α and uε2≍ε−4r4e−4βm.

2.1F1step 1.1givenalgebra∎

The cutoff relation implies m≍r−1/α. For rε∗=(log⁡ε−1/β)−α, if rε/rε∗→0, then m/(log⁡ε−1/β)→∞, so the expression in step 1.1 tends to zero. If the ratio tends to infinity while rε→0, then m=o(log⁡ε−1) and log⁡uε2=4log⁡ε−1−4βm+4log⁡rε+O(1)→∞, because log⁡(1/rε)=O(log⁡log⁡ε−1). If rε does not tend to zero, reduce to rˉε=rεrε∗. Nonempty alternatives satisfy rε2≤a1−2 by the two q=2 constraints, so rˉε→0 and rˉε/rε∗→∞. The inclusion Θ2(rε)⊆Θ2(rˉε) transfers consistent tests to the original class. By [F1], these limits prove the displayed rate.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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