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.
The Cameron–Martin unit ball is compact in the Banach norm
Statement
Assume AC. Let be a centered tight Borel Gaussian law on a real separable Banach space , and let be its covariance RKHS. The closed Hilbert unit ball is compact in the Banach norm.
Facts & Assumptions
AC is inherited from the Gaussian translation and tightness suppliers. Under AC, the ultrafilter lemma follows from The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter, and DC and countable choice follow from AC implies DC implies countable choice.
Under AC, the real dominated-extension theorem supplies the Hahn–Banach principle HB used by the dual-norming interface (Hahn-Banach dominated extension theorem for real vector spaces, The real dominated-extension principle as an additional hypothesis over ZF).
For , the translated law has density , where is centered normal of variance (Cameron–Martin translation formula for a separable Banach Gaussian, Standard normal and normal laws).
A Borel probability on the separable Banach space is tight (Every borel probability on a polish space is tight, Prokhorov tightness theorem on polish spaces).
Under the ultrafilter lemma, DC and HB, a Banach space is reflexive exactly when every bounded sequence has a weakly convergent subsequence; under countable choice, a Hilbert space is reflexive (Reflexivity is equivalent to weak subsequential compactness of bounded sequences, Hilbert spaces are reflexive by Riesz representation). The needed choice hypotheses follow from [A1] and [A2].
The canonical embedding satisfies , and continuous linear functionals separate points (Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian, Relative dual norming, point separation, and recovery of the norm).
Cauchy–Schwarz applies to the square-integrable density and event indicator (Cauchy-Schwarz for random variables).
Proof
Given: AC and a centered tight Borel Gaussian law on , its covariance RKHS , and .
If , write . If , then almost surely and . If , completing the square in the normal density of gives . In both cases [F1] yields . Choose compact with using [F2]. Cauchy–Schwarz [F5] then gives , uniformly for all , while . Hence . For each there is with , so . The difference is compact; therefore is relatively compact in .
Let be any sequence in . By [F3], pass to a subsequence weakly converging in to some . Relative compactness from step 1.1 gives a further subsequence with in . For every , [F4] gives . By [F4], . Thus every sequence in has a norm-convergent subsequence whose limit lies in ; in the metric space , this is compactness.
Depends on
- Covariance operator and reproducing-kernel Hilbert space of a Banach Gaussian
- Cameron–Martin translation formula for a separable Banach Gaussian
- Standard normal and normal laws
- The Axiom of Choice
- Prokhorov tightness theorem on polish spaces
- Every borel probability on a polish space is tight
- Reflexivity is equivalent to weak subsequential compactness of bounded sequences
- Hilbert spaces are reflexive by Riesz representation
- The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter
- AC implies DC implies countable choice
- Relative dual norming, point separation, and recovery of the norm
- Hahn-Banach dominated extension theorem for real vector spaces
- The real dominated-extension principle as an additional hypothesis over ZF
- Cauchy-Schwarz for random variables
Used by
Dependency tree · two levels
80 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
- A. Lunardi, M. Miranda, and D. Pallara, Infinite Dimensional Analysis (standard reference, not scraped)
- M. Hairer, An Introduction to Stochastic PDEs (standard reference, not scraped)