Status: the counterexample and sparse lower bound pass independent mathematical and source-scope review. Prior-art review remains with the root agent; this note alone does not establish novelty.
Exact source
Barron Han, Oron Sabag, Victoria Kostina, and Babak Hassibi, Coded Kalman Filtering over MIMO Gaussian Channels with Feedback, arXiv:2406.17196v2 (5 August 2025), Conjecture 1, equations (23)–(24), printed page 6.
Primary full text: https://arxiv.org/pdf/2406.17196
The stated optimization problem fixes diagonal and , requires diagonal , and asks for satisfying
It minimizes over these variables and conjectures that an optimum has exactly one nonzero entry in each column of . There is no further constraint relating to in the stated problem. The source discusses related constraints from the underlying communication model later, but those must not silently be inserted into equations (23)–(24).
The example below uses positive distinct diagonal entries of strictly below one, so there is no issue with the source's abbreviated condition or with uniqueness of the Lyapunov solution. It disproves equality of the dense and sparse infima, which is stronger than exploiting the source's possibly unattained-optimum wording.
Exact feasible point
Take
Then
Because is diagonal and , the unique solution has entries
Direct rational arithmetic gives
The off-diagonal cancellation is exact:
Both diagonal entries are strictly positive. Thus this is an exact feasible point, not a numerical optimizer output.
Complete sparse classification
Every column must be nonzero because a zero column forces the corresponding diagonal entry of to vanish. With exactly one nonzero entry per column and two channels, there are precisely four assignment patterns.
If both columns use the same channel with diagonal value , nonzero column scaling is a diagonal congruence and does not change positive definiteness. The relevant matrix is
For distinct ,
Since , holds exactly when . Necessity follows from the determinant and the diagonal sign at ; sufficiency follows from the positive diagonal entries and determinant. Here , so the power infimum for a common channel is .
If the columns use different channels, is diagonal. A mode assigned to channel needs , equivalently . This condition is also sufficient. The two mode costs before division by the channel squared gain are and .
For , , the four exact sparse power infima are therefore:
| Assignment | Infimum |
|---|---|
| Both modes to channel 1 | |
| Both modes to channel 2 | |
| Mode to channel 1, mode to channel 2 | |
| Mode to channel 2, mode to channel 1 |
The minimum is . Thus
with exact positive gap
The strict inequalities required by only mean that the sparse thresholds are infima. The dense feasible point is strictly below all of them, so allowing limits does not restore the conjecture.
A continuous family of counterexamples
Keep as above. For put
This retains the same positive definite and has dense feasible power . The four sparse thresholds are
The dense point lies strictly below all four whenever
For the first and fourth comparisons these are exactly the upper and lower bounds. The two other comparisons give weaker lower bounds, as direct rational cross multiplication confirms. In particular the example lies in a nonempty open interval of channel gains; the contradiction is not tied to a floating-point special case.
Limits of this review
This review checks the conjecture as actually stated. It does not assert a separate counterexample to every engineering interpretation in the paper, nor does it need a reconstruction of the full coded Kalman filter. The source's conditional Theorem 2 cannot be invoked after its conjectural hypothesis fails; further consequences require their own derivation.
Independent review: algebra agent, 21 November 2026.