Theorem C.4 — exact saturation test: with symbols orbit sum hive system at
OpenSpectralFeedback.Supplement.theorem_C_4_saturation_testlinear-algebramatrix-analysisoptimizationp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-information
Let be a density matrix on , , its positive spectrum, , , and let be the least rank- majorant. Suppose . For every the following are equivalent:
- the unlimited value is attainable with at most transmitted symbols, i.e. there are with and ;
- for some unitaries on the support of ,
- the linear hive system (C.10) is feasible with .
Moreover, the least number of symbols attaining exists and lies between and . By the equivalence it is the least for which the hive system at is feasible, a linear feasibility problem with rational data when is rational.
Differences from the source:
- generalization: receiver rank r ≤ d → any r ≥ 1; reason: r′ = min{r, n} and f_r are unchanged for r > d; for r ≤ d it is the source's statement
- encoding: χ(q) attainable with at most m transmitted symbols → χ(q) ∈ rewardSet r χ_r m ρ (m atoms, zero atoms allowed); reason: an atom may be zero, which is an unused symbol
- encoding: unitaries U_h on the support of ρ → a fixed isometry W : ℂ^n → ℂ^d with WW = I_n and WWρ = ρ, and unitaries U_h of ℂ^n, with ρ = (1/m) Σ W U_h diag(q) U_h* W*; reason: W identifies the support of ρ with ℂ^n
- reading: for rational λ, the minimum can therefore be determined by rational LP feasibility, with 1 ≤ m ≤ n → the least attaining m₀ exists and 1 ≤ m₀ ≤ n (with the equivalence, m₀ is the least m whose hive system at x = q/m is feasible); reason: the sentence's mathematical content; the algorithmic reading has no stated model of computation
Preamble
import Mathlib import Definitions.Def_SpectralFeedback_rewardSet import Definitions.Def_SpectralFeedback_Supplement_chi import Definitions.Def_SpectralFeedback_Supplement_leastMajorant import Definitions.Def_SpectralFeedback_Supplement_socpValues open scoped ComplexOrder
Formal statement
namespace SpectralFeedback
namespace Supplement
/-- **Theorem C.4** (Exact saturation test; Qi, *Spectral Structure and Exact Arithmetic of
Finite-Feedback Measurement Discrimination*, manuscript (Nov. 2026), p.30 (PDF p.32)). Suppose
`r′ ≥ 2`. The unlimited value `χ(q)` is attainable with at most `m` transmitted symbols if and only if
`ρ = (1/m) ∑_{h=1}^m U_h diag(q) U_h*` (C.15) for some unitaries on its support. Equivalently, the
linear hive system (C.10) is feasible with `x = q/m`. For rational `λ`, the minimum can therefore be
determined by rational LP feasibility, with `1 ≤ m ≤ n`.
**Formalization Note** Notation of §C.3–C.4 (pp.27, 29): `ρ` is a density matrix, `n = rank ρ`,
`λ` its positive spectrum (`eigDesc ρ i`, `i < n`), `r′ = min{r, n}`, `q` the least rank-`r′`
majorant (`leastMajorant`). "Attainable with at most `m` symbols" is `χ(q) ∈ rewardSet r χ_r m ρ`
(`m` atoms, zero atoms allowed). "Unitaries on its support": a fixed isometry `W : ℂ^n → ℂ^d` onto
the range of `ρ` (`W* W = I_n`, `W W* ρ = ρ`) and unitaries `U_h` of `ℂ^n`. The last sentence is read
as: the least attaining `m` exists and lies in `[1, n]` (by the two equivalences it is the least `m`
for which (C.10) at `x = q/m` is feasible, a linear system with rational data when `λ` is
rational). -/
theorem theorem_C_4_saturation_test (r : ℕ) (hr : 1 ≤ r) {d : ℕ}
(ρ : Matrix (Fin d) (Fin d) ℂ) (hρ : ρ.PosSemidef) (htr : ρ.trace = 1)
(hr' : 2 ≤ min r ρ.rank) :
(∀ m : ℕ, 1 ≤ m →
((chi ρ.rank (leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank)) ∈ rewardSet r (chi r) m ρ ↔
∃ W : Matrix (Fin d) (Fin ρ.rank) ℂ, ∃ U : Fin m → Matrix (Fin ρ.rank) (Fin ρ.rank) ℂ,
W.conjTranspose * W = 1 ∧ W * W.conjTranspose * ρ = ρ ∧
(∀ h, U h ∈ Matrix.unitaryGroup (Fin ρ.rank) ℂ) ∧
ρ = ((m : ℂ)⁻¹) • ∑ h, W * U h *
Matrix.diagonal (fun i => ((leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank) i : ℝ) : ℂ)) *
star (U h) * W.conjTranspose) ∧
(chi ρ.rank (leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank)) ∈ rewardSet r (chi r) m ρ ↔
HiveChain ρ.rank m (fun i => leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank) i / (m : ℝ))
(fun i => eigDesc ρ (i : ℕ))))) ∧
∃ m₀ : ℕ, 1 ≤ m₀ ∧ m₀ ≤ ρ.rank ∧
chi ρ.rank (leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank)) ∈ rewardSet r (chi r) m₀ ρ ∧
∀ m : ℕ, 1 ≤ m → m < m₀ →
chi ρ.rank (leastMajorant (eigDesc ρ) ρ.rank (min r ρ.rank)) ∉ rewardSet r (chi r) m ρ := by sorry
end Supplement
end SpectralFeedback
Source
Qi, Spectral Structure and Exact Arithmetic of Finite-Feedback Measurement Discrimination, manuscript (Nov. 2026; PDF sha256 a5b5cf40…eabde9cf), Theorem C.4, (C.15), p.30 (PDF p.32); notation §C.3–C.4, pp.27, 29