Project-declaredLean 4.8.0
Le exp of cut
Prob.le_exp_of_cut
Plain-language statement
Lower bounding an exp in terms of an event
probabilitycomplexity theoryinteractive protocols
Source project: debate
Person-level attribution pending.
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 167 research declarations. Search 10,000 more complete Mathlib declarations.
167 results
Clear filtersView proof record
Project-declaredLean 4.8.0
Pr enrich le pr
Prob.pr_enrich_le_pr
Plain-language statement
pr_mono when the left side is enriched
probabilitycomplexity theoryinteractive protocols
Source project: debate
Person-level attribution pending.
Project-declaredLean 4.8.0
Pr eq prob
Prob.pr_eq_prob
Plain-language statement
pr/exp of an indicator is just prob
probabilitycomplexity theoryinteractive protocols
Source project: debate
Person-level attribution pending.
Project-declaredLean 4.8.0
Pr le pr enrich
Prob.pr_le_pr_enrich
Plain-language statement
pr_mono when the right side is enriched
probabilitycomplexity theoryinteractive protocols
Source project: debate
Person-level attribution pending.
Project-declaredLean 4.8.0
Pr or le
Prob.pr_or_le
Plain-language statement
pr (p ∨ q) ≤ pr p + pr q
probabilitycomplexity theoryinteractive protocols
Source project: debate
Person-level attribution pending.
Project-declaredLean 4.33.0-rc1
Alt Set eq upcrossings Before
ProbabilityTheory.altSet_eq_upcrossingsBefore
Plain-language statement
altSet X F a b m is exactly the event of at least m upcrossings of [a, b] by the monotone enumeration finIdx F t of F.
probabilitystochastic processesmeasure theory
Source project: Brownian motion
Person-level attribution pending.