Theorem 1: general and Hermitian operator-sum representations (rectangular typing corrected)
ProvedQAlgorithms.Papers.Independent.Advance50.P40.theorem1_operator_sum_representationsLet and be an arbitrary function. Then is complex-linear if and only if there are a finite index set and two families such that, on every matrix ,
Within the class of complex-linear maps, preserves Hermiticity if and only if there are finitely many and real coefficients such that, on every matrix ,
No positivity of or trace-preservation condition is imposed; an empty sum represents the zero map. Lean expresses complex linearity by agreement everywhere with a bundled complex-linear map.
Source correction. The printed first clause assigns size while taking its adjoint. Change only this size to , which is forced by the displayed matrix product; retain arbitrary positive and both clauses.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P40
noncomputable section
namespace QAlgorithms.Papers.Independent.Advance50.P40
/-- Theorem 1, PDF p. 1, Eqs. (2)-(3), with a minimal rectangular typing correction.
Printed: E and Eprime have sizes m by n and n by m in E X Eprime-dagger.
Changed: both operation-element families have size m by n; the adjoint is retained.
Why: E X has size m by n, so Eprime-dagger must have size n by m.
Linearity means equality on every matrix with a complex-linear map. The signed
Hermitian representation is asserted within that class, as in the source's
"Linear maps" paragraph. Coefficients are arbitrary reals, not necessarily positive.
Finite sums may be empty, representing the zero map. No trace condition is added. -/
theorem theorem1_operator_sum_representations {n m : ℕ} [NeZero n] [NeZero m]
(Phi : SystemMatrix n → SystemMatrix m) :
((∃ L : SystemMatrix n →ₗ[ℂ] SystemMatrix m, ∀ X, L X = Phi X) ↔
∃ (r : ℕ) (E Eright : Fin r → Matrix (Fin m) (Fin n) ℂ),
∀ X, Phi X = ∑ a, E a * X * (Eright a).conjTranspose) ∧
((∃ L : SystemMatrix n →ₗ[ℂ] SystemMatrix m, ∀ X, L X = Phi X) →
((∀ X, X.IsHermitian → (Phi X).IsHermitian) ↔
∃ (r : ℕ) (c : Fin r → ℝ) (E : Fin r → Matrix (Fin m) (Fin n) ℂ),
∀ X, Phi X = ∑ a, (c a : ℂ) • (E a * X * (E a).conjTranspose))) := by sorry
end QAlgorithms.Papers.Independent.Advance50.P40
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of nonzero natural numbers and every function , both of the following hold: first, there exists a complex-linear map with for every if and only if there exist a natural number and two independently chosen families of matrices , indexed by , such that
where denotes the conjugate transpose of . Second, if such a complex-linear map exists, then is Hermitian for every Hermitian matrix if and only if there exist a natural number , real numbers , and matrices , indexed by , such that
The coefficients may be positive, negative, or zero. In either representation, is allowed; the empty sum then represents the zero function.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.