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 10 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

10 results

Clear filters
Project-declaredLean 4.31.0

Do two uniform sampling eq uniform prod

do_two_uniform_sampling_eq_uniform_prod

Plain-language statement

Proves that a do block sampling two independent uniform distributions is equal to the single uniform distribution over the product type.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

PMF map uniform Of Fintype of fiber const

PMF.map_uniformOfFintype_of_fiber_const

Plain-language statement

Pushforward of PMF.uniformOfFintype α under a map f : α → β whose fibers over the image all have the same cardinality k > 0 is the uniform distribution on the image of f. Useful when f is an affine-linear surjection: every fiber is a translate of the kernel and hence has constant cardinality. The proximity-gap proofs use this to bridge the coeff...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Pr add split by complement

Pr_add_split_by_complement

Plain-language statement

Law of Total Probability (Partitioning an Event) The probability of an event f r occurring can be calculated by summing the probabilities of two disjoint cases: 1. f r occurs AND g r occurs. 2. f r occurs AND g r does NOT occur. Good to be used with Pr_multi_let_equiv_single_let

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Pr le Pr of implies

Pr_le_Pr_of_implies

Plain-language statement

Monotonicity of Probability If event A (defined by predicate f) implies event B (defined by predicate g) for all outcomes r, then the probability of A is less than or equal to the probability of B.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prob marginalization first of prod

prob_marginalization_first_of_prod

Project documentation

Helper lemma for probability marginalization. Pr_{ (x, y) ← D₁ × D₂ }[ P x ] = Pr_{ x ← D₁ }[ P x ]

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Prob schwartz zippel mv polynomial

prob_schwartz_zippel_mv_polynomial

Plain-language statement

Schwartz-Zippel Lemma (Probability Form): For a non-zero multivariate polynomial P of total degree at most d over a finite field L, the probability that P(r) evaluates to 0 for a uniformly random r is at most d / |L|.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record