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 randomized threshold attains every test size
Statement
Let be a Borel probability measure on and let . There are and such that
Facts & Assumptions
Given: A Borel probability measure on and .
A measure is countably additive on pairwise disjoint measurable sequences. (Measures on sigma-algebras)
and is a measure. (Probability measures and probability spaces)
Every nonempty real set bounded below has an infimum, and an infimum is its greatest lower bound. (Greatest lower bound (infimum), Every nonempty set bounded below has an infimum)
The Borel sigma-algebra is generated by the open sets. (The Borel sigma-algebra of a topological space)
Proof
If , write and for ; these sets are disjoint with union , so [F1] gives . If and , apply continuity from below to and subtract from . Thus is continuous from below and above.
Set and . By step 1.1, and , so is nonempty and bounded below; it is upward closed. Let by [F3]. For there is with , hence ; for , . Continuity from below and above gives . If , set ; if , the inequalities force , so take .
Define . Continuity of reflection and [F4] show every Borel has Borel preimage; [F1]–[F2] then make a Borel probability. Apply step 2.1 to , obtaining and . With , and , which gives the lower-tail equality.
Remarks
The value randomizes only at the boundary atom. If there is no atom at the selected threshold, the tail already has probability exactly and the boundary value is immaterial.
Depends on
Used by
Dependency tree · two levels
19 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
- Jun Shao, Stat 610 Mathematical Statistics, Lecture 11, Theorem 8.3.17, PDF pp. 9–10 (standard reference, not scraped)
- George Deligiannidis, Foundations of Statistical Inference, Theorem 13.5, PDF p. 78 (standard reference, not scraped)