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

1 · Prerequisites

2 · Summary

This page separates countable products of arbitrary probability spaces from arbitrary-index extension of consistent laws on standard-Borel coordinates. Both constructions live on the generated cylinder sigma-algebra.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra

Definition

For measurable spaces (Ei,Ei)iI, put E=iIEi. For finite FI, let πF:EiFEi be restriction to F (the singleton empty product when F=). On iFEi, write qi for the ith coordinate map and define

iFEi:=σ{qi1(A):iF, AEi}.

For F= this is the two-set sigma-algebra on the singleton. If e:[n]F is any enumeration, coordinate relabelling identifies this sigma-algebra with the recursively defined finite product sigma-algebra of The product sigma-algebra and its finite iterates: both are generated by the same coordinate inverse images. Thus the notation is independent of the enumeration.

A finite-coordinate cylinder is πF1(A) for AiFEi. The cylinder sigma-algebra is

CI:=σ{πF1(A):FI finite, AiFEi}.

This is the product sigma-algebra on the arbitrary product; the empty-support cylinder is either or E.

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

Finite-coordinate cylinders form a π-system

Statement

The finite-coordinate cylinders in E=iIEi form a pi-system.

Facts & Assumptions

Given: Two finite-coordinate cylinders πF1(A) and πG1(B).

[F1]

Their supports F,G are finite, and their bases are measurable in the respective finite product sigma-algebras.

Proof

1.1

Put H=FG and let pF,pG be the coordinate projections from HEi. Then C:=pF1(A)pG1(B) is measurable in HEi.

F1
2.1

Directly from restriction of coordinates, πF1(A)πG1(B)=πH1(C), a finite-coordinate cylinder. The family is nonempty because it contains E, so it is a pi-system.

step 1.1
LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Finite-coordinate cylinder sets form an algebra

Statement

The family AI of all finite-coordinate cylinders in E is an algebra of subsets of E.

Facts & Assumptions

Given: Cylinders πF1(A) and πG1(B).

[F1]

A finite product sigma-algebra is closed under complements, inverse images under coordinate projections, and finite unions.

Proof

1.1

The empty-support cylinders give ,EAI. Also EπF1(A)=πF1((FEi)A)AI.

F1
2.1

For H=FG, pull both bases to HEi; their union is measurable and its inverse image is πF1(A)πG1(B). Thus AI has the three algebra operations.

F1
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-09-06Open item page →

A consistent family of finite-dimensional distributions

Definition

Let (Ei,Ei)iI be measurable spaces. A family (μF)FI, indexed by all finite subsets of I, is a consistent family of finite-dimensional distributions when each μF is a probability measure on iFEi, with the finite unordered product sigma-algebra of Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra, and for every pair of finite sets FGI the pushforward of μG under the restriction pG,F(x)=xF equals μF; equivalently, μG(pG,F1(A))=μF(A) for every AiFEi. The restriction is measurable since inverse images of coordinate generators are coordinate generators. The empty support carries the unique probability measure on the singleton empty product.

Reordering means choosing a different enumeration of the same finite set F. If e:[n]F is an enumeration, its displayed ordered law is the pushforward of μF under re(x)=(xe(0),,xe(n1)). For another enumeration e, the coordinate permutation rere1 pushes this ordered law to the one displayed using e. This is automatic from these definitions and does not require equal laws on different subsets of I, or invariance under permutations of a fixed ordered product. In particular, consistency is data about every finite joint law, not merely the one-coordinate marginals.

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

Consistent finite-dimensional laws define a well-defined finitely additive cylinder law

Statement

Suppose the product E=iIEi is nonempty. For a consistent family (μF), the formula μ0(πF1(A)):=μF(A) is well-defined on AI and is finitely additive.

Facts & Assumptions

Given: A nonempty product E, a consistent family (μF), and a finite disjoint cylinder decomposition.

[F1]

If FH, consistency says (pH,F)#μH=μF.

[F2]

Finite-coordinate cylinders form an algebra. (Finite-coordinate cylinder sets form an algebra)

Proof

1.1

Fix xE. If πF1(A)=πG1(B), pull both sets to H=FG. Their lifted bases are equal: otherwise a point of their symmetric difference, combined with the coordinates of x outside H, would distinguish the cylinders. Hence consistency gives μF(A)=μH(pH,F1A)=μH(pH,G1B)=μG(B).

F1
2.1

