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.32.0

Sum generalized Kronecker Delta cons₂

sum_generalizedKroneckerDelta_cons₂

Plain-language statement

Double contraction. Contracting the last k of k+2 index pairs leaves two free pairs, with value a 2×2 generalized Kronecker delta times the factorial factor.

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sum generalized Kronecker Delta self

sum_generalizedKroneckerDelta_self

Plain-language statement

Full contraction. Iterating the snoc contraction over all four indices: ∑_f δ^{f}_{f} = 4!. Here f ranges over all maps Fin 4 → Fin 4.

physicsquantum field theoryrelativity

Source project: Physlib

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Sum of rdist eq

sum_of_rdist_eq

Plain-language statement

Let Y1,Y2,Y3Y_1,Y_2,Y_3 and Y4Y_4 be independent GG-valued random variables. Then d[Y1Y3;Y2Y4]+d[Y1Y1Y3;Y2Y2Y4]d[Y_1-Y_3; Y_2-Y_4] + d[Y_1|Y_1-Y_3; Y_2|Y_2-Y_4] +I[Y1Y2:Y2Y4Y1Y2Y3+Y4]=d[Y1;Y2]+d[Y3;Y4]. + I[Y_1-Y_2 : Y_2 - Y_4 | Y_1-Y_2-Y_3+Y_4] = d[Y_1; Y_2] + d[Y_3; Y_4].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Sum of rdist eq step cond Mutual Info

sum_of_rdist_eq_step_condMutualInfo

Plain-language statement

For four measurable random variables Y0,Y1,Y2,Y3Y_0,Y_1,Y_2,Y_3 in a finite abelian group, the conditional mutual-information term used in the fibring identity can be reduced to I ⁣[(Y0Y1,Y2Y3):(Y0Y2,Y1Y3)|Y0Y1Y2+Y3]=I[Y0Y1:Y1Y3Y0Y1Y2+Y3].I\!\left[(Y_0-Y_1,Y_2-Y_3):(Y_0-Y_2,Y_1-Y_3)\,\middle|\,Y_0-Y_1-Y_2+Y_3\right]=I[Y_0-Y_1:Y_1-Y_3\mid Y_0-Y_1-Y_2+Y_3].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Sum prob Event option map eq some le is Some

sum_probEvent_option_map_eq_some_le_isSome

Plain-language statement

Selector fibers inside an optional output are disjoint, so their finite sum is bounded by the probability of returning any some value.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record