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.
Continuous maps preserve convergence in probability
Statement
Let be continuous, and suppose that, for every , Then, for every , In particular, coordinate pairing gives stability under sums and products; it gives quotients whenever the limiting denominator is nonzero almost surely, defining the quotient arbitrarily where the approximating denominator is zero.
Facts & Assumptions
Given: A continuous and the displayed norm-tail convergence of to .
The displayed hypothesis directly says that every fixed-distance bad event for has probability tending to zero.
Coordinatewise probability convergence gives probability convergence of pairs (Pairing preserves convergence in probability).
Proof
Fix . Choose a compact cube with and a compact cube containing every point within distance of . Uniform continuity of on gives such that points of within have -images within .
If and , then and . Thus the image bad-event probability is at most , which is at most . Its limsup is at most by [L1]. Letting proves the claim.
Apply [L2] and the claim to and . For division, first restrict to and then let ; the limiting denominator is nonzero almost surely, and the zero-denominator convention for the approximating pair is contained in the remaining event.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
5 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
- S. Roch, Lecture 3: Modes of convergence, Theorem 3.14 (standard reference, not scraped)