Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Symmetric Gaussian product-mixture testing bound

Statement

Assume Countable Choice. In the Gaussian sequence detection experiment, let v∈Θq(r) have finite support J and put u(v)2=12ε4∑j∈Jvj4. Let πv be the uniform probability law on the finite family of mean sequences whose jth coordinate is independently +vj or −vj for j∈J and is zero off J, and let Pπv be the corresponding mixture sampling law. Then its likelihood ratio with respect to the null law is Lv=dPπvdPε,0=∏j∈Jexp⁡ ⁣(−vj22ε2)cosh⁡ ⁣(vjYjε2), it satisfies Eε,0Lv2=∏j∈Jcosh⁡ ⁣(vj2ε2),Eε,0(Lv−1)2≤exp⁡(u(v)2)−1, and the minimax risks obey γε(Θq(r))≥1−12exp⁡(u(v)2)−1,βε(Θq(r),α)≥1−α−12exp⁡(u(v)2)−1 for every α∈(0,1).

Facts & Assumptions

Given: Countable Choice, ε>0, v∈Θq(r) of finite support, and the null and alternative laws in the Gaussian sequence detection experiment.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is inherited from the Gaussian sequence inverse model.

[F1]

Gaussian sequence inverse model and White-noise spectral sequence representation: after scaling the normalized observation by sj=σj−1, Yj=ηj+εξj with independent standard normal coordinates ξj.

[F2]

Minimax detection risk and separation rate: αε(ψ)=Eε,0ψ, βε(Θq(r),ψ)=sup⁡η∈Θq(r)Eε,η(1−ψ), and γε is the infimum of their sum.

[F3]

The standard-normal coordinate law supplied by [F1] has density φ(x)=(2π)−1/2e−x2/2. Since it is a probability law, ∫Rφ(x) dx=1. This uses the supplied experiment, not the stronger-AC normalization theorem The standard normal density has total mass one.

[F4]

Independent random elements have product joint law: a finite tuple of independent coordinates has the product of its marginal laws.

[F5]

Finite measures agreeing on a generating pi-system and on the whole space are equal: probability measures agreeing on a generating pi-system agree on its generated sigma-algebra.

[F6]

Total variation distance for probability laws: ∥P−Q∥TV=sup⁡A∣P(A)−Q(A)∣ over measurable events.

[F7]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: translation of the standard normal density preserves its integral, so EetG=et2/2 for G∼N(0,1) by completing the square.

Proof

1.1A1F1givenconstruct

For each sign vector τ∈{−1,+1}J, let vjτ=τjvj on J and zero elsewhere. Absolute values and squares are unchanged, so every vτ belongs to Θq(r).

1.2F1F3F7givenalgebra

Under the null, Xj=Yj/ε has density φ. For a fixed sign and coordinate, the density ratio for mean τjvj versus zero is exp⁡(τjvjYj/ε2−vj2/(2ε2)); completing the square using [F7] shows its null expectation is one.

2.1step 1.2F4algebra

Independence [F4] multiplies the one-coordinate ratios from step 1.2, giving the density ratio for the finite coordinate vector on each cylinder event. Its null expectation is the product of unit expectations, so it defines a probability measure on the full product space.

3.1step 2.1F5algebra

Cylinder events form a generating pi-system. The fixed-sign sampling law and the probability measure from step 2.1 agree on every cylinder, so [F5] gives equality on the product sigma-algebra and validates the full likelihood-ratio identity.

4.1step 3.1algebra

Averaging the fixed-sign likelihood ratios in step 3.1 over the finite sign set factors coordinatewise and gives Lv=∏j∈Je−δj/2cosh⁡(δjXj), where δj=vj2/ε2. This density is positive and has null expectation one.

5.1F4F7step 4.1algebra

For a standard normal G, [F7] and cosh⁡2t=(1+cosh⁡(2t))/2 give e−δEcosh⁡2(δG)=e−δ(1+e2δ)/2=cosh⁡δ. Independence [F4] and step 4.1 therefore give E0Lv2=∏j∈Jcosh⁡δj.

6.1step 5.1algebra

The function g(t)=t2/2−log⁡cosh⁡t is even, has g(0)=0, and for t≥0 has derivative g′(t)=t−tanh⁡t≥0, since (tanh⁡t)′≤1 and tanh⁡0=0. Thus cosh⁡t≤et2/2 for all real t. Since ∑jδj2=2u(v)2, step 5.1 yields E0(Lv−1)2=∏jcosh⁡δj−1≤e12∑jδj2−1=eu(v)2−1.

7.1F6step 6.1algebra

Since E0(Lv−1)=0, the positive and negative parts of Lv−1 have equal integrals; hence every event E satisfies ∣Pπv(E)−P0(E)∣≤12E0∣Lv−1∣≤12E0(Lv−1)2. Approximate a randomized test ψ by N−1∑k=1N1{ψ≥k/N}; the event bound [F6] and uniform approximation error N−1 give ∣Eπvψ−E0ψ∣≤∥Pπv−P0∥TV.

8.1F2step 6.1step 7.1givenalgebra∎

The maximal type-II error is at least its mixture average because every sign alternative lies in Θq(r). Therefore every test has total error at least 1−∥Pπv−P0∥TV, and any level-α test has maximal type-II error at least 1−α−∥Pπv−P0∥TV. Taking the respective infima, then applying steps 6.1 and 7.1, proves both stated risk bounds.

Depends on

Used by

Dependency tree · two levels

57 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