Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Partial sums of independent centered variables are a martingale

Example

Assume AC. Let (Yk)k1 be given independent real integrable variables with EYk=0, and fix cR. Then S0=c and Sn=c+k=1nYk form a martingale for F0={,Ω} and Fn=σ(Y1,,Yn). This is also the natural filtration of the partial sums.

Facts & Assumptions

Given: The hypotheses and conventions in the example.

[F3]

Finite linear combinations remain integrable and their integrals are linear. The Lebesgue integral is linear on L1(μ).

[F4]

The sigma-algebra of a finite past is independent of the next variable sigma-algebra. Disjoint groups of an independent sigma-algebra family remain independent.

[F5]

An integrable variable independent of a sigma-algebra has constant conditional mean equal to its expectation. Conditioning a known variable and an independent variable.

[F6]

An integrable variable measurable for the conditioning sigma-algebra conditions to itself. Conditioning a known variable and an independent variable.

[F7]

Conditional expectation is linear, order preserving and expectation preserving. Basic algebra and order properties of conditional expectation.

[F8]

AC supplies the inherited conditional-expectation existence and any stated choice of versions. The Axiom of Choice.

Verification

technique · direct
1.1

To justify the finite L1 operations independently of the affected supplier proof, augment every finite disjoint simple display by the complement with coefficient 0. Pairwise intersections of two augmented displays partition the whole space and carry equal coefficients; finite additivity and 0(+)=0 prove representation independence. Common refinements give simple addition and monotonicity; scalar zero is direct and positive scalars are termwise. Supremum over simple minorants, increasing simple approximation and the sets {fjcs} for 0<c<1 give monotone convergence and nonnegative additivity. Positive/negative and real/imaginary decompositions give finite L1 linearity. This also repairs the integral base beneath the event identities defining the conditional classes used below. The generated sigma-algebras are nested because their generator families are nested. The finite sum Sn is Fn-measurable and ESnc+k=1nEYk<. Independence means independence of the sigma-algebras σ(Yk) Independent random elements. Group the first n of these separately from σ(Yn+1). Then Yn+1 is independent of Fn, so E[Yn+1Fn]=EYn+1=0. At n=0 independence of the trivial sigma-algebra follows directly from its two events.

givenF1F2F3F4F5construct
2.1

Conditioning the finite identity Sn+1=Sn+Yn+1 gives E[Sn+1Fn]=Sn+0=Sn. Hence this is a martingale Martingale submartingale and supermartingale. Each Sk for kn is measurable for σ(Y1,,Yn), while Yk=SkSk1 is measurable for σ(S0,,Sn). Minimality in both directions proves equality of these sigma-algebras, including the trivial initial one, as required by Natural filtration of a process. AC is inherited solely from the conditional classes; the independent sequence was given.

F1F2F6F7F8step 1.1
3.1

For a concrete model let Ω={1,1}2 with each point of mass 1/4, Y1(u,v)=u, Y2(u,v)=2v, and Yk=0 for k3. The two coordinate events have product probabilities because their intersections have cardinality the product of their cardinalities; adding constant variables preserves this identity. Here S0=c, S1=c+u, and Sn=c+u+2v for n2. Averaging the two values in each fixed-u fibre gives c+u, and the first average is c. This displays the calculation without an identical-distribution assumption.

step 1.1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

29 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