ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (Γ,Π,Σ^)(\Gamma,\Pi,\hat{\Sigma}) be a solution of the convex optimization in, with matrices FF, GG, HH, and JJ as in Theorem. The matrix pair formed using the pseudoinverse Σ^†\hat{\Sigma}^\dagger is

(F+GΓΣ^†,H+JΓΣ^†).(F+G\Gamma\hat{\Sigma}^\dagger,H+J\Gamma\hat{\Sigma}^\dagger).

A matrix pair is detectable when the associated linear system satisfies the detectability condition.

Detectability redundancy conjecture. The detectability condition in Theorem is redundant: if (Γ,Π,Σ^)(\Gamma,\Pi,\hat{\Sigma}) solves the optimization in, then (F+GΓΣ^†,H+JΓΣ^†)(F+G\Gamma\hat{\Sigma}^\dagger,H+J\Gamma\hat{\Sigma}^\dagger) is detectable.

The detectability condition is required in the paper to establish achievability of the convex-optimization upper bound for the feedback capacity, although the condition can be checked through an LMI optimization. The conjecture is based on extensive simulations; the supplied text gives no proof or resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.