For disjoint cylinders Cr=πFr1(Ar) with r<m, pull all bases to H=r<mFr. They are disjoint measurable sets, so finite additivity of μH yields μ0(rCr)=rμ0(Cr). The union is in the cylinder algebra by [F2].

F1F2
LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The countable-product cylinder premeasure is countably additive

Statement

Assume countable choice and dependent choice. For a countable sequence of probability spaces and its finite-product cylinder law μ0, μ0 is a premeasure on the cylinder algebra.

Facts & Assumptions

Given: Countable choice, dependent choice, a countable sequence of probability spaces, its cylinder algebra, and the finitely additive law μ0.

[F1]

The finite-coordinate product law is a probability measure and has the rectangle formula. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F2]

For product-measurable A in two sigma-finite factors, each section is measurable, its section-measure function is measurable, and the product mass is the integral of that function. (For sigma-finite measures, the section-measure functions are measurable, The product measure of two sigma-finite measure spaces)

[F3]

A decreasing sequence of measurable sets with finite first measure has measure converging to that of its intersection. (Continuity from above when one set has finite measure)

[F4]

Countable choice supplies a point of the product of the nonempty coordinate spaces. (The Axiom of Countable Choice (ACω))

[F5]

Under countable choice, a countable union of finite coordinate supports is countable. (Countable unions of at most countable sets, assuming ACω)

[F6]

Dependent choice licenses a recursively constructed sequence when the admissible next coordinate depends on the prefix already chosen. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

Proof

1.1

Every coordinate space is nonempty because it carries a probability measure. By [F4], the coordinate product is therefore nonempty, so the finitely additive cylinder law is well-defined. Let Cn be cylinders and suppose that μ0(Cn)η>0 for every n. By [F5], enumerate the countable union of their finite supports. After enlarging supports, take Cn to be determined by the first kn active coordinates, with (kn) nondecreasing. Recursively regarding each finite product as a two-factor product, [F2] expresses each cylinder mass as the integral of its measurable next-coordinate section-mass function.

F1F2F4F5
2.1

The finite-stage section argument recursively maintains the following invariant after m coordinates have been chosen: every remaining Cn-section has tail-cylinder mass at least η/2m. For a prefix with this invariant, let Dn be the measurable set of possible next coordinates whose further section has mass at least η/2m+1. The Dn decrease with n. The section formula and the bound by 1 give the next-coordinate measure of Dn at least η/2m+1; [F3] therefore makes nDn nonempty. Every choice from this intersection extends the prefix and preserves the invariant.

F2F3step 1.1
3.1

By [F6], make the recursively compatible selections from step 2.1. For each n, once the first kn active coordinates have been selected, they lie in the finite base of Cn because its remaining section has positive mass. Fill any inactive coordinates with the product point supplied by [F4]. The resulting point lies in every Cn, contradicting nCn=. Thus μ0(Cn)0.

F4F6step 2.1
4.1

Finite additivity plus continuity at the empty set gives countable additivity whenever a disjoint union remains a cylinder: apply it to the decreasing remainders. Hence μ0 is a premeasure.

step 3.1
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Assuming countable and dependent choice, countable products of arbitrary probability spaces

Statement

Assume countable choice and dependent choice. For probability spaces (En,En,μn)nN there is a unique probability measure μ on CN such that, for every finite F, its F-coordinate marginal is nFμn.

Facts & Assumptions

Given: Countable choice, dependent choice, and a sequence of probability spaces.

[F1]

Under the two stated choice principles, the cylinder law with the displayed finite product values is a premeasure. (The countable-product cylinder premeasure is countably additive)

[F2]

Assuming countable choice, a premeasure extends to a measure on the sigma-algebra it generates. (Assuming countable choice, a premeasure extends through its induced outer measure)

[F3]

