Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Minimax detection risk and separation rate

Definition

Assume Countable Choice and use the Gaussian sequence inverse model with singular values sj>0, inverse-noise weights σj=sj−1, and parameter coordinates θ=(θj)∈ℓ2. Let a=(aj) be a positive nondecreasing sequence with aj→∞, and let σ=(σj) be a positive nondecreasing sequence with σj→∞. For ε>0, put ηj=θj/σj and observe Yj=Zj/σj=ηj+εξj, where Z is the normalized observation in the Gaussian sequence inverse model and the ξj are independent standard normal random variables. For 0<q≤2 and r>0, define Θq(r)={η∈RN>0:(σjηj)j≥1∈ℓ2, ∑j=1∞∣ajσjηj∣q≤1, ∑j=1∞σj2ηj2≥r2}. Test H0:η=0 against H1:η∈Θq(r) by a product-Borel measurable randomized test ψ:RN>0→[0,1], where ψ(y) is the rejection probability. Its type-I error and maximal type-II error are αε(ψ)=Eε,0ψ,βε(Θq(r),ψ)=sup⁡η∈Θq(r)Eε,η(1−ψ). When Θq(r)=∅, define βε(Θq(r),ψ)=βε(Θq(r),α)=γε(Θq(r))=0, the convention that no type-II error occurs when no alternative is possible. For α∈(0,1) define βε(Θq(r),α)=inf⁡ψ: αε(ψ)≤αβε(Θq(r),ψ),γε(Θq(r))=inf⁡ψ{αε(ψ)+βε(Θq(r),ψ)}. A positive family rε∗→0 is a minimax separation rate if γε(Θq(rε))→1 and βε(Θq(rε),α)→1−α for every α∈(0,1) whenever rε/rε∗→0, while γε(Θq(rε))→0 and βε(Θq(rε),α)→0 for every α∈(0,1) whenever rε/rε∗→∞.

Depends on

Used by

Dependency tree · two levels

24 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