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

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.

Depends on

Used by

Dependency tree · two levels

25 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