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.
Boundedness of first moments alone does not give uniform integrability
Statement refuted
There are nonnegative variables on one probability space with , . They have and tight laws converging weakly to , but are not uniformly integrable.
Facts & Assumptions
A uniformly integrable family: Let be a measure space. A family of integrable real-valued functions is uniformly integrable when
Equivalently, for every there is such that
This page adopts the tail-integral definition. On finite measure spaces it is equivalent to -boundedness plus uniform absolute continuity, proved later on this page.
Weak convergence of borel probability measures: For Borel probability measures on a metric space S, write if for every bounded continuous real function f on S. Continuity is def-metric-continuity. Such f is Borel measurable (inverse images of open sets are open) and , so the integrals are finite in def-integrable-real-and-complex-functions-and-their-integrals. No completeness or coupling is required.
Markov's inequality for random variables: If is a nonnegative random variable on a probability space and , then
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: Let with , let be the set of functions and let be the Euclidean metric on it (lem-metrics-on-rn). Then:
- Closed boxes are compact. For reals the box is a compact subset of (def-metric-compactness).
- Heine-Borel. A subset is a compact subset of if and only if is closed in (def-metric-topology) and bounded (def-metric-bounded-diameter).
- The real line. A subset is a compact subset of , the usual metric (lem-real-line-is-a-metric-space), if and only if is closed in and bounded.
No choice principle is used. The bisection below halves one coordinate at a time and takes the left half whenever the left half still fails to be finitely covered, the right half otherwise: a rule with two outcomes, decided by a property of the box, not a selection. That is the whole reason the theorem is available in ZF, while the general "complete and totally bounded implies compact" (thm-complete-and-totally-bounded-implies-compact) is not.
The hypothesis is inherited from lem-metrics-on-rn, which defines and its metrics only there; the last remark below records what happens at .
Counterexample
Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.
Use the countable space of positive integers, with . Its masses sum to one by telescoping. Define P(E) as the sum over k in E; for disjoint countable unions the nonnegative double sum can be interchanged by taking suprema of finite subsums, proving countable additivity. Set . Telescoping gives , proving the displayed law, including .
The finite-law calculation gives . If n>K, then . Thus the supremum of these tail integrals is one for every , and F1 fails.
The interval is compact by F4. For bounded continuous f the law integral is , whose difference from f(0) is at most . This is weak convergence by F2. F3 gives uniformly; the compact interval [-R,R] with / therefore verifies tightness. Step 1.2 nevertheless excludes uniform integrability.
Depends on
- A uniformly integrable family
- Weak convergence of borel probability measures
- Tight family of probability measures
- Markov's inequality for random variables
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
39 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
- Durrett, §3.2, weak convergence versus moment convergence; explicit two-point construction (standard reference, not scraped)