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

All topics

2569 results

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
Project-declaredLean 4.33.0-rc1

Sum dist diff le

sum_dist_diff_le

Plain-language statement

In the τ\tau-minimizer endgame, let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2, set k=d[X1;X2]k=d[X_1;X_2], U=X1+X2U=X_1+X_2, V=X1+X2V=X_1'+X_2, W=X1+X1W=X_1'+X_1, S=X1+X2+X1+X2S=X_1+X_2+X_1'+X_2', and I1=I[U:VS]I_1=I[U:V\mid S]. If c[AS#AS]=i=12(d[Xi0;AS]d[Xi0;Xi])c[A\mid S\#A\mid S]=\sum_{i=1}^2\bigl(d[X_i^0;A\mid S]-d[X_i^0;X_i]\bigr), then c[US#US]+c[VS#VS]+c[WS#WS](63η)k+3(2ηkI1)c[U\mid S\#U\mid S]+c[V\mid S\#V\mid S]+c[W\mid S\#W\mid S]\le(6-3\eta)k+3(2\eta k-I_1).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sum eq integral add integral deriv

sum_eq_integral_add_integral_deriv

Plain-language statement

A first-order Euler–Maclaurin formula. For 0ab0\le a\le b and a differentiable function ff whose derivative is continuous on [a,b][a,b], the sum over integers a<kb\lfloor a\rfloor<k\le\lfloor b\rfloor equals f(a)B1(a)f(b)B1(b)+abf(t)dt+abf(t)B1(t)dt,f(a)B_1(a)-f(b)B_1(b)+\int_a^b f(t)\,dt+\int_a^b f'(t)B_1(t)\,dt, where B1(t)=tt12B_1(t)=t-\lfloor t\rfloor-\tfrac12.

analytic number theoryprime numbersasymptotics

Source project: Prime Number Theorem and More

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sum generalized Kronecker Delta cons

sum_generalizedKroneckerDelta_cons

Plain-language statement

Single contraction. Contracting the last k of k+1 index pairs leaves one free pair σ, τ, with the factorial factor (4-1)(4-2)….

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record