ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QXYQ_{XY} be a joint distribution on finite alphabets, and consider distributed hypothesis testing with null hypothesis H0:PXY=QXQY\mathcal{H}_0: P_{XY}=Q_XQ_Y and alternative hypothesis H1:PXY=QXY\mathcal{H}_1: P_{XY}=Q_{XY}. An encoder observing XnX^n sends a message of rate at most RR to a decoder, which observes YnY^n and decides between the hypotheses. For every fixed type-I error constraint, let θ(R)\theta(R) denote the optimal type-II error exponent. Han's conjecture asserts that

θ(R)=max⁡U−X−YIQ(U;X)≤RLQ(U;Y),\theta(R)=\max_{\substack{U-X-Y\\ I_Q(U;X)\le R}} L_Q(U;Y),

where QUXY=QXYQU∣XQ_{UXY}=Q_{XY}Q_{U|X} and LQ(U;Y)=D(QUQY ∥ QUY)L_Q(U;Y)=D(Q_UQ_Y\,\|\,Q_{UY}) is the lautum information. The August 2026 paper cited in the source claims that this conjectured characterization is false and gives a different exact single-letter characterization.

Record

Added
Links

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.