Statement and scope
Han, Sabag, Kostina and Hassibi, Coded Kalman Filtering over MIMO Gaussian Channels with Feedback, arXiv:2406.17196v2, Conjecture 1, equations (23)–(24), asks whether the following optimization problem always has an optimal encoder with exactly one nonzero entry in each column:
Here the diagonal matrices and are fixed. We use positive, distinct diagonal entries of strictly less than one, so all stability and uniqueness requirements are satisfied. No additional relation between and occurs in the conjecture's stated feasible set.
We refute the universal conjecture by a strict separation between the unrestricted infimum and the infimum over every encoder having the proposed form. Thus the argument also refutes an interpretation using minimizing sequences rather than an attained minimum. It does not rely on the possible nonattainment caused by the strict inequality .
The proof supplies a rational instance and an open interval of channel gains. This resolves the full universal assertion negatively. It does not merely verify a fixed-size positive case. We make no additional claim about implementation of an actual communication code or the separate general stabilization problem.
1. Entrywise solution of the Lyapunov equation
Write
For , the unique solution of (1) is
Indeed, the entry of (1) is a scalar linear equation with nonzero coefficient . Solving it gives (2). This also establishes uniqueness directly.
2. A rational feasible instance
Choose
and
Every entry of these matrices is rational, and . The associated inverse is
The off-diagonal entry of (2) vanishes because
For the diagonal entries, direct rational simplification gives
Thus
Equations (2)–(6) establish feasibility in (1). Its power is
3. Exact lower bound for every encoder of the proposed form
Suppose that each column of has exactly one nonzero entry. Each of the two source coordinates is then assigned to one of the two channels. There are exactly four assignments. The magnitudes and signs of the nonzero entries remain arbitrary in the argument below.
One coordinate in a channel
When source coordinate is assigned to a channel whose inverse-noise factor is , its diagonal entry in (2) is a positive square times
It is positive exactly when . Since , this is equivalent to
If the two source coordinates use different channels, is diagonal. Conditions (8) are then both necessary and sufficient.
Both coordinates in the same channel
If both source coordinates use one channel, (2) is an invertible diagonal congruence of
The diagonal congruence preserves positive definiteness even when one of its diagonal factors is negative. Direct expansion yields
Here and . If , (9) forces . Conversely, this condition makes both diagonal entries and the determinant positive, since . Therefore the exact necessary and sufficient power condition is
The unused channel can receive zero power. Equations (8) and (10) give the exact infimum for each assignment; each threshold can be approached from above.
Exhausting the four assignments
For (3), the four infimal powers are as follows. An assignment specifies the channel used by each source coordinate.
| Assignment | Exact infimal power |
|---|---|
Their minimum is . It follows that the infimum restricted to all encoders of the conjectured form is
By (7),
and the exact separation supplied by the feasible instance is
Consequently no encoder with exactly one nonzero entry per column can be optimal, or even approach the unrestricted infimum, for this feasible problem instance. This disproves Conjecture 1.
4. An open family of counterexamples
Keep and fixed as in (3)–(4), and instead take
The matrix is still (5), so remains exactly (6). The unrestricted feasible power is
Put . For , the four sparse thresholds reduce to the minimum of
Indeed , and
The two relevant differences are
Both are strictly positive precisely throughout the nonempty interval
Every gain in (13) therefore gives a counterexample with the same exact positive-definite solution . The rational gain lies in this interval. The failure is stable under a continuous range of parameters and comes from cancellation of the two channels' off-diagonal contributions. Restricting each source coordinate to a single channel removes that cancellation and imposes the larger thresholds (8)–(10).
Verification status
This is a written algebraic disproof. The accompanying script checks the displayed rational identities and symbolic determinant factorization; it is not an optimization search. Two independent internal mathematical reviews are recorded separately. No Lean verification or peer review is claimed. The prior-art assessment is in SOURCES.md.