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

Expect val eq mixable mix

ProbDistribution.expect_val_eq_mixable_mix

Plain-language statement

The expectation value of a random variable over α = Fin 2 is the same as Mixable.mix with probabiliy weight X.distr 0

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Q Relative Ent lower Semicontinuous

qRelativeEnt.lowerSemicontinuous

Project documentation

Quantum relative entropy when σ has full rank -/ theorem qRelativeEnt_rank {ρ σ : MState d} [σ.M.NonSingular] : (𝐃(ρ‖σ) : EReal) = ⟪ρ.M, ρ.M.log - σ.M.log⟫ := by apply qRelativeEnt_ker simp [HermitianMat.nonSingular_ker_bot] section lowerSemicontinuous_1 variable {d : Type*} [Fintype d] [DecidableEq d] open scoped InnerProductSpace RealInnerProductSpace...

quantum informationentropyquantum channels

Source project: quantumInfo

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

Rdist of sums ge

rdist_of_sums_ge'

Plain-language statement

A Ruzsa-distance lower bound for sums of independent copies. Let X1,X2X_1',X_2' be independent copies of the τ\tau-minimizers X1,X2X_1,X_2, and set k=d[X1;X2]k=d[X_1;X_2]. Then d[X1+X1;X2+X2]kη2(d[X1;X1]+d[X2;X2]).d[X_1+X_1';X_2+X_2']\ge k-\frac{\eta}{2}\bigl(d[X_1;X_1]+d[X_2;X_2]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record