3.3
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.holderAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and .
For conjugate real exponents 1/p+1/q=1, p>1: |Tr LK|≤Tr|LK|≤||L||_p||K||_q, with an attaining K for each L. For 0<p<1 and M supported by N: Tr MN≥||M||p / ||N^{-1}||{-q}. For positive M,N equality holds when M^p=a N^q, a≥0.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#3.3
3.3, arXiv:1504.00233v5, PDF p.40. -/
theorem holder [Nonempty I] (p q : ℝ) (hp : 0 < p) (hq : q ≠ 0) (hc : 1/p+1/q = 1) :
(1 < p → ∀ L K : paperMat I, ‖(L*K).trace‖ ≤ traceNorm (L*K) ∧ traceNorm (L*K) ≤ paperSchatten L p*paperSchatten K q) ∧
(1 < p → ∀ L : paperMat I, ∃ K : paperMat I, ‖(L*K).trace‖ = traceNorm (L*K) ∧ traceNorm (L*K) = paperSchatten L p*paperSchatten K q) ∧
(p < 1 → ∀ M N : paperMat I, M.PosSemidef → N.PosSemidef → paperSupported M N →
paperSchatten M p*(paperSchatten (paperPower N (-1)) (-q))⁻¹ ≤ (M*N).trace.re) ∧
(∀ M N : paperMat I, M.PosSemidef → N.PosSemidef → (∃ a : ℝ, 0 ≤ a ∧ paperPower M p = (a:ℂ) • paperPower N q) →
(1 < p → ‖(M*N).trace‖ = traceNorm (M*N) ∧ traceNorm (M*N) = paperSchatten M p*paperSchatten N q) ∧
(p < 1 → paperSupported M N → (M*N).trace.re = paperSchatten M p*(paperSchatten (paperPower N (-1)) (-q))⁻¹)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite nonempty index type with decidable equality and real numbers satisfying , , and , define by functional calculus, where and for , and put
The assertion is the conjunction of the following claims: if , then every pair of complex matrices indexed by satisfies
and, for every such , there exists a matrix for which both inequalities are equalities, with no requirement that be nonzero; if , then every positive semidefinite pair satisfying obeys
and, for every positive semidefinite pair , if there exists a real such that , then both forward inequalities are equalities when , while, when and , the reverse inequality is an equality. The hypotheses exclude ; they give when and when . All scalar inverses use the convention , and assigns zero to a zero eigenvalue.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.