Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

A tight Gaussian law is carried by a separable closed subspace

Statement

Let B be a real Banach space and let W be a Borel measurable B-valued random element with tight law μ. Tight means that for every η>0 some compact K⊂B satisfies μ(K)>1−η. Assume W is centered Gaussian, meaning that every continuous real linear functional ℓ:B→R makes ℓ(W) a centered scalar normal random variable. Then there is a separable closed linear subspace E⊂B with μ(E)=1. The law of W viewed as an E-valued random element is tight and centered Gaussian, and its support in E is exactly the support of μ in B, viewed as a subset of B. In particular, every ambient support point belongs to E.

Facts & Assumptions

Given: A real Banach space B, a tight Borel probability law μ on B, and a centered Gaussian random element W with law μ.

[A1]

The Axiom of Choice: AC permits the countable selection of compact sets and finite nets used below.

[A2]

The real dominated-extension principle as an additional hypothesis over ZF: the real dominated-extension principle extends a linear functional dominated by a sublinear functional to the ambient vector space, preserving domination.

Proof

1.1givenA1construct

For each integer m≥1, tightness and [A1] give a compact set Km⊂B with μ(Km)>1−2−m. Each compact metric space Km has a countable dense subset: for each integer r≥1, compactness gives a finite 1/r-net, and the union of these finite nets is countable and dense. The union over m of these dense subsets is countable; let S be its closure. Then S is separable, contains every Km, and μ(S)≥μ(Km)>1−2−m for every m, hence μ(S)=1.

2.1A2step 1.1givenconstruct

Let E be the closed real linear span of S. Rational linear combinations of a countable dense subset of S form a countable dense subset of its real linear span, so E is separable; it is closed by construction and therefore Banach, and μ(E)=1. Define WE=W on the measurable event {W∈E} and WE=0 on its null complement. Then WE is E-valued and Borel measurable: each Borel set of E is E∩A for some ambient Borel A, and its preimage is {W∈E}∩W−1(A) together with the null complement if the set contains zero. Its law is the restriction of μ to E. For any ℓ∈E∗, let p(x)=∥ℓ∥E∗∥x∥B on B; ℓ is dominated by p on E. By [A2] it extends to a linear ℓ~ on B dominated by p, and applying domination to x and −x gives ∣ℓ~(x)∣≤∥ℓ∥E∗∥x∥B. Since WE=W almost surely, ℓ(WE)=ℓ~(W) almost surely, so ℓ(WE) is centered normal. Thus the restricted law is Gaussian.

3.1step 1.1step 2.1givenalgebra∎

For tightness in E, replace each compact Km by Km∩E, which is compact and has the same μ-mass because μ(E)=1. If x∉E, closedness gives a B-open neighborhood disjoint from E, of μ-mass zero, so x is outside the ambient support. If x∈E, every ambient open ball about x intersects E in an E-open neighborhood and has the same measure as that intersection; hence all such neighborhoods have positive measure exactly when all relative neighborhoods do. The two supports therefore agree.

Source notes

The cited sources use tight Borel Gaussian random elements and their support/RKHS framework. The separable closed carrier and the transfer of Gaussianity to it are proved here; neither source excerpt is treated as a substitute proof.

Depends on

Used by

Dependency tree · two levels

6 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