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.
A tight factor times a vanishing factor
Example
Let be the two-point probability space with the power-set sigma-algebra and equal point masses, and set . On this same space for each , put , , and . Then and , so the finite-dimensional product rule gives . Moreover , the precise root- boundedness assertion.
Facts & Assumptions
Given: The probability space and sequences in the example.
Sigma-algebras: The power set of a set is a sigma-algebra.
Measurable spaces and measurable sets: A measurable space is a set equipped with a sigma-algebra.
Measures on sigma-algebras: A measure is countably additive on pairwise disjoint measurable sets and assigns measure zero to the empty set.
Probability measures and probability spaces: A probability measure is a measure with total mass one.
A measurable function between measurable spaces: A map is measurable when every measurable target set has measurable preimage.
Random elements and real random variables: A measurable map into the real line with its Borel sigma-algebra is a real random variable.
Stochastic order and convergence notation for finite-dimensional random vectors: means for every ; means that for every some has .
Finite-dimensional stochastic-order calculus and tightness: If and , then for every fixed bilinear map with a global product norm bound.
Verification
The power set on is a sigma-algebra by [F1], hence gives a measurable space by [F2]. Assigning mass to each singleton defines a measure: any pairwise disjoint sequence contains at most two nonempty sets, and the mass of their union is the sum of their masses. Its total mass is one, so it is a probability measure by [F3]–[F4]. The identity map is measurable because every preimage of a Borel set is a subset of ; thus it is a real random variable by [F5]–[F6].
For every , everywhere, so choosing makes and proves by [F7]. For each , for all sufficiently large , so eventually; hence by [F7].
The multiplication map satisfies for all real , so it has the required bilinear norm bound with constant one. Each is measurable because the power-set sigma-algebra on contains every preimage. Thus [F8] applies to and and gives . The identity then gives from step 1.2. For the finite check , takes the values and takes the values .
Depends on
- A measurable function between measurable spaces
- Measurable spaces and measurable sets
- Measures on sigma-algebras
- Stochastic order and convergence notation for finite-dimensional random vectors
- Probability measures and probability spaces
- Random elements and real random variables
- Sigma-algebras
- Finite-dimensional stochastic-order calculus and tightness
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- Peter Bartlett, Theoretical Statistics, Stat 210B Lecture 16, PDF pp. 9–11 (standard reference, not scraped)
- John Duchi, Theory of Statistics, Stats 300B Lecture 2, Winter 2018, PDF pp. 1–3 (standard reference, not scraped)