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

1 topic

83 results

Clear filters
Project-declaredLean 4.33.0-rc1

PFR conjecture

PFR_conjecture'

Project documentation

Polynomial Freiman-Ruzsa theorem without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K12|c|<2K^{12}, and HA|H|\le|A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Pow inner nonneg

pow_inner_nonneg'

Project documentation

A positivity lemma for self-difference-convolutions. If f=ggf=g\mathbin{\circleddash}g and the nonnegative weight ν\nu has a factorization ν=hh\nu=h\mathbin{\circleddash}h, then every natural power of ff has nonnegative weighted inner product with ν\nu: fk,ν0\langle f^k,\nu\rangle\ge0 for every kNk\in\mathbb N.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Probability Theory i Indep Fun sum elim

ProbabilityTheory.iIndepFun.sum_elim

Plain-language statement

Two internally independent families remain jointly independent after they are combined over a disjoint union, provided the two family-valued random variables are independent of one another.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Rdist add rdist add cond Mutual eq

rdist_add_rdist_add_condMutual_eq

Plain-language statement

A fibring identity in the τ\tau-minimizer setup. Let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2 and put k=d[X1;X2]k=d[X_1;X_2]. Then d[X1+X2;X2+X1]+d[X1X1+X2;X2X2+X1]+I[X1+X2:X1+X2X1+X2+X1+X2]=2kd[X_1+X_2';X_2+X_1']+d[X_1\mid X_1+X_2';X_2\mid X_2+X_1']+I[X_1+X_2:X_1'+X_2\mid X_1+X_2+X_1'+X_2']=2k.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Rdist of indep eq sum fibre

rdist_of_indep_eq_sum_fibre

Plain-language statement

If Z1,Z2Z_1, Z_2 are independent, then d[Z1;Z2]d[Z_1; Z_2] is equal to d[π(Z1);π(Z2)]+d[Z1π(Z1);Z2π(Z2)] d[\pi(Z_1);\pi(Z_2)] + d[Z_1|\pi(Z_1); Z_2 |\pi(Z_2)] plus I(Z1Z2:(π(Z1),π(Z2))π(Z1Z2)).I( Z_1 - Z_2 : (\pi(Z_1), \pi(Z_2)) | \pi(Z_1 - Z_2) ).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record