Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 Q be a Borel probability measure on R and let 0<α<1. There are c+,c−∈R and γ+,γ−∈[0,1] such that Q((c+,∞))+γ+Q({c+})=α,Q((−∞,c−))+γ−Q({c−})=α.

Facts & Assumptions

Given: A Borel probability measure Q on R and 0<α<1.

[F1]

A measure is countably additive on pairwise disjoint measurable sequences. (Measures on sigma-algebras)

[F2]

Q(R)=1 and Q is a measure. (Probability measures and probability spaces)

[F3]

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)

[F4]

The Borel sigma-algebra is generated by the open sets. (The Borel sigma-algebra of a topological space)

Proof

1.1givenF1algebra

If En↑E, write D0=E0 and Dn=En∖En−1 for n≥1; these sets are disjoint with union E, so [F1] gives Q(E)=∑nQ(Dn)=lim⁡nQ(En). If En↓E and Q(E0)<∞, apply continuity from below to E0∖En↑E0∖E and subtract from Q(E0). Thus Q is continuous from below and above.

2.1givenF2F3step 1.1choosealgebra

Set S(t)=Q((t,∞)) and C={t:S(t)≤α}. By step 1.1, S(n)→0 and S(−n)→1, so C is nonempty and bounded below; it is upward closed. Let c+=inf⁡C by [F3]. For t>c+ there is s∈C with s<t, hence S(t)≤α; for t<c+, S(t)>α. Continuity from below and above gives Q((c+,∞))≤α≤Q([c+,∞)). If d=Q({c+})>0, set γ+=(α−Q((c+,∞)))/d∈[0,1]; if d=0, the inequalities force Q((c+,∞))=α, so take γ+=0.

3.1step 2.1F1F2F4constructalgebra∎

Define Q−(B)=Q({x:−x∈B}). Continuity of reflection and [F4] show every Borel B has Borel preimage; [F1]–[F2] then make Q− a Borel probability. Apply step 2.1 to Q−, obtaining c′ and γ−. With c−=−c′, Q−((c′,∞))=Q((−∞,c−)) and Q−({c′})=Q({c−}), 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