A lambda-system containing a pi-system contains the sigma-algebra generated by that pi-system. (Dynkin's pi-lambda theorem)

Proof

1.1

Define μ0(πF1(A))=(nFμn)(A). The finite product marginals are consistent, so [F1] applies.

F1
1.2

By [F2], μ0 extends to a measure μ on the generated cylinder sigma-algebra. Since the empty cylinder is E and has value 1, μ is a probability measure.

F2
2.1

Let ν be another probability measure with the stated marginals. The family D={ACN:μ(A)=ν(A)} is a lambda-system: it contains the whole space because both measures have mass one, is closed under relative complements of nested members, and is closed under increasing countable unions by continuity from below. The two measures agree on every cylinder, and cylinders are a pi-system by Finite-coordinate cylinders form a π-system, so [F3] gives CND. Hence μ=ν.

F3
CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Coordinate random elements of a countable product are independent

Statement

Under the measure of Assuming countable and dependent choice, countable products of arbitrary probability spaces, the coordinate maps Xn(x)=xn have laws μn and are independent.

Facts & Assumptions

Given: The canonical countable product probability space and finitely many distinct indices n1,,nk.

[F1]

The product measure has every prescribed finite product marginal. (Assuming countable and dependent choice, countable products of arbitrary probability spaces)

[F2]

Independence of random elements means the finite intersection formula for their measurable inverse images. (Independent random elements)

Proof

1.1

For AjEnj and the distinct indices fixed above, [F1] gives P(j{XnjAj})=jμnj(Aj); taking one coordinate gives the asserted law.

F1
2.1

The right side is jP(XnjAj), which is exactly [F2]. Since the finite family was arbitrary, all coordinates are independent.

F2
CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Countably many independent copies of a prescribed law exist

Statement

Assume countable choice and dependent choice. Every probability measure ν on (S,Σ) is the common law of a countable independent family of S-valued random elements.

Facts & Assumptions

Given: Countable choice, dependent choice, and a measurable probability space (S,Σ,ν).

[F1]

Under countable choice and dependent choice, the canonical countable product probability measure exists. (Assuming countable and dependent choice, countable products of arbitrary probability spaces)

[F2]

Its canonical coordinates have their prescribed laws and are independent. (Coordinate random elements of a countable product are independent)

Proof

1.1

Apply [F1] with En=S and μn=ν for every n, and write Xn for its coordinate maps.

F1
2.1

By [F2], every Xn has law ν and every finite subfamily is independent; this is the required independent-copy sequence.

F2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Stochastic processes and their finite-dimensional distributions

Definition

For tI, let Xt:(Ω,F,P)(Et,Et) be a random element. The family X=(Xt)tI is a stochastic process. For an ordered tuple of distinct times (t1,,tn), its finite-dimensional distribution is the pushforward law of (Xt1,,Xtn) on j<nEtj+1. These laws, including their coordinate order, form a consistent family under deletion and permutation of times.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Process law, modification, and indistinguishability

Definition

Two processes with the same index set and corresponding target spaces have the same process law if all corresponding finite-dimensional laws agree; their source probability spaces need not be the same. Suppose in addition that X=(Xt)tI and Y=(Yt)tI are defined on one common probability space (Ω,F,P), take values in the same measurable space at each t, and {Xt=Yt} is measurable for each t. Then Y is a modification (or version) of X when P(Xt=Yt)=1 for every fixed t. They are indistinguishable when the event {ω:Xt(ω)=Yt(ω) for every tI} is measurable and has probability one. The latter has one exceptional null event; the former may have a different null event at every time.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Standard Borel spaces

Definition

A measurable space (E,E) is standard Borel if there are a Polish space P and a bijection h:EP such that AE exactly when h[A] is Borel in P. Thus the measurable structure is part of the datum; no particular compatible Polish topology on E is selected.

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

Finite products of standard Borel spaces are standard Borel

Statement

Every finite product of standard Borel spaces, with its finite product sigma-algebra, is standard Borel.

Facts & Assumptions

Given: Standard-Borel spaces (Ej,Ej) for j<n.

[F1]

Each Ej is measurably isomorphic to the Borel space of a Polish space. (Standard Borel spaces)

Proof

1.1

Choose Polish presentations hj:EjPj from [F1]. The product map h=j<nhj is a bijection from Ej to Pj.

F1
2.1

A finite product of Polish spaces is Polish, and inverse images under h of its Borel rectangles are exactly the finite product measurable rectangles. Therefore h transports its Borel sigma-algebra to j<nEj, proving the claim.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-06Open item page →

Assuming countable choice, Borel probability measures on Polish spaces are inner regular

Statement

Assume countable choice. If P is Polish and μ is a Borel probability measure on P, then for every Borel AP and ε>0 there is a compact KA with μ(AK)<ε.

Facts & Assumptions

Given: A complete separable metric presentation (P,d), a Borel probability μ, and ε>0.

[F1]

A Polish space has a complete compatible metric and a countable dense set. (Polish spaces are separable completely metrizable spaces)

[F2]

Measures are continuous from below and countably subadditive. (Continuity from below for measures, Finite and countable subadditivity of measures)

[F4]

A lambda-system containing a pi-system contains the sigma-algebra it generates. (Dynkin's pi-lambda theorem)

Proof

1.1

The empty P is immediate, so suppose P and enumerate a countable dense set as (xm). For each r1, continuity from below chooses a finite union Ur of 2r2-balls centered at the xm with μ(PUr)<ε2r2. Countable choice makes these choices simultaneously.

F1F2
2.1

The set K0=rUr is closed. Countable subadditivity gives μ(PK0)<ε/2. For every scale, one of the finite closed-ball covers from step 1.1 covers K0; choosing one point of K0 from each nonempty member of that finite cover and doubling the radius gives a finite net with centres in K0. Hence K0 is totally bounded and [F3] makes it compact.

F2F3step 1.1
3.1

Every open G contains a compact KG losing less than ε: for G=P use K0; otherwise intersect K0 with the increasing closed sets {x:d(x,PG)1/n}. Their union is K0G, so [F2] gives one with the required loss.

F2step 2.1
4.1

Let R be the Borel sets which, for every δ>0, have compact KAG with G open and μ(GK)<δ. Step 3.1 puts every open set in R. The tight compact set from step 2.1 shows that complements remain in R: from KAG, use K0GPAPK and bound the loss by μ(PK0)+μ(GK).

F2step 2.1step 3.1
5.1

For pairwise disjoint AjR, continuity from below makes the measure of the tail of jAj arbitrarily small. A finite union of compact inner approximants handles that tail, while the union of the open outer approximants has loss bounded by the summable errors. Thus R is a lambda-system. Open sets are a pi-system generating the Borel sigma-algebra, so [F4] gives B(P)R. The compact inner approximant for A proves the statement.

F2F4step 4.1
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces

Statement

Assume the Axiom of Choice. For any set I, standard-Borel coordinate spaces (Ei,Ei), and consistent finite-dimensional laws (μF)FI, there is a unique probability measure μ on CI whose F-coordinate marginal is μF for each finite F.

Facts & Assumptions

Given: AC, standard-Borel coordinates, and a consistent family (μF).

[F1]

Consistency gives a well-defined finitely additive cylinder law. (Consistent finite-dimensional laws define a well-defined finitely additive cylinder law)

[F2]

After one Polish presentation is fixed on every coordinate, each finite product has the corresponding product Polish presentation; coordinate restrictions between such products are continuous. Its probability measures admit compact inner approximations, and compact metric spaces are sequentially compact. (Standard Borel spaces, Finite products of standard Borel spaces are standard Borel, Assuming countable choice, Borel probability measures on Polish spaces are inner regular, In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle)

[F3]

AC supplies both countable choice and values in every nonempty family of otherwise unconstrained coordinate spaces. (The Axiom of Choice, The Axiom of Countable Choice (ACω))

[F4]

Assuming countable choice, a premeasure extends to its generated sigma-algebra. (Assuming countable choice, a premeasure extends through its induced outer measure)

Proof

1.1

By AC, choose once and for all, for every iI, a Polish presentation hi:EiPi witnessing that (Ei,Ei) is standard Borel. Pull the topology and a complete compatible metric of Pi back to Ei. The finite product topologies now used below come from these same coordinate presentations, so every restriction map between them is continuous.

F2F3
2.1

Let Cn be cylinders and suppose their cylinder masses stayed above η>0. Enumerate the countable union of their finite supports. For each n, choose a nested finite support Hn that contains both the original support of Cn and the first n active coordinates, and view Cn as a cylinder over Hn. In the product presentation fixed in step 1.1, inner-regularly replace its Hn-base by a compact base, losing less than η2n2. Finite intersections of the lifted compact cylinders then have positive cylinder mass.

F1F2F3step 1.1
3.1

For each N, choose a point in the intersection of the first N lifted compact cylinders from step 2.1. For fixed n, all points with Nn have their Hn-coordinates in the compact nth base. Sequential compactness successively supplies a subsequence converging on H1, a further subsequence converging on H2, and so on; take the diagonal subsequence. Because every restriction iHn+1EiiHnEi is continuous by step 1.1, the successive limits restrict to the earlier limits. They therefore define one point on the union of the active coordinates. Each compact base is closed, so this point lies in every lifted compact cylinder.

F2F3step 1.1step 2.1
4.1

Use AC to fill the inactive coordinates. The resulting point lies in every Cn, a contradiction. Hence the cylinder law is continuous at the empty set and is a premeasure.

F3step 3.1
5.1

By [F4] it extends to CI and has total mass one. Two such extensions agree on all cylinders; these are a pi-system, so Dynkin's pi-lambda theorem gives uniqueness on CI, and nowhere larger.

F4
CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Arbitrary products of standard Borel probability spaces

Statement

Assume AC. For standard-Borel probability spaces (Ei,Ei,μi)iI there is a unique probability measure on CI whose finite-coordinate marginals are the finite product measures iFμi.

Facts & Assumptions

Given: AC and a family of standard-Borel probability spaces.

[F1]

Finite product measures have the rectangle formula and are probability measures. (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique)

[F2]

Kolmogorov extension applies to every consistent finite-dimensional family on standard-Borel coordinates. (Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces)

Proof

1.1

For finite F, define νF=iFμi. The rectangle formula shows that projecting νG to FG gives νF, so the family is consistent.

F1
2.1

Apply [F2] to (νF). Its conclusion is exactly the stated measure and its cylinder-sigma uniqueness; it does not assert a measure on P(iEi).

F2
CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The canonical coordinate process realizes consistent finite-dimensional laws

Statement

Under the extension measure of Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces, Xi(x)=xi is a process whose finite-dimensional distributions are the prescribed (μF).

Facts & Assumptions

Given: The extension measure μ on the cylinder space and its coordinate maps.

[F1]

The extension has marginal μF under every finite-coordinate projection. (Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces)

Proof

1.1

Each coordinate map is measurable because inverse images of its measurable sets are one-coordinate cylinders. Thus (Xi) is a process.

F1
2.1

For finite F, (Xi)iF=πF, so its pushforward law is μF by [F1]. This is precisely the finite-dimensional-law convention.

F1
TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Finite-dimensional distributions determine a process law on the cylinder sigma-algebra

Statement

If two probability measures on CI have equal finite-dimensional marginals, then they are equal.

Facts & Assumptions

Given: Probability measures μ,ν on CI with equal finite-dimensional marginals.

[F1]

Finite-coordinate cylinders form a pi-system generating CI. (Finite-coordinate cylinders form a π-system)

[F2]

A lambda-system containing a pi-system contains the sigma-algebra it generates. (Dynkin's pi-lambda theorem)

Proof

1.1

On D={CCI:μ(C)=ν(C)}, complements and disjoint countable unions preserve equality because both measures are probabilities. Thus D is a lambda-system.

F2
2.1

Equal finite-dimensional marginals put every cylinder in D. By [F1] and [F2], CID, hence μ=ν.

F1F2
LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Assuming countable choice, cylinder-measurable events depend on only countably many coordinates

Statement

Assume countable choice. For every ACI there is a countable JI such that xJ=yJ implies xAyA.

Facts & Assumptions

Given: Countable choice, the arbitrary product E, and its cylinder sigma-algebra.

[F1]

The cylinder sigma-algebra is generated by finite-coordinate cylinders. (Coordinate maps, finite-coordinate cylinders, and the cylinder σ-algebra)

[F2]

Under countable choice, a countable union of countable sets is countable. (Countable unions of at most countable sets, assuming ACω)

Proof

1.1

Let D be the events determined by some countable coordinate set. Complements preserve the same support. For a countable family in D, countable choice selects one countable support for each event, and [F2] makes their union countable; that union determines the union of the events. Thus D is a sigma-algebra.

F2
2.1

Every finite-coordinate cylinder belongs to D, using its finite support. By generated-sigma minimality and [F1], CID.

F1
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The cylinder sigma-algebra need not be the full path-space power set

Assuming countable choice, for uncountable I every CI-event is determined by countably many coordinates (Assuming countable choice, cylinder-measurable events depend on only countably many coordinates). Thus a subset that is not determined by any countable coordinate set is not in CI; such subsets occur, for example, in uncountable Bernoulli path spaces. Consequently the extension theorems in general construct measures only on CI, not on every subset of path space and not for every set-defined path functional. If every coordinate space is a singleton, by contrast, the path space is a singleton and CI is its full power set. The companion counterexample makes the proper-inclusion boundary concrete.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

State-space and index-set boundaries of the two extension routes

Under countable choice and dependent choice, the countable theorem Assuming countable and dependent choice, countable products of arbitrary probability spaces covers arbitrary measurable coordinate spaces but only product finite marginals. The arbitrary-index theorem Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces covers general consistent finite-dimensional laws, but requires standard-Borel coordinates and AC in the compact-product route. Recursive kernel constructions require extra conditional-probability data and belong to the later Markov-kernel page.

5 · Examples, counterexamples and false statements

None yet.

Sources