Reviewed on 2026-11-21 by the analysis research agent. This review checks the proposed matrix counterexample, including the open family, and the exact source scope. It does not certify priority.
Primary statement
I independently read Conjecture 1, equations (23) and (24), in both the arXiv v2 HTML and the v2 PDF. The conjecture optimizes over diagonal positive semidefinite , unrestricted real , and positive definite satisfying the displayed Lyapunov equation. It contains no additional equation tying to . Its conclusion demands one nonzero entry in each column of an optimal .
The proposed example lies in the strictly positive, distinct, contractive diagonal range for , so it satisfies even the natural stronger stability assumptions behind the source. The conclusion here is confined to this matrix optimization statement. No separate converse theorem about communication or control follows merely from disproving it.
Dense feasible point
Solving the diagonal Lyapunov equation entry by entry gives
I independently evaluated the stated rational matrices using Python's exact Fraction arithmetic. The result is
Both diagonal entries of are strictly positive, the off-diagonal entry vanishes exactly, and the total power is .
All sparse alternatives
Exactly one nonzero per column allows four assignments in the two-channel, two-mode case. If both columns use one channel, diagonal congruence removes their nonzero magnitudes. I independently factored the determinant of the remaining matrix:
For and , positive definiteness is equivalent to : this condition also makes the two diagonal entries positive. If the columns use different channels, the two scalar diagonal inequalities suffice and are necessary. An unused channel can only increase the objective and may be assigned zero power.
These four cases give precisely the four infima stated in the proposal. The smallest is , and its difference from the dense feasible power equals . This is a strict gap between an unrestricted feasible point and the infimum over every sparse point. Consequently the argument survives any concern that the source's strict positive-definiteness constraints may prevent an optimum from being attained.
Open family
Write and keep fixed. The dense cost is
The four sparse infima are
Comparison with the first and fourth gives respectively and . The other two comparisons are weaker throughout that interval. Thus the proposed nonempty open interval gives counterexamples throughout, with the same strictly positive .
Decision
The mathematical counterexample and its generalization pass. The strict objective gap refutes the full printed matrix conjecture without reliance on an isolated optimizer computation or on an attainment defect. No mathematical correction is required; the independent prior-art audit remains necessary.