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

Pure separable iff trace Left pure

MState.pure_separable_iff_traceLeft_pure

Plain-language statement

A pure state is separable iff the partial trace on the left is pure.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Purify spec

MState.purify_spec

Plain-language statement

The defining property of purification, that tracing out the purifying system gives the original mixed state.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Spectrum prod

MState.spectrum_prod

Plain-language statement

Spectrum of direct product. There is a permutation σ so that the spectrum of the direct product of ρ₁ and ρ₂, as permuted under σ, is the pairwise products of the spectra of ρ₁ and ρ₂.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Spectrum pure eq constant

MState.spectrum_pure_eq_constant

Plain-language statement

The specturm of a pure state is (1,0,0,...), i.e. a constant distribution.

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Multi Dist of cast

multiDist_of_cast

Plain-language statement

Multidistance is unchanged when a finite family of random variables is reindexed along an equality m=mm'=m. This says that the quantity depends on the family, not on the particular equal presentation of its finite index type.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Multidist ruzsa IV

multidist_ruzsa_IV

Project documentation

Let m ≥ 2, and let X_[m] be a tuple of G-valued random variables. Let W := ∑ X_i. Then d[W;-W] ≤ 2 D[X_i].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record