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.
Continuity from above when one set has finite measure
Statement
Let be a decreasing sequence of measurable sets for a measure . If for some , then
Facts & Assumptions
Given: Measurable sets , an index with , and .
For increasing measurable , (Continuity from below for measures).
If and , then , with real subtraction valid when (Measure of a set difference when the smaller set has finite measure).
Every subset of has an infimum there (Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in ).
Proof
For put . Then increases and .
Every and has finite measure by inclusion in , and [L2] gives and .
Apply continuity from below to and substitute step 1.2: taking the supremum of the left differences is the same as subtracting the infimum of the decreasing finite values, so cancellation of the finite number yields .
A decreasing sequence has the same infimum as any of its tails, so step 2.1 gives ; this includes , , and a sequence that is constant from onward.
Depends on
- Continuity from below for measures
- Measure of a set difference when the smaller set has finite measure
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
Used by
- A nondecreasing function that is not right-continuous can fail countable additivity Counterexample
- Counting-measure tails decrease to the empty set while every term has infinite measure Counterexample
- Borel master codes for null and meagre sets Definition
- Birth–death recurrence through scale products Example
- Borel's exceptional set can be uncountable and null Example
- The fat Cantor set has positive length and dimension one Example
- The Smith-Volterra-Cantor set has Lebesgue measure exactly 1/2 Example
- FALSE: continuity from above needs no finiteness hypothesis False statement
- FALSE: every nondecreasing function defines a Lebesgue-Stieltjes measure on Borel sets False statement
- Basic identities for a probability measure Lemma
- Dyadic coding supplies coin measure and its completed Lebesgue transfer Lemma
- Levy prokhorov distance is a metric Lemma
- Maximum principle for a compact logarithmic potential Lemma
- Real cdf and bounded continuous definitions agree Lemma
- The countable-product cylinder premeasure is countably additive Lemma
- Transfer of null and meagre invariants between Cantor space and the line Lemma
- Uniform open hulls for Borel sections of small measure Lemma
- For sigma-finite measures, the section-measure functions are measurable Proposition
- Assuming countable choice, finite-on-compacts Borel measures on ℝ correspond to nondecreasing right-continuous functions modulo constants Theorem
- Cauchy sequences in measure converge in measure Theorem
- Continuity from below, and from above when one set has finite signed measure Theorem
- Convergence in probability and almost surely agree for independent series Theorem
- Converging together lemma Theorem
- Egorov's theorem Theorem
- Equivalent criteria for recurrence and transience Theorem
- Finite-total-variation signed measures are complete Theorem
- Interval formulas and atoms for a Lebesgue-Stieltjes measure Theorem
- Kac integral formula for excursions Theorem
- Kac return-time formula without invertibility Theorem
- Kolmogorov convergence criterion Theorem
- Lebesgue-Stieltjes measures on ℝ are outer regular and inner regular by compact sets Theorem
- Levy prokhorov metric metrizes weak convergence Theorem
- On a finite measure space, almost-everywhere convergence implies convergence in measure Theorem
- Portmanteau theorem Theorem
- Probability laws correspond to distribution functions Theorem
- Riesz's subsequence theorem for convergence in measure Theorem
- The limsup of the measures is at most the measure of the set limsup under a finite-union bound Theorem
Dependency tree · two levels
14 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. Axler, Measure, Integration & Real Analysis, Theorem 2.60 (standard reference, not scraped)