Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 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.

Mildly ill-posed Sobolev q=2 detection rate

Example

Assume α,β>0, q=2, aj=jα, and σj=jβ in the Gaussian sequence detection experiment. The minimax separation rate over Θ2(r) has order rε∗≍ε4α/(4α+4β+1).

Facts & Assumptions

Given: α,β>0, q=2, aj=jα, σj=jβ, and a nonempty Θ2(r) with the finite extremal profile supplied 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 corresponding indistinguishability or consistency branch.

[F2]

Existence of a finite q=2 ellipsoid extremal profile for small radius and The q=2 ellipsoid extremal profile minimizes the fourth-power objective: for sufficiently small r, a finite-support extremal profile exists and has η~j2=z02j2β(1−Aj2α)+.

Verification

1.1F1F2givenconstructalgebra

Let m be the largest active index, so Am2α<1≤A(m+1)2α and (m+1)−2α≤A<m−2α. For j≤m/2, 1−Aj2α≥1−2−2α>0. For any fixed p>0, ∑j≤mjp≤mp+1 and ∑m/4≤j≤m/2jp≥cpmp+1 for all sufficiently large m, by counting at least m/8 terms each at least (m/4)p. Applying these bounds with p=4β and p=4β+2α gives J1≍m4β+1,J0≍m4β+1,J2=A∑j≤mj4β+2α(1−Aj2α)≍m4β+1. Thus [F1] yields r2≍A≍m−2α and uε2≍ε−4r4m−(4β+1).

2.1F1step 1.1givenalgebra∎

Since m≍r−1/α, the last expression becomes uε2≍ε−4r4+(4β+1)/α=(r/ε4α/(4α+4β+1))4+(4β+1)/α. Hence radii with ratio tending to zero give uε→0, and [F1] gives the indistinguishability limits. For a ratio tending to infinity, if rε does not tend to zero, replace it by rˉε=rεrε∗: nonempty alternatives satisfy rε≤a1−1, so rˉε→0, rˉε/rε∗→∞, and Θ2(rε)⊆Θ2(rˉε). The consistent tests from [F1] at rˉε therefore also work at rε. This proves the stated separation 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