Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

Completeness of the weighted continuous trajectory space

Statement

Assume Countable Choice. Let (E,A,μ) be a probability space, T>0, and d≥1. Use the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Let X be the space, modulo equality μ-almost everywhere, of jointly measurable maps X:[0,T]×E→Rd whose paths are continuous for almost every label and whose time-supremum function is measurable, and for which ∥X∥X:=∫Esup⁡0≤t≤T∣Xt(z)∣dμ(z)<∞. In this formula and in ∥X−Y∥X, take the supremum on a measurable conull set where the relevant paths are continuous and extend it by zero off that set; equality almost everywhere means equality of whole paths outside one measurable null set. The seminorm identifies maps equal almost everywhere, and the induced distance dX(X,Y)=∥X−Y∥X is a metric on the quotient; it is complete.

Facts & Assumptions

Given: Countable Choice, a probability space (E,A,μ), T>0, and the norm and equivalence convention in the Statement.

[F2]

Tonelli's theorem passes a sum of nonnegative measurable functions through the integral (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F3]

Completeness means every Cauchy sequence converges in the metric (Complete metric space: every Cauchy sequence converges in the space).

[A1]

Countable Choice permits choosing one measurable representative for each member of a countable sequence of equivalence classes (The Axiom of Countable Choice (ACω)).

[F5]

Countable suprema and pointwise limits of measurable real-valued functions are measurable (Sequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable).

[F6]

Sections of product-measurable functions are measurable, and the Borel sigma-algebra of a finite Euclidean product is the product of the coordinate Borel sigma-algebras (Every section of a product-measurable function is measurable, The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}).

[F7]

A nonnegative measurable function with finite integral is finite almost everywhere (A nonnegative measurable function with finite integral is finite almost everywhere).

Proof

1.1A1F4F5F6givenconstruct

Let (Xn) be Cauchy in dX. By [A1], choose measurable representatives and, for each representative, a measurable conull set on which its paths are continuous. Countable Choice gives these sets simultaneously; their intersection C∈A is conull. For a fixed countable dense set D⊆[0,T], continuity on C gives sup⁡0≤t≤T∣Xm(t,z)−Xn(t,z)∣=sup⁡q∈D∣Xm(q,z)−Xn(q,z)∣(z∈C). Each fixed-time section of each coordinate is measurable by [F6], since coordinate projections are continuous, and the right side is measurable by [F5]. Define it to be zero on Cc; this is a measurable representative of the time-supremum difference, as prescribed in the Statement. Changing the conull set or the representative does not change its integral. Symmetry and the triangle inequality follow pointwise on a common conull set, and a zero distance forces the paths to agree almost everywhere: for a nonnegative measurable supremum g with zero integral, μ{g>1/j}≤j∫g=0 for every j≥1. It is integrable because on C it is bounded by the sum of the two given integrable path suprema.

2.1A1F2F5F7step 1.1choose

Choose increasing indices nk successively as the least indices large enough that ∥Xm−Xn∥X≤2−k whenever m,n≥nk. Put gk(z)=sup⁡t∣Xnk+1(t,z)−Xnk(t,z)∣ on C and gk(z)=0 off C. By step 1.1 each gk is measurable and ∫Egk dμ≤2−k. Thus G=∑k=1∞gk is measurable by [F5], and Tonelli gives ∫EG dμ≤∑k=1∞2−k<∞. By [F7], A:=C∩{G<∞} is measurable and conull. For every z∈A, the paths Xnk(⋅,z) are uniformly Cauchy on [0,T].

3.1F1F4F5F6F7step 2.1

Replace each selected representative by X~nk(t,z)=Xnk(t,z) on A and 0 outside A. These maps remain jointly measurable and represent the same equivalence classes. By [F1], for each z∈A their uniform limit is a continuous path X(⋅,z); set X(⋅,z)=0 off A. The coordinate projections of X~nk are measurable, so their pointwise limits are measurable by [F5]; [F6] makes the resulting map into Rd jointly measurable. Its time-supremum function is measurable because its paths are continuous and the supremum equals the countable supremum over D of measurable sections. On A, sup⁡t∣Xt−X~nk,t∣≤∑j≥kgj; off A this difference is zero. Hence the integrable series tail bounds ∥X−Xnk∥X and tends to zero. Since Xnk has finite norm, [F4] gives ∥X∥X<∞.

4.1F3F4step 3.1algebra∎

Since the original sequence is Cauchy and its subsequence converges to X, the triangle inequality gives ∥Xn−X∥X→0: for any ϵ>0, first take k with ∥Xnk−X∥<ϵ/2, then take n beyond the Cauchy index so ∥Xn−Xnk∥<ϵ/2. Thus every Cauchy sequence converges, which is completeness by [F3].

Depends on

Used by

Dependency tree · two levels

74 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