Source-pinned research
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 10 research declarations. Search 10,000 more complete Mathlib declarations.
10 results
Clear filtersprob_split_last_uniform_sampling_of_finFun
Plain-language statement
Rewrites the probability over the large r space as a sequential probability, sampling r_last first, then r_init.
Source project: ArkLib
Person-level attribution pending.
prob_split_uniform_sampling_of_equiv_prod
Project documentation
Generic Probability Splitting Lemma (via Equivalence) This lemma proves that a single probability statement over a uniform distribution on a type α can be rewritten as a sequential probability statement over two smaller, independent distributions γ and δ, given an equivalence e : α ≃ γ × δ. This is a formal "change of variables" for probabilit...
Source project: ArkLib
Person-level attribution pending.
prob_tsum_form_doubleton
Plain-language statement
Unrolls Pr_{ let x ← D; let y ← D }[P x y] into a sum of the form ∑' (x × y), (if P x y then 1 else 0).
Source project: ArkLib
Person-level attribution pending.
prob_tsum_form_singleton
Plain-language statement
Unrolls Pr_{ let x ← D }[P x] into a sum of the form ∑' x, Pr[x] * (if P x then 1 else 0).
Source project: ArkLib
Person-level attribution pending.