Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Marginal sub-Gaussianity does not justify an anytime confidence sequence

Statement refuted

For every α∈(0,1) and ρ>0, marginal centered sub-Gaussianity with proxy 1 alone makes the intervals in Gaussian-mixture confidence-sequence boundary a (1−α) confidence sequence for the common mean, regardless of dependence.

Facts & Assumptions

Given: Fix α∈(0,1) and ρ>0. Let Ω={−1,+1} with equal probabilities, let Z(ω)=ω, let F0={∅,Ω} and Ft=σ(Z) for every t≥1, and set Xt=Z, μ=0, and σ2=1.

[F1]

Conditional Hoeffding bound for bounded martingale differences: if D is conditionally centered and lies between measurable endpoints A≤D≤B of deterministic width at most c, then E[eλD∣G]≤eλ2c2/8 for every real λ.

[F2]

Sub-Gaussian variables and vectors, and sub-exponential variables: a centered real random variable is sub-Gaussian with proxy 1 when EeλX≤eλ2/2 for every λ∈R.

[F3]

Conditioning a known variable and an independent variable: an integrable variable independent of a sigma-algebra has conditional expectation equal almost surely to its ordinary expectation.

[F4]

Conditional expectation given a sigma algebra: a conditional-expectation version is a measurable integrable function with the same integral as the input on every event in the conditioning sigma-algebra.

[F5]

Conditional expectation is unique almost surely: any two versions of the same conditional expectation agree almost surely.

[F6]

Conditionally sub-Gaussian increments: the required sequential premise bounds the conditional mgf of each increment given Ft−1 for every fixed real λ.

[F7]

Gaussian-mixture confidence-sequence boundary: for σ2=1, the radius at time t≥1 is t−1(t+ρ)log⁡((t+ρ)/(α2ρ)).

[A1]

The Axiom of Choice: AC is assumed by the conditional-expectation convention in [F1].

Counterexample

1.1givenF1F2F3A1

We have EZ=0 and −1≤Z≤1. Since F0 is trivial, [F3] gives E[Z∣F0]=0 and, for every λ, E[eλZ∣F0]=EeλZ; the latter variable is integrable because Z has finite support. Apply [F1] with D=Z, A=−1, B=1, and c=2 to get E[eλZ∣F0]≤eλ2/2, hence EeλZ≤eλ2/2 for every λ∈R. Thus every marginal Xt=Z is centered and sub-Gaussian with proxy 1 by [F2].

1.2givenF4F5F6algebra

At time t=2, X2=Z is F1-measurable. Its own version satisfies [F4], so [F5] gives E[eX2∣F1]=eZ almost surely. On the event {Z=1}, which has probability 1/2, this equals e>e1/2. Hence the conditional sub-Gaussian premise [F6] with proxy 1 fails at t=2 and λ=1.

1.3givenF7F8algebra

Every sample mean is Xˉt=Z. For all sufficiently large t, (t+ρ)/(α2ρ)≥1; using [F8] and u−1≤u−3/4 for u≥1 gives (uα(t)/t)2≤4(t+ρ)5/4/((α2ρ)1/4t2)=4t−3/4(1+ρ/t)5/4/(α2ρ)1/4→0. Thus the radius is eventually less than 1.

2.1givenstep 1.3F7algebra∎

Since ∣Xˉt∣=∣Z∣=1, step 1.3 implies that 0 is outside every boundary interval for all sufficiently large t, on both outcomes. Therefore P(0∈Ct for all t≥1)=0<1−α, refuting the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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.