Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 150 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

150 results

Clear filters
Project-declaredLean 4.32.0

Prob Event bind le add bad disagree

probEvent_bind_le_add_bad_disagree

Plain-language statement

Four-way disagreement+bad additive bind bound. A merge of probEvent_bind_le_add_of_disagree with the three-world probEvent_bind_le_add_bad_of_disagree: the disagreement set D (a table-level exceptional set, not a bad event) is charged its full mass ε₁; everywhere off D the my-world is bounded by the oc-world plus the per-shared-sample...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prob Event bind le add bad of disagree

probEvent_bind_le_add_bad_of_disagree

Plain-language statement

Three-way disagreement-aware additive bind bound (hop A). A coupled three-world variant of probEvent_bind_le_add_of_disagree: the three worlds share the sampling computation mx, and at each shared sample x, off the disagreement set D the my-world is bounded by the oc-world plus the per-step slack ε, while on D the ob-world (the bad w...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prob Event bind le prob Event add

probEvent_bind_le_probEvent_add

Plain-language statement

Prefix-event split for a bind. Prefix points satisfying p are charged in full; off-prefix continuations are charged by the uniform tail bound ε.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prob Event bind le prob Event convex

probEvent_bind_le_probEvent_convex

Plain-language statement

Convex prefix-event split for a bind. The off-prefix tail bound ε is charged only on the mass outside p, giving Pr[p] + (1 - Pr[p]) * ε.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prob Event le tsum prob Output mul cost of mem support

probEvent_le_tsum_probOutput_mul_cost_of_mem_support

Plain-language statement

First-moment / Markov bound (support-restricted cost). Variant of probEvent_le_tsum_probOutput_mul_cost whose c ≥ 1 hypothesis need only hold on the support of mx.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record