TheoremBase

A Closed Subset of a Euclidean Space is a Countable Union of Compact Sets, and Its Coordinate Projections are Borel

A closed subset of a Euclidean space is exhausted by its intersections with the closed balls about the origin, each compact; consequently the image of a closed subset of a product under either coordinate projection is a Borel set.

Statement

In the setting of Probability Measures on Euclidean Space and Random Vectors: Standing Notation, whose Euclidean spaces, norm, distance dEd_{E}, topology and closed balls Bˉ(x,r)\bar{B}(x,r) are those fixed there, let m,q,p∈Nm,q,p\in\mathbb{N} satisfy 1≤m1\le m, 1≤q1\le q and 1≤p1\le p. The natural number kk is read as a real number through the canonical map ι\iota from N\mathbb{N} to R\mathbb{R} where a real number is required; this is the only use of the symbol ι\iota here, the concatenation map being written ιq,p\iota^{q,p} throughout. Compact is compactness in a metric space and closed is closedness for the topology of dEd_{E}.

1. (Exhaustion by compact sets) Let C⊆RmC\subseteq\mathbb{R}^{m} be closed. For k∈Nk\in\mathbb{N} the set Ck=C∩Bˉ(0Rm,ι(k))C_{k}=C\cap\bar{B}(0_{\mathbb{R}^{m}},\iota(k)) is compact, being closed and bounded and hence compact by The Heine-Borel Theorem in Rn\mathbb{R}^n, and Compactness of Closed Balls and the Unit Sphere, and

C=⋃k∈NCk.C=\bigcup_{k\in\mathbb{N}}C_{k}.

2. (Projections of a closed set are Borel) Let C⊆Rq+pC\subseteq\mathbb{R}^{q+p} be closed, and let pr1q,p\mathrm{pr}^{q,p}_{1} and pr2q,p\mathrm{pr}^{q,p}_{2} be the coordinate projections. Then

pr1q,p(C)={pr1q,p(z):z∈C}∈B(Rq),pr2q,p(C)={pr2q,p(z):z∈C}∈B(Rp).\mathrm{pr}^{q,p}_{1}(C)=\{\mathrm{pr}^{q,p}_{1}(z):z\in C\}\in\mathcal{B}(\mathbb{R}^{q}),\qquad \mathrm{pr}^{q,p}_{2}(C)=\{\mathrm{pr}^{q,p}_{2}(z):z\in C\}\in\mathcal{B}(\mathbb{R}^{p}).

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…