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.33.0-rc1

Tendsto of eventually monotone of tendsto on dense

tendsto_of_eventually_monotone_of_tendsto_on_dense

Plain-language statement

We combine limsup_le_of_eventually_monotone_of_tendsto_on_dense and le_liminf_of_eventually_monotone_of_tendsto_on_dense to prove that F · a converges to f a if f is continuous at a.

probabilitystochastic processesmeasure theory

Source project: Brownian motion

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Torsion PFR

torsion_PFR

Project documentation

Polynomial Freiman-Ruzsa theorem for bounded-torsion groups. Let GG be a finite abelian group in which mx=0mx=0 for every xx, with m2m\ge2. If AGA\subseteq G is nonempty and A+AKA|A+A|\le K|A|, then there are a subgroup HGH\le G and a set cc such that Ac+HA\subseteq c+H, HA|H|\le|A|, and c<mK256m3+1|c|<mK^{256m^3+1}.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.8.0

Vera debate cost

vera_debate_cost

Plain-language statement

Vera makes few queries, regardless of Alice and Bob

probabilitycomplexity theoryinteractive protocols

Source project: debate

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Weak PFR asymm prelim

weak_PFR_asymm_prelim

Plain-language statement

An asymmetric weak-PFR estimate. Let A,BA,B be nonempty finite subsets of a rank-nn free Z\mathbb Z-module GG. There are a subgroup NGN\le G, cosets x,yG/Nx,y\in G/N, and nonempty fibers Ax={aA:a+N=x}A_x=\{a\in A:a+N=x\} and By={bB:b+N=y}B_y=\{b\in B:b+N=y\} such that nlog2logG/N+40d[UA;UB]n\log2\le\log|G/N|+40d[U_A;U_B] and logA+logBlogAxlogBy34(d[UA;UB]d[UAx;UBy]).\log|A|+\log|B|-\log|A_x|-\log|B_y|\le34\bigl(d[U_A;U_B]-d[U_{A_x};U_{B_y}]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record