Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Borel laws on a separable Hilbert space are determined by basis coordinates

Statement

Assume the Axiom of Countable Choice. Let H be a real Hilbert space with a finite or countable complete orthonormal basis (ej)j∈J. For each finite F⊆J, define the coordinate map πF:H→RF by πF(x)=(⟨x,ej⟩)j∈F. If ν and ν′ are Borel probability measures on H and ν(πF−1(B))=ν′(πF−1(B)) for every finite F⊆J and every Borel B⊆RF, then ν=ν′.

Facts & Assumptions

Given: Countable Choice, a real Hilbert space H, a finite or countable complete orthonormal basis (ej)j∈J, and two Borel probability measures ν,ν′ whose finite-coordinate pushforwards under the maps πF agree.

[A1]

Countable Choice is assumed, as required by the Parseval supplier. The Axiom of Countable Choice (ACω)

[F1]

Each coordinate map x↦⟨x,ej⟩ is a continuous linear functional by Cauchy–Schwarz; continuous maps have Borel preimages of Borel sets; the inner-product norm satisfies the triangle inequality; a Borel probability law is a probability measure on the Borel sigma-algebra. Hilbert space Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs A continuous map has Borel preimages of Borel sets The induced length is a norm A norm on a real vector space, the induced metric, and the dictionary with the metric axioms The Borel sigma-algebra of a topological space Borel probability law on a polish space Probability measures and probability spaces

[F2]

For a complete orthonormal family in a Hilbert space, Countable Choice implies Parseval's identity ∥x∥2=∑j∣⟨x,ej⟩∣2 for every x∈H. Parseval equivalences for an orthonormal family

[F3]

The rationals are countable and dense in the reals, finite products of at most countable sets are at most countable, and under Countable Choice a countable union of at most countable sets is at most countable. Q is countably infinite Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable A product of two at most countable sets is at most countable Every subset of an at most countable set is at most countable Countable unions of at most countable sets, assuming ACω

[F4]

Finite measures agreeing on a generating pi-system and on the whole space agree on the generated sigma-algebra. Finite measures agreeing on a generating pi-system and on the whole space are equal

[F6]

Finite sums, products, and lattice operations of Borel real functions are Borel measurable. Arithmetic and lattice operations preserve measurability whenever they are defined

Proof

Given: The hypotheses in the Statement.

1.1F1givenconstruct

If H={0}, then it has only one Borel probability measure and the conclusion holds. Otherwise, let C be the family of all finite coordinate cylinder sets πF−1(B), where F⊆J is finite and B⊆RF is Borel. Each cylinder is Borel by continuity in [F1]. The family contains H, and the intersection of two cylinders is the finite-coordinate cylinder obtained on the union of their index sets. Hence C is a pi-system.

2.1A1F1F2F3F6step 1.1chooseconstruct

Enumerate the basis if it is infinite, and in the finite case repeat the last partial sum after all basis vectors have appeared. For x0∈H and r>0, put SN(x)=∑j≤N∣⟨x−x0,ej⟩∣2. By [F2], ∥x−x0∥2=sup⁡NSN(x), so B(x0,r)=⋃q∈Q0≤q<r2 ⋂N≥1{x:SN(x)≤q}. Indeed, if ∥x−x0∥2<r2, choose a rational strictly between these two numbers; conversely, membership in one intersection gives ∥x−x0∥2≤q<r2. By [F1] and [F6], each SN is Borel, and {SN≤q} is a cylinder over a Borel subset of RF. Thus every open ball belongs to σ(C).

3.1F3F5step 2.1chooseconstruct

Let D be the set of all finite rational linear combinations of basis vectors. If the basis is finite, D is at most countable by [F3]. If it is countably infinite, enumerate it and write D as the union over N of the sets of rational linear combinations of the first N vectors. Each of those sets is at most countable by [F3], so their union is at most countable by the Countable Choice clause of [F3]. The real span of the basis is dense by completeness. Each finite real linear combination is approximated by a rational one: approximate each of its finitely many coefficients by a rational and use the triangle inequality and ∥ej∥=1. Thus D is dense in H. By definition, this makes H separable. Separability: the existence of an at most countable dense subset The balls B(d,s) with d∈D and positive rational s form an at most countable family by [F3], and they are open by [F5]. They are a base: given x∈U with U open, choose r>0 with B(x,r)⊆U, then d∈D with ∥d−x∥<r/3, and a rational s with ∥d−x∥<s<r−∥d−x∥. The triangle inequality gives x∈B(d,s)⊆B(x,r)⊆U. By step 2.1 every such ball lies in σ(C), so every open set, as a union of a subfamily of this countable base, lies in σ(C).

4.1F1F3step 3.1

Every coordinate map is continuous by [F1], so σ(C)⊆B(H). Step 3.1 and the definition of the Borel sigma-algebra give the reverse inclusion. Thus σ(C)=B(H).

5.1F4step 1.1step 4.1given∎

The assumed equality of finite-coordinate measures makes ν and ν′ agree on every cylinder in C. They are probability measures, so they agree on H as well. The pi-system C generates B(H) by step 4.1; [F4] therefore gives ν=ν′.

Depends on

Used by

Dependency tree · two levels

113 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