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.

1 topic

167 results

Clear filters
Project-declaredLean 4.8.0

Snaps prob

snaps_prob

Plain-language statement

Snapping doesn't changed prob for close p

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.8.0

Soundness p

soundness_p

Plain-language statement

Soundness for any valid parameters

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.8.0

Soundness

soundness'

Plain-language statement

Bob wins the debate with probability ≥ 8/15

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Sub cond Multi Distance le

sub_condMultiDistance_le

Project documentation

If (Xi)1im(X_i)_{1 \leq i \leq m} is a τ\tau-minimizer, and k:=D[(Xi)1im]k := D[(X_i)_{1 \leq i \leq m}], then for any other tuples (Xi)1im(X'_i)_{1 \leq i \leq m} and (Yi)1im(Y_i)_{1 \leq i \leq m} with the XiX'_i G$-valued, one has kD[(Xi)1im(Yi)1im]ηi=1md[Xi;XiYi]. k - D[(X'_i)_{1 \leq i \leq m} | (Y_i)_{1 \leq i \leq m}] \leq \eta \sum_{i=1}^m d[X_i; X'_i|Y_i].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record