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.

Infinite Product Measures and Kolmogorov Extension — Examples

1 · Prerequisites

2 · Summary

Canonical product spaces supply independent coordinates; the counterexamples mark the limits of finite-dimensional data and cylinder measurability.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The infinite fair-coin-toss space

Example

Assume countable choice and dependent choice. Take En={0,1} with μn({0})=μn({1})=1/2. On {0,1}N with its cylinder measure, Xn(x)=xn is the nth fair toss; for distinct n1,…,nk and aj∈{0,1},

P(Xn1=a1,…,Xnk=ak)=2−k.

Verification

Given: Countable choice, dependent choice, and the fair Bernoulli laws.

1.1given

The countable product theorem supplies the measure with the displayed finite product marginals.

2.1algebra∎

Each specified coordinate atom has mass 1/2, so the finite rectangle has mass ∏j=1k(1/2)=2−k; the coordinates are independent by the coordinate-independence corollary.

ExampleConstruction: Literature-sourcedVerification: AI-generatedaudited 2026-09-06Open item page →

An i.i.d. sequence with a prescribed law

Example

Assume countable choice and dependent choice. Given any probability law ν on (S,Σ), equip SN with its cylinder sigma-algebra and the canonical product probability and set Xn(x)=xn. Then (Xn) is an i.i.d. S-valued sequence with common law ν.

Facts & Assumptions

Given: Countable choice, dependent choice, and a probability space (S,Σ,ν), repeated at every index n∈N.

[F1]

The stated choice principles give the canonical countable product probability. (Assuming countable and dependent choice, countable products of arbitrary probability spaces)

[F2]

Its coordinate maps are independent copies with the prescribed law. (Coordinate random elements of a countable product are independent)

Verification

1.1givenF1F2

Apply [F1] with (En,En,μn)=(S,Σ,ν) for every n∈N. It gives the canonical probability on the cylinder sigma-algebra of SN. By [F2], its coordinate maps Xn(x)=xn are independent and each has law ν.

2.1step 1.1∎

Its finite-family conclusion is independence, while its one-coordinate conclusion is the common marginal; together these are the definition of i.i.d.

ExampleConstruction: Literature-sourcedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

Independent but non-identically distributed coordinates

Example

Assume countable choice and dependent choice. On {0,1}N take the product whose nth coordinate has Bernoulli parameter pn=1/(n+2). Then the coordinates are independent but not identically distributed.

Verification

Given: Countable choice, dependent choice, and the stated Bernoulli laws.

1.1given

The countable-product theorem supplies the product probability under the stated choice principles. The coordinate-independence corollary applies to this sequence of Bernoulli laws and gives independence.

2.1algebra∎

P(X0=1)=1/2 while P(X1=1)=1/3. Hence their laws differ, so the independent family is not identically distributed.

ExampleConstruction: Literature-sourcedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

A canonical random walk from product increments

Example

Assume countable choice and dependent choice. On the product space Ω={0,1}N, give each coordinate the fair Bernoulli law and use the product probability measure of Assuming countable and dependent choice, countable products of arbitrary probability spaces. Write Xn(x)=xn, set ξn=2Xn−1∈{−1,1}, and put S0=0 and Sn=∑r=0n−1ξr for n≥1. The process (Sn)n≥0 is the canonical simple random walk built from independent increments.

Verification

Given: Countable choice, dependent choice, and the fair Bernoulli coordinate laws.

[F1] The countable product theorem supplies the product probability measure with its prescribed finite marginals (Assuming countable and dependent choice, countable products of arbitrary probability spaces).

[F2] Its coordinate maps are independent (Coordinate random elements of a countable product are independent).

1.1F1F2given

The countable product theorem gives the probability measure with fair Bernoulli coordinate marginals. The coordinate-independence corollary makes the Xn independent. Thus the signs ξn are independent, with P(ξn=1)=P(ξn=−1)=1/2.

2.1step 1.1∎

For any finite list of distinct increment times, their joint law is the uniform law on the corresponding sign vectors. The process coordinates are the partial sums of these increments, not the increments themselves.

ExampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

An uncountable Bernoulli coordinate process

Example

Let I be uncountable and give every finite F⊆I the uniform law on {0,1}F. Assuming AC, the extension theorem produces a probability measure on the cylinder sigma-algebra of {0,1}I, and its coordinates are independent fair bits.

Verification

Given: An uncountable set I and the stated finite uniform laws.

1.1given

The finite uniform laws are compatible under deletion of coordinates, so the standard-Borel extension theorem applies.

2.1step 1.1∎

The canonical-process corollary identifies each prescribed finite joint law. Thus finite coordinate events are measurable and have their product probabilities; no assertion is made about arbitrary path events.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

A modification need not be indistinguishable

Statement refuted

A modification of a process must be indistinguishable from it.

Counterexample

Let U be uniform on [0,1], let Xt≡0, and let Yt=1{U=t} for t∈[0,1].

Given: Lebesgue probability on [0,1] and its coordinate map U.

1.1given

For fixed t, {Xt≠Yt}={U=t} is measurable and has Lebesgue probability 0, so Y is a modification of X under the stated diagonal convention.

2.1step 1.1∎

For every outcome u, choosing t=u gives Yt(u)=1≠0=Xt(u). Thus the equality-for-all-times event is empty, not probability one, and the processes are not indistinguishable.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

One-dimensional marginals alone do not specify a joint law

Statement refuted

The one-dimensional marginals of a process determine all its finite-dimensional laws.

Counterexample

Let Z be a fair bit. The pair (Z,Z) and a pair (Z,W) of independent fair bits have the same one-dimensional marginals.

Given: Fair bits Z and W, with Z,W independent in the second pair.

1.1given

Each displayed coordinate has Bernoulli(1/2) law in both pairs.

2.1algebra∎

But P(Z=Z)=1 for the first pair, whereas P(Z=W)=1/2 for the independent pair. Their two-dimensional laws differ, refuting the statement.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

A noncylinder path functional may fail to be measurable

Statement refuted

Every set-defined path functional on the uncountable Bernoulli path space is measurable for its cylinder sigma-algebra.

Counterexample

Assume AC. For uncountable I, let A={x∈{0,1}I:{i:xi=1} is uncountable} and put f=1A.

Given: AC, an uncountable index set I, and its Bernoulli cylinder space.

1.1given

If A were cylinder-measurable, the countable-coordinate lemma would give a countable J⊆I determining it.

2.1step 1.1

Choose i∈I∖J. The all-zero path and the path with ones on I∖J agree on J, but only the latter belongs to A; this contradicts determination by J.

3.1step 2.1∎

Hence A is not cylinder-measurable and f is not a real random variable on the canonical cylinder probability space.

Sources