AFTD Auto-Formalizing Theoretical Domains

not_universal_spectral_bound_positive_trace_preserving

theoremverifiedoriginal

Not every positive trace-preserving linear map on d × d complex matrices with d ≥ 3 satisfies Tr(Φ) ≤ d m(Φ) + d² − d: in dimension 3 the positive trace-preserving map X ↦ K X K + (3/4) P Xᵀ P, K = diag(1/2, 1/2, 1), P = diag(1, 1, 0), has operator trace 11/2 while 3 m(Φ) + 6 ≤ 9/2.

Statement

theorem not_universal_spectral_bound_positive_trace_preserving :
    ¬ ∀ (d : ℕ), 3 ≤ d →
      ∀ (Φ : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ),
      is_positive_linear_map d Φ → is_trace_preserving_linear_map d Φ →
      ((LinearMap.trace ℂ (Matrix (Fin d) (Fin d) ℂ)) Φ).re ≤
        (d : ℝ) * spectral_min_re d Φ + (d : ℝ) ^ 2 - (d : ℝ)
Related work
OP-733: arXiv:2610.37187 (Removing Trace Preservation from a Universal Spectral Bound for 2-Positive Maps), Sec. 9, Concluding remarks: whether positive trace-preserving maps in dimension d >= 3 can violate (1.2), a question raised in arXiv:2506.02145.
Verified
01 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • not_universal_spectral_bound_positive_tp_dim_threeThe universal spectral bound Tr(Φ) ≤ 3 m(Φ) + 6 fails for some positive trace-preserving map Φ on 3 × 3 complex matrices: Φ(X) = K X K +…
  • spectral_min_reThe minimal real part m(Φ) of an eigenvalue of a linear map Φ on d × d complex matrices is the infimum of the real parts of the elements…
  • is_positive_linear_mapA linear map Φ on d × d complex matrices is positive if it maps every positive semidefinite matrix to a positive semidefinite matrix.
  • is_trace_preserving_linear_mapA linear map Φ on d × d complex matrices is trace-preserving if the trace of Φ(X) equals the trace of X for all d × d complex matrices X.

Read back from the Lean

The theorem asserts the negation of the following statement: for all natural numbers $d \ge 3$ and all $\mathbb{C}$-linear maps $\Phi : M_d(\mathbb{C}) \to M_d(\mathbb{C})$, if $\Phi$ is positive (i.e., maps positive semidefinite matrices to positive semidefinite matrices) and trace-preserving (i.e., $\mathrm{Tr}(\Phi(X)) = \mathrm{Tr}(X)$ for all $X \in M_d(\mathbb{C})$), then the real part of the operator trace of $\Phi$ (as a linear map on $M_d(\mathbb{C})$) is less than or equal to $d \cdot \inf \{\mathrm{Re}(\lambda) : \lambda \in \mathrm{spectrum}_{\mathbb{C}}(\Phi)\} + d^2 - d$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The theorem is proved by contradiction using a known counterexample in dimension 3. Assuming for contradiction that the spectral bound holds for all d ≥ 3, we specialize the universal assumption to d = 3 to deduce that every positive trace-preserving linear map on 3 × 3 matrices satisfies Re(Tr(Φ)) ≤ 3 m(Φ) + 6. This directly contradicts `not_universal_spectral_bound_positive_tp_dim_three`, which establishes that this inequality fails in dimension 3.

  1. It suffices to show that the spectral bound holds for all positive trace-preserving maps in dimension 3.

    Assume for contradiction (h) that the spectral bound Re(Tr(Φ)) ≤ d · m(Φ) + d² − d holds for all dimensions d ≥ 3 and all positive trace-preserving linear maps Φ. Invoking `not_universal_spectral_bound_positive_tp_dim_three`, which states that this inequality does not hold for all such maps in dimension d = 3, reduces deriving False to showing that every positive trace-preserving map in dimension 3 satisfies Re(Tr(Φ)) ≤ 3 · m(Φ) + 6.

    lines 7–8

    uses not_universal_spectral_bound_positive_tp_dim_three

      intro h
      apply not_universal_spectral_bound_positive_tp_dim_three
  2. For an arbitrary positive trace-preserving map Φ in dimension 3, the bound holds in unsimplified form: Re(Tr(Φ)) ≤ 3 · m(Φ) + 3² − 3.

    Let Φ be an arbitrary positive (`hp`) and trace-preserving (`ht`) map on 3 × 3 complex matrices. Specializing the universal hypothesis h to d = 3 (justified by 3 ≤ 3 via `le_rfl`), Φ, `hp`, and `ht` yields the inequality h1: Re(Tr(Φ)) ≤ 3 · m(Φ) + 3² − 3.

    lines 9–10

    uses le_rfl

      intro Φ hp ht
      have h1 := h 3 le_rfl Φ hp ht
  3. The desired inequality Re(Tr(Φ)) ≤ 3 · m(Φ) + 6 holds, completing the proof.

    Evaluating the numerical expressions simplifies 3² − 3 to 9 − 3 = 6, after which linear arithmetic concludes that Re(Tr(Φ)) ≤ 3 · m(Φ) + 6.

    lines 11–12

      norm_num at h1 ⊢
      linarith
not_universal_spectral_bound_positive_tp_dim_three
It is not the case that every positive trace-preserving linear map Φ on 3 × 3 complex matrices satisfies Re(Tr(Φ)) ≤ 3 m(Φ) + 6.
le_rfl
Reflexivity of less-than-or-equal: every element in a preorder satisfies a ≤ a.

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem not_universal_spectral_bound_positive_trace_preserving :    ¬ ∀ (d : ℕ), 3 ≤ d →      ∀ (Φ : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ),      is_positive_linear_map d Φ → is_trace_preserving_linear_map d Φ →      ((LinearMap.trace ℂ (Matrix (Fin d) (Fin d) ℂ)) Φ).re ≤        (d : ℝ) * spectral_min_re d Φ + (d : ℝ) ^ 2 - (d : ℝ) := by  intro h  apply not_universal_spectral_bound_positive_tp_dim_three  intro Φ hp ht  have h1 := h 3 le_rfl Φ hp ht  norm_num at h1 ⊢  linarith
See it in the graphDiscuss this resultChallenge it