Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Sequential Validity and Ville's Inequality

1 · Prerequisites

2 · Summary

Objective

Develop discrete-time, null-uniform validity for optional monitoring from nonnegative test supermartingales. Starting from the filtration, supermartingale, and bounded optional-sampling definitions, prove Ville's inequality by stopping at the first crossing truncated at a deterministic horizon and taking the increasing-event limit. Prove that a fixed product-measurable mixture of null test supermartingales remains a test supermartingale. Convert a test supermartingale into an anytime-valid p-value process and invert a parameter-indexed family into a confidence sequence. Every guarantee is under each law in the stated null family. The page makes no continuous-time, adaptive-allocation, or bandit claim.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Nonnegative test supermartingales

Definition

Assume the Axiom of Choice (AC) The Axiom of Choice. Let (Ω,F,(Ft)t∈N0) be a discrete filtration on a measurable space, and let P0 be a family of probability laws on (Ω,F). A real-valued process E=(Et)t∈N0 is a nonnegative test supermartingale for P0 if, for every P∈P0, it is adapted and integrable under P Filtration and filtered probability space Martingale submartingale and supermartingale, satisfies P(Et≥0)=1 for every t, and has EPE0≤1.

The same process must satisfy the supermartingale condition under every law in the null family; that is what makes the definition uniform over a composite null. The initial value may be random and need not be bounded by one pointwise. Time starts at zero.

Remarks

A nonnegative test supermartingale is a standard sufficient process for anytime-valid testing. Some literature uses e-process for a broader class, allowing a process dominated under each null law by a different test martingale. This item defines the planned common test-supermartingale class; it does not assert that every e-process is itself a supermartingale.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Ville's inequality for nonnegative test supermartingales

Statement

Assume AC. Let P0 be a family of probability laws on a common discrete filtered measurable space and let E=(Et)t≥0 be a nonnegative test supermartingale for P0 Nonnegative test supermartingales. For every P∈P0 and every α∈(0,1), P ⁣(sup⁡t≥0Et≥1α)≤α.

Facts & Assumptions

Given: Assume AC. If P0 is empty the conclusion is vacuous; otherwise fix P∈P0, α∈(0,1), and the nonnegative test supermartingale E. All stopping times below use the discrete filtration and time starts at zero.

[F1]

Nonnegative test supermartingales: under every null law P, E is adapted, integrable, nonnegative almost surely at each time, a supermartingale, and EPE0≤1.

[F2]

Discrete stopping time: a map into N0∪{∞} is a stopping time when {τ≤n}∈Fn for each n, and it is bounded if some deterministic N satisfies τ≤N almost surely.

[F3]

Optional sampling for bounded stopping times: under AC, for bounded stopping times and a supermartingale the expectation inequality points downward.

[F4]

Continuity from below for measures: for an increasing sequence of measurable events, the measure of the union is the limit of their measures.

[A1]

The Axiom of Choice: AC supplies the conditional-expectation clauses used by the supermartingale definition and bounded optional-sampling theorem.

Proof

1.1givenF1F2choose

Fix any γ∈(0,1) and define τγ=inf⁡{t≥0:Et≥1/γ}, with inf⁡∅=∞. For every n, {τγ≤n}=⋃k=0n{Ek≥1/γ}∈Fn, so τγ is a stopping time. Also {τγ∧N≤n}={τγ≤n} for n<N and is the whole space for n≥N, so each τγ∧N is a bounded stopping time.

2.1F1F2F3A1step 1.1

The constant time 0 is a stopping time bounded by 0, and step 1.1 shows τγ∧N is a bounded stopping time. Bounded optional sampling therefore gives EPEτγ∧N≤EPE0≤1.

3.1F1step 2.1algebra

On {τγ≤N}, Eτγ∧N≥1/γ; on its complement the stopped value is EN≥0 almost surely. Hence EPEτγ∧N≥γ−1P(τγ≤N), and step 2.1 yields P(τγ≤N)≤γ.

