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

1 topic

160 results

Clear filters
Project-declaredLean 4.28.0

Sᵥₙ subadditivity

Sᵥₙ_subadditivity

Plain-language statement

"Ordinary" subadditivity of von Neumann entropy

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Sᵥₙ wm

Sᵥₙ_wm

Plain-language statement

Weak monotonicity, version with partial traces.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Tau minimizer exists rdist eq zero

tau_minimizer_exists_rdist_eq_zero

Plain-language statement

For p.η ≤ 1/8, there exist τ-minimizers X₁, X₂ at zero Rusza distance. For p.η < 1/8, all minimizers are fine, by tau_strictly_decreases'. For p.η = 1/8, we use a limit of minimizers for η < 1/8, which exists by compactness.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Tau strictly decreases

tau_strictly_decreases

Plain-language statement

If d[X1;X2]>0d[X_1;X_2] > 0 then there are GG-valued random variables X1,X2X'_1, X'_2 such that τ[X1;X2]<τ[X1;X2]\tau[X'_1;X'_2] < \tau[X_1;X_2]. Phrased in the contrapositive form for convenience of proof.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record