ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a broadcast channel, define

Tα(X):=max⁡p(u,v∣x)αI(U;Y)+I(V;Z)−I(U;V),α≥1.T_\alpha(X):=\max_{p(u,v\mid x)}\alpha I(U;Y)+I(V;Z)-I(U;V),\qquad \alpha\geq1.

For a product channel define Tα(X1,X2)T_\alpha(X_1,X_2) analogously, and let C[f(X)]\mathfrak{C}[f(X)] be the upper concave envelope of ff at p(x)p(x). Put λˉ=1−λ\bar\lambda=1-\lambda.

Generalized factorization conjecture. For all product channels, all λ∈[0,1]\lambda\in[0,1], all α≥1\alpha\geq1, and all p(x1,x2)p(x_1,x_2),

−(α−λˉ)H(Y1,Y2)−λˉH(Z1,Z2)+Tα(X1,X2)-(\alpha-\bar\lambda)H(Y_1,Y_2)-\bar\lambda H(Z_1,Z_2)+T_\alpha(X_1,X_2) ≤C[−(α−λˉ)H(Y1)−λˉH(Z1)+Tα(X1)]+C[−(α−λˉ)H(Y2)−λˉH(Z2)+Tα(X2)].\leq \mathfrak{C}[-(\alpha-\bar\lambda)H(Y_1)-\bar\lambda H(Z_1)+T_\alpha(X_1)] +\mathfrak{C}[-(\alpha-\bar\lambda)H(Y_2)-\bar\lambda H(Z_2)+T_\alpha(X_2)].

This equivalent formulation is sufficient for proving optimality of the entire private-message region in Marton's inner bound. The source gives no resolution of the generalized conjecture.

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.