4.1F4step 3.1

The events {τγ≤N} increase with N and their union is {τγ<∞}=⋃t≥0{Et≥1/γ}. Continuity from below and step 3.1 therefore give P(∃t≥0:Et≥1/γ)≤γ.

5.1step 4.1algebraassume-contrachoosecontradictiondischarge-contradiction∎

Let H={sup⁡t≥0Et≥1/α} and suppose q=P(H)>α. Since q≤1, β=(α+q)/2 lies in (α,1), so 1/β<1/α. If every Et≤1/β, then sup⁡tEt≤1/β<1/α, contrary to H; hence H⊆{∃t:Et≥1/β} even if the supremum is not attained. Step 4.1 with γ=β gives q≤β<q, a contradiction. Therefore P(H)≤α, and since P was arbitrary, the bound holds under every null law.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Mixtures of null test supermartingales

Statement

Assume AC. Let (Λ,A,π) be a probability space and let P0 be a family of laws on a common discrete filtered measurable space (Ω,F,(Ft)t≥0). For each λ∈Λ, let Eλ=(Etλ)t≥0 be a nonnegative test supermartingale for P0. Suppose that, for every t, the map (λ,ω)↦Etλ(ω) is measurable with respect to A⊗Ft. Before mixing, take its pointwise nonnegative version Etλ,+(ω)=max⁡{Etλ(ω),0}, and define E‾t(ω)=∫ΛEtλ,+(ω) π(dλ),E~t(ω)={E‾t(ω),E‾t(ω)<∞,0,E‾t(ω)=∞. Then E~=(E~t)t≥0 is a nonnegative test supermartingale for P0. The modification on the infinite-integral set makes a real-valued version common to all null laws.

Facts & Assumptions

Given: Assume AC. Let π, P0, and the product-measurable family of component test supermartingales satisfy the Statement. If P0 is empty, its lawwise conclusion is vacuous; otherwise fix any P∈P0 when checking the test-supermartingale conditions.

[F1]

Nonnegative test supermartingales: under each P∈P0, every component is nonnegative, adapted, integrable, a supermartingale, and has initial expectation at most one.

[F2]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function, section integrals are measurable and the product integral equals either iterated integral.

[F3]

Optional sampling for bounded stopping times: under AC, bounded stopping of a supermartingale gives a downward expectation inequality; deterministic times are bounded stopping times.

[F4]

Conditional expectation as an ae class: under AC, the conditional-expectation class exists and is represented by conditional-expectation versions.

[F5]

Conditional expectation given a sigma algebra: a conditional-expectation version is measurable and has the same integral as the original variable on every event in the conditioning sigma-algebra.

[A1]

The Axiom of Choice: AC supplies conditional-expectation classes used in the supermartingale and optional-sampling clauses.

Proof

1.1F1F2F3A1

Fix P∈P0 and t≥0. For every λ, P(Etλ≥0)=1, so Etλ,+=Etλ P-almost surely and has the same expectation. Apply F3 at the deterministic times 0 and t to get EPEtλ,+=EPEtλ≤EPE0λ=EPE0λ,+≤1. The pointwise nonnegative map (λ,ω)↦Etλ,+(ω) is product-measurable; Tonelli F2 makes E‾t Ft-measurable and gives EPE‾t=∫ΛEPEtλ,+ π(dλ)≤1. Hence Nt={E‾t=∞}∈Ft is null under every P∈P0. The common modification E~t=E‾t off Nt and 0 on Nt is finite, adapted, nonnegative and integrable under every null law, with EPE~0≤1.

2.1F1F2F4F5A1step 1.1

Fix P∈P0, t≥1, and A∈Ft−1. Since Esλ,+=Esλ P-almost surely for s=t−1,t, the component supermartingale condition and the event-integral identity F5 give ∫AEtλ,+ dP=∫AEtλ dP≤∫AEt−1λ dP=∫AEt−1λ,+ dP for every λ. Tonelli F2 integrates these inequalities over π; since Nt and Nt−1 are P-null, replacing the mixtures by E~t and E~t−1 does not change these integrals. Thus ∫AE~t dP≤∫AE~t−1 dP.

3.1F4F5A1step 2.1∎

Let U=EP[E~t∣Ft−1], which exists by F4 and AC A1. For every A∈Ft−1, the event-integral identity F5 and step 2.1 give ∫A(U−E~t−1) dP≤0. Take A={U>E~t−1}. If P(A)>0, then for some integer m≥1 the subset where U−E~t−1≥1/m has positive measure, making that integral strictly positive, a contradiction. Therefore U≤E~t−1 almost surely. As P and t were arbitrary, E~ is a test supermartingale for P0.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Anytime-valid p-value processes

Definition

Let P0 be a family of probability laws on a common discrete filtered probability space (Ω,F,(Ft)t≥0). A process p=(pt)t≥0 is an anytime-valid p-value process for P0 if each pt is Ft-measurable with values in [0,1] and, for every P∈P0 and α∈(0,1), P(∃t≥0:pt≤α)≤α.

At time t, the rejection rule at threshold α is the Ft-measurable test function φt,α=1{pt≤α} in the sense of Randomized tests: the indicator supplies a binary probability kernel by Every measurable rejection function defines a randomized test. For any stopping time τ:Ω→N0∪{∞} Discrete stopping time, the rejection event is {τ<∞, pτ≤α}=⋃t≥0({τ=t}∩{pt≤α}). For t=0, {τ=t}={τ≤0}∈F0; for t≥1, {τ=t}={τ≤t}∖{τ≤t−1}∈Ft by the stopping-time condition and filtration property. Thus each term is in Ft, so this event is measurable and is contained in the all-times crossing event; the definition therefore controls rejection after data-dependent stopping.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A test supermartingale gives anytime-valid p-values

Statement

Assume AC. Let E=(Et)t≥0 be a nonnegative test supermartingale Nonnegative test supermartingales for a null family P0. Define pt={1,Et≤0,min⁡(1,1/Et),Et>0. Then p=(pt)t≥0 is an anytime-valid p-value process for P0 Anytime-valid p-value processes. For every P∈P0, fixed t≥0, and u∈[0,1], P(pt≤u)≤u. For every possibly unbounded stopping time τ and u∈[0,1], P(τ<∞, pτ≤u)≤u(P∈P0).

Facts & Assumptions

Given: Assume AC. Let P0 be a null family, E a nonnegative test supermartingale for that family, and pt the process in the Statement.

[F1]

Nonnegative test supermartingales: under every P∈P0, each Et is a finite real-valued measurable random variable and is nonnegative almost surely.

[F2]

Anytime-valid p-value processes: an adapted [0,1]-valued process is anytime-valid when every null law bounds its all-times crossing event by the threshold.

[F3]

Ville's inequality for nonnegative test supermartingales: for every null law P and α∈(0,1), P(sup⁡t≥0Et≥1/α)≤α.

[F4]

Valid p-values: a measurable [0,1]-valued statistic is a valid p-value for a nonempty null when every null law satisfies P(p≤u)≤u for all u∈[0,1].

[A1]

The Axiom of Choice: AC is the assumption used by the supermartingale conditional-expectation convention and Ville's bounded optional-sampling proof.

Proof

1.1F1givenconstruct

The map g:R→[0,1] defined by g(x)=1 for x≤0 and g(x)=min⁡(1,1/x) for x>0 is Borel measurable. Thus pt=g(Et) is Ft-measurable and [0,1]-valued. For 0<α<1, the threshold 1/α>1, so pt≤α holds exactly when Et≥1/α.

2.1F2F3A1step 1.1

Taking the union over all t in the equivalence of step 1.1 and applying F3 gives P(∃t≥0:pt≤α)=P(∃t≥0:Et≥1/α)≤P(sup⁡t≥0Et≥1/α)≤α for every P∈P0. This is the defining anytime-valid condition.

3.1F1F2step 2.1

For a fixed t and 0<u<1, {pt≤u}⊆{∃s:ps≤u}, so its probability is at most u by step 2.1. Since Et is finite, pt>0; hence the bound at u=0 is zero, and at u=1 it is trivial. For any stopping time τ, {τ<∞, pτ≤u}=⋃t≥0({τ=t}∩{pt≤u}) is contained in the all-times crossing event for 0<u<1; the endpoints follow as above. Thus fixed-time and stopping-time validity both hold.

4.1F4step 1.1step 3.1given∎

If P0 is nonempty, form the fixed-time experiment with data space (Ω,Ft), parameter set Θ=P0, laws given by restriction to Ft, and null set Θ0=Θ. The observation is the identity map from the original sample space to this data space. Step 1.1 makes pt a statistic and step 3.1 gives its superuniform inequality under every law in Θ0, so F4 makes it a valid p-value in this experiment. If P0 is empty, all lawwise assertions are vacuous.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Confidence sequences

Definition

Let Θ be a parameter set and (Pθ)θ∈Θ a family of probability laws on a common discrete filtered measurable space (Ω,F,(Ft)t≥0) Filtration and filtered probability space. For α∈(0,1), a (1−α) confidence sequence is a sequence of set-valued rules Ct(ω)⊆Θ such that, for each fixed θ∈Θ, the membership event {θ∈Ct} belongs to Ft for every t and Pθ(θ∈Ct for every t≥0)≥1−α.

The coverage is simultaneous over all discrete times. The definition makes no claim of conditional-on-covariates coverage or validity under a changed sampling law.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Confidence sequences by test-supermartingale inversion

Statement

Assume AC and fix α∈(0,1). Let Θ be a parameter set, (Pθ)θ∈Θ a family of laws on a common discrete filtered measurable space, and, for each θ∈Θ, let Eθ=(Etθ)t≥0 be a nonnegative test supermartingale for the singleton null family {Pθ}. Define Ct(ω)={θ∈Θ:Etθ(ω)<1/α}. Then (Ct)t≥0 is a (1−α) confidence sequence Confidence sequences.

No measurable structure on Θ or joint measurability across θ is needed for this pointwise membership and coverage statement.

Facts & Assumptions

Given: Assume AC, α∈(0,1), the parameter family, and the candidate test-supermartingale Eθ for each θ. If Θ is empty the conclusion is vacuous; otherwise fix an arbitrary θ when proving its coverage bound.

[F1]

Nonnegative test supermartingales: for each fixed θ, Eθ is adapted and nonnegative under Pθ.

[F2]

A test supermartingale gives anytime-valid p-values: transforming a test supermartingale by pt=1 when Et≤0 and pt=min⁡(1,1/Et) otherwise gives an anytime-valid p-value process under its null law.

[F3]

Confidence sequences: each fixed-parameter membership event must be adapted and the true parameter must be covered simultaneously with probability at least 1−α.

[A1]

The Axiom of Choice: AC is required by the conditional-expectation convention in the test-supermartingale definition and its validity theorem.

Proof

1.1F1F2A1given

Fix θ∈Θ. Under Pθ, define ptθ=1 when Etθ≤0 and ptθ=min⁡(1,1/Etθ) otherwise. By adaptedness in F1 and the Borel transformation used in F2, each ptθ is Ft-measurable. Hence {θ∈Ct}={Etθ<1/α}={ptθ>α} is Ft-measurable.

2.1F2A1step 1.1

For this fixed θ, F2 gives Pθ(∃t≥0:ptθ≤α)≤α. The complement is exactly {θ∈Ct for every t≥0}, whose probability is therefore at least 1−α.

3.1F3step 1.1step 2.1∎

Steps 1.1 and 2.1 hold for every θ. They give the membership measurability and simultaneous-coverage clauses in F3, so (Ct) is a confidence sequence.

5 · Examples, counterexamples and false statements

None yet.

Sources