Union bound over windows
ProvedBitcoinBackboneProb.typicalOn_failure_le_of_windowIf every window of length at least fails with probability at most , then TypicalOn ω lam L.
import Definitions.Def_BitcoinBackboneProb open BitcoinBackboneProb BitcoinBackbone open MeasureTheory ProbabilityTheory
theorem BitcoinBackboneProb.typicalOn_failure_le_of_window (n t : ℕ) (p : unitInterval)
(lam L : ℕ) (hlam : 1 ≤ lam) (β : ℝ)
(hβ : ∀ a k : ℕ, lam ≤ k → (P n t p).real
{ω | ∑ i ∈ Finset.Ioo a (a + k), Y ω i ≤ ∑ i ∈ Finset.Icc a (a + k), Z ω i} ≤ β) :
(P n t p).real {ω | ¬ TypicalOn ω lam L} ≤ (L : ℝ) ^ 2 * β := by sorryRead-back
What the Lean code literally says, in plain math · claude-fable-5-1 (independent sub-agent, blind: Lean code + auditor instructions only)
Read-back: BitcoinBackboneProb.typicalOn_failure_le_of_window
Statement. Let , , and . Assume
- ;
- for all with :
(here has elements and has elements; the event is the non-strict reverse of the window inequality; the hypothesis is required for every start , with no upper bound on or ).
Then
with cast to . No condition on the margin is assumed. The hypothesis implies (it bounds a probability). For the right side is (and no window exists since ).
Probabilistic round model (unfolded)
- Parameters. are arbitrary natural numbers (either may be ): is the number of honest parties, the number of adversarial queries per round. is an element of the closed unit interval (so and are allowed); wherever it appears in arithmetic it is the real number . All casts of and other naturals into formulas are casts into (so , etc. below are real subtractions and may be negative), except where a natural-number subtraction is explicitly flagged.
- Bernoulli law . The two-point Bernoulli measure on built by Mathlib's
bernoulliMeasure true false p: mass on and mass on . It is a probability measure. - Round outcomes . A round outcome is a pair with (which honest parties succeeded) and (which adversarial queries succeeded). If (resp. ) the corresponding component is the unique empty function.
- Round law . The product measure
on (product -algebra): all coordinates are independent, each with probability . It is a probability measure.
- Traces . A trace is an infinite sequence of round outcomes, indexed by all starting at ; with the product -algebra.
- Trace law . The infinite product probability measure on (Mathlib's
Measure.infinitePi): the coordinates are i.i.d. with law . It is a probability measure. For any set (measurable or not; non-measurable sets get their outer measure), below denotes the real number obtained by converting the (extended-nonnegative) measure of to ; it lies in . - Counts in one round. For :
- Round indicators. if and otherwise; if and otherwise (both natural numbers); computed in .
- Trace variables. For and (including ): , , (natural numbers), . So and .
- Margin.
where is natural-number subtraction (truncated at ): for the exponent is and ; for , ; the convention applies, so for , the factor equals .
- Rate.
(the denominator is at least , never zero).
Window conventions
For natural numbers : (closed window; empty if , a single point if ) and (open window; empty whenever ). A sum over an empty index set is . Sums of the natural-number variables are computed in and compared there.
Typicality on a horizon (unfolded)
For a trace and , holds iff for all with and :
(strict inequality; adversarial blocks counted over the closed window including both endpoints, uniquely successful rounds over the open window excluding both endpoints; , i.e. round of the trace, is included).
Edge cases: if there is no admissible window and holds vacuously (for every ). Any admissible window with has an empty open window, so its right side is and the strict inequality fails; hence for , is false for every and every , and for it is false for every as soon as .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.