All proofs
Project-declaredLean 4.28.0 · mathlib@8f9d9cff6bd7

Trace function convex univ

HermitianMat.trace_function_convex_univ

Project documentation

The trace functional is invariant under joint unitary conjugation of MStates. -/ theorem sandwichedTraceFunctional_conj_unitary_MState (U : Matrix.unitaryGroup d ℂ) (ρ σ : MState d) : Q̃_ α(ρ.U_conj U‖σ.U_conj U) = Q̃_ α(ρ‖σ) := by unfold sandwichedTraceFunctional MState.U_conj exact sandwichedTraceFunctional_conj_unitary_hermitian U ρ.M σ.M /-! ## Joint...

Exact Lean statement

theorem trace_function_convex_univ (g : ℝ → ℝ) (hg : ConvexOn ℝ Set.univ g) :
    ConvexOn ℝ Set.univ (fun A : HermitianMat d ℂ => (A.cfc g).trace)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem trace_function_convex_univ (g :   ) (hg : ConvexOn  Set.univ g) :    ConvexOn  Set.univ (fun A : HermitianMat d ℂ => (A.cfc g).trace) := by  refine convex_univ, ?_  intro A _ B _ a b ha hb hab;  -- Let $C = aA + bB$.  set C : HermitianMat d ℂ := a • A + b • B;  -- By the properties of the trace and the convexity of $g$, we have:  have h_trace : (C.cfc g).trace = ∑ i, g (C.H.eigenvalues i) := by    exact trace_cfc_eq C g;  -- By the properties of the trace and the convexity of $g$, we have $\sum_{i} g(C_{ii}) \leq a \sum_{i} g(A_{ii}) + b \sum_{i} g(B_{ii})$.  have h_sum : ∑ i, g (C.H.eigenvalues i)  a * ∑ i, g ((A.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) + b * ∑ i, g ((B.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) := by    have h_sum :  i, g (C.H.eigenvalues i)  a * g ((A.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) + b * g ((B.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) := by      intro i      have h_eigenvalue : C.H.eigenvalues i = a * ((A.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) + b * ((B.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re) := by        have h_eigenvalue : (C.conj (star C.H.eigenvectorUnitary.val)).mat i i = a * (A.conj (star C.H.eigenvectorUnitary.val)).mat i i + b * (B.conj (star C.H.eigenvectorUnitary.val)).mat i i := by          simp +zetaDelta at *;          simp [conj]          exact Complex.ext rfl rfl;        have h_eigenvalue : (C.conj (star C.H.eigenvectorUnitary.val)) = (diagonal ℂ C.H.eigenvalues).conj 1 := by          have h_eigenvalue : C = (diagonal ℂ C.H.eigenvalues).conj C.H.eigenvectorUnitary := by            exact eq_conj_diagonal C;          convert congr_arg ( fun x => ( conj ( star C.H.eigenvectorUnitary.val ) ) x ) h_eigenvalue using 1;          simp [ HermitianMat.conj_conj ];        simp_all [ HermitianMat.conj ];        convert congr_arg Complex.re ‹ ( diagonal ℂ _ ) i i = _ › using 1;        · exact Eq.symm ( by erw [ show ( diagonal ℂ _ : HermitianMat d ℂ ) i i = ( C.H.eigenvalues i : ℂ ) by exact if_pos rfl ] ; norm_cast );        · norm_num [ Complex.ext_iff ];      rw [h_eigenvalue]      exact hg.2 trivial trivial ha hb hab;    simpa only [ Finset.mul_sum _ _ _, Finset.sum_add_distrib ] using Finset.sum_le_sum fun i _ => h_sum i;  -- By the properties of the trace and the convexity of $g$, we have $\sum_{i} g(A_{ii}) \leq \text{tr}(g(A))$ and $\sum_{i} g(B_{ii}) \leq \text{tr}(g(B))$.  have h_trace_A : ∑ i, g ((A.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re)  (A.cfc g).trace := by    convert HermitianMat.peierls_inequality _ _ hg using 1;    convert HermitianMat.trace_cfc_conj_unitary _ _ _ using 1;    rotate_right;    exact C.H.eigenvectorUnitary;    simp [ conj_conj ]  have h_trace_B : ∑ i, g ((B.conj (star C.H.eigenvectorUnitary.val)).mat i i |> Complex.re)  (B.cfc g).trace := by    convert HermitianMat.peierls_inequality _ _ hg using 1;    convert HermitianMat.trace_cfc_conj_unitary _ _ _;    rotate_right;    exact C.H.eigenvectorUnitary;    simp [ conj_conj ];  simpa only [ h_trace ] using h_sum.trans ( add_le_add ( mul_le_mul_of_nonneg_left h_trace_A ha ) ( mul_le_mul_of_nonneg_left h_trace_B hb ) )
Project
quantumInfo
License
MIT
Commit
56e83a9288a3
Source
QuantumInfo/Finite/Entropy/DPI.lean:238-281

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.28.0

Conj Transpose isometry mul isometry le one

conjTranspose_isometry_mul_isometry_le_one

Project documentation

The operator norm of the conjugate transpose is equal to the operator norm. -/ theorem Matrix.opNorm_conjTranspose_eq_opNorm {m n : Type*} [Fintype m] [Fintype n] [DecidableEq m] [DecidableEq n] (A : Matrix m n 𝕜) : Matrix.opNorm Aᴴ = Matrix.opNorm A := by unfold Matrix.opNorm rw [← ContinuousLinearMap.adjoint.norm_map (toEuclideanLin A).toContinuousLine...

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Convex roof of pure

convex_roof_of_pure

Plain-language statement

The convex roof extension of g : KetUpToPhase d → ℝ≥0 applied to a pure state ψ is g (KetUpToPhase.mk ψ).

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record
Project-declaredLean 4.28.0

Id achieves Rate log dim

CPTPMap.id_achievesRate_log_dim

Plain-language statement

The identity channel on D dimensional space achieves a rate of log2(D).

quantum informationentropyquantum channels

Source project: quantumInfo

Person-level attribution pending.

View proof record